Parallel algorithms for simultaneous scheduling, binding and floorplanning in high-level synthesis

With small device features in submicron technologies, interconnection delays play a dominant part in cycle time. Hence, it is important to consider the impact of physical design during high level synthesis. In comparison to a traditional approach which separates high-level synthesis from physical design, an algorithm which is able to make these stages interact very closely, would result in solutions with lower latency and area. However, such an approach could result in increased runtimes. Parallel processing is an attractive way of reducing the runtimes. In this paper, two parallel algorithms for simultaneous scheduling, binding and floorplanning algorithm are presented. A detailed hardware model is considered, taking into account multiplexor and register areas and delays. Experimental results are reported on an IBM SP-2 multicomputer, with close to linear speedups for a set of benchmark circuits.

[1]  Takashi Kambe,et al.  Hybrid floorplanning based on partial clustering and module restructuring , 1996, Proceedings of International Conference on Computer Aided Design.

[2]  Kyung-Geun Lee,et al.  Asynchronous Communication of Multiple Markov Chains in Parallel Simulated Annealing , 1992, ICPP.

[3]  Emile H. L. Aarts,et al.  Parallel implementations of the statistical cooling algorithm , 1986, Integr..

[4]  Srinivas Devadas,et al.  Algorithms for hardware allocation in data path synthesis , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Ernest S. Kuh,et al.  Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Martin D. F. Wong,et al.  Simultaneous functional-unit binding and floorplanning , 1994, ICCAD '94.

[7]  Larry J. Stockmeyer,et al.  Optimal Orientations of Cells in Slicing Floorplan Designs , 1984, Inf. Control..

[8]  Stephen W. Director,et al.  Mason: A Global Floorplanning Approach for VLSI Design , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Sung-Mo Kang,et al.  Interconnection delay in very high-speed VLSI , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[10]  Ravi Nair,et al.  Generation of performance constraints for layout , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Prithviraj Banerjee,et al.  Parallel Algorithms for Force Directed Scheduling of Flattened and Hierarchical Signal Flow Graphs , 1999, IEEE Trans. Computers.

[12]  Alice C. Parker,et al.  3D scheduling: high-level synthesis with floorplanning , 1991, 28th ACM/IEEE Design Automation Conference.

[13]  Barry M. Pangrle,et al.  A grid-based approach for connectivity binding with geometric costs , 1993, ICCAD '93.

[14]  Prithviraj Banerjee,et al.  Simultaneous scheduling, binding and floorplanning in high-level synthesis , 1998, Proceedings Eleventh International Conference on VLSI Design.

[15]  Hidetoshi Onodera,et al.  Layout-driven module selection for register-transfer synthesis of sub-micron ASIC's , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[16]  Ranga Vemuri,et al.  DSS: a distributed high-level synthesis system , 1992, IEEE Design & Test of Computers.

[17]  David W. Knapp.  Fasolt: a program for feedback-driven data-path optimization , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  John A. Chandy,et al.  Parallel simulated annealing strategies for VLSI cell placement , 1996, Proceedings of 9th International Conference on VLSI Design.

[19]  Prithviraj Banerjee.  Parallel algorithms for VLSI computer-aided design , 1994 .