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...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the conference on Design, automation and test in Europe pp. 57 - 62
Main Authors: Satish, Nadathur, Ravindran, Kaushik, Keutzer, Kurt
Format: Conference Proceeding
Language:English
Published: San Jose, CA, USA EDA Consortium 16.04.2007
Series:ACM Conferences
Subjects:
ISBN:3981080122, 9783981080124
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first