Article

Integrated prefetching and caching in single and parallel disk systems

Authors:

Susanne Albers,

Markus BüttnerAuthors Info & Claims

SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

Pages 109 - 117

https://doi.org/10.1145/777412.777431

Published: 07 June 2003 Publication History

Abstract

We study integrated prefetching and caching in single and parallel disk systems. There exist two very popular approximation algorithms called Aggressive and Conservative for minimizing the total elapsed time in the single disk problem. For D parallel disks, approximation algorithms are known for both the elapsed time and stall time performance measures. In particular, there exists a D-approximation algorithm for the stall time measure that uses D-1 additional memory locations in cache.In the first part of the paper we investigate approximation algorithms for the single disk problem. We give a refined analysis of the Aggressive algorithm, showing that the original analysis was too pessimistic. We prove that our new bound is tight. Additionally we present a new family of prefetching and caching strategies and give algorithms that perform better than Aggressive and Conservative.In the second part of the paper we investigate the problem of minimizing stall time in parallel disk systems. We present a polynomial time algorithm for computing a prefetching/caching schedule whose stall time is bounded by that of an optimal solution. The schedule uses at most 3(D-1) extra memory locations in cache. This is the first polynomial time algorithm for computing schedules with a minimum stall time. Our algorithm is based on the linear programming approach of [1]. However, in order to achieve minimum stall times, we introduce the new concept of synchronized schedules in which fetches on the D disks are performed completely in parallel.

References

[1]

S. Albers, N. Garg and S. Leonardi. Minimizing tall time in single and parallel disk systems. Journal of the ACM, 47:969--986, 2000.

Digital Library

[2]

S. Albers and C. Witt. Minimizing stall time in single and parallel disk systems using multicommodity network flows. Proc. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX), Springer LNCS 2129, 12--23, 2001.

[3]

L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78--101, 1966.

Digital Library

[4]

A. Borodin, S. Irani, P. Raghavan and B. Schieber. Competitive paging with locality of reference. Journal on Computer and System Sciences, 50:244--258, 1995.

Digital Library

[5]

P. Cao, E.W. Felten, A.R. Karlin and K. Li. A study of integrated prefetching and caching strategies. Proc. ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 188--196, 1995.

Digital Library

[6]

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 (TOCS), 14:311--343, 1996.

Digital Library

[7]

A. Fiat and M. Mendel. Truly online paging with locality of reference. Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997.

Digital Library

[8]

D.R. Fuchs and D.E. Knuth. Optimal prepaging and font caching. ACM Transactions on Programming Languages and Systems, 7:62--79, 1985.

Digital Library

[9]

A. Gaysinsky, A. Itai, and H. Shachnai. Strongly competitive algorithms for caching with pipelined prefetching. Proc. 9th Annual European Symposium on Algorithms (ESA01), Springer LNCS 2161, 49--61, 2001.

[10]

D.A. Hutchinson, P. Sanders, and J.S. Vitter. Duality between prefetching and queued writing with parallel disks. Proc. 9th Annual European Symposium on Algorithms (ESA01), Springer LNCS 2161, 62--73, 2001.

[11]

M. Kallahalla and P.J. Varman. Optimal prefetching and caching for parallel I/O systems. Proc. 13th ACM Symposium on Parallel Algorithms and Architectures, 2001.

Digital Library

[12]

T. Kimbrel and A.R. Karlin. Near-optimal parallel prefetching and caching. SIAM Journal on Computing, 29:1051--1082, 2000. Preliminary version in FOCS96.

Digital Library

[13]

T. Kimbrel, P. Cao, E.W. Felten, A.R. Karlin and K. Li. Integrated parallel prefetching and caching. Proc. ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 1996.

Digital Library

[14]

T. Kimbrel, A. Tomkins, R.H. Patterson, B. Bershad, P. Cao, E.W. Felten, G.A. Gibson, A.R. Karlin and K. Li. A trace-driven comparison of algorithms for parallel prefetching and caching. Proc. of the ACM SIGOPS/USENIX Association Symposium on Operating System Design and Implementation, 1996.

Digital Library

[15]

P. Krishnan and J.S. Vitter. Optimal prediction for prefetching in the worst case. SIAM Journal on Computing, 27:1617--1636, 1998.

Digital Library

[16]

M. Palmer and S.B. Zdonik. Fido: A cache that learns to fetch. Proc. 17th International Conference on Very Large Data Bases, 255--264, 1991.

Digital Library

[17]

R.H. Patterson, G.A. Gibson, E. Ginting, D. Stodolsky and J. Zelenka. Informed prefetching and caching. Proc. 15th Symposium on Operating Systems Principles, 79--95, 1995.

Digital Library

[18]

D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202--208, 1985.

Digital Library

[19]

J. Vitter and P. Krishnan. Optimal prefetching via data compression. Journal of the ACM, 43:771--793, 1996.

Digital Library

Cited By

Hou BChen F(2018)Pacaca: Mining Object Correlations and Parallelism for Enhancing User Experience with Cloud Storage2018 IEEE 26th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS.2018.00036(293-305)Online publication date: Sep-2018
https://doi.org/10.1109/MASCOTS.2018.00036
Seshadri VYedkar SXin HMutlu OGibbons PKozuch MMowry T(2015)Mitigating Prefetcher-Caused Pollution Using Informed Caching Policies for Prefetched BlocksACM Transactions on Architecture and Code Optimization10.1145/267795611:4(1-22)Online publication date: 9-Jan-2015
https://dl.acm.org/doi/10.1145/2677956
Rafique M(2010)A Capabilities-Aware Programming Model for Asymmetric High-End SystemsProceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing10.1109/CCGRID.2010.131(844-849)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1109/CCGRID.2010.131
Show More Cited By

Index Terms

Integrated prefetching and caching in single and parallel disk systems
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Integrated prefetching and caching in single and parallel disk systems

We study integrated prefetching and caching in single and parallel disk systems. In the first part of the paper we investigate approximation algorithms for the single disk problem. There exist two very popular approximation algorithms called Aggressive ...
Criticality aware tiered cache hierarchy: a fundamental relook at multi-level cache hierarchies
ISCA '18: Proceedings of the 45th Annual International Symposium on Computer Architecture

On-die caches are a popular method to help hide the main memory latency. However, it is difficult to build large caches without substantially increasing their access latency, which in turn hurts performance. To overcome this difficulty, on-die caches ...
Stealth prefetching
Proceedings of the 2006 ASPLOS Conference

Prefetching in shared-memory multiprocessor systems is an increasingly difficult problem. As system designs grow to incorporate larger numbers of faster processors, memory latency and interconnect traffic increase. While aggressive prefetching ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

June 2003

374 pages

ISBN:1581136617

DOI:10.1145/777412

General Chair:
Arnold Rosenberg
University of Massachusetts
,
Program Chair:
Friedhelm Meyer auf der Heide
U. Paderborn

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA03

Sponsor:

SPAA03: 15th ACM Symposium on Parallelism in Algorithms and Architecturesn

June 7 - 9, 2003

California, San Diego, USA

Acceptance Rates

SPAA '03 Paper Acceptance Rate 38 of 106 submissions, 36%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
411
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hou BChen F(2018)Pacaca: Mining Object Correlations and Parallelism for Enhancing User Experience with Cloud Storage2018 IEEE 26th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS.2018.00036(293-305)Online publication date: Sep-2018
https://doi.org/10.1109/MASCOTS.2018.00036
Seshadri VYedkar SXin HMutlu OGibbons PKozuch MMowry T(2015)Mitigating Prefetcher-Caused Pollution Using Informed Caching Policies for Prefetched BlocksACM Transactions on Architecture and Code Optimization10.1145/267795611:4(1-22)Online publication date: 9-Jan-2015
https://dl.acm.org/doi/10.1145/2677956
Rafique M(2010)A Capabilities-Aware Programming Model for Asymmetric High-End SystemsProceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing10.1109/CCGRID.2010.131(844-849)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1109/CCGRID.2010.131
Monti HButt AVazhkudai SGschwind MNicolau ASalapura VMoreira J(2009)/scratch as a cacheProceedings of the 23rd international conference on Supercomputing10.1145/1542275.1542325(350-359)Online publication date: 8-Jun-2009
https://dl.acm.org/doi/10.1145/1542275.1542325
Hon WShah RVarman PVitter JMeyer auf der Heide FShavit N(2008)Tight competitive ratios for parallel disk prefetching and cachingProceedings of the twentieth annual symposium on Parallelism in algorithms and architectures10.1145/1378533.1378593(352-361)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1145/1378533.1378593
Rafique MButt ANikolopoulos DRamirez ABiliardi GGschwind M(2008)Dma-based prefetching for i/o-intensive workloads on the cell architectureProceedings of the 5th conference on Computing frontiers10.1145/1366230.1366236(23-32)Online publication date: 5-May-2008
https://dl.acm.org/doi/10.1145/1366230.1366236
Ding XJiang SChen F(2007)A buffer cache management scheme exploiting both temporal and spatial localitiesACM Transactions on Storage10.1145/1242520.12425223:2(5-es)Online publication date: 1-Jun-2007
https://dl.acm.org/doi/10.1145/1242520.1242522
Butt AGniady CHu Y(2007)The Performance Impact of Kernel Prefetching on Buffer Cache Replacement AlgorithmsIEEE Transactions on Computers10.1109/TC.2007.102956:7(889-908)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1109/TC.2007.1029
Jiang SDing XChen FTan EZhang X(2005)DULOProceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 410.5555/1251028.1251036(8-8)Online publication date: 13-Dec-2005
https://dl.acm.org/doi/10.5555/1251028.1251036
Butt AGniady CHu Y(2005)The performance impact of kernel prefetching on buffer cache replacement algorithmsACM SIGMETRICS Performance Evaluation Review10.1145/1071690.106423133:1(157-168)Online publication date: 6-Jun-2005
https://dl.acm.org/doi/10.1145/1071690.1064231
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents