公开(公告)号：US10255340B2

公开(公告)日：2019-04-09

申请号：US15249864

申请日：2016-08-29

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： James E. King, III ,  Michael T. Stack ,  Arthur J. Beaverson ,  Steven Bagby

IPC: G06F15/16 ,  G06F17/30 ,  H04L29/08

Abstract: Method and apparatus for replicating data structures over a network in which each data structure is assigned an owner node among a plurality of networked peer nodes. Preferably that owner can be ascertained through information in the data structure. When an update to the data structure is desired by a non-owner, a request to modify the data structure is sent out on the network and when received by the owner, the owner performs the modification. The owner node can then notify the other nodes regarding the update. The method, implemented through a single-writer, multiple-reader paradigm, insures availability, partition tolerance and eventual consistency; it avoids the high overhead costs and single point of failure drawbacks of the prior art centralized management and locking protocols. Administrators can connect to any peer node in the network to manage, monitor and request modifications to a data structure.

公开(公告)号：US10176113B2

公开(公告)日：2019-01-08

申请号：US14519722

申请日：2014-10-21

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Paul Bowden ,  Arthur J. Beaverson

IPC: G06F17/30 ,  G06F12/1045 ,  G06F12/02 ,  G06F12/0864 ,  G06F12/0875 ,  G06F12/14

Abstract: Method and apparatus for constructing an index that scales to a large number of records and provides a high transaction rate. New data structures and methods are provided to ensure that an indexing algorithm performs in a way that is natural (efficient) to the algorithm, while a non-uniform access memory device sees IO (input/output) traffic that is efficient for the memory device. One data structure, a translation table, is created that maps logical buckets as viewed by the indexing algorithm to physical buckets on the memory device. This mapping is such that write performance to non-uniform access SSD and flash devices is enhanced. Another data structure, an associative cache is used to collect buckets and write them out sequentially to the memory device as large sequential writes. Methods are used to populate the cache with buckets (of records) that are required by the indexing algorithm. Additional buckets may be read from the memory device to cache during a demand read, or by a scavenging process, to facilitate the generation of free erase blocks.