skip to main content
10.1145/1007912.1007950acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
Article

Online algorithms for prefetching and caching on parallel disks

Published: 27 June 2004 Publication History

Abstract

Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as possible, using prefetching to avoid bottlenecks in disk access. Efficient algorithms have been developed for some particular patterns of accessing the disk blocks. In this paper, we consider general request sequences. When the request sequence consists of unique block requests, the problem is called prefetching and is a well-solved problem for arbitrary request sequences. When the reference sequence can have repeated references to the same block, we need to devise an effective caching policy as well. While optimum offline algorithms have been recently designed for the problem, in the online case, no effective algorithm was previously known. Our main contribution is a deterministic online algorithm threshold-LRU which achieves O((MD/L)2/3) competitive ratio and a randomized online algorithm threshold-MARK which achieves O(√(MD/L) log (MD/L)) competitive ratio for the caching/prefetching problem on the parallel disk model (PDM), where D is the number of disks, M is the size of fast memory buffer, and M+L is the amount of lookahead available in the request sequence. The best-known lower bound on the competitive ratio is Ω(≾MD/L) for lookahead LM in both models. We also show that if the deterministic online algorithm is allowed to have twice the memory of the offline then a tight competitive ratio of Θ(≾MD/L) can be achieved. This problem generalizes the well-known paging problem on a single disk to the parallel disk model.

References

[1]
S. Albers. On the influence of lookahead in competitive paging algorithms. Algorithmica, 18(3):283--305, 1997.]]
[2]
S. Albers and M. Büttner. Integrated prefetching and caching in single and parallel disk systems. In SPAA, pages 109--117, 2003.]]
[3]
S. Albers, N. Garg, and S. Leonardi. Minimizing stall time in single and parallel disk systems. In In Proc. of 30th Annual ACM Symp. on Theory of Computing (STOC 98), pages 454--462, 1998.]]
[4]
S. Albers and C. Witt. Minimizing stall time in single and parallel disk systems using multicommodity network flows. In RANDOM-APPROX, 2001.]]
[5]
R. Barve, M. Kallahalla, P. J. Varman, and J. S. Vitter. Competitive parallel disk prefetching and buffer management. In In Proc. of Fifth Workshop on I/O in parallel and Distributed Systems, pages 47--56, Nov 1997.]]
[6]
L. A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78--101, 1966.]]
[7]
A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.]]
[8]
D. Breslauer. On competitive online paging with lookahead. TCS, 290(1-2):365--375, 1998.]]
[9]
P. Cao, E. W. Felton, A. R. Karlin, and K. Li. A study of integrated prefetching and caching strategies. In In Proc. of the joint Intl. Conf. on measurement and modeling of computer systems, pages 188--197, May 1995.]]
[10]
A. Fiat, R. Karp, M. Luby, L. McGoech, D. D. Sleator, and N. E. Young. Competitive paging algorithms. Journal of Algorithms, 12(4):685--699, Dec 1991.]]
[11]
D. A. Hutchinson, P. Sanders, and J. S. Vitter. Duality between prefetching and queued writing with application to integrated caching and prefetching and to external sorting. In ESA, 2001.]]
[12]
M. Kallahalla and P. J. Varman. Optimal read-once parallel disk scheduling. In In Proc. of Sixth ACM Workshop on I/O in Parallel and Distributed Systems, pages 68--77, 1999.]]
[13]
M. Kallahalla and P. J. Varman. Optimal prefetching and caching for parallel i/o systems. In SPAA, 2001.]]
[14]
A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79--119, 1988.]]
[15]
T. Kimbrel, P. Cao, E.W. Felten, A. R. Karlin, and K. Li. Integrated parallel prefetching and caching. In SIGMETRICS, 1996.]]
[16]
T. Kimbrel and A. R. Karlin. Near optimal parallel prefetching and caching. In FOCS, pages 540--549, 1996.]]
[17]
L. A. McGeoch and D. D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816--825, 1991.]]
[18]
D. D. Sleator and R. E. Tarjan. Amortized efficiency of the list update and paging rules. Communications of the ACM, 28:202--208, November 1985.]]
[19]
J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing surveys, 33(2):209--271, June 2001.]]
[20]
N. Young. Competitive paging and dual-guided on-line weighted caching and matching algorithms. In Ph.D. thesis. Princeton University, 1991. CS-TR-348-91.]]

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
June 2004
332 pages
ISBN:1581138407
DOI:10.1145/1007912
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: 27 June 2004

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. I/O scheduling
  2. caching
  3. online algorithms
  4. parallel disk model
  5. prefetching

Qualifiers

  • Article

Conference

SPAA04

Acceptance Rates

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

Upcoming Conference

SPAA '25
37th ACM Symposium on Parallelism in Algorithms and Architectures
July 28 - August 1, 2025
Portland , OR , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)2
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2016)External Sorting and PermutingEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_137(708-715)Online publication date: 22-Apr-2016
  • (2015)External Sorting and PermutingEncyclopedia of Algorithms10.1007/978-3-642-27848-8_137-2(1-10)Online publication date: 24-Jun-2015
  • (2013)Cooperating to buy shoes in the real worldProceedings of the South African Institute for Computer Scientists and Information Technologists Conference10.1145/2513456.2513474(286-294)Online publication date: 7-Oct-2013
  • (2013)Client Buffering Considerations for Video StreamingProceedings of the 2013 27th International Conference on Advanced Information Networking and Applications Workshops10.1109/WAINA.2013.69(595-600)Online publication date: 25-Mar-2013
  • (2011)Server-Side Buffering Measurements for VoD SystemsProceedings of the 2011 14th International Conference on Network-Based Information Systems10.1109/NBiS.2011.30(142-147)Online publication date: 7-Sep-2011
  • (2008)Algorithms and data structures for external memoryFoundations and Trends® in Theoretical Computer Science10.1561/04000000142:4(305-474)Online publication date: 1-Jan-2008
  • (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
  • (2007)A Model and Prototype of a Resource-Efficient Storage Server for High-Bitrate Video-on-Demand2007 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2007.370587(1-7)Online publication date: Mar-2007
  • (2007)Dynamic Memory Allocation and Data Sharing Schedule in Media ServerMultimedia and Expo, 2007 IEEE International Conference on10.1109/ICME.2007.4284589(72-75)Online publication date: Jul-2007
  • (2005)On competitive online read-many parallel disks schedulingProceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1073970.1074006(217-217)Online publication date: 18-Jul-2005

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media