The power of duality for prefetching and sorting with parallel disks

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 334-335

  Hutchinson, D A ^a   Sanders, P ^a   Vitter, J S ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; MAGNETIC DISK STORAGE; PARALLEL PROCESSING SYSTEMS; QUEUEING NETWORKS; RANDOM ACCESS STORAGE;

PARALLEL DISKS;

CACHE MEMORY;

EID: 0034837007     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378760     Document Type: Conference Paper

References (8)

1. Simple randomized mergesort on parallel disks
2. A study of replacement algorithms for virtual storage computers
3. Optimal read-once parallel disk scheduling
4. Optimal prefetching and caching for parallel I/O systems
5. Near-optimal parallel prefetching and caching
6. Fast concurrent access to parallel disks
7. External memory algorithms and data structures: Dealing with MASSIVE data
8. Distribution sort with randomized cycling