Scheduling jobs on a tree-connected processor system

A tree-connected processor system (TPS) is one where m (>or=1) processors are connected to constitute a rooted tree. The authors study the problem of finding a feasible schedule for a TPS for n jobs with release times and deadlines. It is shown that the problem can be solved in O(mn log n) time if jobs have unit processing times.<<ETX>>

[1]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[2]  Barbara B. Simons,et al.  A fast algorithm for single processor scheduling , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[3]  Barbara B. Simons,et al.  A fast algorithm for multiprocessor scheduling , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..