This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
October 1985 (vol. 11 no. 10)
pp. 1193-1202
S.M. Shatz, Department of Electrical Engineering and Computer Science, University of Illinois
In this paper a technique called process merging is introduced. This technique allows the merging of two communicating sequential processes into a new single process. Thus, this technique can be used to reconfigure a distributed program after a faulty processing element has been detected. The technique is most applicable to dedicated multiple microprocessor systems where the need for continuous operation is critical. A process merging algorithm which operates on distributed programs using the CSP notation is presented in detail and its operation is discussed. In order to illustrate the merging technique, the algorithm's behavior is demonstrated using two classical distributed programs: the Bounded Buffer, Producer, Consumer program and the Dining Philosophers program. Finally, the merging technique is examined with respect to its demands on overall system operation and overhead. This examinatiQn leads to suggestions for future research.
Index Terms:
software reconfiguration, CSP programs, distributed computing, fault-tolerance, process merging
Citation:
S.M. Shatz, "Post-Failure Reconfiguration of CSP Programs," IEEE Transactions on Software Engineering, vol. 11, no. 10, pp. 1193-1202, Oct. 1985, doi:10.1109/TSE.1985.231867
Usage of this product signifies your acceptance of the Terms of Use.