User: Guest  Login
Document type:
Technical Report 
Author(s):
Ernst W. Mayr; Hans Stadtherr 
Title:
Optimal Parallel Algorithms for Two Processor Scheduling with Tree Precedence Constraints 
Abstract:
Consider the problem of finding a minimum length schedule for an unit execution time tasks on m processors with tree-like precedence constraints. A sequential algorithm can solve this problem in linear time. The fastest known parallel algorithm needs O(log n) time using n^2 processors. For the case m=2 we present two work optimal parallel algorithms that produce greedy optimal schedules for intrees and outtrees. Both run in O(log n) time using n/(log n) processors of an EREW PRAM. 
Keywords:
parallel algorithms; scheduling; tree precedence constraints; optimal work 
Year:
1995 
Year / month:
1995-11-08 00:00:00 
Pages:
26