摘要
并行程序中的不确定性给任务调度带来了困难，采用动态调度的方法有时开销很大。本文以并行程序设计中的条件分支为例，介绍了如何利用分支图和前趋图来描述并行程序，并通过对这两种任务图的归约把不确定性转化为确定性，然后根据确定性任务图的调度技术。
The nondeterminism in parallel programs brings many difficulties to the task scheduling in which the dynamic method has high overhead. Taking condition branches in parallel programming as an example. this paper describes how to model parallel programs with the branch graph and the predence graph, then propses a method of transforming nondeterminism to determinism by the reducing of these two task graphs and constructing a unified scheduling schema according to the thchnology of scheduling determintic task graphs.
出处
《小型微型计算机系统》
EI
CSCD
北大核心
1997年第1期6-12,共7页
Journal of Chinese Computer Systems
