We present here a new deterministic parallel algorithm for the two-processor scheduling problem. The algorithm uses only O(n3) processors and takes O(log2n) time on a CREW 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. © 2002 Elsevier Science B.V. All rights reserved.
Jung, H., Serna, M., & Spirakis, P. (2003). An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. In Theoretical Computer Science (Vol. 292, pp. 639–652). https://doi.org/10.1016/S0304-3975(01)00120-7