A Unified Method of Mutual Exclusion in Parallel and Distributed Systems
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes a mutual exclusion method that is unified for the parallel and distributed systems. The method partially serializes requests into partial queues of requests, which are next totally serialized into a main queue. A request in the main queue is authorized to enter the critical section (CS) when the request receives the privilege token from the previous request in the queue. In the distributed system of N sites that each is a parallel system, mutual exclusion is performed by cooperation of two algorithms based on the same method. The algorithm for the distributed system works on a logical network (that is a directed tree) of S (≦N) sites. The algorithm for each site produces a local-main queue of requests. The chunk of requests in the local queue is concatenated at a time to the partial queue of the distributed system. Then the cost of mutual exclusion-the number of intersite messages required per CS entry-is reduced to O(1)(between 0 and 3).
- 社団法人電子情報通信学会の論文
- 1996-04-25
著者
-
Takesue Masaru
Department Electronics Amp Information Engineering Hosei University
-
Takesue Masaru
Department Of Electronics And Information Engn. Hosei University
関連論文
- Algorithm Transformation for Cube-Type Networks (Special Issue on Architectures, Algorithms and Networks for Massively Parallel Computing)
- A Unified Method of Mutual Exclusion in Parallel and Distributed Systems