CC07-ICDCS

From VaVMURI

Jump to: navigation, search
Self-Similar Algorithms for Dynamic Distributed Systems
K. Mani Chandy and Michel Charpentier
Submitted, 2007 International Conference on Distributed Computing Systems (ICDCS)

This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may cease functioning tem- porarily or permanently. Communication and computing may be interrupted by an adversary or by environmental factors such as noise and power loss. The set of processes may be partitioned into sub- sets that cannot communicate with each other; algorithms in which al l such subsets behave in a similar fashion, regard less of size and identities of processes, are cal led self-similar algorithms. Algorithms adapt to changing conditions, speeding up or slowing down depending on the resources available. The paper presents necessary and sufficient conditions for the application of a self-similar strategy and self-similar algorithms are developed for several problems by applying the methodology.

Personal tools