Distributed sparing in disk arrays

Comparison of sparing alternatives for disk arrays

ACM SIGARCH Computer Architecture News ◽

10.1145/146628.140392 ◽

1992 ◽

Vol 20 (2) ◽

pp. 318-329 ◽

Cited By ~ 2

Author(s):

Jai Menon ◽

Dick Mattson

Keyword(s):

Disk Arrays

Download Full-text

Performance consequences of parity placement in disk arrays

ACM SIGPLAN Notices ◽

10.1145/106973.106992 ◽

1991 ◽

Vol 26 (4) ◽

pp. 190-199 ◽

Cited By ~ 1

Author(s):

Edward K. Lee ◽

Randy H. Katz

Keyword(s):

Disk Arrays ◽

Performance Consequences

Download Full-text

Using non-volatile storage to improve the reliability of RAID5 disk arrays

Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing ◽

10.1109/ftcs.1997.614093 ◽

2002 ◽

Cited By ~ 5

Author(s):

R.Y. Hou ◽

Y.N. Patt

Keyword(s):

Disk Arrays

Download Full-text

The Multiple-Orientability Thresholds for Random Hypergraphs

Combinatorics Probability Computing ◽

10.1017/s0963548315000334 ◽

2015 ◽

Vol 25 (6) ◽

pp. 870-908 ◽

Cited By ~ 1

Author(s):

NIKOLAOS FOUNTOULAKIS ◽

MEGHA KHOSLA ◽

KONSTANTINOS PANAGIOTOU

Keyword(s):

Load Balancing ◽

Hard Disk ◽

Maximum Load ◽

Disk Arrays ◽

Uniform Hypergraph ◽

Cuckoo Hashing ◽

Uniform Hypergraphs ◽

Random Hypergraphs ◽

Do So ◽

Parallel Access

Ak-uniform hypergraphH= (V, E) is called ℓ-orientable if there is an assignment of each edgee∈Eto one of its verticesv∈esuch that no vertex is assigned more than ℓ edges. LetHn,m,kbe a hypergraph, drawn uniformly at random from the set of allk-uniform hypergraphs withnvertices andmedges. In this paper we establish the threshold for the ℓ-orientability ofHn,m,kfor allk⩾ 3 and ℓ ⩾ 2, that is, we determine a critical quantityc*k,ℓsuch that with probability 1 −o(1) the graphHn,cn,khas an ℓ-orientation ifc<c*k,ℓ, but fails to do so ifc>c*k,ℓ.Our result has various applications, including sharp load thresholds for cuckoo hashing, load balancing with guaranteed maximum load, and massive parallel access to hard disk arrays.

Download Full-text