The input/output complexity of sorting and related problems
Communications of the ACM
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A comparison of high-availability media recovery techniques
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Bounds on the separation of two parallel disk models
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
RAMA: an easy-to-use, high-performance parallel file system
Parallel Computing - Special double issue: parallel I/O
Simple randomized mergesort on parallel disks
Parallel Computing - Special double issue: parallel I/O
Random duplicated assignment: an alternative to striping in video servers
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Simple competitive request scheduling strategies
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Balanced allocations: the heavily loaded case
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Comparing random data allocation and data striping in multimedia servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Infinite parallel job allocation (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the Second International Conference on Data Engineering
Design and Performance Tradeoffs in Clustered Video Servers
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Coding Techniques for Handling Failures in Large Disk Arrays
Coding Techniques for Handling Failures in Large Disk Arrays
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
Reconciling simplicity and realism in parallel disk models
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Reconciling simplicity and realism in parallel disk modelsy
Parallel Computing - Parallel data-intensive algorithms and applications
Space Efficient Hash Tables with Worst Case Constant Access Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Presenting data from experiments in algorithmics
Experimental algorithmics
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems
IEEE Transactions on Computers
Approximation of a retrieval problem for parallel disks
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
| Hi-index | 0.00 |
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 system 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 &agr;: automatically load-balanced parallel hard-disk array.