检索结果-内蒙古大学图书馆

quorum-based group mutual exclusion algorithm for a distributed system with dynamic group set

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007年第10期18卷 1345-1360页

作者： Atreya, Ranganath Mittal, Neeraj Peri, Sathya Univ Texas Dept Comp Sci Richardson TX 75083 USA

The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type ( or a group) with each critical section. In this problem, processes requesting critical sections of the same type can execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their critical sections in a mutually exclusive manner. We present a distributed algorithm for solving the group mutual exclusion problem based on the notion of surrogate-quorum. Intuitively, our algorithm uses the quorum that has been successfully locked by a request as a surrogate to service other compatible requests for the same type of critical section. Unlike the existing quorum-based algorithms for group mutual exclusion, our algorithm achieves a low message complexity of O(q) and a low ( amortized) bit-message complexity of O(bqr), where q is the maximum size of a quorum, b is the maximum number of processes from which a node can receive critical section requests, and r is the maximum size of a request while maintaining both synchronization delay and waiting time at two message hops. As opposed to some existing quorum-based algorithms, our algorithm can adapt without performance penalties to dynamic changes in the set of groups. Our simulation results indicate that our algorithm outperforms the existing quorum-based algorithms for group mutual exclusion by as much as 45 percent in some cases. We also discuss how our algorithm can be extended to satisfy certain desirable properties such as concurrent entry and unnecessary blocking freedom.

关键词： message-passing system resource management mutual exclusion group mutual exclusion quorum-based algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Fuzzified quorum-based Wakeup Scheduling In Heterogeneous Wireless Sensor Network

On the Fuzzified Quorum-based Wakeup Scheduling In Heterogen...

引用

IEEE 17th International Symposium on Consumer Electronics (ISCE)

作者： Own, Chung-Ming Wei, Chiu-Yi St Johns Univ Dept Comp & Commun Engn New Taipei City Taiwan

ISBN: (纸本)9781467361996

In this paper, we propose a power-saving protocol, the fuzzified quorum-based wakeup scheduling method. In the 802.11 wireless sensor network, the hosts in the power saving mode must have to wake-up every beacon interval to check if they have to remain awake in the remaining of the beacon interval. In our study, the authors proposed the adaptive grid-quorum method to involve the power saving idea in the event-driven wireless sensor network. With the fuzzified balancing algorithm proposed, the system not only can solve the mentioned network problem, but also can remain the efficiency enhancement and energy-saving issues at the same time.

关键词： quorum-based algorithm fuzzification heterogeneous wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：