A flexible datapath allocation method for architectural synthesis
Authors:
Open Access
- 1 October 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 4 (4) , 376-404
Abstract
We present a robust datapath allocation method that is flexible enough to handle constraints imposed by a variety of target architectures. Key features of this method are its ability to handle accurate modeling of datapath units and the simultaneous optimization of direct objective functions. The proposed method consists of a new binding model construction scheme and an optimization technique based on simulated annealing. To illustrate the flexibility of this method, two datapath allocation procedures have been developed for two problem enviroments: (1) a procedure that incorporates interconnection area and delay estimates, where floor-planning is tightly integrated into datapath allocation; and (2) a procedure that handles registers, register files, and multiport memories for data storage, as well as random and linear topologies for interconnection architectures. Results from these two applications show our method produces competitive designs for benchmark circuits, as well as being flexible enough to be used for a variety of different domains.Keywords
This publication has 15 references indexed in Scilit:
- Global optimization approach for architectural synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- 3D scheduling1991
- Incorporating bottom-up design into hardware synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Algorithms for hardware allocation in data path synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Force-directed scheduling for the behavioral synthesis of ASICsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Architectural synthesis for DSP silicon compilersIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- REAL: a program for REgister ALlocation1987
- A Procedure for Placement of Standard-Cell VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Optimization by Simulated AnnealingScience, 1983
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970