An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
From MaRDI portal
Publication:1870558
DOI10.1016/S0304-3975(01)00120-7zbMath1026.68161MaRDI QIDQ1870558
Hermann Jung, Maria J. Serna, Paul G. Spirakis
Publication date: 14 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- NP-complete scheduling problems
- Optimal scheduling for two-processor systems
- The Two-Processor Scheduling Problem is in Random NC
- Two Processor Scheduling is in $\mathcal{NC}$
- Parallel Matrix and Graph Algorithms
- An Almost-Linear Algorithm for Two-Processor Scheduling
- P-COMPLETE GEOMETRIC PROBLEMS
- Optimal Sequencing of Two Equivalent Processors
This page was built for publication: An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
