Self-Stabilizing Algorithms under Various Composite Atomicity Computational Models
博士 === 元智大學 === 資訊工程學系 === 98 === A distributed system consists of a set of loosely connected processors that do not share a common or global memory. The main restriction of the distributed system is that each processor in the system can only access the data of its neig hbors. Since a distributed al...
Main Authors: | Cheng-Pin Wang, 王承斌 |
---|---|
Other Authors: | Tetz C. Huang |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/26458778189583627316 |
Similar Items
-
Self-Stabilizing Algorithms under Various Composite Atomicity Computational Models
by: Cheng-Pin Wang, et al.
Published: (2010) -
Self-Stabilizing Algorithms Assuming Separate Read/Write Atomicity
by: Nathan Mou, et al.
Published: (2005) -
Self-stabilizing Algorithm on Linear Array
by: Cheng-Kai Lin, et al.
Published: (2006) -
Self-Stabilizing Algorithms under the Distributed Daemon Model
by: Ming-Yi Chiu, et al.
Published: (2010) -
A Self-Stabilizing Mutual Exclusion Algorithm Assuming Only Read / Write Atomicity
by: Chin-Hui Tsou, et al.
Published: (2003)