Static Scheduling of Conditional Parallel Tasks

One of critical issues affecting parallel system performance is the scheduling of parallel tasks onto available target processors. A number of algorithms and software tools have been presented to deal with the task scheduling problem in parallel processing. This paper studies the static scheduling of general types of applications. We focus on "conditional task scheduling", in which the task model may vary between each program execution, due to conditional branching within tasks. A parallel programming environment, called ATME, is presented to practically tackle this complicated conditional scheduling problem. Keywords: static scheduling, conditional task scheduling, task model, model estimation, multiprocessing, parallel programming environment. 1 Introduction Parallel programming is more complex than its sequential programming counterpart. Issues to be considered include task partition, task communication and synchronization, task scheduling and tuning. The performance of the parall..