๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Traversing Layered Graphs Using the Work Function Algorithm

โœ Scribed by William R. Burley

Book ID
102578182
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
299 KB
Volume
20
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

โœฆ Synopsis

The work function algorithm WFA is an on-line algorithm that has been studied mostly in connection with the k-server problem, but can actually be used on a wide variety of on-line problems. Despite being a simple algorithm, WFA has proven to be difficult to analyze, and until recently few interesting results were known. We analyze the performance of the generalized work function algorithm, denoted โฃ-WFA, for on-line traversal of layered graphs. We show that for layered graphs of width k and any

This gives an O k2 -competitive ratio for appro-ลฝ 3 k . priate choice of โฃ , improving the previous upper bound of O k 2 . แฎŠ 1996 Academic Press, Inc.

๐Ÿ“œ SIMILAR VOLUMES

Competitive Algorithms for Layered Graph
Competitive Algorithms for Layered Graph Traversal
โœ Fiat, Amos; Foster, Dean P.; Karloff, Howard; Rabani, Yuval; Ravid, Yiftach; Vis ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 382 KB
Page Migration Algorithms Using Work Fun
Page Migration Algorithms Using Work Functions
โœ Marek Chrobak; Lawrence L Larmore; Nick Reingold; Jeffery Westbrook ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 323 KB

The problem is to schedule movements online so as to minimize the total cost of memory references. Page migration can also be viewed as a restriction of the 1-server with excursions problem. This paper presents a collection of algorithms