The combinatorial optimization problem of assigning the communicating processes of a parallel program onto a parallel machine so as to minimize its overall execution time is referred to as static mapping. This problem is NP-complete in general. We introduce a mapping algorithm based on the recursive bipartitioning of both the source process graph and the target architecture graph, whose divide and conquer and modular approach allows the handling of many topologies and bipartitioning heuristics. Mapping results on hypercube, binary de Buijn, and bidimensional mesh graphs are presented in order to illustrate this feature.
展开▼
机译:将并行程序的通信过程分配给并联机器的组合优化问题,以最小化其整体执行时间被称为静态映射。这个问题一般是np-cleante。我们介绍了一种基于源过程图和目标架构图的递归双分区的映射算法,其分割和征服和模块化方法允许处理许多拓扑和双分层启发式。提出了HyperCube,Binary de Buijn和Bidimensional网格图的映射结果,以说明此功能。
展开▼