Group mutual exclusion is a natural problem, formulated by Joung in 1998, that generalises the classical mutual exclusion problem. In group mutual exclusion a process requests a "session" before entering its critical section; processes are allowed to be in the critical section simultaneously provided they have requested the same session. To rule out solutions that cause processes to delay each other even when they all request the same session, group mutual exclusion algorithms must satisfy a property called "concurrent entering". Joung stated this property only informally. Keane and Moir later gave a precise statement of this property and devised a simple group mutual exclusion algorithm that satisfies it.
We argue that Keane and Moir's formulation is not quite as strong as the property Joung described informally. We propose a new precise and simple formulation of concurrent entering that is stronger than Keane and Moir's and properly captures Joung's intention. Keane and Moir's algorithmdoes not satisfy this stronger property, while Joung's original algorithm does. We present another algorithm that satisfies this stronger property and has some advantages over Joung's.
我们认为,基恩和莫尔的表述不如Joung非正式描述的财产那么强大。我们提出了一种新的精确且简单的并发输入方式,该方式要比Keane和Moir的输入要强,并能恰当地体现Joung的意图。 Keane和Moir的算法不满足此更强的属性,而Joung的原始算法却不满足。我们提出了另一种算法,该算法可以满足此更强的属性,并且比Joung的算法具有一些优势。 P>
机译:正确的互斥算法何时可以保证互斥?
机译:越来越多的排斥:保利排斥原理与束缚费米子的能量守恒互斥
机译:双层集分割模型基于相互排除的相邻地区应用于脑MR图像
机译:关于组相互排除的说明
机译:用于崩溃重启共享存储系统的可恢复的互斥算法
机译:贝甲酰胺的甲苯甲蛋白在Hylocereus中的报告并不是很好地证明并不是反驳互斥范式的强烈基础
机译:具有覆盖范围的人口方案的自稳定互斥和群体互斥