A distributed K-mutual exclusion algorithm /
algorithm at low and high rates of request for critical
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1994.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | algorithm at low and high rates of request for critical algorithm for distributed systems. The proposed algorithm algorithms. compared with other distributed K-mutual exclusion Critical Section. Nodes that do not possess a token, send a is free from deadlock and starvation. We analyze the nodes is organized as a logical forest, with the node nodes. Only nodes with a token are allowed to enter the possessing the token forming the root of a tree. For a receiving the token they enter the critical section. We show request for the token along the edges of the forest. On section execution. The simulation and implementation results show that the average number of messages and the average time system with K tokens, there are K such forests. The token that the proposed algorithm achieves K-mutual exclusion and This thesis presents a new token-based K-mutual exclusion to enter the critical section for our algorithm is small uses K tokens to achieve K-mutual exclusion. The system of N with its associated token-queue and tag is passed among the |
|---|---|
| Item Description: | "Major subject: Electrical Engineering". Vita. |
| Physical Description: | xi, 79 leaves : illustrations ; 28 cm. Also available online. |
| Bibliography: | Includes bibliographical references. |