处理机阿基米德环中的分布式选举
Distributed elections in an Archimedean ring of processors
摘要：
在实际的物理分布的计算机系统中，无限的并行性是不能容忍的。这样的系统，同步或不同步，使用时钟和超时。因此，系统中经过的绝对时间的大小需要满足阿基米德公理。在这种限制下，逻辑上的时间无关的解决方案，可以推导出，但更好的（消息传递的数量），否则是可能的。在没有中央控制的异步处理器的环中的选举中，由各个处理器使用时钟允许确定性的解决方案，该解决方案只需要线性数量的消息传递。为了获得结果，必须假设时钟测量其时间单位的有限比例绝对时间跨度，即环网络中经过的时间的大小满足阿基米德公理。因此，一些基本的微妙之处与分布式计算突出。例如，所需消息传递次数的已知非线性下限被破解。对于同步的情况下，在必要的假设举行了fortiori，该方法是-渐近-最有效的一个，但最佳的数量级。确定性算法是渐近最优的位复杂度，并且，在同步的情况下，也产生一个最佳的方法来确定环的大小。这些结果改进了已有的结果。
英文摘要：
Unlimited asynchronism is intolerable in real physically distributed computer systems. Such systems, synchronous or not, use clocks and timeouts. Therefore the magnitudes of elapsed absolute time in the system need to satisfy the axiom of Archimedes. Under this restriction of asynchronicity logically time-independent solutions can be derived which are nonetheless better (in number of message passes) than is possible otherwise. The use of clocks by the individual processors, in elections in a ring of asynchronous processors without central control, allows a deterministic solution which requires but a linear number of message passes. To obtain the result it has to be assumed that the clocks measure finitely proportional absolute time-spans for their time units, that is, the magnitudes of elapsed time in the ring network satisfy the axiom of Archimedes. As a result, some basic subtilities associated with distributed computations are highlighted. For instance, the known nonlinear lower bound on the required number of message passes is cracked. For the synchronous case, in which the necessary assumptions hold a fortiori, the method is -asymptotically- the most efficient one yet, and of optimal order of magnitude. The deterministic algorithm is of -asymptotically- optimal bit complexity, and, in the synchronous case, also yields an optimal method to determine the ring size. All of these results improve the known ones.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
