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

Page Migration Algorithms Using Work Functions

โœ Scribed by Marek Chrobak; Lawrence L Larmore; Nick Reingold; Jeffery Westbrook

Book ID
102579118
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
323 KB
Volume
24
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

โœฆ Synopsis

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

๐Ÿ“œ SIMILAR VOLUMES

Traversing Layered Graphs Using the Work
Traversing Layered Graphs Using the Work Function Algorithm
โœ William R. Burley ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 299 KB

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 interestin