Optimal Preemptive Scheduling on Two-Processor Systems
- 1 November 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-18 (11), 1014-1020
- https://doi.org/10.1109/t-c.1969.222573
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.Keywords
This publication has 5 references indexed in Scilit:
- Production and Stabilization of Real-Time Task SchedulesJournal of the ACM, 1967
- Scheduling Independent Tasks on Parallel ProcessorsManagement Science, 1966
- Generalized multiprocessing and multiprogramming systemsPublished by Association for Computing Machinery (ACM) ,1963
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959