Name
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 APX-hard. This also implies that computing the optimal processing time is NP-hard, which settles an open problem posed by Kimbrel and Karlin. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-24749-4_19 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Approximation algorithm,Open problem,Computer science,CPU cache,Parallel computing,Algorithm,Minimum time,Distributed computing | Conference | 2996 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.38 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christoph Ambühl | 1 | 357 | 18.50 |
| Birgitta Weber | 2 | 20 | 1.67 |