A Fault-Tolerant Sequencer for Timed Asynchronous Systems

Authors:
Roberto Baldoni;Carlo Marchetti;Sara Tucci Piergiovanni
Affiliations:
-;-;-
Venue:
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Year:
2002

Citing 8
Cited 2

Algorithms for mutual exclusion

Algorithms for mutual exclusion
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Replication management using the state-machine approach

Distributed systems (2nd Ed.)
The primary-backup approach

Distributed systems (2nd Ed.)
The Timed Asynchronous Distributed System Model

IEEE Transactions on Parallel and Distributed Systems
A Highly Available Local Leader Election Service

IEEE Transactions on Software Engineering
Software-Based Replication for Fault Tolerance

Computer
Semi-Passive Replication

SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems

Reconciliation service for copies synchronisation

UbiMob '04 Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing
Scalable service-oriented replication with flexible consistency guarantee in the cloud

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 their operations). Moreover, we provide an implementation of the sequencer service in a specific partially synchronous distributed system, namely the timed asynchronous model. As an example, if a sequencer is used by a software replication scheme then we get the advantage to deploy server replicas across an asynchronous distributed system such as the Internet.