Reducing False Causality in Causal Message Ordering

  • Authors:
  • Pranav Gambhire;Ajay D. Kshemkalyani

  • Affiliations:
  • -;-

  • Venue:
  • HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

A significant shortcoming of causal message ordering systems is their inefficiency because of false causality. False causality is the result of the inability of the "happens before" relation to model true causal relationships among events. The inefficiency of causal message ordering algorithms takes the form of additional delays in message delivery and requirements for large message buffers. This paper gives a lightweight causal message ordering algorithm based on a modified "happens before" relation. This lightweight algorithm greatly reduces the inefficiencies that traditional causal message ordering algorithms suffer from, by reducing the problem of false causality.