DocumentCode
2674030
Title
An algorithm for guaranteeing synchronous ordering of messages
Author
Murty, Venkataesh V. ; Garg, Vijay K.
Author_Institution
Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA
fYear
1995
fDate
25-27 Apr 1995
Firstpage
208
Lastpage
214
Abstract
The paper studies the characteristics of synchronous ordering of messages. Synchronous ordering of messages defines synchronous communication based on the causality rather than time. We present the sufficient conditions, based on the causality relations, for any algorithm to provide synchronous ordering. We also propose an algorithm using acknowledgment messages to implement the sufficient conditions. The algorithm is deadlock-free, and provides a higher degree of concurrency than existing algorithms
Keywords
message passing; parallel algorithms; acknowledgment messages; algorithm; causality relations; concurrency; deadlock-free algorithm; guaranteed synchronous message ordering; synchronous communication; Algorithm design and analysis; Concurrent computing; Control systems; Distributed algorithms; Distributed computing; Laboratories; Message passing; Sufficient conditions; Synchronous motors; System recovery; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Autonomous Decentralized Systems, 1995. Proceedings. ISADS 95., Second International Symposium on
Conference_Location
Phoenix, AZ
Print_ISBN
0-8186-7087-8
Type
conf
DOI
10.1109/ISADS.1995.398974
Filename
398974
Link To Document