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

具有同步共享内存的匿名处理器

Anonymous Processors with Synchronous Shared Memory

Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo

摘要:

我们考虑同步分布式系统中,匿名处理器通过共享读写变量进行通信。我们的目标是让所有处理器都为自己分配唯一的名称。我们认为这个问题的情况下确定的数量$n$是已知的或不,是否同时尝试写入不同的值到同一个存储单元是允许的或不,以及是否共享变量的数量是一个常数独立的$n$或它是无界的。对于已知的$n$,我们给拉斯维加斯算法,在最佳的预期时间内运行,由可用的共享内存的量确定,并使用最佳的$O(n\log n)$预期数量的随机位。对于未知的$n$,我们给出蒙特卡罗算法,产生正确的输出时,终止概率是$1-n^{-Ω(1)}$,这是最好的可能时,几乎肯定终止,并使用$O(n\log n)$随机位。

英文摘要:

We consider synchronous distributed systems in which anonymous processors communicate by shared read-write variables. The goal is to have all the processors assign unique names to themselves. We consider the instances of this problem determined by whether the number $n$ is known or not, and whether concurrently attempting to write distinct values into the same memory cell is allowed or not, and whether the number of shared variables is a constant independent of $n$ or it is unbounded. For known $n$, we give Las Vegas algorithms that operate in the optimum expected time, as determined by the amount of available shared memory, and use the optimum $O(n\log n)$ expected number of random bits. For unknown $n$, we give Monte Carlo algorithms that produce correct output upon termination with probabilities that are $1-n^{-Ω(1)}$, which is best possible when terminating almost surely and using $O(n\log n)$ random bits.

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

↑