DocumentCode
1393562
Title
Cohorts structures for fault-tolerant k entries to a critical section
Author
Jiang, Jehn-Ruey ; Huang, Shing-Tsaan ; Kuo, Yu-Chen
Author_Institution
Dept. of Manage. Inf. Syst., Chung Yuan Christian Univ., Chung Li, Taiwan
Volume
46
Issue
2
fYear
1997
fDate
2/1/1997 12:00:00 AM
Firstpage
222
Lastpage
228
Abstract
We propose a structure named Cohorts to solve the problem of the access control of multiple entries to a critical section. Our solution is formalized as forming quorums in a k-coterie. It is resilient to node failures and/or network partitioning, invokes constant expected message cost and has comparably high availability
Keywords
authorisation; fault tolerant computing; Cohorts structures; critical section; expected message cost; fault-tolerant k entries; k-coterie; network partitioning; quorums; Access control; Availability; Broadcasting; Costs; Distributed algorithms; Fault tolerance; Fault tolerant systems; Intelligent networks; Partitioning algorithms; Resilience;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.565603
Filename
565603
Link To Document