Recognizing Complemental k-Coteries by Availability
碩士 === 東吳大學 === 資訊科學系 === 93 === k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The distributed k-mutual exclusion algorithm adopting k-coteries has the fault-tolerant capability when the system has node and/or communication link failures. However, the fault-tol...
Main Authors: | Po-Yao Wu, 吳柏嶢 |
---|---|
Other Authors: | Yu-Chen Kuo |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/e2v4a9 |
Similar Items
-
The Streatham Coterie
by: Bailey, Jane Edgecomb
Published: (1947) -
The Nondomination of Cohorts Coteries
by: Teng-Yi Chiu, et al.
Published: (2008) -
A General Cohorts Structure for the k-Coteries Construction
by: Hsueh-hua Liao, et al.
Published: (2004) -
A General Tree Structure for Constructing Nondominated k-coteries
by: Li-Ming Tai, et al.
Published: (2004) -
Optimizing the dominated k-coterie for the distributed mutual exclusion problem
by: Yi-Da Li, et al.