✦ LIBER ✦

Competitive Parallel Disk Prefetching and Buffer Management

✍ Scribed by Rakesh Barve; Mahesh Kallahalla; Peter J. Varman; Jeffrey Scott Vitter

Book ID: 102573630
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 189 KB
Volume: 36
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.2000.1089

No coin nor oath required. For personal study only.

✦ Synopsis

We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel IrO systems, using a read-once model of block references. This has widespread applicability to key IrO-bound applications such as external merging and concurrent playback of multiple video streams. Two realistic lookahead models, global lookahead and local lookahead, are defined. Algorithms NOM and GREED, based on these two forms of lookahead are analyzed for shared buffer and distributed buffer configurations, both of which

📜 SIMILAR VOLUMES

Duality Between Prefetching and Queued W

Duality Between Prefetching and Queued Writing with Parallel Disks

✍ Hutchinson, David A.; Sanders, Peter; Vitter, Jeffrey Scott 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 248 KB

Integrated prefetching and caching in si

Integrated prefetching and caching in single and parallel disk systems

✍ Susanne Albers; Markus Büttner 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 238 KB

[ACM Press the twenty-first annual sympo

[ACM Press the twenty-first annual symposium - Calgary, AB, Canada (2009.08.11-2009.08.13)] Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09 - Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms

✍ Kobayashi, Koji; Miyazaki, Shuichi; Okabe, Yasuo 📂 Article 📅 2009 🏛 ACM Press ⚖ 557 KB

[ACM Press the twenty-first annual sympo

✍ Kobayashi, Koji; Miyazaki, Shuichi; Okabe, Yasuo 📂 Article 📅 2009 🏛 ACM Press ⚖ 557 KB

The online buffer management problem formulates the problem of queuing policies of network switches supporting QoS (Quality of Service) guarantee. We focus on multi-queue switches in QoS networks proposed by Azar et al. To achieve good upper bounds, they introduced so-called "the relaxed model". Als

[ACM Press the nineteenth annual ACM sym

[ACM Press the nineteenth annual ACM symposium - San Diego, California, USA (2007.06.09-2007.06.11)] Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07 - A tight bound on online buffer management for two-port shared-memory switches

✍ Kobayashi, Koji; Miyazaki, Shuichi; Okabe, Yasuo 📂 Article 📅 2007 🏛 ACM Press ⚖ 148 KB

[ACM Press the nineteenth annual ACM sym

✍ Kobayashi, Koji; Miyazaki, Shuichi; Okabe, Yasuo 📂 Article 📅 2007 🏛 ACM Press ⚖ 148 KB

The online buffer management problem formulates the problem of queueing policies of network switches supporting QoS (Quality of Service) guarantee. For this problem, several models are considered. In this paper, we focus on shared memory switches with preemption. We prove that the competitive ratio