BibTeX
@MISC{Ch_self-similaralgorithms,
author = {K. Mani Ch and Michel Charpentier},
title = {Self-Similar Algorithms for Dynamic Distributed Systems∗},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic dis-tributed systems in which communication channels and pro-cesses 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; algo-rithms in which all such subsets behave in a similar fash-ion, regardless of size and identities of processes, are called self-similar algorithms. Algorithms adapt to changing con-ditions, speeding up or slowing down depending on the re-sources available. The paper presents necessary and suffi-cient conditions for the application of a self-similar strat-egy. Self-similar algorithms are developed for several prob-lems by applying the methodology.
