Glass: a graph-theoretical approach for global binding

Abstract Module binding is the behavioral synthesis step that derives a structural representation of the datapath. It involves three tasks: functional unit, storage unit, and interconnection unit binding. This paper presents GLASS , a graph-theoretical formulation of the binding problem that performs all binding tasks simultaneously. Operations, variables, and data transfers are represented as vertices of the same compatibility graph and binding decisions are interfaced among different types of hardware modules (ALUs, registers, buses, …) in order to minimize the estimated datapath area. The solutions generated by GLASS are superior to those obtained by existing graph-theoretical P-time techniques.

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

[2]  Barry M. Pangrle.  Splicer: a heuristic approach to connectivity binding , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[3]  Wolfgang Rosenstiel,et al.  Synthesizing circuits from behavioural descriptions , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Jordi Cortadella,et al.  High-level synthesis of asynchronous systems: Scheduling and process synchronization , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[5]  Alice C. Parker,et al.  The high-level synthesis of digital systems , 1990, Proc. IEEE.

[6]  Minjoong Rim,et al.  Optimal allocation and binding in high-level synthesis , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[7]  Daniel Gajski,et al.  Design Tools for Intelligent Silicon Compilation , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Daniel P. Siewiorek,et al.  Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Jordi Cortadella,et al.  An asynchronous architecture model for behavioral synthesis , 1992, [1992] Proceedings The European Conference on Design Automation.

[10]  Emil F. Girczyc,et al.  A generalized interconnect model for data path synthesis , 1991, DAC '90.

[11]  Daniel D. Gajski,et al.  High ― Level Synthesis: Introduction to Chip and System Design , 1992 .

[12]  Pierre G. Paulin,et al.  Scheduling and Binding Algorithms for High-Level Synthesis , 1989, 26th ACM/IEEE Design Automation Conference.

[13]  Yu-Chin Hsu,et al.  Data path allocation based on bipartite weighted matching , 1990, 27th ACM/IEEE Design Automation Conference.

[14]  Peter Marwedel,et al.  Integrated Scheduling and Binding : A Synthesis Approach for Design Space Exploration , 1989, 26th ACM/IEEE Design Automation Conference.

[15]  John A. Nestor,et al.  Data path allocation using an extended binding model , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[16]  Fadi J. Kurdahi,et al.  REAL: A Program for REgister ALlocation , 1987, 24th ACM/IEEE Design Automation Conference.