随机放置宝藏的无坐标并行线性搜索
Parallel Linear Search with no Coordination for a Randomly Placed Treasure
摘要:
在STOC'16中,Fraigniaud等人考虑了在按重要性排序的许多盒子中找到隐藏在其中一个盒子中的宝藏的问题。也就是说,如果一个宝藏在一个更重要的盒子里,那么一个人会想更快地找到它。假设有许多搜索者,作者建议使用一种不需要搜索者之间协调的算法可能非常有益。实际上,除了节省对通信和协调机制的需要之外,这种算法还具有固有的鲁棒性。作者着手解决这个线性搜索问题的情况下,可数的盒子和对手放置的宝藏,并证明了最好的加速可能由$k$非协调搜索正是$\frac{k}{4}(1+1/k)^2$。特别地,这意味着渐进地,与完全协调的情况相比,加速差四倍。我们提出了一个重要的问题,其中的宝藏是均匀随机放置在一个有限的,大,盒子的数量。我们设计的非协调算法,实现了两个搜索器的$6/5$的加速,三个搜索器的$3/2$的加速,并在一般情况下,任何$k \geq 1$搜索器的$k(k+1)/(3k-1)$的加速。因此,当$k$增长到无穷大时,与完全协调的情况相比,加速接近三倍差。此外,这些界限在很强的意义上是紧的,因为没有用于$k$搜索器的非协调搜索算法可以实现更好的加速。我们还设计了非协调算法,只使用对数内存中的搜索域的大小,但渐近,实现最佳的速度。最后,我们注意到,我们所有的算法都非常简单,因此适用。
英文摘要:
In STOC'16, Fraigniaud et al. consider the problem of finding a treasure hidden in one of many boxes that are ordered by importance. That is, if a treasure is in a more important box, then one would like to find it faster. Assuming there are many searchers, the authors suggest that using an algorithm that requires no coordination between searchers can be highly beneficial. Indeed, besides saving the need for a communication and coordination mechanism, such algorithms enjoy inherent robustness. The authors proceed to solve this linear search problem in the case of countably many boxes and an adversary placed treasure, and prove that the best speed-up possible by $k$ non-coordinating searchers is precisely $\frac{k}{4}(1+1/k)^2$. In particular, this means that asymptotically, the speed-up is four times worse compared to the case of full coordination. We suggest an important variant of the problem, where the treasure is placed uniformly at random in one of a finite, large, number of boxes. We devise non-coordinating algorithms that achieve a speed-up of $6/5$ for two searchers, a speed-up of $3/2$ for three searchers, and in general, a speed-up of $k(k+1)/(3k-1)$ for any $k \geq 1$ searchers. Thus, as $k$ grows to infinity, the speed-up approaches three times worse compared to the case of full coordination. Moreover, these bounds are tight in a strong sense as no non-coordinating search algorithm for $k$ searchers can achieve better speed-ups. We also devise non-coordinating algorithms that use only logarithmic memory in the size of the search domain, and yet, asymptotically, achieve the optimal speed-up. Finally, we note that all our algorithms are extremely simple and hence applicable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。