Scheduling with Concurrency-Based Constraints

This paper considers scheduling problems with timing constraints of the forms < (precedence), ≤ (no later than), and ≐ (concurrence). Scheduling unit-time jobs subject to < and ≐ constraints, and scheduling unit-time jobs subject to ≤ constraints, are proved NP-complete for fixed k ≥ 3 process...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of algorithms Ročník 18; číslo 1; s. 98 - 123
Hlavní autori: Berger, B., Cowen, L.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: San Diego, CA Elsevier Inc 1995
Elsevier
Predmet:
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Software engineering
Processor
Optimal algorithm
Constraint
Concurrency
NP complete problem
Scheduling
Timing
Parallelization
ISSN:0196-6774, 1090-2678
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper considers scheduling problems with timing constraints of the forms < (precedence), ≤ (no later than), and ≐ (concurrence). Scheduling unit-time jobs subject to < and ≐ constraints, and scheduling unit-time jobs subject to ≤ constraints, are proved NP-complete for fixed k ≥ 3 processors. (This contrasts with the case of just < constraints, which is a famous open problem.) We then show that a modified version of Gabow′s linear time 2-processor scheduling algorithm can optimally handle all three types of constraints. Linear time and NC algorithms for optimally scheduling with any subset of {<, ≤, ≐ } constraints are thus obtained for k = 2 processors. Approximation results for k ≥ 3 processors are also obtained. Finally, we consider a problem that arises in practice on the Tera architecture, proving an NP-completeness result and providing an approximation algorithm.
ISSN:0196-6774
1090-2678
DOI:10.1006/jagm.1995.1003