Retiming for wire pipelining in system-on-chip

At the integration scale of System-On-Chips (SOCs), the conflicts between communication and computation will become prominent even on a chip. A big fraction of system time will shift from computation to communication. In synchronous systems, a large amount of communication time is spent on multiple-clock period wires. In this paper, we explore retiming to pipeline long interconnect wires in SOC designs., Behaviorally, it means that both computation and communication are rescheduled for parallelism. The retiming is applied to a netlist of macro-blocks, where the internal structures may not be changed and flip-flops may not be able to be inserted on some wire segments. This problem is different from that on a gate level netlist and is formulated as a wire retiming problem. Theoretical treatment and a polynomial time algorithm are presented in the paper. Experimental results showed the benefits and effectiveness of our approach.

[1]  Sandy Irani,et al.  Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems , 1999, DAC '99.

[2]  Sachin S. Sapatnekar,et al.  Optimizing large multiphase level-clocked circuits , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Harish Kriplani,et al.  Timing model extraction of hierarchical blocks by graph reduction , 2002, DAC '02.

[4]  Evangeline F. Y. Young,et al.  Retiming with Interconnect and Gate Delay , 2003, ICCAD 2003.

[5]  Jason Cong,et al.  Multilevel global placement with retiming , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[6]  J. Quadrat,et al.  Numerical Computation of Spectral Elements in Max-Plus Algebra☆ , 1998 .

[7]  Steven Burns.  Performance Analysis and Optimization of Asynchronous Circuits , 1991 .

[8]  C. L. Liu,et al.  Optimal clock period clustering for sequential circuits with retiming , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Ajay J. Daga,et al.  Automated timing model generation , 2002, DAC '02.

[10]  Pasquale Cocchini.  Concurrent flip-flop and repeater insertion for high performance integrated circuits , 2002, ICCAD 2002.

[11]  Robert K. Brayton,et al.  Planning for performance , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[12]  Cheng-Kok Koh,et al.  Flip-flop and repeater insertion for early interconnect planning , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[13]  Jason Cong,et al.  Physical planning with retiming , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[14]  Narendra V. Shenoy,et al.  Efficient Implementation Of Retiming , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[15]  Jason Cong,et al.  Buffer block planning for interconnect-driven floorplanning , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[16]  Brian Foutz,et al.  Efficient stimulus independent timing abstraction model based on a new concept of circuit block transparency , 2002, DAC '02.

[17]  Cheng-Kok Koh,et al.  Interconnect Planning with Local Area Constrained Retiming , 2003 .

[18]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.

[19]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[20]  Soha Hassoun,et al.  Optimal path routing in single- and multiple-clock domain systems , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  Hai Zhou,et al.  Simultaneous routing and buffer insertion with restrictions on buffer locations , 1999, DAC '99.

[22]  Soha Hassoun,et al.  Optimal buffered routing path constructions for single and multiple clock domain systems , 2002, ICCAD 2002.