针对成本约束有向无环图DAG(directed acyclic graph)表示的网格工作流完工时间最小化问题,提出两个基于优先级规则的迭代启发算法.算法利用并行活动特征定义正向分层和逆向分层两个概念,将其分别引入最大收益规则MP(maximum profit),得到正分层最大收益规则MPTL(maximum profit with top level)和逆分层最大收益规则MPBL(maximum profit with bottom level).两规则每次迭代尽量以完工时间的最小增加换取总费用的最大降低,逐步将分层初始解构造为满足成本约束的可行解.模拟结果表明,两规则在获得较少迭代次数和运行时间的同时,能显著改进MP规则的平均性能,且MPBL优于MPTL.
Message passing Interface (MPI) is a kind of network distributed parallel computing environments whichhave been widely used on super parallel computers and networks. First,this paper describes the rssearch backgrounda...
详细信息
Message passing Interface (MPI) is a kind of network distributed parallel computing environments whichhave been widely used on super parallel computers and networks. First,this paper describes the rssearch backgroundand developing status of MPI. Then on this basis it will study and analyze the functions and features of MPI ,summa-rize its insufficiencies and gives some suggestions for modification.
暂无评论