Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6120
Title: A Lower Bound for Two-Server Balancing Algorithms
Authors: Kleinberg, Jon M.
Keywords: computer science
technical report
Issue Date: May-1993
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1350
Abstract: We consider the class of balancing algorithms for two servers. Such algorithms have appeared in a number of the early papers on this problem; they are so named because they seek to "balance" the distance travelled evenly among the servers. In this paper, we show a universal lower bound on the competitive ratio of any balancing algorithm for two servers. The lower bound is equal to (5 + $\sqrt{7}$)/2 ($\sim$ 3.82), and consequently shows that no optimal on-line algorithm for two servers can be expressed as a balancing algorithm.
URI: http://hdl.handle.net/1813/6120
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
93-1350.pdf542.07 kBAdobe PDFView/Open
93-1350.ps123.56 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us