On Quorum Systems for Group Resources with Bounded Capacity
On Quorum Systems for Group Resources with Bounded Capacity
复制标题
有限容量组资源的仲裁系统
DOI：
10.1007/978-3-540-30186-8_7
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Yuh
中科院分区：
文献类型：
--
作者：
Yuh
我们提出了一个称为（m,1,k）的资源分配问题来模拟有界容量的群体互斥。具体来说，这个问题涉及进程组之间的资源调度。同一组的进程最多可以同时使用该资源，但不同组的进程不能同时使用该资源。当其与群体规模相等时，问题就变成了群体互斥。然后，我们将互斥仲裁系统推广到该问题。我们证明了（m,1,k）资源分配的群体系统的研究与组合学和有限射影几何中的一些经典问题密切相关。通过应用这些结果，我们能够获得一些最优/接近最优的仲裁系统。
We present a problem called (m,1,k)-resource allocationto model group mutual exclusion with bounded capacity. Specifically, the problem concerns the scheduling of a resource amongmgroups of processes. The resource can be used by at mostkprocesses of the same group at a time, but no two processes of different groups can use the resource simultaneously. The problem reduces to group mutual exclusion whenkis equal to the group size. We then generalize quorum systems for mutual exclusion to the problem. We show that the study of quorum systems for (m,1,k)-resource allocation is closely related to some classical problems in combinatorics and in finite projective geometries. By applying the results there, we are able to obtain some optimal/near-optimal quorum systems.