A Study of Mutual Exclusion Problems in Rotator Graphs
碩士 === 國立臺北商業技術學院 === 商學研究所 === 95 === Mutual exclusion (ME) is a basic and also an important issue in distributed systems. This paper provides algorithms to solve ME problem in rotator graphs. A rotator graph, which has many good properties such as low diameter, recursive construction and unique s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/18669861965673568996 |