Distributed design-space exploration for high-level synthesis systems

A parallel algorithm for design-space exploration and trade-off analysis is presented. Coarse-grained parallelism is introduced by generating multiple module bags and performing scheduling and performance analysis of the data flow graph for each module bag in parallel. This algorithm was implemented on a multiple processor machine as part of a distributed high-level synthesis system. Experimental results showed reduction in search time, improvement in design quality, and close-to-linear speedup.<<ETX>>

[1]  Christos A. Papachristou,et al.  A linear program driven scheduling and allocation method followed by an interconnect optimization algorithm , 1991, DAC '90.

[2]  Raul Camposano.  From behavior to structure: high-level synthesis , 1990, IEEE Design & Test of Computers.

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

[4]  Donald E. Thomas,et al.  The combination of scheduling, allocation, and mapping in a single algorithm , 1991, DAC '90.

[5]  Donald E. Thomas,et al.  Automating Technology Relative Logic Synthesis and Module Selection , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Alice C. Parker,et al.  MAHA: A Program for Datapath Synthesis , 1986, DAC 1986.

[7]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Alice C. Parker,et al.  Tutorial on high-level synthesis , 1988, DAC '88.