Title: Ideal stabilisation
Authors: Mikhail Nesterenko; Sébastien Tixeuil
Addresses: Computer Science Department, Kent State University, Kent, OH 44242, USA ' UPMC Sorbonne Universités, Paris, France; Institut Universitaire de France, Paris, France
Abstract: We propose a new approach to specifying and reasoning about forward recovery fault tolerant programs. We call it ideal stabilisation. The program is ideally stabilising if its every state is legitimate. Ideal stabilisation allows the specification designer to prescribe, with arbitrary degree of precision, not only the fault-free program behaviour but also its recovery operation. Unlike the classic variant, ideal stabilisation is particularly suitable for program composition. Specifications may or may not mention all possible states. We identify approaches to designing ideal stabilisation to both classes of specifications. For the first class, we state the necessary condition for an ideally stabilising solution. On the basis of this condition we prove that there is no ideally stabilising solution to the leader election problem. We illustrate the utility of the concept of ideal stabilisation by providing examples of well-known programs and proving them ideally stabilising. Specifically, we prove ideal stabilisation of the conflict manager, the alternator, the propagation of information with feedback and the alternating bit protocol.
Keywords: distributed algorithms; fault tolerance; self-stabilisation; methodology; grid computing; utility computing; ideal stabilisation; recovery operations; leader election problem; fault tolerant programs.
International Journal of Grid and Utility Computing, 2013 Vol.4 No.4, pp.219 - 230
Available online: 12 Oct 2013 *Full-text access for editors Access for subscribers Purchase this article Comment on this article