@inproceedings{4bff7ea46c2d43e2bee5b7b7943be32f,
title = "Minimizing stall time in single and parallel disk systems using multicommodity network flows",
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.",
author = "Susanne Albers and Carsten Witt",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 ; Conference date: 18-08-2001 Through 20-08-2001",
year = "2015",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "12--24",
editor = "Luca Trevisan and Klaus Jansen and Michel Goemans and Rolim, \{Jose D. P.\}",
booktitle = "Approximation, Randomization, and Combinatorial Optimization",
}