ASP: Adaptive Online Parallel Disk Scheduling
| dc.contributor.author | Kallahalla, Mahesh | en_US |
| dc.contributor.author | Varman, Peter J. | en_US |
| dc.date.accessioned | 2015-09-15T17:27:26Z | en_US |
| dc.date.available | 2015-09-15T17:27:26Z | en_US |
| dc.date.issued | 1999 | en_US |
| dc.description.abstract | In this work we address the problems of prefetching and I/O scheduling for read-once reference strings in a parallel I/O system. We use the standard parallel disk model with D disks a shared I/O bu er of sizeM. We design an on-line algorithm ASP (Adaptive Segmented Prefetching) with ML-block lookahead, L 1, and compare its performance to the best on-line algorithm with the same lookahead. We show that for any reference string the number of I/Os done by ASP is with a factor (C), C = minfpL;D1=3g, of the number of I/Os done by the optimal algorithm with the same amount of lookahead. | en_US |
| dc.identifier.citation | M. Kallahalla and P. J. Varman, "ASP: Adaptive Online Parallel Disk Scheduling," 1999. | en_US |
| dc.identifier.doi | http://dx.doi.org/10.1.1.37.3640 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/81642 | en_US |
| dc.language.iso | eng | en_US |
| dc.title | ASP: Adaptive Online Parallel Disk Scheduling | en_US |
| dc.type | Journal article | en_US |
| dc.type.dcmi | Text | en_US |