Proceedings 35th Annual Symposium on Foundations of Computer Science (1994)
Santa Fe, NM, USA
Nov. 20, 1994 to Nov. 22, 1994
M. Ajtai , IBM Almaden Res. Center, San Jose, CA, USA
J. Aspnes , IBM Almaden Res. Center, San Jose, CA, USA
C. Dwork , IBM Almaden Res. Center, San Jose, CA, USA
O. Waarts , IBM Almaden Res. Center, San Jose, CA, USA
We introduce a theory of competitive analysis for distributed algorithms. The first steps in this direction were made in the seminal papers of Y. Bartal et al. (1992), and of B. Awerbuch et al. (1992), in the context of data management and job scheduling. In these papers, as well as in other subsequent sequent work, the cost of a distributed algorithm is compared to the cost of an optimal global-control algorithm. In this paper we introduce a more refined notion of competitiveness for distributed algorithms, one that reflects the performance of distributed algorithms more accurately. In particular, our theory allows one to compare the cost of a distributed on-line algorithm to the cost of an optimal distributed algorithm. We demonstrate our method by studying the cooperative collect primitive, first abstracted by M. Saks, N. Shavit, and H. Woll (1991). We provide the first algorithms that allow processes to cooperate to finish their work in fewer steps. Specifically, we present two algorithms (with different strengths), and provide a competitive analysis for each one.
distributed on-line algorithm, competitive analysis, distributed algorithms, data management, job scheduling, optimal global-control algorithm, competitiveness
C. Dwork, M. Ajtai, O. Waarts and J. Aspnes, "A theory of competitive analysis for distributed algorithms," Proceedings 35th Annual Symposium on Foundations of Computer Science(FOCS), Santa Fe, NM, USA, 1994, pp. 401-411.