By Topic

A state machine approach to dynamic reconfiguration of distributed applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lim, A.S. ; Dept. of Comput. Sci., Clark Atlanta Univ., GA, USA

Many large and complex distributed applications execute for a long period of time and require dynamic reconfiguration that is graceful so as to reduce reduce the cost of downtime and increase the availability of critical operations. To make our reconfiguration facility efficient and general, we have the following design goals. First, processes should be allowed to interact arbitrarily without unnecessary restrictions. We avoid using transactions since they restrict the way processes can synchronize among one another. Second, we should not mandate quiescence of all affected processes before dynamic reconfiguration can begin. Third, a new configuration should be unconstrained by the properties of the old configuration. We model the behavior of each process (or resource) by a finite-state machine (FSM), known as a basic machine

Published in:

Configurable Distributed Systems, 1994., Proceedings of 2nd International Workshop on

Date of Conference:

21-23 Mar 1994