Complexity of Scheduling in Synthesizing Hardware from Concurrent Action Oriented Specifications

Concurrent Action Oriented Specifications (CAOS) formalism such as Bluespec Inc.'s Bluespec System Verilog (BSV) has been recently shown to be effective for hardware modeling and synthesis. This formalism offers the benefits of automatic handling of concurrency issues in highly concurrent system descriptions, and the associated synthesis algorithms have been shown to produce efficient hardware comparable to those generated from hand-written Verilog/VHDL. These benefits which are inherent in such a synthesis process also aid in faster architectural exploration. This is because CAOS allows a high-level description (above RTL) of a design in terms of atomic transactions, where each transaction corresponds to a collection of operations. Optimal scheduling of such actions in CAOS-based synthesis process is crucial in order to generate hardware that is efficient in terms of area, latency and power. In this paper, we analyze the complexity of the scheduling problems associated with CAOS-based synthesis and discuss several heuristics for meeting the peak power goals of designs generated from CAOS. We also discuss approximability of these problems as appropriate.

[1]  Arvind,et al.  High-level synthesis: an essential ingredient for designing complex ASICs , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[2]  Sujit Dey,et al.  Power management techniques for control-flow intensive designs , 1997, DAC.

[3]  Chaitali Chakrabarti,et al.  Low-power scheduling with resources operating at multiple voltages , 2000 .

[4]  Srivaths Ravi,et al.  Transient power management through high level synthesis , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[5]  James C. Hoe,et al.  Hardware Synthesis from Term Rewriting Systems , 1999, VLSI.

[6]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[7]  Massoud Pedram,et al.  Power Optimization and Synthesis at Behavioral and System Levels Using Formal Methods , 1999 .

[8]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[9]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  Sujit Dey,et al.  High-Level Power Analysis and Optimization , 1997 .

[11]  Saraju P. Mohanty,et al.  A framework for energy and transient power reduction during behavioral synthesis , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[12]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[13]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[14]  Leslie A. Hall,et al.  Approximation algorithms for scheduling , 1996 .

[15]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[16]  José C. Monteiro,et al.  Scheduling techniques to enable power management , 1996, DAC '96.

[17]  Sujit Dey,et al.  A power management methodology for high-level synthesis , 1998, Proceedings Eleventh International Conference on VLSI Design.

[18]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[19]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[20]  Wen-Tsong Shiue.  High level synthesis for peak power minimization using ILP , 2000, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors.

[21]  Niraj K. Jha,et al.  High-level synthesis of low-power control-flow intensive circuits , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[22]  Sandeep K. Shukla,et al.  Low-power hardware synthesis from TRS-based specifications , 2006, Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings..

[23]  Gaurav Singh,et al.  Algorithms for Low Power Hardware Synthesis from CAOS-- Concurrent Action Oriented Specifications , 2006 .

[24]  Magdy A. Bayoumi,et al.  Multiple voltage-based scheduling methodology for low power in the high level synthesis , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[25]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[26]  Reino Kurki-Suonio.  A Practical Theory of Reactive Systems - Incremental Modeling of Dynamic Behaviors , 2005, Texts in Theoretical Computer Science. An EATCS Series.

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .