Masayuki Terai
ABSTRACT
This paper presents a new min-cut placement algorithm for timing assurance layout design. When critical nets are given net length constraints, the proposed algorithm can place cells so that the constraints may be met. This algorithm is built into the layout system for gate arrays called GALOP [1] and has been successfully applied to clock skew control of an ECL 12K-gate gate array.
- 1.M.Terai, "A Method of Improving the Terminal Assignment in the Channel Routing for Gate Arrays," IEEE Trans. Computer-Aided Des., vol. CAD-4, 1985, pp. 329-336.Google Scholar
- 2.A.E.Dunlop, et.al., "Chip Layout Optimization Using Critical Path Weighting," Proc. 21st DAC, 1984, pp.133-136. Google ScholarDigital Library
- 3.M.Burstein and M.N.Youssef, "Timing Influenced Layout Design," Proc. 22nd DAC, 1985, pp. 124-130. Google ScholarDigital Library
- 4.Y.Ogawa, et.al., "Efficient Placement Algorithms Optimizing Delay for High-Speed ECL Masterslice LSI's," Proc. 23rd DAC, 1986, pp. 404-410. Google ScholarDigital Library
- 5.S.Teig, R.L.Smith and J.Seaton,"I'iming-Driven Layout of Cell-Based ICs," VLSI System Design, May I986, pp. 63-73.Google Scholar
- 6.P.S.Hauge, R.Nair and E.J.Yoffa, "Circuit Placement for Predictable Performance," Proc. IEEE ICCAD, 1987, pp.88-91.Google Scholar
- 7.M.A.B.Jaekson and E.S.Kuh, "Performance-Driven Placement of Cell Based IC's," Proc. 26th DAC, 1989, pp. 370-375. Google ScholarDigital Library
- 8.M.A.Breuer, "Min-Cut Placement," J. Design Automation & Fault-Tolerant Computing, vol.1, no.4, 1977, pp.343-362.Google Scholar
- 9.H.Shiraishl and F.Hirose, "Efficient Placement and Routing Techniques for Master Slice LSI," Proc. 17th DAC, 1980, pp. 458-464. Google ScholarDigital Library
- 10.B.W.Kemighan and S.Lin, "An Efficient Procedure for Partitioning Graphs," Bell Syst. Tech. J, Feb. 1970, pp. 291-307Google ScholarCross Ref
- 11.T.Nishimura, et.at., "A Bipolar 18K-Gate Variable Size Cell Masterslice," IEEE J. Solid-State Circuits, vol. SC-21, 1986, pp. 727-732.Google ScholarCross Ref
Index Terms
- A new min-cut placement algorithm for timing assurance layout design meeting net length constraint
Recommendations
Timing-driven placement using design hierarchy guided constraint generation
ICCAD '02: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided designDesign hierarchy plays an important role in timing-driven placement for large circuits. In this paper, we present a new methodology for delay budgeting based timing-driven placement. A novel slack assignment approach is described as well as its ...
Individual wire-length prediction with application to timing-driven placement
In this paper, we address the problem of individual wire-length prediction and demonstrate its usefulness in timing-driven placement. Many researchers have observed that different placement algorithms produce different individual wire lengths. We ...
Wire length prediction in constraint driven placement
SLIP '03: Proceedings of the 2003 international workshop on System-level interconnect predictionExperiments show that lengths of individual wires are different for different placement algorithms. To achieve accurate wire length prediction, some knowledge of a placer's details is necessary. We postulate that wire length prediction should be coupled ...
Comments