The two-processor scheduling problem is in R-NC

Authors:
U Vazirani;V V Vazirani
Affiliations:
Cornell University;-
Venue:
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Year:
1985

Citing 5
Cited 4

Scheduling Tasks with Nonuniform Deadlines on Two Processors

Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
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
A linear-time algorithm for a special case of disjoint set union

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Constructing a perfect matching is in random NC

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Parallel and output sensitive algorithms for combinatorial and linear algebra problems

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Matching is as easy as matrix inversion

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The two-processor scheduling problem is perhaps the most basic problem in scheduling theory, and several efficient algorithms have been discovered for it. However, these algorithms are inherently sequential in nature. We give a fast parallel (R-NC) algorithm for this problem. Interestingly enough, our algorithm for this purely combinatoric-looking problem draws on some powerful algebraic methods.