Skip to main content
Conference Proceedings

A parallel algorithm for two processors precedence constraint scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 510 LNCS 417-428
DOI: 10.1007/3-540-54233-7_152
3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a new parallel algorithm for the two processors scheduling problem. The algorithm uses only O(n3) processores 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.

Cite

CITATION STYLE

APA

Jung, H., Serna, M., & Spirakis, P. (1991). A parallel algorithm for two processors precedence constraint scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 510 LNCS, pp. 417–428). Springer Verlag. https://doi.org/10.1007/3-540-54233-7_152

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