On competitive online read-many parallel disks scheduling

Authors:
Rahul Shah;Peter J. Varman;Jeffrey Scott Vitter
Affiliations:
Purdue University, West Lafayette, IN;Rice University, Houston, TX;Purdue University, West Lafayatte, IN
Venue:
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2005

Citing 3
Cited 1

Optimal read-once parallel disk scheduling

Proceedings of the sixth workshop on I/O in parallel and distributed systems
Optimal prefetching and caching for parallel I/O sytems

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Online algorithms for prefetching and caching on parallel disks

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the natural extension of the single disk caching problem to parallel disk I/O model. We close the existing gap between lower and upper bounds and achieve optimal competitive ratio of O(√D) when lookahead is more than the memory size M. When lookahead is smaller, we derive various upper bounds and lower bounds on the competitive ratio under various adversarial models.