Abstract
The growing importance of multiple-disk parallel I/O systems requires the development of appropriate prefetching and buffer management algorithms. We answer several fundamental questions on prefetching and buffer management for such parallel I/O systems. Specifically, we find and prove the optimality of an algorithm, P-MIN, that minimizes the number of parallel I/Os. Secondly, we analyze P-CON, an algorithm which 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. Finally, we define and analyze P-LRU, a semi-on-line version of the traditional LRU buffermanagement algorithm. Unexpectedly, we find that the performance of P-LRU is independent of the number of disks.
Research partially supported by a grant from the Schlumberger Foundation
Research partially supported by NSF grant CCR-9303011
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Albers. The influence of lookahead in competitive paging algorithms. In Proc. 1st European Symposium on Algorithms LNCS, Springer Verlag, Berlin, Germany 1993, pages 1–12, 1993.
L. A. Belady. A Study of Replacement Algorithms for Virtual Storage. IBM Systems Journal, 5:78–101, 1966.
S. Ben-David and A. Borodin. A New Measure for the Study of On-Line Algorithms. Algorithmica, 11:73–91, 1994.
P. Cao, E. Felten, A. Karlin, and K. Li. A Study of Integrated Prefetching and Caching Strategies. In Proc. ACM SIGMETRICS Conference, 1995.
P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson. RAID: High-Performance Reliable Secondary Storage. ACM Computing Surveys, 26(2):145–185, 1994.
E. G. Coffman and P. J. Denning. Operating Systems Theory. Addison-Wesley, Englewood Cliffs, N.J., 1973.
D.Breslauer. On competitive on-line paging with lookahead. In Proc. Symposium Theor. Aspects of Computer Science, pages 593–603, 1996.
A. Fiat, R. Karp, M.Luby, L. McGeoch, D. D. Sleator, and N. E. Young. Competitive Paging Algorithms. J. Algorithms, 12:685–699, 1991.
E. Koutsoupias and C. H. Papadimitriou. Beyond competitive analysis. In Proc. 35th IEEE Symposium on Foundations of Computer Science, pages 394–400, 1994.
V. Pai, A. SchÄffer, and P.Varman. Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging. Theo. Comp. Sci., 12:211–239, 1994.
D. Sleator and R. E. Tarzan. Amortized Efficiency of List Update and Paging Rules. Comm. ACM, 28(2):202–208, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Varman, P.J., Verma, R.M. (1996). Tight bounds for prefetching and buffer management algorithms for parallel I/O systems. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_50
Download citation
DOI: https://doi.org/10.1007/3-540-62034-6_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62034-1
Online ISBN: 978-3-540-49631-1
eBook Packages: Springer Book Archive