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

On competitive online read-many parallel disks scheduling

Published: 18 July 2005 Publication History

Abstract

We consider the natural extension of the single disk caching problem to parallel disk I/O model. We close the existing gap between lower and upper bounds and achieve optimal competitive ratio of O(√D) when lookahead is more than the memory size M. When lookahead is smaller, we derive various upper bounds and lower bounds on the competitive ratio under various adversarial models.

References

[1]
D. A. Hutchinson, P. Sanders, and J. S. Vitter. Duality between prefetching and queued writing. In ESA, 2001.
[2]
M. Kallahalla and P. J. Varman. Optimal read-once parallel disk scheduling. In IOPADS, 1999.
[3]
M. Kallahalla and P. J. Varman. Optimal prefetching and caching for parallel i/o systems. In SPAA, 2001.
[4]
R. Shah, P. J. Varman, and J. S. Vitter. Online algorithms for prefetching and caching on parallel disks. In SPAA, 2001.

Cited By

View all
  • (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

Index Terms

  1. On competitive online read-many parallel disks scheduling

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
    July 2005
    346 pages
    ISBN:1581139861
    DOI:10.1145/1073970
    • General Chair:
    • Phil Gibbons,
    • Program Chair:
    • Paul Spirakis
    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: 18 July 2005

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. online algorithms
    2. parallel disk model

    Qualifiers

    • Article

    Conference

    SPAA05

    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)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 13 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (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

    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