动态、匿名、有界内存消息传递系统中的局部互斥
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
AI总结：
针对动态匿名消息传递系统，提出一种局部互斥算法，保证互斥和无锁自由，每节点内存O(Δ)，消息大小Θ(1)。
摘要：
互斥是分布式计算中的一个经典问题，它为可能需要访问相同共享资源的并发操作执行提供隔离。受关于弱能力实体且连接随时间变化的分布式系统算法研究的启发，我们解决了局部互斥问题，该问题要求每个节点为自己及其“持久”邻居的最大子集获取排他锁，这些邻居在锁请求的时间间隔内保持与它连接。使用已建立的时变图模型来捕捉对抗性拓扑变化，我们提出并严格分析了一种针对匿名节点并通过异步消息传递通信的局部互斥算法。该算法在半同步和异步并发下满足互斥（锁集不相交）和无锁自由（最终以概率1成功）。它需要每节点$\mathcal{O}(Δ)$内存和大小为$Θ(1)$的消息，其中$Δ$是每个节点的最大连接数。最后，我们描述了该算法如何实现种群协议假设的成对交互以及典型变形虫模型假设的并发控制操作，展示了它在被动和主动动态分布式系统中的实用性。
英文摘要：
Mutual exclusion is a classical problem in distributed computing that provides isolation among concurrent action executions that may require access to the same shared resources. Inspired by algorithmic research on distributed systems of weakly capable entities whose connections change over time, we address the local mutual exclusion problem that tasks each node with acquiring exclusive locks for itself and the maximal subset of its "persistent" neighbors that remain connected to it over the time interval of the lock request. Using the established time-varying graphs model to capture adversarial topological changes, we propose and rigorously analyze a local mutual exclusion algorithm for nodes that are anonymous and communicate via asynchronous message passing. The algorithm satisfies mutual exclusion (non-intersecting lock sets) and lockout freedom (eventual success with probability 1) under both semi-synchronous and asynchronous concurrency. It requires $\mathcal{O}(Δ)$ memory per node and messages of size $Θ(1)$, where $Δ$ is the maximum number of connections per node. We conclude by describing how our algorithm can implement the pairwise interactions assumed by population protocols and the concurrency control operations assumed by the canonical amoebot model, demonstrating its utility in both passively and actively dynamic distributed systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
