The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1969 vol.18)
pp: 1014-1020
R.R. Muntz , IEEE
ABSTRACT
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.
INDEX TERMS
Computation graphs, multiprocessing, parallel processing, preemptive scheduling, static scheduling.
CITATION
R.R. Muntz, E.G. Coffman, "Optimal Preemptive Scheduling on Two-Processor Systems", IEEE Transactions on Computers, vol.18, no. 11, pp. 1014-1020, November 1969, doi:10.1109/T-C.1969.222573
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool