An optimal parallel algorithm for two-processor scheduling

The author presents a parallel algorithm for two-processor scheduling of tasks with treelike precedence constraints (outforests and inforests). The algorithm runs in O(log n) time using n/log n processors on the EREW PRAM. The algorithm is optimal and has a better time-processor product compared to the existing two-processor scheduling algorithms for outforests and inforests.