Abstract
We present algorithms for scheduling a system of n unit-length tasks on m identical parallel machines for the case where the precedence constraints are a collection of outtrees. The given algorithms produce an optimal height-priority schedule on an exclusive read, exclusive write (EREW) P-RAM. The complexity of these algorithms is either O((logn)**2) parallel time using O(n) processors, or O(logn) parallel time and O(n**2) processors. As a complementary result we prove that finding a height-priority-schedule for the same problem is logspace complete for P, if the number of available machines is allowed to increase with time.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | North-Holland |
| Pages | 91-102 |
| Number of pages | 12 |
| ISBN (Print) | 0444876626 |
| State | Published - 1985 |