Sciweavers

Share
DAGSTUHL
1996

Competitive Analysis of Distributed Algorithms

9 years 22 days ago
Competitive Analysis of Distributed Algorithms
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line algorithm that can in e ect predict future inputs. E orts to apply competitive analysis to faulttolerant distributed algorithms require accounting for not only this input nondeterminism but also system nondeterminism that arises in distributed systems prone to asynchrony and failures. This paper surveys recent e orts to adapt competitive analysis to distributed systems, and suggests how these adaptations might in turn be useful in analyzing a wider variety of systems. These include tools for building competitive algorithms by composition, and for obtaining more meaningful competitive ratios by limiting the knowledge of the o -line algorithm.
James Aspnes
Added 02 Nov 2010
Updated 02 Nov 2010
Type Conference
Year 1996
Where DAGSTUHL
Authors James Aspnes
Comments (0)
books