A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our technique solves relaxed versions of the problem and iteratively learns constraints to prune the solution space. Typical formula...
Uložené v:
| Vydané v: | Proceedings of the conference on Design, automation and test in Europe s. 57 - 62 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
San Jose, CA, USA
EDA Consortium
16.04.2007
|
| Edícia: | ACM Conferences |
| Predmet: |
Computing methodologies
> Artificial intelligence
> Search methodologies
> Heuristic function construction
Theory of computation
> Design and analysis of algorithms
> Approximation algorithms analysis
> Scheduling algorithms
Theory of computation
> Design and analysis of algorithms
> Online algorithms
> Online learning algorithms
Theory of computation
> Design and analysis of algorithms
> Online algorithms
> Online learning algorithms
> Scheduling algorithms
|
| ISBN: | 3981080122, 9783981080124 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!

