Authors consider a set of n tasks with a tree precedence relation and execution time of 1 or 2 units, and present an O(n log n) time algorithm to find a minimum length schedule of these tasks on two identical processors. Possible generalizations, as well as the relations between this algorithm and other scheduling algorithms, are described.
|Original language||English (US)|
|Number of pages||11|
|State||Published - Jan 1 1981|
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Hardware and Architecture
- Computer Networks and Communications