This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Preemptive Scheduling on Two-Processor Systems
November 1969 (vol. 18 no. 11)
pp. 1014-1020
ASCII Text
x 
 
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.
 
 
BibTex
x
 
@article{ 10.1109/T-C.1969.222573,
author = {R.R. Muntz and E.G. Coffman},
title = {Optimal Preemptive Scheduling on Two-Processor Systems},
journal ={IEEE Transactions on Computers},
volume = {18},
number = {11},
issn = {0018-9340},
year = {1969},
pages = {1014-1020},
doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1969.222573},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Optimal Preemptive Scheduling on Two-Processor Systems
IS - 11
SN - 0018-9340
SP1014
EP1020
EPD - 1014-1020
A1 - R.R. Muntz,
A1 - E.G. Coffman,
PY - 1969
KW - Computation graphs
KW - multiprocessing
KW - parallel processing
KW - preemptive scheduling
KW - static scheduling.
VL - 18
JA - IEEE Transactions on Computers
ER -
 
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, Nov. 1969, doi:10.1109/T-C.1969.222573
Usage of this product signifies your acceptance of the Terms of Use.