loading...
Reconfigurable Algorithms in View Synchrony
Cambridge, Massachusette October 08-October 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NCA.2001.962541IEEE International Symposium on Netwo ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
N. Lesley, University of Sydney
A. Fekete, University of Sydney
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.
Citation:
N. Lesley, A. Fekete, "Reconfigurable Algorithms in View Synchrony," nca, pp.0256, IEEE International Symposium on Network Computing and Applications (NCA'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions