| Alternate document: Details Asynchronous Random Polling Dynamic Load Balancing Peter Sanders |
Peter Sanders  Home/Search
Context Related
| mpisb.mpg.de/~san...asyncpardisk.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpisb.mpg.de/~sanders/pa...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Allocation of data to parallel disk using redundant storage and random placement of blocks 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 simulations, practically important quantities are... (Update)
Cited by: More
Perfectly Balanced Allocation - Czumaj, Riley, Scheideler (2003) (Correct)
Algorithms for Scalable Storage Servers - Sanders (2004) (Correct)
Similar documents (at the sentence level):
25.8%: Asynchronous Scheduling of Redundant Disk Arrays - Sanders (2000) (Correct)
Active bibliography (related documents): More All
0.5: Performance of the IBM General Parallel File System - Terry Jones Alice (2000) (Correct)
0.3: Fast Concurrent Access to Parallel Disks - Sanders, Egner, Korst (1999) (Correct)
0.0: Random Arc Allocation and Applications to Disks, Drums and DRAMs - Sanders, Vöcking (2001) (Correct)
Similar documents based on text: More All
0.4: Reconciling Simplicity and Realism in Parallel Disk Models - Sanders (2001) (Correct)
0.2: IDA-based Disk Arrays - Bestavros (1991) (Correct)
0.1: Input/Output: Algorithms and Architectures - Popa (1997) (Correct)
Related documents from co-citation: More All
8: Fast Concurrent Access to Parallel Disks - Sanders, Egner et al. - 1999
6: Balanced allocations: The heavily loaded case - Berenbrink, Czumaj et al. - 2000
6: Reconciling simplicity and realism in parallel disk models - Sanders - 2001
BibTeX entry: (Update)
P. Sanders. Asynchronous scheduling of redundant disk array. In Proceedings 12th ACM Symposium on Parallel Algorithms and Architectures, pages 88--98, 2000. http://citeseer.ist.psu.edu/sanders00asynchronous.html More
@inproceedings{ sanders00asynchronous,
author = "Peter Sanders",
title = "Asynchronous scheduling of redundant disk arrays",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "89-98",
year = "2000",
url = "citeseer.ist.psu.edu/sanders00asynchronous.html" }
Citations (may not include all citations):158 A case for redundant arrays of inexpensive disks (RAID (context) - Patterson, Gibson et al. - 1988
109 The input/output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
93 Disk striping (context) - Salem, Garcia-Molina - 1986
81 Efficient PRAM simulation on a distributed memory machine - Karp, Luby et al. - 1992
21 Fast concurrent access to parallel disks - Sanders, Egner et al. - 2000
3 Bounds on the separation of two parallel disk models (context) - Armen - 1996
2 RAMA: An easy-to-use, high-performance parallel file system - Miller, Katz - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mpi-sb.mpg.de/~sanders/papers/index.html): More
Better Algorithms for Parallel Backtracking - Sanders (1995) (Correct)
Asynchronous Random Polling Dynamic Load Balancing - Sanders (Correct)
A Parallelization of Dijkstra's Shortest Path Algorithm - Crauser, Mehlhorn, Meyer.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC