Fault-Tolerant Sequencer: Specification and an Implementation∗

The synchronization among thin, independent and concurrent processes in an open distributed system is a fundamental issue in current architectures (e.g. middlewares, three-tier architectures etc.). “Independent process” means no message has to be exchanged among the processes to synchronize themselves and “open” means that the number of processes that require to synchronize changes along the time. In this paper we present the specification of a sequencer service that allows independent processes to get a sequence number that can be used to label successive operations (e.g. to allow a set of independent and concurrent processes to get a total order on these labelled operations). Moreover, we propose an implementation of the sequencer service in the timed asynchronous model along with its correctness proof.

[1]  Rachid Guerraoui,et al.  Implementing E-Transactions with Asynchronous Replication , 2001, IEEE Trans. Parallel Distributed Syst..

[2]  Roberto Baldoni,et al.  Design of an Interoperable FT-CORBA Compliant Infrastructure , 2001 .

[3]  Pascal Felber Lightweight Fault Tolerance in CORBA , 2001, DOA.

[4]  Louise E. Moser,et al.  Totem: a fault-tolerant multicast group communication system , 1996, CACM.

[5]  Flaviu Cristian,et al.  Fail-aware datagram service , 1999, IEE Proc. Softw..

[6]  Kenneth P. Birman,et al.  The process group approach to reliable distributed computing , 1992, CACM.

[7]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[8]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[9]  Rachid Guerraoui,et al.  Software-Based Replication for Fault Tolerance , 1997, Computer.

[10]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[11]  Fred B. Schneider,et al.  The primary-backup approach , 1993 .

[12]  Roberto Baldoni,et al.  Software replication in three-tiers architectures: is it a real challange? , 2001, Proceedings Eighth IEEE Workshop on Future Trends of Distributed Computing Systems. FTDCS 2001.

[13]  Flaviu Cristian,et al.  The Timed Asynchronous Distributed System Model , 1998, IEEE Trans. Parallel Distributed Syst..

[14]  Michel Raynal,et al.  Algorithms for mutual exclusion , 1986 .

[15]  Flaviu Cristian,et al.  A Highly Available Local Leader Election Service , 1999, IEEE Trans. Software Eng..

[16]  André Schiper,et al.  Lightweight causal and atomic group multicast , 1991, TOCS.