### Abstract

The k-server problem is the problem of scheduling the motion of k mobile servers so as to serve a sequence of requests, where to serve a request is to move one of the k servers to the request site. Each request is served before any future requests are known. An online algorithm is known as competitive if its cost never exceeds a constant times that of an optimal offline adversary. Though no competitive deterministic online algorithms are known for any k > 2, we prove that a simple, natural randomized algorithm is competitive for the 3-server problem.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990 |

Publisher | Association for Computing Machinery |

Pages | 280-290 |

Number of pages | 11 |

ISBN (Electronic) | 0898712513 |

State | Published - Jan 1 1990 |

Event | 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990 - San Francisco, United States Duration: Jan 22 1990 → Jan 24 1990 |

### Publication series

Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
---|

### Other

Other | 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990 |
---|---|

Country | United States |

City | San Francisco |

Period | 1/22/90 → 1/24/90 |

### All Science Journal Classification (ASJC) codes

- Software
- Mathematics(all)

## Fingerprint Dive into the research topics of 'A competitive 3-server algorithm'. Together they form a unique fingerprint.

## Cite this

Berman, P., Karloff, H., & Tardos, G. (1990). A competitive 3-server algorithm. In

*Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990*(pp. 280-290). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms). Association for Computing Machinery.