Name
Abstract | ||
|---|---|---|
. In this work we address the problems of prefetching and I/O schedulingfor read-once reference strings in a parallel I/O system. We use the standardparallel disk model with D disks a shared I/O buffer of size M . We designan on-line algorithm ASP (Adaptive Segmented Prefetching) with ML-blocklookahead, L 1, and compare its performance to the best on-line algorithmwith the same lookahead. We show that for any reference string the number ofI/Os done by ASP is with a factor \Theta(C), C = ... |
Year | Venue | Keywords |
|---|---|---|
1998 | External memory algorithms | adaptive online parallel disk,disk scheduling |
Field | DocType | ISBN |
I/O scheduling,Computer science,Parallel computing,Elevator algorithm,Distributed computing | Conference | 0-8218-1184-3 |
Citations | PageRank | References |
1 | 0.36 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mahesh Kallahalla | 1 | 539 | 34.54 |
| Peter J. Varman | 2 | 700 | 83.23 |