This Article 
 Bibliographic References 
 Add to: 
27th International Conference on Distributed Computing Systems (ICDCS '07)
Self-Similar Algorithms for Dynamic Distributed Systems
Toronto, Canada
June 25-June 27
ISBN: 0-7695-2837-3
K. Mani Chandy, California Institute of Technology
Michel Charpentier, California Institute of Technology
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 temporarily 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 subsets that cannot communicate with each other; algorithms in which all such subsets behave in a similar fashion, regardless of size and identities of processes, are called 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. Self-similar algorithms are developed for several problems by applying the methodology.
K. Mani Chandy, Michel Charpentier, "Self-Similar Algorithms for Dynamic Distributed Systems," icdcs, pp.67, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.