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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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 1998
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)
Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5, 78–101 (1966)
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)
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)
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)
Kimbrel, T., Karlin, A.R.: Near-optimal parallel prefetching and caching. SIAM Journal on Computing 29, 1051–1082 (2000); Preliminary version in FOCS 1996
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albers, S., Büttner, M. (2003). Integrated Prefetching and Caching with Read and Write Requests. In: Dehne, F., Sack, JR., Smid, M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45078-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-45078-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40545-0
Online ISBN: 978-3-540-45078-8
eBook Packages: Springer Book Archive