2013 IEEE 33rd International Conference on Distributed Computing Systems (2007)
June 25, 2007 to June 27, 2007
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", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 67, 2007, doi:10.1109/ICDCS.2007.137