Steven D Bagby

US Patent:

20160371354, Dec 22, 2016

Filed:

Aug 29, 2016

Appl. No.:

15/249864

Inventors:

- Westborough MA, US
Michael T. Stack - No. Chelmsford MA, US
Arthur J. Beaverson - Boxboro MA, US
Steven Bagby - San Jose CA, US

International Classification:

G06F 17/30
H04L 29/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.

US Patent:

20150242315, Aug 27, 2015

Filed:

May 11, 2015

Appl. No.:

14/708401

Inventors:

- Westborough MA, US
Arthur J. Beaverton - Boxborough MA, US
Steven Bagby - San Jose CA, US
Sowmya Manjanatha - Westford MA, US

International Classification:

G06F 12/08

Abstract:

Apparatus and method for placing data based on the content of the data in random access memory such that indexing operations are not required. A strong (e.g., cryptographic) hash is applied to a data element resulting in a signature. A weaker hash function is then applied to the signature to generate a storage location in memory for the data element. The weaker hash function assigns multiple data elements to the same storage location while the signature comprises a unique identifier for locating a particular data element at this location. In one embodiment a plurality of weak hash functions are applied successively to increase storage space utilization. In other embodiments, the assigned storage location can be determined by one or more attributes of the data element and/or the storage technology, e.g, long-lived versus short-lived data and/or different regions of the memory having different performance (e.g., access latency memory lifetime) characteristics.