2026-09-20T08:30:47Zhttps://repository.rice.edu/server/oai/request

oai:repository.rice.edu:1911/170992024-01-11T20:57:17Zcom_1911_8299col_1911_13110

Varman, Peter J. Kallahalla, Mahesh 2009-06-04T07:03:53Z 2009-06-04T07:03:53Z 1997 Kallahalla, Mahesh. "Competitive prefetching and buffer management for parallel I/O systems." (1997) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/17099">https://hdl.handle.net/1911/17099</a>. https://hdl.handle.net/1911/17099 THESIS E.E. 1997 KALLAHALLA In this thesis we study prefetching and buffer management algorithms for parallel I/O systems. Two models of lookahead, global and local, which give limited information regarding future accesses are introduced. Two configurations of the I/O buffer, shared and distributed, are considered, based upon the accessibility of the I/O buffer. The performance of prefetching algorithms using the two forms of lookahead is analyzed in the framework of competitive analysis, for read-once access patterns. Two algorithms, PHASE and GREED, which match the lower bounds are presented. A randomized version of GREED that performs the minimal expected number of I/Os is designed and applied to the problems of external sorting and video retrieval. Finally the problem of designing prefetching and buffer management algorithms for read-many reference strings is examined. An algorithm which uses randomized write-back to attain good expected I/O performance is presented. 101 p. application/pdf eng Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. Electronics Electrical engineering Computer science Competitive prefetching and buffer management for parallel I/O systems Thesis Text Electrical Engineering Engineering Rice University Masters Master of Science open.access