网络内计算的函数最优嵌入:复杂性分析与算法
Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms
摘要:
我们考虑最优分布式计算的一个给定的函数的分布式数据。输入(数据)节点和接收函数的汇聚节点形成由无向加权网络图描述的连通网络。计算给定函数的算法由加权有向无环图描述,称为计算图。嵌入定义了在接收端获得函数的计算通信序列。寻求两种最优嵌入,即(1)最小化在接收端获得函数的延迟,(2)最小化函数的一次计算的代价。这种抽象的动机是三个应用-在传感器网络的网络计算,操作员在分布式数据库的位置,和模块放置在分布式计算。我们首先表明,获得最小延迟和最小成本嵌入都是NP完全问题,成本最小化实际上是MAX SNP困难的。接下来,我们考虑特定形式的计算图,其中多项式时间的解决方案是可能的。当计算图是树时,描述了一种获得最小延迟嵌入的多项式时间算法。接下来,对于函数由分层图描述的情况,我们描述了在多项式时间内获得最小成本嵌入的算法。该算法也可用于获得延迟最小化的近似。然后,我们考虑有界树宽计算图,并给出了一个算法,以获得最小成本嵌入在多项式时间。
英文摘要:
We consider optimal distributed computation of a given function of distributed data. The input (data) nodes and the sink node that receives the function form a connected network that is described by an undirected weighted network graph. The algorithm to compute the given function is described by a weighted directed acyclic graph and is called the computation graph. An embedding defines the computation communication sequence that obtains the function at the sink. Two kinds of optimal embeddings are sought, the embedding that---(1)~minimizes delay in obtaining function at sink, and (2)~minimizes cost of one instance of computation of function. This abstraction is motivated by three applications---in-network computation over sensor networks, operator placement in distributed databases, and module placement in distributed computing. We first show that obtaining minimum-delay and minimum-cost embeddings are both NP-complete problems and that cost minimization is actually MAX SNP-hard. Next, we consider specific forms of the computation graph for which polynomial time solutions are possible. When the computation graph is a tree, a polynomial time algorithm to obtain the minimum delay embedding is described. Next, for the case when the function is described by a layered graph we describe an algorithm that obtains the minimum cost embedding in polynomial time. This algorithm can also be used to obtain an approximation for delay minimization. We then consider bounded treewidth computation graphs and give an algorithm to obtain the minimum cost embedding in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。