An efficient deterministic parallel algorithm for two processors precedence constraint scheduling

Authors:
Hermann Jung;Maria Serna;Paul Spirakis
Affiliations:
Humboldt University, Germany;Dept. de Llentguatges i Sistemes Informàtics. Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain;Computer Technology Institute, Riga Fereou 61, 26110 Patras, Greece
Venue:
Theoretical Computer Science - Algorithms,automata, complexity and games
Year:
2003

Citing 4
Cited 0

Two processor scheduling is in NC

SIAM Journal on Computing
The two-processor scheduling problem is in random NC

SIAM Journal on Computing
An Almost-Linear Algorithm for Two-Processor Scheduling

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

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.