An efficient deterministic parallel algorithm for two processors precedence constraint scheduling

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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.

Author supplied keywords

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free