A Parallel Algorithm for Two Processors Precedence Constraint Scheduling

Download PDF
Open Webpage

Hermann Jung, Maria J. Serna, Paul G. Spirakis

Published: 1991, Last Modified: 09 May 2025ICALP 1991EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We present a new parallel algorithm for the two processors scheduling problem. The algorithm uses only O(n 3) processors and takes time O(log2 n) time on a PRAM. In order to prove the above bounds we show how to compute in NC the lexicographically first matching for a special kind of convex bipartite graphs.