Title | A high performance reliable atomic group protocol |
Creator | |
Date Issued | 1996 |
Conference Name | 1996 International Conference on Parallel and Distributed Systems (ICPADS) |
Source Publication | Proceedings of 1996 International Conference on Parallel and Distributed Systems
![]() |
ISBN | 0-8186-7267-6 |
Pages | 378-385 |
Conference Date | JUN 03-06, 1996 |
Conference Place | Tokyo, JAPAN |
Abstract | A novel and efficient group communication (multicast) protocol, based on a single logical-clock token ring approach, is described. The protocol is highly efficient and it guarantees total ordering and atomicity of multicast messages for asynchronous distributed systems. Unlike other logical token-ring algorithms, the protocol does not have a problem of token loss. The optimized fault-tolerant algorithms of the protocol can handle process failures and network partitioning. The experiment results of the implemented protocol in a local area network of workstations have demonstrated that its performance is better than any existing solutions in the same environment, especially, for achieving message total ordering and atomic (safe) delivery. |
Keyword | Atomic Multicast Communication Protocols Distributed Systems Logical Token Ring Fault- Tolerance |
DOI | 10.1109/ICPADS.1996.517585 |
Indexed By | CPCI-S |
Language | 英语English |
WOS Research Area | Computer Science |
WOS Subject | Computer Science, Theory & Methods |
WOS ID | WOS:A1996BF88U00048 |
Citation statistics | |
Document Type | Conference paper |
Identifier | http://repository.uic.edu.cn/handle/39GCC9TT/9449 |
Collection | Research outside affiliated institution |
Affiliation | 1.Department of Computer Science, City University of Hong Kong, Hong Kong, China 2.Schloss Birlinghoven, GMD, Saint Augustine, USA |
Recommended Citation GB/T 7714 | Jia, Weijia,Cao, Jiannong,Nett, Edgaret al. A high performance reliable atomic group protocol[C], 1996: 378-385. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment