Group k-mutual exclusion for distributed systems

研究成果: 書貢獻/報告類型會議論文篇章同行評審

摘要

In this paper, we propose an algorithm to solve the group k-mutual exclusion (Gk-ME) problem for distributed systems. The Gk-ME problem is concerned with controlling the concurrent accesses of some resource by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm utilizes a token circulation mechanism and does not require the nodes to have identifications. The delay and session switches of the proposed algorithm are Ω(n2) and Ω(n), respectively.

原文???core.languages.en_GB???
主出版物標題Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems
編輯T. Gonzalez
頁面140-145
頁數6
版本1
出版狀態已出版 - 2003
事件Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems - Marina del Rey, CA, United States
持續時間: 3 11月 20035 11月 2003

出版系列

名字Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
號碼1
15

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems
國家/地區United States
城市Marina del Rey, CA
期間3/11/035/11/03

指紋

深入研究「Group k-mutual exclusion for distributed systems」主題。共同形成了獨特的指紋。

引用此