Advertisement

Integrated Prefetching and Caching with Read and Write Requests

  • Susanne Albers
  • Markus Büttner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)

Abstract

All previous work on integrated prefetching/caching assumes that memory reference strings consist of read requests only. In this paper we present the first study of integrated prefetching/caching with both read and write requests. For single disk systems we analyze popular algorithms such as Conservative and Aggressive and give tight bounds on their approximation ratios. We also develop a new algorithm that performs better than Conservative and Aggressive. For parallel disk systems we present a general technique to construct feasible schedules. The technique achieves a load balancing among the disks. Finally we show that it is NP-complete to decide if an input can be served with f fetch and w write operations, even in the single disk setting.

Keywords

Elapse Time Optimal Schedule Approximation Ratio Memory Block Disk Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albers, S., Garg, N., Leonardi, S.: Minimizing stall time in single and parallel disk systems. Journal of the ACM 47, 969–986 (2000); Preliminary version STOC 1998zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Albers, S., Witt, C.: Minimizing stall time in single and parallel disk systems using multicommodity network flows. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 12–23. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5, 78–101 (1966)CrossRefGoogle Scholar
  4. 4.
    Cao, P., Felten, E.W., Karlin, A.R., Li, K.: A study of integrated prefetching and caching strategies. In: Proc. ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pp. 188–196 (1995) Google Scholar
  5. 5.
    Cao, P., Felten, E.W., Karlin, A.R., Li, K.: Implementation and performance of integrated application-controlled caching, prefetching and disk scheduling. ACM Transaction on Computer Systems (TOCS) 14, 311–343 (1996)CrossRefGoogle Scholar
  6. 6.
    Gaysinsky, A., Itai, A., Shachnai, H.: Strongly competitive algorithms for caching with pipelined prefetching. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 49–61. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Kimbrel, T., Karlin, A.R.: Near-optimal parallel prefetching and caching. SIAM Journal on Computing 29, 1051–1082 (2000); Preliminary version in FOCS 1996zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Kimbrel, T., Cao, P., Felten, E.W., Karlin, A.R., Li, K.: Integrated parallel prefetching and caching. In: Proc. ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) (1996) Google Scholar
  9. 9.
    Kimbrel, T., Tomkins, A., Patterson, R.H., Bershad, B., Cao, P., Felten, E.W., Gibson, G.A., Karlin, A.R., Li, K.: A trace-driven comparison of algorithms for parallel prefetching and caching. In: Proc. of the ACM SIGOPS/USENIX Association Symposium on Operating System Design and Implementation (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Susanne Albers
    • 1
  • Markus Büttner
    • 1
  1. 1.Institute of Computer ScienceFreiburg UniversityFreiburgGermany

Personalised recommendations