Upper bounds for multi-level multi-server paging

Shlomi Dolev, Anat Eyal, Danny Hendler, Philip Derbeko, Marina Kogan-Sadetsky

Research output: Contribution to journalArticlepeer-review

Abstract

The distributed multi-level multi-server paging problem (DMLMSP) defined in this paper extends and generalizes the classical distributed paging problem [3] to a distributed concurrent multi-level setting, in which multiple servers share caches at multiple levels. The DMLMSP can be used for modeling algorithms for efficient distributed storage systems, in which multiple servers use caches for accelerating access to a centralized storage, maintaining cache coherency across multiple nodes while minimizing access latency and optimizing cache-hit ratio. The DMLMSP model fits basic principles of Non-Uniform Cache Architectures (NUCAs) and can be used for analyzing multiple-level centralized storage. We present an optimal offline algorithm for the DMLMSP model, with minimum number of page faults and minimum makespan, whose time complexity is polynomial in the length of the servers' page request sequences. The new algorithm generalizes and simplifies the state of the art algorithms [3,1].

Original languageEnglish
Pages (from-to)72-76
Number of pages5
JournalInformation Processing Letters
Volume142
DOIs
StatePublished - Feb 2019
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2018 Elsevier B.V.

Funding

We thank to the anonymous reviewers for the constructive very detailed deep comments, which improved significantly the results. We also thank EMC and ISF grant number 428/11 for supporting the research.

FundersFunder number
EMC
Iowa Science Foundation
Israel Science Foundation428/11

    Keywords

    • Concurrency
    • Distributed computing
    • Distributed systems
    • Multi-level shared cache
    • Optimal offline polynomial paging algorithm

    Fingerprint

    Dive into the research topics of 'Upper bounds for multi-level multi-server paging'. Together they form a unique fingerprint.

    Cite this