Abstract
In this paper we study integrated prefetching and caching in parallel disk systems. This topic has gained a lot of interest in the last years which manifests itself in numerous recent approximation algorithms. This paper provides the first negative result in this area by showing that optimizing the stall time is \(\mathcal{APX}\)-hard. This also implies that computing the optimal processing time is \(\mathcal{NP}\)-hard, which settles an open problem posed by Kimbrel and Karlin.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Albers, S., Büttner, M.: Integrated prefetching and caching in single and parallel disk systems. In: Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, New York (2003)
Albers, S., Garg, N., Leonardi, S.: Minimizing stall time in single and parallel disk systems. Journal of the ACM (JACM) 47(6), 969–986 (2000); Preliminary version in 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 computer. IBM Systems Journal 5(2) (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–197 (1995)
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)
Hutchinson, D.A., Sanders, P., Vitter, J.S.: Duality between prefetching and queued writing with parallel disks. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 62–73. Springer, Heidelberg (2001)
Kallahalla, M., Varman, P.J.: Optimal prefetching and caching for parallel i/o systems. In: Proc. 13th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 219–228. ACM Press, New York (2001)
Kimbrel, T.: Parallel Prefetching and Caching. PhD thesis, University of Washington (1997)
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), pp. 262–263 (1996)
Kimbrel, T., Karlin, A.R.: Near-optimal parallel prefetching and caching. SIAM Journal on Computing 29(4), 1051–1082 (2000); Preliminary version in FOCS 1996
Mayr, E.W., Prömel, H.J., Steger, A. (eds.): Dagstuhl Seminar 1997. LNCS, vol. 1367. Springer, Heidelberg (1998)
Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory, I: Two-level memories. Algorithmica 12(2-3), 110–147 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambühl, C., Weber, B. (2004). Parallel Prefetching and Caching Is Hard. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive