Modular Competitiveness for Distributed Algorithms (2000)
| Venue: | In Proc. 28th ACM Symp. on Theory of Computing (STOC |
| Citations: | 13 - 2 self |
BibTeX
@INPROCEEDINGS{Aspnes00modularcompetitiveness,
author = {James Aspnes and Orli Waarts},
title = {Modular Competitiveness for Distributed Algorithms},
booktitle = {In Proc. 28th ACM Symp. on Theory of Computing (STOC},
year = {2000},
pages = {237--246},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We define a novel measure of competitive performance for distributed algorithms based on throughput, the number of tasks that an algorithm can carry out in a fixed amount of work. This new measure complements the latency measure of Ajtai et al. [3], which measures how quickly an algorithm can finish tasks that start at specified times. An important property of the throughput measure is that it is modular: we define a notion of relative competitiveness with the property that a k-relatively competitive implementation of an object T using a subroutine U , combined with an l-competitive implementation of U , gives a kl-competitive algorithm for ...
