期刊
PARALLEL COMPUTING
卷 26, 期 12, 页码 1519-1534出版社
ELSEVIER
DOI: 10.1016/S0167-8191(00)00048-X
关键词
graph partitioning; hypergraph partitioning; parallel computing
Calculations can naturally be described as graphs in which vertices represent computation and edges reflect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives and discuss their relative merits. (C) 2000 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据