5. 63, 31 A 1 1/1992 Row et al. manner so that they are optimally assigned to the nodes in
5,202,979 A 4, 1993 Hillis et al. accordance with each node's capacity value. By utilizing the …

(US); Ryan A. Callison, Magnolia, TX 2003. O135709 A1 7, 2003 Niles et al.(US); George J.
Scholhamer, III, 2003/0159001 A1 8/2003 Chalmer et al. Tomball, TX (US) 2004.0003173 …

A map-reduce compatible distributed file system that consists of successive component
layers that each provide the basis on which the next layer is built provides transactional read …

BACKGROUND Data is typically stored on computing systems and/or attached storage
devices. The data may include operating system data, file system data, and application data …

AGGREGAEB AGGREGAEC fails, new data may still be accessed by the system (the striped
aggregates), both to write new data, and to read data stored on the failed aggregate. In …

A map-reduce compatible distributed file system that consists of successive component
layers that each provide the basis on which the next layer is built provides transactional read …

Abstract A “Distributed Storage Controller” applies an RDMA-based memory allocator to
implement a distributed thread-safe and lock-free storage system in shared memory …

Abstract An “RDMA-Based Memory Allocator” applies remote direct memory access (RDMA)
messaging to provide fast lock-free memory allocations and de-allocations for shared …

A hash table system having a first hash table and a second hash table is provided. The first
hash table may be in-memory and the second hash table may be on-disk. Inserting an entry …

G06F 5/73(2006.01)(57) ABSTRACT G06F 7/30(2006.01) A high availability cluster and
method of storage medium GO6F 9/50(2006.01) management in Such high availability …