The Minimal Dependency Relation for Causal Event Ordering in Distributed Computing

@inproceedings{Hernndez2014TheMD,
  title={The Minimal Dependency Relation for Causal Event Ordering in Distributed Computing},
  author={Sa{\'u}l E. Pomares Hern{\'a}ndez},
  year={2014}
}
Several algorithms of different domains in distributed systems are designed over the principle of the Happened-Before Relation (HBR). One common aspect among them is that they intend to be efficient in their implementation by identifying and ensuring the necessary and sufficient dependency constraints. In this pursuit, some previous works talk about the use of a transitive reduction of the causality. However, none of these works formally prove in a broad manner that such transitive reduction is… CONTINUE READING
2 Citations
12 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Morales Rosales , and Gustavo Rodriguez Gomez , An Intermedia Synchronization Mechanism for Multimedia Distributed System

  • Jorge Estudillo Ramirez, A Luis
  • Annu . Rev . Scal . Compt . , Ser . Scal Compt
  • 2004

Applied abstract algebra, Undergraduate Texts in Mathematics, 2nd edition

  • R. Lidl, G. G. Pilz
  • 1998
1 Excerpt

A Note on the Determination of the Immediate Predecessors in a Distributed Computation

  • G. Melideo Helary
  • Int . Journal of Foundations of Computer Science
  • 1995

Similar Papers

Loading similar papers…