An Efficient Causal Ordering Algorithm for Mobile Computing Environments - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

An Efficient Causal Ordering Algorithm for Mobile Computing Environments


Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination process(es), should be sent with each message. By eliminating other kinds of control information from the messages, the communication overheads can be significantly reduced. In this paper we present an algorithm that uses this knowledge to efficiently enforce causal ordering of messages. The proposed algorithm does not require any prior knowledge of the network or communication topology. As computation proceeds, it acquires knowledge of the logical communication topology and is capable of handling dynamically changing multicast communication groups. With regard to communication overheads, the algorithm is optimal for the broadcast communication case. Its energy efficiency and low bandwidth requirement make it suitable for mobile computing systems. We present a strategy that employs the algorithm for causally ordered multicasting of messages in mobile computing environments.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2680.pdf (132.25 Ko) Télécharger le fichier

Dates and versions

inria-00074011 , version 1 (24-05-2006)


  • HAL Id : inria-00074011 , version 1


Ravi Prakash, Michel Raynal, Mukesh Singhal. An Efficient Causal Ordering Algorithm for Mobile Computing Environments. [Research Report] RR-2680, INRIA. 1995. ⟨inria-00074011⟩
131 View
216 Download


Gmail Facebook Twitter LinkedIn More