Random redundant allocation of data to parallel disk arrays can be exploited to achieve low access delays. New algorithms are proposed which improve the previously known shortest queue algorithm by systematically exploiting that scheduling decisions can be deferred until a block access is actually started on a disk. These algorithms are also generalized for coding schemes with low redundancy. Using extensive experiments, practically important quantities are measured which have so far eluded an analytical treatment: The delay distribution when a stream of requests approaches the limit of the sytem capacity, the system efficiency for parallel disk applications with bounded prefetching buffers, and the combination of both for mixed traffic. A further step towards practice is taken by outlining the system design for a: automatically load-balanced parallel hard-disk array. 1
|
1308
|
The Theory of Error Correcting Codes
– MacWilliams, Sloane
- 1977
|
|
801
|
Computer Networks
– Tanenbaum
- 1981
|
|
564
|
H.: "A Case for Redundant Arrays of Inexpensive Disks (RAID)",Proceedings of the 1988
– Patterson, Gibson, et al.
- 1988
|
|
557
|
LEDA: a platform for combinatorial and geometric computing
– Mehlhorn, Näher
- 1995
|
|
398
|
The input/output complexity of sorting and related problems
– Aggarwal, Vitter
- 1988
|
|
375
|
Network flows
– Ahuja, Magnanti, et al.
- 1993
|
|
371
|
Efficient dispersal of information for security, load balancing
– Rabin
- 1998
|
|
212
|
A case for redundant arrays of inexpensive disks
– Patterson, Gibson, et al.
- 1988
|
|
174
|
Disk Striping
– Salem, Garcia-Monlina
- 1986
|
|
171
|
Computers and Intractability
– Garey, Johnson
- 1979
|
|
168
|
Balanced allocations
– Azar, Broder, et al.
- 1994
|
|
111
|
Probability and Statistics with Reliability, Queueing and
– Trivedi
- 1982
|
|
111
|
The Power of Two Choices in Randomized Load Balancing
– Mitzenmacher
- 1996
|
|
82
|
auf der Heide. Efficient PRAM simulation on a distributed memory machine
– Karp, Luby, et al.
- 1992
|
|
78
|
The Art of Computer Programming: Sorting and Searching, volume 3
– Knuth
- 1973
|
|
75
|
Coding techniques for handling failures in large disk arrays
– Gibson, Hellerstein, et al.
- 1988
|
|
68
|
A Case for Redundant Arrays
– Patterson, Gibson, et al.
- 1988
|
|
62
|
Simple randomized mergesort on parallel disks
– Barve, Grove, et al.
- 1996
|
|
55
|
EN Adaptive Packet Routing for Bursty Adversarial Traffic
– AIELLO, KUSHILEVITZ, et al.
- 1998
|
|
54
|
EVENODD: An optimal scheme for tolerating double disk failures in RAID architectures
– Blaum, Brady, et al.
- 1994
|
|
54
|
Adversarial queuing theory
– Borodin, Kleinberg, et al.
- 2001
|
|
45
|
Comparing random data allocation and data striping in multimedia servers
– SANTOS, MUNTZ, et al.
|
|
43
|
Queueing systems with selection of the shortest of two queues: An asymptotic approach
– Vvedenskaya, Dobrushin, et al.
- 1996
|
|
38
|
F.Cristian, “Tolerating Multiple Failures in RAID Architectures with Optimal Storage and Uniform Declustering
– Alvarez
- 1997
|
|
35
|
A Comparison of High-Availability Media Recovery Techniques
– Copeland, Keller
- 1989
|
|
32
|
Balanced Allocations: The Heavily Loaded Case
– Berenbrink, Czumaj, et al.
- 2000
|
|
29
|
Fast concurrent access to parallel disks
– Sanders, Egner, et al.
- 2000
|
|
26
|
Random duplicated assignment: An alternative striping in video servers
– Korst
- 1997
|
|
23
|
Design and performance tradeoffs in clustered video servers
– Tewari, Mukherjee, et al.
- 1996
|
|
21
|
RAMA: An easy-to-use, high-performance parallel file system
– Miller, Katz
- 1997
|
|
21
|
A Parallel Disk Storage System for Real-Time Multimedia Applications
– Muntz, Santos, et al.
- 1998
|
|
14
|
Optimal read-once parallel disk scheduling
– Kallahalla, Varman
- 1999
|
|
14
|
Mixed-Media File Systems
– Bosch
- 1999
|
|
12
|
On balls and bins with deletions
– Cole, Frieze, et al.
- 1998
|
|
11
|
Reconciling simplicity and realism in parallel disk models
– Sanders
- 2001
|
|
10
|
Block allocation in video servers for availability and throughput
– Tetzlaff, Flynn
- 1996
|
|
10
|
Analyzing an infinite parallel job allocation process
– Adler, Berenbrink, et al.
- 1998
|
|
10
|
Duality between prefetching and queued writing with parallel disks
– Hutchinson, Sanders, et al.
- 2001
|
|
7
|
The Power of Two Choices
– Mitzenmacher
- 1996
|
|
6
|
auf der Heide, "Efficient PRAM simulation on a distributed memory machine
– Karp, Luby, et al.
- 1992
|
|
4
|
Random duplicate storage strategies for load balancing in multimedia servers
– Aerts, Korst, et al.
- 2000
|
|
3
|
Adaptiv packet routing for bursty adversarial traffic
– Aiello, Kushilevitz, et al.
- 1998
|
|
2
|
Bounds on the separation of two parallel disk models
– Armen
- 1996
|
|
2
|
Design of the PRESTO multimedia storage network
– Berenbrink, Brinkmann, et al.
- 1999
|
|
2
|
Simple competitive request scheduling strategies
– Berenbrink, Riedel, et al.
- 1999
|
|
2
|
Random duplicate storage for load balancing in multimedia servers
– Aerts, Korst, et al.
- 2000
|
|
1
|
Asynchronous control of disks in video servers
– Korst, Coumans
- 1998
|
|
1
|
Adversarial queing theory
– Borodin, Kleinberg, et al.
- 1996
|
|
1
|
Incremental scheduling of mixed workloads in multimedia information servers," Journal of Multimedia Tools and Applications
– Nerjes, Muth, et al.
- 2000
|
|
1
|
Analyzing an Infinite Parallel Job Allocation
– Adler, Berenbrink, et al.
- 1998
|
|
