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

Authors:
Susanne Albers;Carsten Witt
Affiliations:
-;-
Venue:
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Year:
2001

Citing 7
Cited 0

A study of integrated prefetching and caching strategies

Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Informed prefetching and caching

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Implementation and performance of integrated application-controlled file caching, prefetching, and disk scheduling

ACM Transactions on Computer Systems (TOCS)
A trace-driven comparison of algorithms for parallel prefetching and caching

OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Minimizing stall time in single and parallel disk systems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Fast approximation algorithm for minimum cost multicommodity flow

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Near-optimal parallel prefetching and caching

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study integrated prefetching and caching in single and parallel disk systems. Arecen t 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.