The Community for Technology Leaders
Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001 (2001)
Cambridge, Massachusette
Oct. 8, 2001 to Oct. 10, 2001
ISBN: 0-7695-1432-4
pp: 0256
N. Lesley , University of Sydney
A. Fekete , University of Sydney
ABSTRACT
A common approach to designing fault-tolerant distributed systems is to use a view-oriented process group communication service as a building block. An application that uses such a service often operates by a simple algorithm (such as a replicated state machine) for the duration of a view, but whenever the view changes, a complicated calculation is used to reconfigure the system. This reconfiguration typically involves exchange of state and merging of information from previously partitioned views. In this paper, we show how to automate the design of the reconfiguration mechanism in certain simple cases, where the reconfiguration treats all previous views symmetrically.
INDEX TERMS
CITATION

N. Lesley and A. Fekete, "Reconfigurable Algorithms in View Synchrony," Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001(NCA), Cambridge, Massachusette, 2001, pp. 0256.
doi:10.1109/NCA.2001.962541
93 ms
(Ver 3.3 (11022016))