A comparison of list schedules for paral
β
Adam, Thomas L.; Chandy, K. M.; Dickson, J. R.
π
Article
π
1974
π
Association for Computing Machinery
π
English
β 604 KB
The problem of scheduling two or more processors to minimize the execution time of a program which consists of a set of partially ordered tasks is studied. Cases where task execution times are deterministic and others in which execution times are random variables are analyzed. It is shown that diffe