On-line algorithms for the K-server problem and its variants.

• Other Authors: Wat, Chi-ming.
• Format: Others
• Language: English
• Published: Chinese University of Hong Kong 1995
• Subjects: Algorithms; Online data processing
• Online Access: http://library.cuhk.edu.hk/record=b5888570; http://repository.lib.cuhk.edu.hk/en/item/cuhk-320607

by Chi-ming Wat. === Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. === Includes bibliographical references (leaves 77-82). === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Performance analysis of on-line algorithms --- p.2 === Chapter 1.2 --- Randomized algorithms --- p.4 === Chapter 1.3 --- Types of adversaries --- p.5 === Chapter 1.4 --- Overview of the results --- p.6 === Chapter 2 --- The k-server problem --- p.8 === Chapter 2.1 --- Introduction --- p.8 === Chapter 2.2 --- Related Work --- p.9 === Chapter 2.3 --- The Evolution of Work Function Algorithm --- p.12 === Chapter 2.4 --- Definitions --- p.16 === Chapter 2.5 --- The Work Function Algorithm --- p.18 === Chapter 2.6 --- The Competitive Analysis --- p.20 === Chapter 3 --- The weighted k-server problem --- p.27 === Chapter 3.1 --- Introduction --- p.27 === Chapter 3.2 --- Related Work --- p.29 === Chapter 3.3 --- Fiat and Ricklin's Algorithm --- p.29 === Chapter 3.4 --- The Work Function Algorithm --- p.32 === Chapter 3.5 --- The Competitive Analysis --- p.35 === Chapter 4 --- The Influence of Lookahead --- p.41 === Chapter 4.1 --- Introduction --- p.41 === Chapter 4.2 --- Related Work --- p.42 === Chapter 4.3 --- The Role of l-lookahead --- p.43 === Chapter 4.4 --- The LRU Algorithm with l-lookahead --- p.45 === Chapter 4.5 --- The Competitive Analysis --- p.45 === Chapter 5 --- Space Complexity --- p.57 === Chapter 5.1 --- Introduction --- p.57 === Chapter 5.2 --- Related Work --- p.59 === Chapter 5.3 --- Preliminaries --- p.59 === Chapter 5.4 --- The TWO Algorithm --- p.60 === Chapter 5.5 --- Competitive Analysis --- p.61 === Chapter 5.6 --- Remarks --- p.69 === Chapter 6 --- Conclusions --- p.70 === Chapter 6.1 --- Summary of Our Results --- p.70 === Chapter 6.2 --- Recent Results --- p.71 === Chapter 6.2.1 --- The Adversary Models --- p.71 === Chapter 6.2.2 --- On-line Performance-Improvement Algorithms --- p.73 === Chapter A --- Proof of Lemma1 --- p.75 === Bibliography --- p.77