Caching and prefetching algorithms for programs with looping reference patterns

Computer Journal

Volumn 49, Issue 1, 2006, Pages 42-61

  Dini, Gianluca ^a   Lettieri, Giuseppe ^a   Lopriore, Lanfranco ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CACHING AND PREFETCHING; GRAPHICAL MODEL; MEASUREMENT EXPERIMENTS; PAGE CACHING; PAGE PLACEMENTS; PERFORMANCE INDICES; PREFETCHING; PRIMARY MEMORY; PROGRAM ACTIVITIES; PROGRAM EXECUTION; REFERENCE PATTERNS; SECONDARY MEMORIES; SIMPLIFYING ASSUMPTIONS; SYSTEM RESOURCES;

ALGORITHMS;

PROGRAM PROCESSORS;

EID: 77952278012     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxh140     Document Type: Article

References (41)

1. Johnson, T. and Shasha, D. (1994) 2Q: a low overhead high performance buffer management replacement algorithm. In Proc. Twentieth Int. Conf. on Very Large Data Bases, Santiago, Chile, September 12-15, pp. 439-450. Morgan Kaufmannn, San Mateo, CA.
2. Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y. and Kim, C. S. (1999) On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies. Perf. Eval. Rev., 27, 134-143.
3. O'Neil, E. J., O'Neil, P. E. and Welkum, G. (1993) The LRU-K page replacement algorithm for database disk buffering. ACM SIGMOD Record, 22, 297-306.
4. Smaragdakis, Y., Kaplan, S. and Wilson, P. (1999) EELRU: simple and effective adaptive page replacement. Perform. Eval. Rev.,11, 122-133.
5. Megiddo, N. and Modha, D. S. (2003) ARC: a self-tuning, low overhead replacement cache. In Proc. Second USENIX Conf. on File and Storage Technologies (FAST 03), San Francisco, CA, March 31-April 2, pp. 115-130. USENIX Association, Berkeley, CA.
6. Bansal S. and Modha, D. S. (2004) CAR: clock with adaptive replacement. Proc. Third USENIX Conf. on File and Storage Technologies (FAST 04), San Francisco, CA, March 31-April 2, pp. 187-200. USENIX Association, Berkeley, CA.
7. Choi, J., Noh, S. H., Min, S. L. and Cho, Y. (1999) An implementation study of a detection-based adaptive block replacement scheme. In Proc. 1999 USENIXAnnual Technical Conf, Monterey, CA, June 6-11, pp. 239-252. USENIX Association, Berkeley, CA.
8. Choi, J., Noh, S. H., Min, S. L. and Cho, Y. (2000) Towards application/file-level characterization of block references: a case for fine-grained buffer management. Perf. Eval. Rev., 28, 286-295. (Pubitemid 32478174)
9. Faloutsos, C., Ng, R. and Sellis, T (1995) Flexible and adaptable buffer management techniques for database management systems. IEEE Trans. Comput., 44, 546-560.
10. Kim, J. M., Choi, J., Kim, J., Noh, S. H., Min, S. L., Cho, Y. and Kim, C.S. (2000) A low-overhead high performance unified buffer management scheme that exploits sequential and looping references. In Proc. Fourth USENIX Symp. on Operating System Design and Implementation, San Diego, CA, October 22-25, pp. 119-134. USENIX Association, Berkeley, CA.
11. Gniady, C., Butt, A. R. and Hu, Y C. (2004) Program counter based pattern classification in buffer caching. In Proc. Sixth USENIX Symp. on Operating Systems Design and Implementation, San Francisco, CA, December 6-8, pp. 395-408. USENIX Association, Berkeley, CA.
12. Shalicky, T LASPack Reference Manual. Available at http:// www.tu-dresden.de/mwism/skalicky/laspack/laspack.html.
13. Pasquale, B. K. and Polyzos, G. C. (1993) A static analysis of I/O characteristics of scientific applications in a production workload. In Proc. 1993 ACM/IEEE Conf. on Supercomputing, Portland, OR, November 15-19, pp. 388-397. IEEE Computer Soceity Press, Los Alamitos, CA.
14. Glass, G. and Cao, P (1997) Adaptive page replacement based on memory reference behavior. Perf. Eval. Rev., 25, 115-126.
15. Patterson, R H. and Gibson, G. A. (1994) Exposing I/O concurrency with informed prefetching. Proc. Third Int. Conf. on Parallel and Distributed Information Systems, Austin, TX, September 28-30, pp. 7-16. IEEE Computer Society Press, Los Alamitos, CA.
16. Huizinga, D. M. and Desai, S. (2000) Implementation of informed prefetching and caching in Linux. Proc. Int. Conf. on Information Technology: Coding and Computing, Las Vegas, NV, March 27-29, pp. 443-448. IEEE Computer Soceity, Los Alamitos, CA.
17. Albers, S., Garg, N. and Leonardi, S. (2000) Minimizing stall time in single and parallel disk systems. J. ACM, 47, 969-986.
18. Kaplan, S. F., McGeoch, L. A. and Cole, M. F. (2002) Adaptive caching for demand prepaging. In Proc. Third Int. Symp. on Memory Management, Berlin, Germany, June 20-21, pp. 114-126. ACM Press New York, NY
19. Patterson, R. H., Gibson, G. A., Ginting, E., Stodolsky, D. and Zelenka, J. (1995) Informed prefetching and caching. Oper. Syst. Rev., 29, 79-95.
20. Patterson, R. H., Gibson, G. A. and Satyanarayanan, M. (1993) A status report on research in transparent informed prefetching. Oper. Syst. Rev., 27, 21-34.
21. Cao, P, Feiten, E. W., Karlin, A. R. and Li, K. (1995) A study of integrated prefetching and caching strategies. In Proc. ACM SIGMETRICS Joint Int. Conf. on Measurement and Modeling of Computer Systems, Ottawa, Ontario, Canada, May 15-19, pp. 188-197. ACM Press New York, NY
22. Dini, G., Lettieri, G. and Lopriore, L. (2000) An overview of Ulisse, a distributed single address space system. In Kirby, G. N. C., Dearle, A. and Sjeberg D. I. K. (eds) Proc. Ninth Int. Workshop on Persistent Object Systems: Design, Implementation, and Use, POS-9, Lillehammer, Norway, September 6-8, LNCS, 2135, 215-227. Springer-Verlag GmbH, Berlin.
23. Lopriore, L. (2002) Access control mechanisms in a distributed, persistent memory system. IEEE Trans. Parall. Distr. Syst., 13, 1066-1083.
24. Dahlin, M. D., Wang, R. Y., Anderson, T E. and Patterson, D. A. (1994) Cooperative caching: using remote client memory to improve file system performance. In Proc. First USENIXSymp. on Operating Systems Design and Implementation, Monterey, CA, November 14-17, pp. 267-280. USENIX Association, Berkeley, CA.
25. Feeley, M. J., Morgan, W E., Pighin, F. H., Karlin, A. R., Levy, H. M. and Thekkath, C. A. (1995) Implementing global memory management in a workstation cluster. Oper. Syst. Rev., 29,201-212.
26. Franklin, M. J., Carey, M. J. and Livny, M. (1992) Global memory management in client-server DBMS architectures. In Proc. 18th Int. Conf. on Very Large Data Baies, Vancouver, BC, Canada, August 23-27, pp. 596-609. Morgan Kaufmannn, San Mateo, CA.
27. Voelker, G. M., Anderson, E. J., Kimbrel, T., Feeley, M. J., Chase, J. S., Karlin, A. R and Levy, H. M. (1998) Implementing cooperative prefetching and caching in a globallymanaged memory system. Perform. Eval. Rev., 26, 33-43. (Pubitemid 128593220)
28. Belady, L. A. (1966) A study of replacement algorithms for virtual storage computers. IBM Syst. J., 5, 78-101.
29. Cao, P., Felten, E. W., Karlin, A. R. and Li, K. (1996) Implementation and performance of integrated application-controlled file caching, prefetching, and disk scheduling. ACM Trans. Comput. Syst., 14, 311-343. (Pubitemid 126418626)
30. Lumb, C. R., Schindler, J. and Ganger, G. R. (2002) Freeblock scheduling outside of disk firmware. In Proc. USENIX Conf. on File and Storage Technologies (FAST 02), Monterey, CA, January 28-30, USENIX Ass., pp. 275-288.
31. Shenoy, P J., Goyal, P., Rao, S. S. and Vin, H. M. (1998) Symphony: an integrated multimedia file system. In Proc. ACM/SPIE Multimedia Computing and Networking 1998, San Jose, CA, January 26-28, pp. 124-138. SPIE-International Society for Optical Engineering.
32. Bartoli, A., Dini, G. and Lopriore, L. (2001) Applicationcontrolled memory management in a single address space environment. Int. J. Softw. Tools Techno!. Transfer, 3, 235-245.
33. Cox, M. and Ellsworth, D. (1997) Application-controlled demand paging for out-of-core visualization. In Proc. Conf. on Visualization'97, Phoenix, AZ, October 19-24, pp. 235-244. IEEE, New York, NY
34. Harry, K. and Cheriton, D. R. (1992) Application-controlled physical memory using external page-cache management. SIGPLANNotices, 27, 187-197.
35. Krueger, K., Loftesness, D., Vahdat, A. and Anderson, T E. (1993) Tools for the development of application-specific virtual memory management. ACM SIGPLAN Notices, 28, 48-64.
36. Brown, A. D. and Mowry, T C. (2001) Compiler-based I/O prefetching for out-of-core applications. ACM Trans. Comput. Syst., 19, 111-170. (Pubitemid 33602321)
37. Mitra, T, Yang, C.-K. and Chiueh, T (2000)Application-specific file prefetching for multimedia programs. In Proc. Int. Conf. on Multimedia and Expo, New York, NY, July 30-August 2, pp. 459-462. IEEE, Piscataway, NJ.
38. Chang, F. and Gibson, G. A. (1999) Automatic I/O hint generation through speculative execution. In Proc. Third Symp. on Operating Systems Design and Implementation, New Orleans, LA, February 22-25, pp. 1-14. USENIX Association, Berkeley, CA.
39. Kimbrel, T., Tomkins, A., Patterson, R. H., Bershad, B., Cao, P., Felten, E. W., Gibson, G. A., Karlin, A. R. and Li, K. (1996) A trace-driven comparison of algorithms for parallel prefetching and caching. ACM Oper. Syst. Rev., 30, 19-34.
40. Vellanki, V and Chervenak, A. L. (1999) A cost-benefit scheme for high performance predictive prefetching. In Proc. SCC99 Conf. on High Performance Networking and Computing, Portland, OR, November 14-19, ACM, New York, NY
41. Yeh, T, Long, D. D. E. and Brandt, S. A. (2001) Performing file prediction with a program-based successor model. In Proc. Ninth Int. Symp. on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Cincinnati, OH, August 15-18, pp. 193-202, IEEE Computer Society Press, Los Alamitos, CA.