A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION

DOI10.1142/S0129054102001503zbMath1067.68521MaRDI QIDQ3021991

Emmanuelle Anceaume, Jean-Michel Helary, Michel Raynal

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

message passingHasse diagramvector clocktimestampcausality trackingasynchronous distributed computationimmediate predecessor

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (1)

From the happened-before relation to the causal ordered set abstraction

Cites Work

• On-the-fly analysis of distributed computations
• An efficient implementation of vector clocks
• Shared global states in distributed computations
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION