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

在MapReduce中实现高效的电路仿真

Efficient Circuit Simulation in MapReduce

Fabian Frei, Koichi Wada

摘要:

MapReduce框架已经牢固地确立了自己作为最广泛使用的并行计算平台之一,用于处理万亿字节和千万亿字节规模的大数据。然而,从理论的角度来探讨它是出了名的困难。在Goodrich et al.的早期努力,明确拥护的目标,把MapReduce框架的立足点等于长期建立的模型,如PRAM,我们调查的MapReduce算法的计算能力相比,通常用于并行计算的组合布尔电路的明显的复杂性问题。依靠Karloff等人十年前引入的标准MapReduce模型,我们开发了一种复杂的模拟技术,以表明NC中的任何问题(即,由多项式大小和输入大小的深度多对数的布尔电路的对数空间一致族解决的问题)可以通过O(T(n)/logn)轮的MapReduce计算来解决,其中n是输入大小,T(n)是见证电路族的深度。因此,我们能够通过证明NC^(i+1)对于所有自然i(包括0)包含在DMRC^i中,将标准的、统一的NC层次模型并行计算与确定性的MapReduce层次DMRC紧密联系起来。这一结果除具有理论意义外,还具有重要的应用价值.特别是,我们展示了NC^1中的所有问题-许多实际相关的问题,如整数乘法和除法,奇偶校验函数,以及识别括号的平衡字符串-如何在确定性MapReduce轮数不变的情况下解决它们。

英文摘要:

The MapReduce framework has firmly established itself as one of the most widely used parallel computing platforms for processing big data on tera- and peta-byte scale. Approaching it from a theoretical standpoint has proved to be notoriously difficult, however. In continuation of Goodrich et al.'s early efforts, explicitly espousing the goal of putting the MapReduce framework on footing equal to that of long-established models such as the PRAM, we investigate the obvious complexity question of how the computational power of MapReduce algorithms compares to that of combinational Boolean circuits commonly used for parallel computations. Relying on the standard MapReduce model introduced by Karloff et al. a decade ago, we develop an intricate simulation technique to show that any problem in NC (i.e., a problem solved by a logspace-uniform family of Boolean circuits of polynomial size and a depth polylogarithmic in the input size) can be solved by a MapReduce computation in O(T(n)/ log n) rounds, where n is the input size and T(n) is the depth of the witnessing circuit family. Thus, we are able to closely relate the standard, uniform NC hierarchy modeling parallel computations to the deterministic MapReduce hierarchy DMRC by proving that NC^(i+1) is contained in DMRC^i for all natural i, including 0. Besides the theoretical significance, this result that has important applied aspects as well. In particular, we show for all problems in NC^1---many practically relevant ones such as integer multiplication and division, the parity function, and recognizing balanced strings of parentheses being among these---how to solve them in a constant number of deterministic MapReduce rounds.

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

↑