arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.04819cs.DC
收藏

快速和可扩展的组互斥

Fast and Scalable Group Mutual Exclusion

Shreyas Gokhale, Neeraj Mittal

摘要:

组互斥问题是经典互斥问题的推广,其中每个临界区都与一个类型或会话相关联。属于同一会话的临界区可以并发执行,而属于不同会话的临界区必须串行执行。众所周知的读写互斥问题是群互斥问题的一个特例。在这项工作中,我们提出了一种新的GME算法的异步共享内存系统,除了满足锁定自由,有界退出和并发进入属性,具有O(1)的步骤复杂性时,系统不包含冲突的请求,以及O(1)的空间复杂性每个GME对象时,系统包含足够数量的GME对象。据我们所知,没有现有的GME算法具有O(1)步并发进入的复杂度。此外,大多数现有的GME算法具有每个GME对象的Ω(n)空间复杂度,其中n表示系统中的进程数量。我们还表明,我们的GME算法可以很容易地修改使用有界空间变量。

英文摘要:

The group mutual exclusion (GME) problem is a generalization of the classical mutual exclusion problem in which every critical section is associated with a type or session. Critical sections belonging to the same session can execute concurrently, whereas critical sections belonging to different sessions must be executed serially. The well-known read-write mutual exclusion problem is a special case of the group mutual exclusion problem. In this work, we present a novel GME algorithm for an asynchronous shared-memory system that, in addition to satisfying lockout freedom, bounded exit and concurrent entering properties, has O(1) step-complexity when the system contains no conflicting requests as well as O(1) space-complexity per GME object when the system contains sufficient number of GME objects. To the best of our knowledge, no existing GME algorithm has O(1) step-complexity for concurrent entering. Moreover, most existing GME algorithms have Ω(n) space complexity per GME object, where n denotes the number of processes in the system. We also show that our GME algorithm can be easily modified to use bounded space variables.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑