|
|||||
|
|
Hu's precedence tree scheduling algorithm: A simple proof |
|
| Authors: | James A M McHugh |
| Institution: | Department of Computer and Information Science, New Jersey Institute of Technology, Newark, New Jersey 07102 |
| Abstract: | This article presents a simple proof of Hu's algorithm for scheduling in minimum time a set of tasks constrained by precedence tree constraints, each task requiring a unit time to complete, and where m processors are available. |
| Keywords: | |