Issue No. 11 - November (1969 vol. 18)
R.R. Muntz , IEEE
One of the important potentials of multiprocessor systems is the ability to speed the completion of a computation by concurrently processing independent portions of the job. In this paper we consider the static scheduling of computations for a system containing two indentical processors. The object is to complete the computation in the minimum amount of time. A computation is assumed to be specified as a partially ordered set of tasks and the execution time for each task. A solution for the two-machine case with preemptive scheduling is presented.
Computation graphs, multiprocessing, parallel processing, preemptive scheduling, static scheduling.
R. Muntz and E. Coffman, "Optimal Preemptive Scheduling on Two-Processor Systems," in IEEE Transactions on Computers, vol. 18, no. , pp. 1014-1020, 1969.