Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems

Simple item page
dc.citation.firstpage1262en_US
dc.citation.issueNumber12eng
dc.citation.journalTitleIEEE Transactions on Parallel and Distributed Systemseng
dc.citation.lastpage1275en_US
dc.citation.volumeNumber10eng
dc.contributor.authorVarman, Peter J.
dc.contributor.authorVerma, Rakesh M.
dc.contributor.orgElectrical and Computer Engineeringeng
dc.contributor.orgVarman Laboratoryeng
dc.date.accessioned2015-09-15T17:20:49Z
dc.date.available2015-09-15T17:20:49Z
dc.date.issued1999-12
dc.description.abstractThe I/O performance of applications in multiple-disk systems can be improved by overlapping disk accesses. This requires the use of appropriate prefetching and buffer management algorithms that ensure the most useful blocks are accessed and retained in the buffer. In this paper, we answer several fundamental questions on prefetching and buffer management for distributed-buffer parallel I/O systems. First, we derive and prove the optimality of an algorithm, P-min, that minimizes the number of parallel I/Os. Second, we analyze P-con, an algorithm that always matches its replacement decisions with those of the well-known demand-paged MIN algorithm. We show that P-con can become fully sequential in the worst case. Third, we investigate the behavior of on-line algorithms for multiple-disk prefetching and buffer management. We define and analyze P-lru, a parallel version of the traditional LRU buffer management algorithm. Unexpectedly, we find that the competitive ratio of P-lru is independent of the number of disks. Finally, we present the practical performance of these algorithms on randomly generated reference strings. These results confirm the conclusions derived from the analysis on worst case inputs.eng
dc.identifier.citationP. J. Varman and R. M. Verma, "Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems," <i>IEEE Transactions on Parallel and Distributed Systems,</i> vol. 10, no. 12, 1999.*
dc.identifier.doihttp://dx.doi.org/10.1109/71.819948en_US
dc.identifier.urihttps://hdl.handle.net/1911/81641
dc.language.isoengeng
dc.publisherRice University
dc.subject.keywordI/Oeng
dc.subject.keywordParallel I/O Systemseng
dc.subject.keywordAlgorithmseng
dc.subject.keywordPrefetchingeng
dc.subject.keywordCachingeng
dc.subject.keywordBuffer managementeng
dc.subject.keywordCompetitive ratioeng
dc.subject.keywordMultiple-Disk Systemseng
dc.subject.keywordExternal Memoryeng
dc.titleTight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systemseng
dc.typeJournal articleeng
dc.type.dcmiTexteng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
tpds99.pdf
Size:
717.14 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.61 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
ECE Publications