等待-自由与建议
Wait-Freedom with Advice
摘要:
我们激励和提出了一种新的思路故障检测器,使我们能够定义,相当令人惊讶的是,这意味着解决分布式任务\emph{wait-free} \emph{using a failure detector}。在我们的模型中,该系统是由\emph{computation}过程,获得输入,并假定输出在有限数量的步骤和\emph{synchronization}过程,是受故障,可以查询故障检测器。我们假设,在\emph{correct}同步过程采取足够多的步骤的条件下,它们为计算过程提供了足够的\emph{advice}来解决给定的任务等待自由:每个计算过程输出有限数量的自己的步骤,而不管其他计算过程的行为。因此,每个任务的特点是\emph{weakest}故障检测器,允许解决它,我们表明,每一个这样的故障检测器捕获一种形式的集协议。然后,我们获得了一个完整的分类任务,包括那些逃避可理解的特征,到目前为止,如重命名或弱对称性破缺。
英文摘要:
We motivate and propose a new way of thinking about failure detectors which allows us to define, quite surprisingly, what it means to solve a distributed task \emph{wait-free} \emph{using a failure detector}. In our model, the system is composed of \emph{computation} processes that obtain inputs and are supposed to output in a finite number of steps and \emph{synchronization} processes that are subject to failures and can query a failure detector. We assume that, under the condition that \emph{correct} synchronization processes take sufficiently many steps, they provide the computation processes with enough \emph{advice} to solve the given task wait-free: every computation process outputs in a finite number of its own steps, regardless of the behavior of other computation processes. Every task can thus be characterized by the \emph{weakest} failure detector that allows for solving it, and we show that every such failure detector captures a form of set agreement. We then obtain a complete classification of tasks, including ones that evaded comprehensible characterization so far, such as renaming or weak symmetry breaking.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。