UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

The Incremental Constraint of k-Server

Thumbnail Image

Files

McAulay_Caelyn.pdf (327.28 KB)

Date

2012-05-19T01:02:02Z

Authors

McAulay, Caelyn Burnham

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

Online algorithms are characterized by operating on an input sequence revealed over time versus a single static input. Instead of generating a single solution, they produce a sequence of incremental solutions corresponding to the input seen so far. An online algorithm's ignorance of future inputs limits its ability to produce optimal solutions. The incremental nature of its solutions is also an obstacle. The two factors can be differentiated by examining the corresponding incremental algorithm, which has knowledge of future inputs, but must still provide a competitive solution at each step. In this thesis, the lower bound of the incremental constraint of k-server is shown to be to 2.

Description

Keywords

computer science, algorithms, online algorithms, k-server, incremental algorithms

LC Keywords

Citation

URI

http://hdl.handle.net/10012/6758

Collections

Theses
Computer Science