Optimal prefetching and caching for parallel I/O systems

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 219-228

  Kallahalla, M ^a   Varman, P J ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; CACHE MEMORY; DECISION MAKING; ONLINE SYSTEMS; SCHEDULING;

PARALLEL-DISK SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0034833591     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. The input/output complexity of sorting and related problems
2. On the influence of lookahead in competitive paging algorithms
3. Minimizing stall time in single and parallel disk systems
4. Multidimensional, multiprocessor, out-of-core FFTs with distributed memory and parallel disks
5. Simple randomized mergesort on parallel disks
6. Competitive parallel disk prefetching and buffer management
7. A study of replacement algorithms for a virtual storage computer
8. On competitive on-line paging with lookahead
9. A study of integrated prefetching and caching strategies
10. Automatic I/O hint generation through speculative execution
11. Competitive paging algorithms
12. Optimal read-once parallel disk scheduling
13. Competitive snoopy caching
14. Near-optimal parallel prefetching and caching
15. A strongly competitive randomized paging algorithm
16. Markov analysis of multiple-disk prefetching strategies for external merging
17. Informed prefetching and caching
18. Fast concurrent access to parallel disks
19. Amortized efficiency of list update and paging rules
20. Tight bounds for prefetching and buffer management algorithms for parallel I/O systems
21. Optimal algorithms for parallel memory, I: Two-level memories