A Prioritized h-out of-k Mutual Exclusion Algorithm with Maximum Degree of Concurrency for Mobile Ad Hoc Networks and Distributed Systems

研究成果: 會議貢獻類型會議論文同行評審

6 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose a distributed prioritized h-out of-k mutual exclusion algorithm for a mobile ad hoc network (MANET) with real-time or prioritized applications. The h-out of-k mutual exclusion problem is a generalization of the k-mutual exclusion problem and the mutual exclusion problem. The proposed algorithm is sensitive to link forming and link breaking and thus is suitable for a MANET. If we do not consider the link breaking and forming, the proposed algorithm can also be applied to distributed systems consisting of stationary nodes that communicate with each other by exchanging messages over wired links. For non-real-time applications, we may associate the priority with the number of requested resources to achieve the maximum degree of concurrency.

原文???core.languages.en_GB???
頁面329-334
頁數6
出版狀態已出版 - 2003
事件Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings - Chengdu, China
持續時間: 27 8月 200329 8月 2003

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

???event.eventtypes.event.conference???Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings
國家/地區China
城市Chengdu
期間27/08/0329/08/03

指紋

深入研究「A Prioritized h-out of-k Mutual Exclusion Algorithm with Maximum Degree of Concurrency for Mobile Ad Hoc Networks and Distributed Systems」主題。共同形成了獨特的指紋。

引用此