2004
DOI: 10.1007/978-3-540-24749-4_19
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Prefetching and Caching Is Hard

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…The problem of finding optimal caching on multiple-disk is proved to be NP-hard [19]. A simpler problem on a single-disk setup has a polynomial solution [20], which is, unfortunately, too complex to be applied in real applications.…”
Section: A Problem Statementmentioning
confidence: 99%
“…The problem of finding optimal caching on multiple-disk is proved to be NP-hard [19]. A simpler problem on a single-disk setup has a polynomial solution [20], which is, unfortunately, too complex to be applied in real applications.…”
Section: A Problem Statementmentioning
confidence: 99%
“…The problem of finding optimal caching on multiple-disk is proved to be NP-hard [6]. A simpler problem on a single-disk setup has a polynomial solution [5], which is, unfortunately, too complex to be applied in real applications.…”
Section: B Heuristic Cachingmentioning
confidence: 99%