Re-engineering of timing constrained placements for regular architectures

Abstract: In a typical design flow, the design may be altered slightly several times after the initial design cycle according to minor changes in the design specification either as a result of design debugging or as a result of changes in engineering requirements. These modifications are usually local and are referred to as engineering changes. In this paper we study the problem of timing driven placement re-engineering: the problem of altering the placement of a circuit to incorporate engineering changes without degrading the timing performance of the circuit. We focus on the re-engineering problem for regular architectures such as FPGAs and gate arrays. Our algorithms exploit the locality of the re-engineering design changes and use the current placement to generate the new placement for the altered circuit. Our experiments on the Xilinx 3000 FPGA architecture demonstrate the effectiveness of our algorithm in handling engineering changes efficiently.

[1]  Shih-Chieh Chang,et al.  Layout Driven Logic Synthesis for FPGAs , 1994, 31st Design Automation Conference.

[2]  Tsz-shing Cheung,et al.  An algorithm to deal with incremental layout alteration , 1991, [1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems.

[3]  C. L. Liu,et al.  Applications of Slack Neighborhood Graphs to Timing Driven Optimization Problems in FPGAs , 1995, Third International ACM Symposium on Field-Programmable Gate Arrays.

[4]  Anmol Mathur,et al.  Compression-relaxation: A New Approach To Performance Driven Placement For Regular Architectures , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[5]  Roberto Tamassia,et al.  A Network Flow Approach to the Reconfiguration of VLSI Arrays , 1991, IEEE Trans. Computers.

[6]  Yun-Cheng Ju Incremental circuit simulation and timing analysis techniques , 1992 .