On Fast Algorithms for Two Servers

Abstract We consider 2-server algorithms with time complexity O (1) per each request. We show that the previously known algorithm BALANCE2 has competitiveness constant not better than 6, and present another algorithm whose competitiveness constant is 4.

Authors

• Marek Chrobak
• Lawrence L. Larmore

Keywords

No keywords are indexed for this paper.