The problem of scheduling task graphs with conditional branching is considered one of the most difficult problems in scheduling parallel programs on multiprocessor computers. The major problem in having branches in task graphs is the non-determinism, since the direction of a branch may be unknown until the program is midway in execution. The authors overcome the problem of non-determinism by proposing a new probabilistic model that distinguishes between branch and precedence relations in parallel programs. They present two different approaches for solving this problem. In the first approach, a schedule is obtained by merging the schedules generated for several possible task graphs. The second technique generates a schedule for a single deterministic task graph that approximates all possible task graphs.
|Original language||English (US)|
|Number of pages||10|
|Journal||Proceedings of the Annual Hawaii International Conference on System Sciences|
|State||Published - Jan 1 1991|
|Event||24th Annual Hawaii International Conference on System Sciences, HICSS 1991 - Kauai, United States|
Duration: Jan 8 1991 → Jan 11 1991
ASJC Scopus subject areas