Skip to main content
SpringerLink
Log in

Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows

  • Conference paper
  • First Online:
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (RANDOM 2001, APPROX 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2129))

Abstract

We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching and caching can also be formulated as a min-cost multicommodity flow problem and, exploiting special properties of our network, can be solved using combinatorial techniques. Moreover, for parallel disk systems, we develop improved approximation algorithms, trading performance guarantee for running time. If the number of disks is constant, we achieve a 2-approximation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Albers, N. Garg, and S. Leonardi. Minimizing stall time in single and parallel disk systems. In Proc. 30th Annual ACM Symp. on Theory of Computing, pages 454–462, 1998.

    Google Scholar 

  2. Bershad, Cao, E. W. Felten, G. A. Gibson, A. R. Karlin, T. Kimbrel, K. Li, R. H. Patterson, and A. Tomkins. A trace-driven comparison of algorithms for parallel prefetching and caching. In Proc. ACM SIGOPS/USENIX Assoc. Symp. on Operating System Design and Implementation (OSDI), 1996.

    Google Scholar 

  3. P. Cao, E. W. Felten, A. R. Karlin, and K. Li. A study of integrated prefetching and caching strategies. In Proc. ACM Int. Conf. on Measurement and Modeling of Computer Systems (SIGMETRICS), pages 188–196, 1995.

    Google Scholar 

  4. P. Cao, E. W. Felten, A. R. Karlin, and K. Li. Implementation and performance of integrated application-controlled caching, prefetching and disk scheduling. ACM Transaction on Computer Systems, 14(4):311–343, 1996.

    Article  Google Scholar 

  5. G. A. Gibson, E. Ginting, R. H. Patterson, D. Stodolsky, and J. Zelenka. Informed prefetching and caching. In Proc. 17th Int. Conf. on Operating Systems Principles, pages 79–95, 1995.

    Google Scholar 

  6. A. Kamath, O. Palmon, and S. Plotkin. Fast approximation algorithm for minimum cost multicommodity flow. In Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 493–501, 1995.

    Google Scholar 

  7. R. Karlin and T. Kimbrel. Near-optimal parallel prefetching and caching. In Proc. 37th Annual Symp. on Foundations of Computer Science, pages 540–549. IEEE Society, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Dortmund University, 44221, Dortmund, Germany

    Susanne Albers & Carsten Witt

Authors
  1. Susanne Albers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carsten Witt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Massachusetts Institute of Technology, MIT, Cambridge, MA, 02139, USA

    Michel Goemans

  2. Institute for Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

  3. Centre Universitaire d’Informatique, Université de Genéve, 24, Rue General Dufour, 1211, Genéve 4, Switzerland

    José D. P. Rolim

  4. Computer Science Division, University of California at Berkeley, 615 Soda Hall, Berkeley, CA, 94720-1776, USA

    Luca Trevisan

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Albers, S., Witt, C. (2001). Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. RANDOM APPROX 2001 2001. Lecture Notes in Computer Science, vol 2129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44666-4_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-44666-4_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42470-3

  • Online ISBN: 978-3-540-44666-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation