Optimal synthesis of multichip architectures
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 9, 238-241
- https://doi.org/10.1109/iccad.1992.279367
Abstract
A global optimization approach to high level synthesis of VLSI multichip architectures is presented. Optimal application-specific architectures are synthesized to minimize latency given constraints on chip area, I/O pin count and interchip communication delays. A mathematical integer programming (IP) model for simultaneously partitioning, scheduling, and allocating hardware (functional units, I/O pins, and interchip buses) is formulated. By exploiting the problem structure (using polyhedral theory), the size of the search space is decreased and a new variable selection strategy is introduced based on the branch and bound algorithm. Multichip optimal architectures for several examples are synthesized in practical CPU times. Execution times are comparable to those for previous heuristic approaches. There are, however, significant improvements in optimal schedules and allocations of multichips.Keywords
This publication has 8 references indexed in Scilit:
- Partitioning of functional models of synchronous digital systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal synthesis of high-performance architecturesIEEE Journal of Solid-State Circuits, 1992
- Optimal VLSI Architectural SynthesisPublished by Springer Nature ,1992
- A formal approach to the scheduling problem in high level synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Synthesis of application-specific multiprocessor architecturesPublished by Association for Computing Machinery (ACM) ,1991
- CHOPPublished by Association for Computing Machinery (ACM) ,1991
- Scheduling parallel program tasks onto arbitrary target machinesJournal of Parallel and Distributed Computing, 1990
- Integer and Combinatorial OptimizationPublished by Wiley ,1988