Although multithreading can improve performance, it is a source of nondeterminism in application behavior. Existing approaches to replicating multithreaded applications either synchronize replicas at interrupt level, at the expense of performance, or use a nonpreemptive deterministic scheduler, ar the expense of concurrency. This paper presents a loose synchronization algorithm for ensuring deterministic replica behavior while preserving concurrency. The algorithm synchronizes replica threads only on state updates by enforcing an equivalent order of mutex acquisitions across replicas.

Original languageEnglish (US)
Article number27
Pages (from-to)250-255
Number of pages6
JournalProceedings of the IEEE Symposium on Reliable Distributed Systems
StatePublished - 2002

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Loose synchronization of multithreaded replicas'. Together they form a unique fingerprint.

Cite this