Allocation, scheduling and voltage scaling on energy aware MPSoCs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3990 LNCS, Issue , 2006, Pages 44-58

  Benini, Luca ^a   Bertozzi, Davide ^b   Guerri, Alessio ^a   Milano, Michela ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF FERRARA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; ENERGY DISSIPATION; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; SYSTEMS ANALYSIS;

LOGIC BENDERS DECOMPOSITION TECHNIQUE; MULTI-PROCESSOR SYSTEM-ON-CHIP (MPSOC); PLANE GENERATION; REALISTIC INSTANCE;

MULTIPROCESSING SYSTEMS;

EID: 33746102162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757375_6     Document Type: Conference Paper

References (12)

1. J. F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238-252, 1962.
2. D. Bertozzi, L. Benini, A. Guerri, and M. Milano. Allocation and scheduling for mpsocs via decomposition and no-good generation. In Procs. of the 11th Intern. Conference on Principles and Practice of Constraint Programming - CP 2005, pages 107-121, Sites, Spain, Sept. 2005. Springer.
3. M. Fischetti E. Balas and W. Pulleyblank. The precedence constrained asymmetric travelling salesman problem. Mathematical Programming, 68:241-265, 1995.
4. A. Eremin and M. Wallace. Hybrid benders decomposition algorithms in constraint logic programming. In Procs. of the 7th Intern. Conference on Principles and Practice of Constraint Programming - CP 2001, pages 1-15, Paphos, Cyprus, Nov. 2001. Springer.
5. I. E. Grossmann and V. Jain. Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS Journal on Computing, 13:258-276, 2001.
6. J. N. Hooker. A hybrid method for planning and scheduling. In Procs. of the 10th Intern. Conference on Principles and Practice of Constraint Programming - CP 2004, pages 305-316, Toronto, Canada, Sept. 2004. Springer.
7. J. N. Hooker. Planning and scheduling to minimize tardiness. In Procs. of the 11th Intern. Conference on Principles and Practice of Constraint Programming -CP 2005, pages 314-327, Sites, Spain, Sept. 2005. Springer.
8. J. N. Hooker and G. Ottosson. Logic-based benders decomposition. Mathematical Programming, 96:33-60, 2003.
9. P. Poletti, A. Poggiali, and P. Marchal. Flexible hardware/software support for message passing on a distributed shared memory architecture. In 2005 Design, Automation and Test in Europe Conference and Exposition DATE2005, pages 736-741, 2005.
10. M. Ruggiero, A. Acquaviva, D. Bertozzi, and L. Benini. Application-specific power-aware workload allocation for voltage scalable mpsoc platforms. In 2005 International Conference on Computer Design, pages 87-93, 2005.
11. M. Ruggiero, A. Guerri, D. Bertozzi, L. Benini, and M. Milano. Communication-aware allocation and scheduling framework for stream-oriented multi-processor systems-on-chip. In 2006 Design, Automation and Test in Europe Conference and Exposition DATE2006, 2006.
12. E. S. Thorsteinsson. A hybrid framework integrating mixed integer programming and constraint programming. In Procs. of the 7th International Conference on Principles and Practice of Constraint Programming - CP 2001, pages 16-30, Paphos, Cyprus, Nov. 2001.