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

在有限的工作和沟通中完成所有工作

Doing-it-All with Bounded Work and Communication

Bogdan S. Chlebus, Leszek Gąsieniec, Dariusz R. Kowalski, Alexander A. Schwarzmann

摘要:

我们认为做所有的问题,其中$p$合作的处理器需要完成$t$类似的和独立的任务,在对抗设置。在这里,我们处理一个同步消息传递系统的处理器,受到崩溃故障。在这种情况下,算法的效率是根据工作复杂性(也称为总可用处理器步骤)和通信复杂性(点对点消息的总数)来衡量的。当工作和沟通被认为是可比较的资源时,那么整体效率就可以用工作+沟通的努力来表达。我们开发和分析了一个建设性的算法,有工作$O( t + p \log p\, (\sqrt{p\log p}+\sqrt{t\log t}\, ) )$和一个非建设性的算法,有工作$O(t +p \log^2 p)$。后一个结果接近功的下限$Ω(t + p \log p/ \log \log p)$。对于某个正的常数$c < 1$,当崩溃的数量由$c\,p$限制在上面时,这些算法中的每一个的努力与其工作成比例。我们还提出了一个非建设性的算法,有努力$O(t + p ^{1.77})$。

英文摘要:

We consider the Do-All problem, where $p$ cooperating processors need to complete $t$ similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of work complexity (also known as total available processor steps) and communication complexity (total number of point-to-point messages). When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work $O( t + p \log p\, (\sqrt{p\log p}+\sqrt{t\log t}\, ) )$ and a nonconstructive algorithm that has work $O(t +p \log^2 p)$. The latter result is close to the lower bound $Ω(t + p \log p/ \log \log p)$ on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by $c\,p$, for some positive constant $c < 1$. We also present a nonconstructive algorithm that has effort $O(t + p ^{1.77})$.

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

↑