High performance reliable atomic group protocol

Weijia Jia; Jiannong Cao; Edgar Nett; Jorg Kaiser

High performance reliable atomic group protocol

Weijia Jia, Jiannong Cao, Edgar Nett, Jorg Kaiser

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

1 Citation (Scopus)

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.

Original language	English
Title of host publication	Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
Publisher	IEEE
Pages	378-385
Number of pages	8
Publication status	Published - 1 Jan 1996
Externally published	Yes
Event	Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) - Tokyo, Japan Duration: 3 Jun 1996 → 6 Jun 1996

Conference

Conference	Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96)
Country/Territory	Japan
City	Tokyo
Period	3/06/96 → 6/06/96

ASJC Scopus subject areas

Hardware and Architecture

Cite this

@inproceedings{830cd142fbed47c0b531914cf08a5f4d,

title = "High performance reliable atomic group protocol",

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.",

author = "Weijia Jia and Jiannong Cao and Edgar Nett and Jorg Kaiser",

year = "1996",

month = jan,

day = "1",

language = "English",

pages = "378--385",

booktitle = "Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS",

publisher = "IEEE",

address = "United States",

note = "Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) ; Conference date: 03-06-1996 Through 06-06-1996",

}

TY - GEN

T1 - High performance reliable atomic group protocol

AU - Jia, Weijia

AU - Cao, Jiannong

AU - Nett, Edgar

AU - Kaiser, Jorg

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029696494&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

SP - 378

EP - 385

BT - Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS

PB - IEEE

T2 - Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96)

Y2 - 3 June 1996 through 6 June 1996

ER -

High performance reliable atomic group protocol

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this