Randomized Parallel Prefetching and Buffer Management
| dc.citation.volumeNumber | Advances in Randomized Parallel Computing | en_US |
| dc.contributor.author | Kallahalla, Mahesh | en_US |
| dc.contributor.author | Varman, Peter J. | en_US |
| dc.date.accessioned | 2015-09-15T17:34:20Z | en_US |
| dc.date.available | 2015-09-15T17:34:20Z | en_US |
| dc.date.issued | 1999 | en_US |
| dc.description.abstract | We show that deterministic algorithms using bounded lookahead cannot fully exploit the potential of a parallel I/O system. Randomization can be used to significantly improve the performance of parallel prefetching and buffer management algorithms. Using randomization in the data layout and a simple prefetching scheme, we show that a readonce reference string of length N can be serviced in θ(N/D) parallel I/Os in a D-disk system. For the case of read-many reference strings we introduce a novel algorithm using randomized write-back with a competitive ratio of θ(D). In contrast, we show that deterministic write-back results in a competitive ratio of at least (D). Supported in part by NSF Grant CCR-9704562 and a grant from the Schlumberger Foundation. | en_US |
| dc.identifier.citation | M. Kallahalla and P. J. Varman, "Randomized Parallel Prefetching and Buffer Management," vol. Advances in Randomized Parallel Computing, 1999. | en_US |
| dc.identifier.doi | http://dx.doi.org/10.1007/3-540-64359-1_708 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/81643 | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Kluwer Academic Publishers | en_US |
| dc.title | Randomized Parallel Prefetching and Buffer Management | en_US |
| dc.type | Journal article | en_US |
| dc.type.dcmi | Text | en_US |