Fifth ACM/ SIGDA Physical Design Workshop Proceedings
April 15-17, 1996 Reston, Virginia, USA
Foreword Welcome to the Fifth ACM SIGDA Physical Design Workshop (PDW-96)! Our workshop is being held in the midst of a watershed era of growth and innovation in the EDA industry, most notably within the "back-end" domains of physical design and physical verification. Timing-, signal integrity- and power-consciousness have rapidly become mainstream design requirements, with reliability and yield just around the corner. Many classic techniques have broken down, from the design of cell libraries to place-and-route to physical verification. That this sea change is partly due to the continued scaling of process technology (weaker drivers driving more resistive interconnects, lower supply voltages reducing noise margins, slew rates affecting signal integrity and timing, neighboring interconnects coupling more noticeably, ...) is well recognized. But the changing nature of the semiconductor business itself - the changing nature of design teams has had an equally and design projects (more design starts, shorter (synthesis-driven) design cycles, ... ) profound impact on our context. We are here because all those problems in physical design which were declared "solved" four years ago (!) are now - without question very much unsolved. Interconnect design, block placement, estimation and cell layout are just a few of the wide-open topics addressed in this workshop. We are also here because few if any of us can claim to know "the real killer issues" in physical design. (What kind of problem will cause the XYZ chip to miss its market window in 1999? Timing? Thermal? Noise? Algorithms or flows?) The two evening panels bring together a number of luminaries in the field to discuss future needs and directions for deep-submicron design, as well as "disconnects" in back-end (data management and physical verification) flows. The Tuesday afternoon panel highlights the emerging need for yield optimization in physical design. Finally, we are here to make new friends and expand our horizons. There will be plenty of opportunities to chat, eat, and imbibe (which we hope will make up for the lack of opportunity to sleep!). The Monday afternoon sessions will highlight what is arguably an extremely rich opportunity in physical design, CAD for micro electromechanical systems (MEMS), and the workshop will close with an open problems session. We are grateful to the U.S. National Science Foundation for its generous support of this workshop (NSF grant MIP-9531666). Additional sponsorship has been provided by ACM SIGDA and Avant! Corporation. On behalf of the technical program and organizing committees, we hope that PDW-96 will be a rewarding and enjoyable experience for you.
Andrew B. Kahng Technical Program Chair
Gabriel Robins General Chair
ii
Workshop Organization
Steering Committee:
General Chair:
M. Lorenzetti (Mentor Graphics)
G. Robins (U. of Virginia)
B. T. Preas (Xerox PARC)
Technical Program Committee:
Keynote Address:
C. K. Cheng (UC San Diego)
C. L. Liu (U. Illinois Urbana-Champaign)
J. P. Cohoon (U. of Virginia)
Benchmarks Co-Chairs:
J. Cong (UC Los Angeles) A. Domic (Cadence)
F. Brglez (NOCSU)
J. Frankle (Xilinx)
W. Swartz (TimberWolf Systems)
E. G. Friedman (Rochester)
Local Arrangements Chair:
D. D. Hill (Synopsys)
M. J. Alexander (U. of Virginia)
L. G. Jones (Motorola)
Treasurer:
A. B. Kahng (UC Los Angeles, Chair)
S. B. Souvannavong
Y.-L. Lin (Tsing Hua)
Publicity Chair:
K. S. J. Pister (UC Los Angeles)
J. L. Ganley (Cadence)
M. Marek-Sadowska (UC Santa Barbara)
Sponsors:
C. Sechen (Washington)
ACM / SIGDA
R.-S. Tsay (Avant! Corporation)
U.S. National Science Foundation
G. Zimmermann (Kaiserslautern)
Avant! Corporation
http: //www. cs. Virginia. edu/- pdw96/
111
Contact Information Gabriel Robins Department of Computer Science Thornton Hall University of Virginia Charlottesville, VA 22903-2442 (804) 982-2207 (804) 982-2214 (fax) robins c-cs.virginia.edu
Jason Cong UCLA Computer Science Department 4711 Boelter Hall Los Angeles CA 90095-1596 (310) 206-2775 (310) 825-2273 (fax) cong~cs.ucla.edu Antun Domic Cadence Design Systems, Inc. 2655 Seely Road, Building 6, MS 6B1 San Jose, CA 95134 (408) 428-5837 (408) 428-5828 (fax) domic cadence.com
C. L. Liu University of Illinois, Urbana-Champaign 1304 West Springfield Avenue Urbana, IL 61801 (217) 333-6769 (217) 333-3501 (fax) liucl cs.uiuc.edu
Jon Frankle Xilinx, Inc. 2100 Logic Drive San Jose, CA 95124 (408) 879-5348 (408) 559-7114 (fax) jon.frankle Axilinx.com
Michael Lorenzetti Mentor Graphics Corporation 8005 SW Boeckman Road Wilsonville, OR 97070-7777 (503) 685-1258 (503) 685-4790 (fax)
[email protected] Bryan T. Preas Xerox PARC 3333 Coyote Hill Road Palo Alto, CA 94304 (415) 812-4845 (415) 812-4471 (fax) preas(4parc.xerox.com
Eby G. Friedman Department of Electrical Engineering Computer Studies Building 420 University of Rochester Rochester, New York 14627 (716) 275-1022 (716) 275-2073 (fax) friedman Oee.rochester.edu
Chung-Kuan Cheng CSE Department University of California, San Diego La Jolla, CA 92093-0114 (619) 534-6184 (619) 534-7029 (fax) kuan~cs.ucsd.edu
Dwight D. Hill Synopsys, Inc. 700 East Middlefield Road Mountain View, CA 94043 (415) 694-4421 (415) 965-8637 (fax) hill synopsys.com
James P. Cohoon Department of Computer Science Thornton Hall University of Virginia Charlottesville, VA 22903-2442 (804) 982-2210 (804) 982-2214 (fax) cohoon~virginia.edu
Larry G. Jones Motorola, Inc. MD OE321 6501 William Cannon Drive West Austin. TX 78735-8598 (512) 891-8867 (512) 891-3161 (fax) jones~ssdt-oakhill.sps.mot.com iv
Andrew B. Kahng UCLA Computer Science Department 3713 Boelter Hall Los Angeles CA 90095-1596 (310) 206-7073 (310) 825-7578 (fax) abk~cs.ucla.edu
Gerhard Zimmermann Department of Computer Science University of Kaiserslautern Erwin-Schroedinger-Strasse P.O. Box 3049 D-67653 Kaiserslautern, Germany +49 631 205-2628 +49 631 205-3558 (fax) zimmermaAinformatik.uni-kl.de
Youn-Long Lin Department of Computer Science Tsing Hua University Hsin-Chu, Taiwan 30043 Republic of China 886-35-731070 886-35-723694 (fax) ylin cs.nthu.edu.tw
Franc Brglez Dept. of Electrical and Computer Engineering North Carolina State University, Box 7911 Raleigh, NC 27695-7911, USA (919) 248-1925 (919) 248-9245 brglez~cbl.ncsu.edu
Kristofer S. J. Pister UCLA Department of Electrical Engineering Los Angeles, CA 90095-1594 (310) 206-4420 (310) 206-8495 (fax) pister ee.ucla.edu
William P. Swartz TimberWolf Systems, Inc. 10880 Cassandra Way Dallas, TX 75228-2493 (214) 613-6772 (214) 682-1478 (fax) bills twolf.com
Malgorzata Marek-Sadowska Room 4157, Engineering I Dept. of Electrical and Computer Engineering University of California Santa Barbara, CA 93106-9560 (805) 893-2721 (805) 893-3262 (fax) mms Kece.ucsb.edu
Michael J. Alexander Department of Computer Science Thornton Hall University of Virginia Charlottesville, VA 22903-2442 (804) 982-2291 (804) 804-982-2214 (fax) alexander tvirginia.edu
Carl Sechen Department of Electrical Engineering Box 352500 University of Washington Seattle. WA 98195-2500 (206) 685-8756 (206) 543-3842 (fax) sechen(ee.washington.edu
Sally B. Souvannavong Department of Computer Science Thornton Hall University of Virginia Charlottesville, VA 22903-2442 (804) 982-2291 (804) 804-982-2214 (fax) sallys~cs.virginia.edu
Ren-Song Tsay Avant! Corporation 1208 East Arques Avenue Sunnyvale, CA 94086 (408) 738-8814 (408) 738-8508 (fax) tsayLavanticorp .com
Joseph L. Ganley Cadence Design Systems, Inc. 555 River Oaks Parkway, MS 2A2 San Jose, CA 95134-1937 (408) 944-7232 (408) 894-2700 (fax) ganleyvcadence.com
v
Program
Sunday, April 14 6:00pm-8:30pm: Registration (the registration desk will also be open 8:00am-5:00pm on Monday and 8:00am-12:00pm on Tuesday)
7:OOpm-8:30pm: Reception (refreshments provided)
Monday, April 15 8:30am-8:40am: Welcome 8:40am-10:OOam: Session 1: Timing-Driven Interconnect Resynthesis Session Chair: E. S. Kuh (UC Berkeley) * Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion T. Okamoto and J. Cong, UIC Los Angeles * Simultaneous Routing and Buffer Insertion for High Performance Interconnect J. Lillis, C.-K. Cheng and T.-T. Y. Lin, UC San Diego * Timing Optimization by Redundancy Addition and Removal L. A. Entrena, E. Olias and J. Uceda, U. Carlos III of Madrid and U. Politecnica of Madrid
I 7 13
* Open Commentary - Moderators: D. D. Hill (Synopsys) and P. Suaris (Interconnectix) 10:00am-10:20am: Break (refreshments provided) 10:20am-12:00pm: Session 2: Interconnect Optimization Session Chair: C. L. Liu (U. Illinois Urbana-Champaign) * Optimal Wire-Sizing Formula Under the Elmore Delay Model C.-P. Chen, Y.-P. Chen and D. F. Wong, U. Texas Austin
21
* Reducing Coupled Noise During Routing A. Vittal and M. Marek-Sadowska, UC Santa Barbara
27
* Simultaneous Transistor and Interconnect Sizing Using General Dominance Property J. Cong and L. He, UC Los Angeles
34
* HierarchicalClock-Network Optimization D. Lehther, S. Pullela, D. Blaauw and S. Ganguly, Somerset Design Center, Motorola * Open Commentary - Moderators: D. D. Hill (Synopsys) and M. Lorenzetti (Mentor)
40
12:00pm-2:00pm: Lunch
vi
Workshop Keynote Address: Prof. C. L. Liu, U. Illinois Urbana-Champaign Algorithmic Aspects of Physical Design of VLSI Circuits
2:00pm-2:45pm: Session 3: Tutorial: Making MEMS Speaker: K. J. Gabriel (ARPA)
45
2:45pm-3:00pm: Break (refreshments provided)
3:00pm-4:15pm: Session 4: Physical Design for MEMS Session Chair: K. J. Gabriel (ARPA) * Physical Design for Surface-Micromachined MEMS
53
G. K. Fedder and T. Mukherjee, Carnegie-Mellon U. * Consolidated Micromechanical Element Library
61
R. Mahadevan and A. Cowen, MCNC * Synthesis and Simulation for MEMS Design E. C. Berg, N. R. Lo, J. N. Simon, H. J. Lee and K. S. J. Pister, UC Los Angeles
67
4:15pm-4:30pm: Break (refreshments provided) 4:30-6:00pm: Session 5: Panel: Physical Design Needs for MEMS Moderator: K. S. J. Pister (UC Los Angeles) Panelists include: * S. F. Bart (Analog Devices)
71
* G. K. Fedder (Carnegie-Mellon U.)
76
* K. J. Gabriel (ARPA) * I. Getreu (Analogy) * R. Grafton (NSF) * R. Harr (ARPA)
81
* R. Mahadevan (MCNC)
83
* J. E. Tanner (Tanner Research)
86
6:00pm-8:00pm: Dinner 8:OOpm-9:30pm: Session 6: Panel: Deep-Submicron Physical Design:
Future Needs and Directions Moderator: N. Mokhoff (Managing Editor, EE Times) Panelists include: * T. C. Lee (President/CEO, Neo Paradigm Labs) * L. Scheffer (Architect, Cadence)
89
* W. Vercruysse (UltraSPARC III CAD Manager, Sun) * M. Wiesel (Design Manager, Intel) * T. Yin (VP R&D, Avant! Corporation)
Vii
Tuesday, April 16
8:30am-9:50am: Session 7: Partitioning Session Chair: D. F. Wong (U. Texas Austin) * VLSI Circuit Partitioningby Cluster-Removal Using Iterative Improvement Techniques S. Dutt and W. Deng, U. Minnesota and LSI Logic * A Hybrid Multilevel/Genetic Approach for Circuit Partitioning C. J. Alpert, L. Hagen and A. B. Kahng, UC Los Angeles and Cadence * Min-Cut Replication for Delay Reduction J. Hwang and A. El Gamal, Xilinx and Stanford U.
92 100 106
* Open Commentary - Moderators: J. Frankle (Xilinx) and G. Zimmermann (U. Kaiserslautern) 9:50am-10:1Oam: Break (refreshments provided) 10:lOam-11:50am: Session 8: Topics in Hierarchical Design Session Chair: M. Sarrafzadeh (Northwestern U.) * Two-Dimensional Datapath Regularity Extraction R. X. T. Nijssen and J. A. G. Jess. TU Eindhoven * HierarchicalNetlength Estimation for Timing Prediction W. Hebgen and G. Zimmermann, U. Kaiserslautern * Exploring the Design Space for Building-Block Placements Considering Area, Aspect Ratio. Path Delay and Routing Congestion H. Esbensen and E. S. Kuh, UC Berkeley * Genetic Simulated Annealing and Application to Non-Slicing Floorplan Design S. Koakutsu, M. Kang and W. W.-M. Dai, Chiba U. and UC Santa Cruz * Open Commentary - Moderators: L. Scheffer (Cadence) and T. Yin (Avant! Corporation)
111 118
126 134
11:50pm-1:30pm: Lunch
1:30pm-3:00pm: Session 9: Poster Session * Physical Layout for Three-DimensionalFPGAs M. J. Alexander, J. P. Cohoon, J. L. Colfiesh, J. Karro, E. L. Peters and G. Robins, U. Virginia
142
* Efficient Area Minimization for Dynamic CMOS Circuits B. Basaran and R. A. Rutenbar, Carnegie-Mellon U.
150
* A Fast Technique for Timing-Driven Placement Re-engineering M. Hossain, B. Thumma and S. Ashtaputre, Compass Design Automation * Over-the-Cell Routing with Vertical Floating Pins I. Peters, P. Molitor and M. XVeber, U. Halle and Deuretzbacher Research GmbH
154
* Congestion-Balanced Placement for FPGAs Y. Sun, R. Gupta and C. L. Liu, Altera and U. Illinois Urbana-Champaign
163
* Fanout Problems in FPGA K.-H. Tsai, M. Marek-Sadowska and S. Kaptanoglu, UC Santa Barbara and Actel
169
viii
158
* Performance-Driven Layout Synthesis: Optimal Pairing & Chaining A. J. Velasco, X. Marin, J. Riera, R. Peset and J. Carrabina, U. Autonoma de Barcelona and Philips Research Labs Eindhoven
176
* Clock-Delayed Domino for Adder and CombinatorialLogic Design G. Yee and C. Sechen, U. Washington
183
3:00pm-4:00pm: Session 10: Manufacturing/Yield Issues I Session Chair: Eby G. Friedman (U. Rochester) * Layout Design for Yield and Reliability K. P. Wang, M. Marek-Sadowska and W. Maly, UC Santa Barbara and Carnegie-Mellon U.
190
* Yield Optimization in Physical Design (invited survey paper) V. K. R. Chiluvuri, Motorola
198
4:00pm-4:15pm: Break (refreshments provided) 4:15pm-5:45pm: Session 11: Panel: Manufacturing/Yield Issues II Moderator: L. G. Jones (Motorola) Panelists include: * V. K. R. Chiluvuri (Motorola) * I. Koren (U. Massachusetts Amherst)
207
* J. Burns (IBM Watson Research Center) * W. Maly (Carnegie-Mellon U.)
5:45pm-7:30pm: Dinner 7:30pm-8:00pm: Session 12a: Design Views in Routing Session Chair: B. T. Preas (Xerox PARC) * A Gridless Multi-Layer Channel Router Based on Combined Constraint Graph and Tile Expansion Approach H.-P. Tseng and C. Sechen, U. Washington
210 218
* A Multi-Layer Chip-Level Global Router L.-C. E. Liu and C. Sechen, U. Washington
8:00pm-9:30pm: Session 12b: Design Views, Data Modeling and Flows:
Critical Disconnects Moderator: A. B. Kahng (UC Los Angeles) Panelists include: * W. W.-M. Dai (UC Santa Cruz and Ultima Interconnect Technology, Inc.)
226
* L. G. Jones (Motorola) * D. Lapotin (IBM Austin Research Center) * E. Nequist (VP R&D, Cooper & Chyan) * R. Rohrer (Fellow, Avant! Corporation) * C. Palesko (VP. Savantage)
228
ix
Wednesday, April 17 8:30am-9:50am: Session 13: Performance-Driven Design Session Chair: M. Marek-Sadowska (UC Santa Barbara) * A Graph-Based Delay Budgeting Algorithm for Large Scale Timing-Driven Placement Problems G. E. Tellez, D. A. Knol and M. Sarrafzadeh, Northwestern U.
234
* Reduced Sensitivity of Clock Skew Scheduling to Technology Variations J. L. Neves and E. G. Friedman, U. Rochester
241
* Multi-Layer Pin Assignment for Macro Cell Circuits L.-C. E. Liu and C. Sechen, U. Washington
249
* Open Commentary- Moderator: J. Cong (UC Los Angeles) 9:50pm-10:10pm: Break (refreshments provided) 10:10am- 11:30am: Session 14: Topics in Layout Session Chair: D. D. Hill (Synopsys) * Constraint Relaxation in Graph-Based Compaction S.-K. Dong, P. Pan, C. Y. Lo and C. L. Liu, Silicon Graphics. Clarkson ]U., Lucent Technologies and U. Illinois 'Urbana-Champaign
256
* An 0(n) Algorithm for Transistor Stacking with Performance Constraints B. Basaran and R. A. Rutenbar, Carnegie-Mellon U. * Efficient Standard Cell Generation When Diffusion Strapping is Required B. Guan and C. Sechen, U. Washington
262
* Open Commentary - Moderators: D. D. Hill (Synopsys) and E. G. Friedman (U. Rochester) 11:30am-12:00pm: Session 15: Open Problems Moderators: A. B. Kahng (UC Los Angeles) and B. T. Preas (Xerox PARC) 12:00pm-2:00pm: Lunch (and benchmark competition results) 2:00pm: Workshop adjourns
x
268
Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion * Takumi Okamoto 1,2 okamoto~cs .ucla. edu
Jason Cong I conglcs .ucla. edu
Dept. of Computer Science, University of California, Los Angeles, CA 90095 2 C&C Research Laboratories, NEC Corp., Miyamae, Kawasaki 216, Japan
Abstract This paper presents an algorithm for interconnect layout optimization with buffer insertion. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm finds a buffered Steiner tree so that the required arrival time (or timing slack) at the source is maximized. In the algorithm, Steiner routing tree construction and buffer insertion are achieved simultaneously by combining A-tree construction and dynamic programming based buffer insertion algorithms, while these two steps were carried out independently in the past. Extensive experimental results indicate that our approach outperforms conventional two-step approaches. Our buffered Steiner trees increase the timing slack at the source by up to 75% compared with those by the conventional approaches. 1.
given tree topology. [7, 8] has integrated wire sizing and power minimization with the algorithm in [6] under a more accurate delay model taking signal slew into account. On interconnect topology optimization problem, the analysis in [9] and [10] showed that as we reduce the device dimension, resistance ratio, which is defined as the ratio of the driver resistance versus the unit wire resistance, decreases. As a result the distributed nature of the interconnect structure must be considered, and conventional algorithm for total wire capacitance minimization does not necessarily lead to the minimum interconnect delay. For interconnect optimization in deep submicron VLSI design, recently a number of interconnect topology optimization algorithms have been proposed, including bounded-radius bounded-cost trees[ri], AHHK trees[12], maximum performance trees[13], A-trees[10], low-delay trees[14, 15], and IDW/CFD trees[16]. Although steady progress has been made in buffer insertion and Steiner tree construction for delay minimization, and encouraging experimental results were reported, we believe that these two steps need to be carried out simultaneously in order to construct even higher performance buffered Steiner trees directly. The independent two-step approach often leads to sub-optimal designs due to the following reasons: in the case of buffer insertion followed by Steiner tree construction, there is a problem that wiring delay and routability can not be estimated accurately in buffer insertion as mentioned above: in the case of Steiner tree construction followed by buffer insertion, there is a problem that Steiner tree optimized for delay does not necessarily result in a minimum-delay buffered Steiner tree. Figure 1 shows an example, where sink si is the most critical among all the sinks. In certain cases, which depends on the technology and criticality of sinks, the buffered Steiner tree in Figure l(a) is desired, while Figure l(b) shows a minimumdelay Steiner tree followed by buffer insertion.
Introduction
For timing optimization of VLSI circuits, buffer insertion (or fanout optimization) and interconnect topology optimization take important roles and a number of algorithms were proposed for these problems over the past a few years. On fanout optimization problem, most of previous work focused on construction of buffered trees in logic synthesis with consideration of user-defined timing and area constraints[1, 2, 3]. The timing measures used during this stage mainly consist of gate delays and a rough approximation for interconnect delay, which is assumed to be piecewise linear with the number of fanouts. When the wiring effect is dominant, traditional synthesis tools that use such a fanout-based model may be optimizing a timing value which is significantly different from the actual post layout value. Another problem with traditional synthesis is in area estimation. Typically, the tools try to optimize only the total gate area, and the interconnect area and the routabilitv of the chip are not taken into account. As a result, although the total gate area of the synthesized netlist is quite small, it may not fit into the target die area after layout. In recent years, [4, 6, 5, 7, 8] attack the fanout optimization problem after layout information is available. In [4], a fanout optimization algorithm based on alphabetic trees is presented that generates fanout trees free of internal edge crossings thus improving routing area. In [5], buffer insertion based on a minimum spanning tree is proposed. In [6]. a polynomial time algorithm using dynamic programming is proposed for delay-optimal buffer insertion problem on a
t S I (Critical)
S l(Critical) h
Source (a) Minimum-Delay Buffered Tree
*This work is partially supported by National Science Foundation Young Investigator Award MIP9357582 and a matching grant from Intel Corporation.
S2
Source 4
(b) Minimum-Delay Tree Followed by Buffer Insertion
Figure 1. Example of Buffered Steiner Tree
1
S4
In this paper, we presents an algorithm for interconnect layout optimization with buffer insertion. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm finds a buffered Steiner tree so that the required arrival time (or timing slack) at the source is maximized. In the algorithm. Steiner tree construction and buffer insertion are achieved simultaneously by combining A-tree algorithm[10] and dynamic programming based buffer insertion algorithm[6]. Extensive experimental results indicate that our approach outperforms conventional two-step approaches. Our buffered Steiner trees increase the timing slack at the source by up to 75% compared with those by the conventional approaches. 2.
Hereafter, it is assumed that only one type of buffer is considered for the buffer insertion, and signal polarity is neglected. Our algorithm, however, is easily extended to general case, where more than one types of buffer can be used and signal polarity must be considered, by using the methods similar to those in [7, 8]. 3. Related Work We briefly review the A-tree algorithm in [10] and the buffer insertion algorithm in [6], which are basis of our proposed algorithm. 3.1. A-tree Algorithm In [10], it was shown that a routing tree which minimizes the Elmore delay upper bound in [20] can be achieved by minimizing a weighted combination of the objectives of the minimum Steiner tree, the shortest path tree, and the "quadratic minimum Steiner tree" (a tree that minimizes the summation of source-node path lengths, taken over all possible node locations). Therefore, a minimum-cost rectilinear arborescence(A-tree) formulated in [21] is of interest since it heuristically addresses all of these terms in the decomposed upper bound at once.
Delay Models and Problem Formulation
2.1. Delay Models As in most previous works on interconnect layout optimization, we adopt the Elmore delay model[17] for interconnects and standard RC models for buffers. For wire e, let l, c, and r, be its length, capacitance and resistance, respectively. Further, let e, denote the wire entering node v from its parent. We use the following basic models for interconnects delay Dwire and buffer delay DbSff: ce = cole
Definition 1: A rectilinear Steiner tree T is called an A-tree if every path connecting the source so and any node p on the tree is a shortest path.
re = rOle
Dwire(ev) = r.,j(
In [10], an efficient algorithm based on bottom-up tree construction from the sinks was proposed for minimum-cost A-tree, which extends the algorithm in [21]. The algorithm starts with a set of subtrees, each consisting of a sink, and iteratively performs two subtrees "merging" or a subtree "growing" until all subtrees are merged into one tree. Two type of move is used for the bottom-up construction: safe move which cannot worsen the sub-optimality of an existing set of subtrees and heuristic move that may not lead to an optimal solution. According to their experimental results, A-trees constructed by the algorithm are at most 4% within the optimal, and achieve interconnect delay reduction by as much as 66% when compared to the best-known Steiner routing topology. In our approach here, we use only heuristic move in the A-tree algorithm for simplicity(essentially the algorithm in [21]). Despite using only heuristic moves, [21] has similar performance as the A-tree algorithm in [10]. The algorithm in [21] works as follows: A set called ROOT consisting of the roots of current subtrees which will eventually be merged to form the solution is maintained; Initially, ROOT contains the roots of n trivial trees, each consisting of a single sink. The algorithm then iteratively merges a pair of roots such that the "merged" root is as far from the source as possible, and terminates when
- + c(Tv))
2
Dbuff(b, ci) = db + rbCi,
where co and ro are capacitance and resistance for unit length wire, respectively, c(T,) is the lumped capacitance of subtree T, rooted at v, db and rb are buffer b's intrinsic delay and output resistance, respectively, and cl is the load on buffer b. When wire e is very long, we can divide e into a sequence of wires connected by degree-2 nodes to capture the distributed nature of the interconnect delay. Note that we assume wires are of a uniform width. Wiresize optimization can be carried out in a separate step after the buffered tree construction using the algorithm in [18, 19] or during the buffered tree construction as mentioned in Section 6. 2.2. Problem Formulation We use required arrival time as our optimization objective. The required arrival time at the root of tree T., denoted q(Tv), is defined as follows: q(Ti,) =
E
(qn
uE'zks(TO,
-
delay(v, u)),
where qu is the required arrival time of sink u, sinks(Tv) is a set of sinks of tree T, and delay(u, v) is delay from v to u defined by our delay models. This measure is useful since it is a typical objective when optimizing the performance of combinational networks. If we assume the signal arrives at the root of T at t = 0, the timing requirements are met when q(T) is non-negative. The buffered Steiner tree problem for delay minimization is stated as follows:
ROOT1 = 1.
More formal description of the algorithm is shown in Figure 2, where all sinks are assumed lie in the first quadrant with so at the origin for simplicity. But it is easy to extend the algorithm to the general case. 3.2. Buffer Insertion For given required arrival times at the sinks of a given Steiner tree, the buffer insertion algorithm in [6] chooses the buffering position on the tree such that the required arrival time at the source is as late as possible, where the delay is calculated based on the definition in Section 2. The algorithm assumes that the the topology of the routing tree (or Steiner tree) is given, as well as the possible (legal) positions of the buffers.
Given: A source so and sinks S1, S2 .s.. ,S, of a signal S. with given positions and a required arrival time associated with si (1 < i < n). Find: Steiner tree T, that spans S and has buffers inserted. Objective: Maximize q(Ts 0 ).
2
Procedure HeuristicAtree() ROOT - {sj I 0 < i < n}; while IROOTI > 1 do Find v, w E ROOT such that the sum min(vx, wt) + min(vy, wy) is maximum; ROOT - ROOT + {r} - {v} - {w}, where r is a node with coordinates (min(v,, w~),rmin(v,, wy)); Merge T, and Tut to T, adding edges from r to v and w, respectively; end while; end procedure
Procedure bottom.up(T) foreach v G T in topological order from sinks to source do if v is a sink then Z-
(qv - Dire(ev), c, + cej;
else ZI
a set of options for v's left child;
Zr a set of options for v's right child; Zv - ; for (z E Z2 , j E Z,) do /* redundant Merge of Z1 and Z,2/ if qj < qj then Zv Zv U (q,, ci + min{cj I gi < qI); end if; end for;
Figure 2. A-tree Algorithm Using Heuristic Move
Zv -
Zv U (maxZEz.(qz - Dbsff(bcZ)), Cb);
for z G Z, do
qz - qz -Dwjre(ev);
In the algorithm, which is based on dynamic programming technique, a set of (qj, ci) pairs is maintained for possible buffers assignment at each legal positions of the buffers, where qj and ci are the required arrival time and the capacitance of dc-connected subtreel rooted at i corresponding to q, respectively(Figure 3). Note that ci is not the total capacitance of entire subtree rooted at i. Each pair is called an option. The algorithm consists of two phases as follows. During the first phase the function "bottom-up(" in Figure 4 computes the irredundant set of all possible options 2, Zv for each node v(or legal positions of the buffers) in the tree in bottom up manner(Figure 5(a)) 3 . For the options at the root of the entire tree, the actual delay is calculated, using the output resistance Rgyte of the gate which produces the signal: q= go-Rguteco, qrco and then the option which gives the maximum q,,,... is chosen. The second phase traces back the computations of the first phase that led to this option, and determines the computed buffer positions on the way (Figure 5(b)).
CZ E CZ + cc; end for; end if; end for; end Procedure; Figure 4. Algorithm Finding a Set of Options
Tv
TO
eler ZIl -A
M~ix(qORgaticO)
eer At
At
I
l
bottom up TI
qsOurc
I
>Rtb Zr
top down r
(a) Option Calculation in Bottom-up Phase
TIT (b) Buffer Insertion in Top-Down Phase
Figure 5. Illustration of buffer insertion
ce
4.
Sink
Simultaneous Steiner Tree Construction and Buffer Insertion
4.1. Basic Idea of the Proposed Approach We develop an algorithm for simultaneous Steiner tree construction and buffer insertion, called buffered A-tree (BAtree) algorithm, by combining the A-tree and buffer insertion algorithms in Section 3. In such combination, the concept of critical path isolation(Figure 7(a)) and balanced load decomposition(Figure 7(b)) are also applied, which are techniques used for fanout optimization(or buffer insertion) in logic synthesist, 2, 3]. In logic synthesis, when one or several sinks are timing-critical, the critical path isolation tech-
Figure 3. An Option at the Root of Subtree T, In the algorithm in [6], candidate points for the buffer insertion are right after the Steiner points in the tree, which makes it possible to unload the critical path as much as possible(Figure 6(a)). In our implementation, we also make each Steiner point itself be a candidate(Figure 6(b)), in addition to the points right after the Steiner points, in order to reduce the number of buffers inserted. Moreover, an edge whose length is longer than certain threshold given by user is divided in order to make it possible to insert buffer in the middle of the wire(Figure 6(b)).
I' hi
7 i, ii'h'
l "dc-connected" means "directly connected by wires'. 2 Irredundant set has no two options (q, c) and (q', c') such that q > q' and c < c' [6]. 3 For simplicity, a binary tree is assumed here, but the algorithm is easily applied to general trees by addition of dummy nodes and 0 length wires[8]. Node which has only one child, where Z, or Zr are NULL in Figure 4, can be also treated by a simple extension.
AT
(a) Candidates for Buffer Insenion Points in 161
AT,rt
(b) Candidates for Buffer Insertion Points in Our Implementation
Figure 6. Candidate Points for Buffer Insertion
3
nique generates a fanout tree so that the root gate drives the critical sinks and a smaller additional load due to buffered non-critical paths. On the other hand, if required times at sinks are within a small range, balanced load decomposition is applied in order to decrease the load at output of root gate. These transformations are applied recursively in a bottom-up process from the sinks in the same manner as the A-tree and buffer insertion algorithms. Therefore, it is natural for us to apply these techniques in combination with the A-tree and buffer insertion algorithms.
Tv V.
ZV ev . y
ew
Source
-- -
Zw
Tw
(xu, yw)
Trv y) --
01
Figure 8. Evaluation of a Merged Subtree Definition 2: The maximum possible required time at the root r of subtree Tr generated by merging of T, and T., denoted R.., is defined as follows: (a) Cntical Signal Isolation
R-
(b) Balanced Load Decomposition
Figure 7. Fanout Optimization in Logic Synthesis
The maximum R'. among all possible Definition 3: merging pairs v and w in the set of roots ROOT of the current subtrees, denoted Rmz(ROOT), is defined as follows:
Rmai(ROOT) =
R_
Definition 4: The distance between the source and the merging point for v and w, denoted D_, is defined as follows: Dw = min(v,, w,) + min(v,, w,). This definition is for the case that v and w are in the first quadrant with so at the origin. Other cases can be defined in a similar way. Definition 5: The maximum D_ among all possible merging pairs v and w in the set of roots ROOT of the current subtrees, denoted Dmax(ROOT), is defined as follows:
2. Merge T, and T. to Tr, and compute a set of options at r by bottom.up(Tr). 4.2. Selection of Roots to be Merged in BA-tree In our algorithm, the computation of options and tree construction are performed simultaneously. Suppose that subtrees T, and T. are merged into Tr as shown in Figure 8. Let Zv and Z. be the sets of options at v and w, respectively computed in the previous steps. Based on Z,, Zw, dist(r, v), dist(r,w), and buffer b's characteristics, a set of options Zr at r are temporarily computed for evaluation of the best merge. Since the parent nodes of the current subtree's roots, v and w, are not determined yet at this stage, 1,, and 1,. were assumed to be 0 in the computation of Z, and Z., respectively. In the temporary computation of Zr, we update Z, and Z. using lev = dist(r, v) and le = dist(r, w) when computing the arrival time at r with the assumption that 1,r = dist(so, r). Note that dist(so,r)
Dmax(ROOT) =
Dvw.
max v,wEROOT
Now, we can define the merging cost for v and w. Definition 6: The merging cost for v and w, denoted mcost(v, w, ROOT), is defined as follows: mcost(v, w, ROOT) = Rvw Rmax(ROOT)
Dvw Dmoz (ROOT)'
where a is a fixed constant with 0.0 < a < 1.0. Note that instead of using a * R_ + f * D_, for the cost, we use the scaled objective above. The use of the scaled objective avoids the problem of choosing a different pairs of a and Qfor each instance. For the subtrees merging in BA-tree algorithm, we select T, and T. whose mcost(v, w, ROOT) is maximum among
,r.
We introduce the following definitions before describing how to select two subtrees to be merged in BA-tree construction. 4
max v,wEROOT
1. Select v and w with taking critical path isolation and balanced load decomposition into account.
1
ZCZr
where r is the merging point of T, and T., and Zr is a set of options at r.
In our approach, the concepts of critical path isolation and balanced load decomposition are used when choosing two subtrees (T, and T.) to be merged in the A-tree algorithm. Every pair of subtree roots v and w are evaluated by computing the required time at the root of subtree Tr, which results from merging of Tv and T.. Then, the best pair for merging is chosen so that critical path isolation and balanced load decomposition are achieved(See Section 4.2). The required times at the root of Tr is calculated based on 4 the options at v and w, dist(r, v) and dist(r, W) for the interconnect delay, and the effect of buffer insertion at r. For the evaluation, we keep a set of options at each of subtree's roots by using bottom-up() during the construction of A-tree. Basically the following two steps are iterated in BA-tree algorithm.
is an upper bound of
= max qz,
dist(v, w) denotes Manhattan distance between v and w
4
all possible pairs of subtrees. Clearly, if we set a = 0.0, our root selection criteria for merging is the same as that in the A-tree algorithm presented in Section 3.1. By using mcost in the A-tree construction, required time maximization with buffer insertion(critical path isolation and balanced load decomposition) and wire length minimization can be achieved simultaneously. The second term in mcost contributes to the wire length minimization as the original A-tree algorithm. The first term contributes to the critical path isolation and balanced load decomposition as the fanout optimization in logic synthesis. When one or several sinks are timing-critical, those sinks are isolated since the merging for those sinks, whose R are smaller than the others, will be applied in the later stage. Figure 9(a) shows an example for this case, where sink SI is the most critical among all the sinks. Sink Si will be isolated since the merging for si, whose R is smaller than the others, will be applied after S 4 , s 3 , and 52 are merged. On the other hand, if required times at sinks are within a small range, the merging will be performed so that the load is balanced, since R of the merging for those sinks are also within a small range. Figure 9(b) shows an example for this case, where required times at sinks SI, S2, S3, ands 4 are within a small range. The load will be balanced, since R of the merging for the sinks are within a small range.
Procedure BA-tree-bottomup() ROOT E {si I 0 < i < nj; foreach v E ROOT do bottom-up(v); /* Zv is computed for each sink '/ end for; while IROOTI > 1 do Find v, w E ROOT with max, c-EROOT mcost(v, w, ROOT); /* Z, is temporarily computed for its evaluation*/ ROOT - ROOT + {r} - {v} - {w}, where r is a node with coordinates (rnin(vr, w,), min(vy, wy)); Merge T, and T, to T, adding edges from r to v and w, respectively; bottom-up(Tr); /* Z,,Z,,Zw are re-computed here with pruning */ end while; end procedure
Figure 10. Algorithm for Simultaneous A-Tree Construction and Option Computation region, and we evaluated the average results. The loading capacitances and required times at the sinks are also
randomly chosen from the intervals [0.05pF, 0.15pF] and [5.0ns, 10.0nus], respectively. The parameters used in the experiments are summarized in Table 1.
Psi
Table 1. Parameters for Experiments Output Resistance of Gate Output Resistance of Buffer Intrinsic delay of Buffer Wire Resistance Wire Capacitance Loading Capacitance of Sink Loading Capacitance of Buffer Required Time at Sink
Source (a) Tree with Cntical Sink Isolation
(b) Tree with Balance Load Decomposition
Figure 9. Example of BA-tree 4.3.
Cb
q,
1000Q 800Q 0.lns 0.12Q/ttm 0.15fF/jlm 0.05pF - 0.15pF 0.05pF 5.Ons - 10.0ns
We compared results obtained by the following two methods:
Overall Algorithm
The algorithm consists of two phases in the same way with the buffer insertion[6]: bottom up tree construction with option computation and top down buffer insertion. Formal description for the first phase, bottom up tree construction with option computation, is shown in Figure 10. Option computation at each subtree's root by bottom up() and mcost(v, w, ROOT) evaluation at the merging are integrated into A-tree algorithm. The second phase, top down buffer insertion, is the same with the one in the buffer insertion[6]. The option which gives the maximum required time at root is chosen, then traces back the computations of the first phase that led to this option. During the backtrace, the buffer positions are determined.
Ml: A-tree[21] followed by buffer insertion[6]. M2: BA-tree construction(s in mcost: 0.2, 0.4) Table 2 shows average required times at the sources of the buffered Steiner trees generated by the two methods. The difference of the required time is increased as the number of sinks is increased. Although the difference is not so large for nets with 10 sinks, the required time at source of BAtree is larger than that by Ml by 49% with a = 0.2 and 75% with a = 0.4 for nets with 100 sinks.
Table 2. Required Time at Source(ns) #sinks
5.
Rgate rb db ro c0 cg
Experimental Results
We implemented BA-tree on a Sun SPARC 5 workstation under the C/UNIX environment, and tested it on signal nets with 10, 25, 50, and 100 sinks5 . For each net size, 100 nets were randomly generated on a 10mm x 10mm routing
M2(a : 0.2)
M2(a : 0.4)
10
3.051.00
Ml
3.07 (1.01)
3.10 (1.027
25 50 100
2.22(l.00) 1.65(1.00 0.88(1.00-
2.29 (1.03) 1.80 1.09) 1.31 1.49)
2.37 (1.07) 1.94 1.18 1.54 (1.75)
Table 3 shows average runtimes, which is increased due to the merging pair evaluation by 1.5 times (10 sinks) to 40 times (100 sinks) in BA-tree.
'The number of sinks in signal nets before buffer insertion is usually up to 100 and most of them are less than 25.
5
-
#sinks 10 L 25 50 100
"A [3] K. J. Singh and A. Sangiovanni-Vincentelli, Heuristic Algorithm for the Fanout Problem," Proc. ACM/IEEE Design Automation Conf., 1990, pp. 3 5 7 360. [4] H. Vaishnav and M. Pedram, "Routability-Driven Fanout Optimization," Proc. ACM/IEEE Design Automation Conf., 1993, pp.2 3 0 - 23 5 . [5] L. N. Kannan, P. R. Suaris, and H. G. Fang, "A Methodology and Algorithms for Post-Placement Delay Optimization," Proc. ACM/IEEE Design Automation Conf., 1994, pp.3 27 -33 2 . [6] L.P.P.P. van Ginneken, "Buffer Placement in Distributed RC-tree Networks for Minimal Elmore Delay," Proc. IEEE Int. Symp. Circuits Syst., 1990, pp. 86 5 -868. [7] J. Lillis, C. K. Cheng, and T. T. Lin, "Optimal and Efficient Buffer Insertion and Wire Sizing," Proc. IEEE Custom Integrated Circuits Conf., 1995, pp. 25 9 -26 2 . [8] J. Lillis, C. K. Cheng, and T. T. Lin, "Optimal Wire Sizing and Buffer Insertion for Low Power and a Generalized Delay Model," Proc. IEEE Int. Conf. ComputerAided Design, 1995, pp. 1 38 -1 43 . [9] D. Zhou, F. P. Preparata, and S. M. Kang, "Interconnection Delay in Very High-Speed VLSI," IEEE Trans. Circuits Syst., 38(7), pp. 77 9 -7 90 , July 1991. [10] J. Cong, K. S. Leung, and D. Zhou, "PerformanceDriven Interconnect Design Based on Distributed RC Delay Mode," Proc. ACM/IEEE Design Automation Conf., 1993, pp.6 0 6 -611. [11] J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong, "Provably Good Performance-Driven Global Routing," IEEE Trans. Computer-Aided Design, 11(6), pp. 73 9 -752, June 1992. [12] C. J. Alpert, T. C. Hu, H. Huang, and A. B. Kahng, "A Direct Combination of the Prim and Dijkstra Constructions for Improved Performance-Driven Routing," Proc. IEEE Int. Symp. Circuits Syst., 1993, pp. 186 9 -1 8 72 . [13] J. P. Cohoon and L. J. Randall, "Critical Net Routing," Proc. IEEE Int. Conf. Computer Design, 1991, pp.l 7 4-177. [14] K. D. Boese, A. B. Kahng, B. A. McCoy, and G. Robins, "Rectilinear Steiner Trees with Minimum Elmore Delay" Proc. ACM/IEEE Design Automation Conf., 1994, pp.3 81 -3 86 . [15] K. D. Boese, A. B. Kahng, B. A. McCoy, and G. Robins, "Near-Optimal Critical Sink Routing Tree Constructions," IEEE Trans. Computer-Aided Design, 14(12), pp.1417-1436, Dec. 1995. [16] X. Hong, T. Xue, E. S. Kuh, C. K. Cheng, and J. Huang, "Performance-Driven Steiner Tree Algorithms for Global Routing," Proc. ACM/IEEE Design Automation Conf., 1993, pp. 177-181. [17] W. C. Elmore, "The Transient Response of Damped Linear Network with Particular Regard to Wideband Amplifier," J. Applied Physics, 19, pp. 55-63, 1948. [18] J.Cong and C.-K.Koh, "Simultaneous Driver and Wire Sizing for Performance and Power Optimization," IEEE Trans. VLSI, 2(4), pp.408-423, Dec. 1994. [19] J.Cong and K.S.Leung, "Optimal Wiresizing Under the Distributed Elmore Delay Model," IEEE Trans. Computer-Aided Design, 14(3), pp.3 2 1 -336, Mar. 1995. [20] J. Rubinstein, P. Penfield, and M. A. Horowitz, "Signal Delay in RC Tree Networks," IEEE Trans. ComputerAided Design, 2(3), pp.202-211, 1983. [21] S.K. Rao, P. Sadayappan, F.K. Hwang, and P.W. Shor, "The Rectilinear Steiner Arborescence Problem," Algorithmica 7, pp.27 7 -288, 1992.
Table 3. Run Time(s) M1 M2(a: 0.2) 1 M2(o : 0.4) 0.03 1.5) 0.03 (1.5) 0.02(1.00) 0.03(1.00) I 0.16(5.3) - 0.15(5.0) 0.06(1.00) 1 1.02(17.0) 1 1.01(16.8) 0.18(1.00) 1 7.18(42.2) - 6.95(38.6)
Table 4 shows wire length, which is increased by 0% (10 sinks) to 7% (100 sinks) with a = 0.2 and 5% (10 sinks) to 28% (100 sinks) with a = 0.4.
#sinks 10 25 50 100
Table 4. Wire Length(mm) 0.4) M2 ( Ml M2 a: 0.2) 2.5821.00 .69(1.05) .57-(1.00) 4.32(1.02) 4.70(1.11) 4.25(l.00) 6.08(1.00) 6.29(1.03) 7.17(1.18 8.64(1.00) 9.23(1.07) 11.0o(1.28)
Table 5 shows the number of buffers inserted, which is also increased by 0% (10 sinks) to 8% (100 sinks) with a = 0.2 and 0% (10 sinks) to 15% (100 sinks) with a = 0.4. Note that minimization for the number of buffers as in [6] is not considered here. Therefore, redundant buffers might be included in the results.
#sinks 10
Table 5. #Buffers Inserted M1 M2(a: 0.2) M2(a: 0.4) 8(1.00) 8 1.00) 8(1.00)
25
18(1.00)
18(1.00)
18(1.00)
50 100
31(1.00) 53(1.00)
32(1.03) 57(1.08)
33(1.06) 61(1.15)
Through Table 2 to 5, tradeoff between the required time, wire length and number of buffers can be seen with the different parameter a. 6. Conclusions In this paper. we have presented an algorithm, BA-tree, which derives buffered Steiner tree so that the required arrival time at the source is maximized. The algorithm achieves Steiner tree construction and buffer insertion simultaneously, while these two steps were carried out independently in the past. We have shown its efficiency and effectiveness experimentally. Future work will include the total capacitance minimization and their trade-off with the required time at the source. We also plan to incorporate optimal wiresizing for further delay optimization. Our preliminary study shows that all these optimization techniques can be combined in the bottom-up dynamic programming paradigm employed in this paper. Interested readers may contact the authors for the follow-up work. References [1] C. L. Berman, J. L. Carter, and K. F. Day, "The fanout problem: From theory to practice," Advanced Research in VLSI: Proc. 1989 Decennial Caltech Conf., pp.69-99, 1989. [2] H. J. Touati, C. W. Moon, R. K. Brayton, and A. Wang, "Performance Oriented Technology Mapping," Proc. sixth MIT VLSI Conf., pp.79-97, 1990.
6
Simultaneous Routing and Buffer Insertion for High Performance Interconnect John Lillis, Chung-Kuan Cheng Dept. of Computer Sci. & Engr.
Ting-Ting Y. Lin Dept. of Elect. & Computer Engr.
University of California. San Diego La Jolla. CA 92093-0114
Abstract We present an algorithm for simultaneously finding a Rectilinear Steiner Tree T and buffer insertion points into T. The objective of the algorithm is to minimize a cost function (e.g., total area or power) subject to given timing constraints on the sinks of the net. An interesting side-effect of our approach is that we are able to derive an entire cost/delay tradeoff curve for added flexibility. The solutions produced by the algorithm are optimal subject to the constraint that the routing topology be induced by a permutation on the sinks of the net. We show that high quality sink permutations can be derived from a given routing structure such as the Minimum Spanning Tree. This derivation provides an error bound on the minimum area solution induced by the permutation. The effectiveness of our algorithm is demonstrated experimentally.
the generalization of area minimization subject to timing constraints. Also of interest is the approach in [12] where the authors derive fanout trees from a sink permutation. However, [12] did not consider area overhead or optimize the topology embedding. Recently, [7] gave an efficient implementation of this generalization (and minimization of power) and also incorporated a generalized buffer delay model taking signal slew into account. Like the P-Tree algorithm, this work also computes a cost/delay tradeoff curve. Since both the P-Tree algorithm and typical buffer insertion algorithms adopt -a bottom-up dynamic programming approach, it is natural to attempt simultaneous optimization by both techniques. This is the topic of this paper. The remainder of the paper is organized as follows. Section 2 introduces necessary concepts and definitions; Section 3 gives details of our algorithm: Section 4 discusses experimental results and we conclude in Section 5.
1
Introduction In recent years, interconnect delay has become an increasingly critical factor in VLSI systems, in some cases accounting for over 50% of overall delay. This trend is a result of the increased resistance of interconnect when feature sizes enter the sub-micron range and will become more dramatic in the future. Two promising techniques for improving interconnect performance are the topic of this paper: performance driven routing and buffer insertion. Previous work in performance driven routing includes [1], [3], [4] and [2]. Recently, in [9], the P-Tree performance driven routing algorithm was proposed. The key idea behind the P-Tree algorithm is restricting the solution space by a permutation constraint on the sinks of the given net; in other words, given such a sink permutation, only routing topologies which can be induced by that permutation are considered. As a result, the problem is sufficiently constrained to allow a pseudo-polynomial dynamic programming algorithm solving the problem of minimizing area subject to timing constraints on the sinks of the net under the Elmore delay model [10]. The algorithm also computed an entire cost/delay treadeoff curve. This approach has yielded impressive results in both area overhead and delay versus previously proposed methods. In the area of buffer insertion, van Ginneken [13] presented an efficient algorithm for inserting buffers into a given static routing topology so as to maximize the required arrival time at the root of the tree and sketched
2
Preliminaries
2.1 Delay Models Throughout this paper we use the Elmore delay model to model interconnect delay and a simple RC delay model for buffers and drivers. In the Elmore model, the delay of a wire segment e = (u, v) transmitting a signal from node u to node v is defined as follows. Let r, and ce be the resistance and capacitance of e respectively. Further, let c(Tv) be the capacitive load at node v. The delay of the segment is expressed as ret 2 + c(Tv)). Similarly, the delay of a buffer b at node v is determined by c(Tv). the capacitive load at v, and b's intrinsic (load independent) delay db and output resistance rb. The delay through the buffer with load cl on its output is db + rbCl
We note that a more accurate buffer delay model taking signal slew into account can be incorporated by the techniques presented in [7] and [8]. For simplicity, we do not present those techniques here.
7
2.2 Definitions and Problem Formulations Central to the algorithm we present are the concepts of the Grid Graph of a terminal set and the notion of a topology being induced by a pin permutation.
Algorithm: MST-tohierarchv Let Tm be a rectilinear Minimum Spanning Tree Vv E Tm, let h(v) be a single node tree labeled v Repeat n - 1 times 1. select a leaf node v and its parent u in Tm 2. delete edge (u, v) from Tm 3. replace h(u) with a new tree t where t.left= h(u) and t.right= h(v) return last tree formed
Definition 2.1 Grid Graph [5]: given a set of terminals N, N 's Grid Graph GG(N) = (V, E) is defined by the following process: Construct vertical and horizontal lines through each terminal. Let V be identified with the set of intersection points of these lines.
Figure 1: Constructing Hierarchy Consistent with MST
There is an edge in E between two vertices iff the corresponding intersection points are connected by a single horizontal or vertical segment.
3.1 Finding High Quality Permutations We adopt the technique proposed in [9] to construct a sink permutation which we summarize here (the reader is referred to [9] for further details). The method is broken into three phases: (1) construction of a hierarchical decomposition of the terminals consistent with the Minimum Spanning Tree, (2) reorienting the hierarchical structure such that the driver is attached to the root while maintaining consistency and (3) application of a dynamic programming algorithm to optimize the tour length of-the induced permutation. The first phase is illustrated in pseudo-code in Figure 1. It was shown in [9] that the hierarchy produced by this algorithm (and and any reorientation of it) is consistent with the MST. By consistency, we mean that any permutation derived by a depth first traversal of the hierarchy can induce the MST itself. This is a useful property since it ensures that the minimum area routing topology induced by the permutation is no worse than 50% larger than the optimal rectilinear steiner tree spanning the points [6]. Among the possible permutations produced by a depth first traversal, we select the one with minimal tour length. Finding this permutation can be done in 0(n4 ) time by dynamic programming [9]. The intuition is that tour length minimization should lead to good clustering characteristics in the permutation. We illustrate this process in Figure 2. In Fig. 2(a) we see an MST for the point set with node e designated at the driver: in 2(b), we see a hierarchical decomposition consistent with the MST; in 2(c), we see the reoriented hierarchy and the possible permutations derived from the hierarchy along with their tour lengths. The minimum tour-length permutation in Figure 2 is "d c b a". To give some insight into the next phase of the algorithm and Formulation 2.1, we show in Figure 3(a) an abstract topology induced by the permutation and in Fig. 3(b) an embedding of that topology into the routing graph (which gives the minimum area Rectilinear Steiner Tree for this case).
Definition 2.2 Permutation Induced Abstract Topology: Consider a terminal set N and a permutation wron the sinks of N. A binary tree T is an abstract topology induced by 7r if its leaves are identified with the terminals in N and it obeys the ordering imposed by wr when T is interpreted as a binary search tree (the driver being implicitly attached to the root). Definition 2.3 Abstract Topology Embedding: Given a abstract topology T (as a binary tree), leaves identified with the terminal set N and a target graph G = (V, E) (e.g., G = GG(N)), an embedding of T into G is a mapping of the internal nodes of T to V. We use the term "abstract topology" to emphasize that such a topology is not a true routing topology in that its internal nodes are not mapped. Only when such a topology is embedded in the plane or a routing graph such as GG(N), does a physical routing topology result. Given this framework, we solve the following problem: Problem 2.1 Given terminal set N, required arrival times for each sink, driver parameters, buffer parameters and sink permutation -r, find the minimum cost routing topology induced by 7r and embedded in GG(N) possibly with buffers inserted at prescribed points where all timing requirements are satisfied. Cost may be a combination of the contribution of inserted buffers and consumed routing resources. For instance, one may wish to minimize the dynamic power dissipation of the net, in which case cost is the total capacitance associated with the solution.
3
Algorithm
In describing our algorithm for simultaneous routing and buffer insertion, we first describe the somewhat independent phase of finding a good sink permutation. Next we describe the algorithm solving Formulation 2.1 by (1) describing the nature and properties of the solutions sets we compute by dynamic programming, (2) giving some important primitives for manipulating those solution sets and (3) sketching the entire algorithm in terms of the primitives.
3.2 Nature of Solution Sets In the following we refer to the i'th sink in the given permutation 7w as sink i. Further, we will assume that our cost metric is total capacitance which corresponds to dynamic power dissipation [11]. The algorithm can be adapted for area minimization by ap-
8
c(14,6) C
(p, c, q) E S(v, i, j)
-
(p, C,q) E Sb(v, i, j)
-
3 routing tree rooted at vertex v, spanning sinks i..j, with cost p. load c and required time q. 3 routing tree rooted at vertex v, spanning sinks i..j, with cost p, load c and required time q and v is a branching point.
, Id(1.4)
.,(O.3)
, M5.i1)
c di2.O)
W~
(b)
1
.,
PERM
TOUR LEN
c4db dc-b cdb. dcb.
24 26 2(0 19
In [13] and [7], the following pruning property was used to keep solution sets as small as possible. Property 3.1 Solution (p, c, q) in solution set S is sub-optimal if 3 solution (p', c', q') E S where p' < p, c' < c and q' > q (in the case where all parameters are equal, either may be discarded). An interesting special case of this property is when all p's are equal (or we are optimizing performance independent of cost). In such a case, we have the property that a solution set with all sub-optimal solutions discarded can be arranged in strictly increasing order of both c and q. We refer to such sets as cq-sets. In [7] it was proposed that solution sets be organized first by p; i.e., one would partition the sets into cq-sets with identical p values. For such sets we maintain the invariant that they are arranged in increasing order of c and q. For a solution set S. it will be useful to refer to the cq-set associated with p; we do so by S[p]. As will be discussed in the next section, organizing the solutions in such a manner allows efficient detection of Property 3.1. 3.3 Primitives We now describe three useful primitives for manipulating cq-sets and solution sets: join-cq-sets(, augment.soln-set() and join-soln-sets(. The routine join-cq-sets(Cj, C,) takes left and right cq-sets of a vertex and produces the optimal cq-set at that vertex. This is done in a linear time process by similar to merging sorted lists by starting with the minimum load pairs and advancing the critical (this technique was used extensively in [13] and [7]). Pseudocode appears in Figure 4.
(C)
Figure 2: Finding a sink permutation
0 .
o.
....-.
.
0 0
d
C
b
(a)
(b)
Figure 3: Abstract Topology and an Embedding propriately weighting the cost of routing and logic resources. For simplicity, we present the algorithm two assumptions: (1) the buffer library does not contain inverters and (2) buffer insertion points are only at branching points. The algorithm can be easily adapted to eliminate these assumptions. Consider a routing tree rooted at a vertex v of GG(N and spanning sinks i..j (possibly containing buffers). Such a tree is characterized by three parameters:
While (i < ICl] and j < IC11) Let (cl,q1) = Ci[i]
p: the total capacitance of the tree.
Let (c2,q2) = C [j] C - C U {(cl + c2, min(ql, q2))}
c: the capacitive load of the tree at v.
If (qi <
q: the required arrival time at v.
q2)
i+1 If (q2 < q)
/* Ci Critical */
i-
Intuitively, p is the cost of the tree, c is the load presented upward by the tree and q gives the timing characteristics of the tree. In a situation where there have been no buffers inserted into the tree, p = c. Thus, it is by these three parameters which we characterize a routing sub-solution. Our approach is to inductively compute, in bottom up fashion, sets of (p, c, q) triples. We compute the sets S(v, i, j) and Sb(V, i, j) which have the following intuitive meaning:
/* C, Critical */
rtr iC+ return C.
Figure 4: Primitive join cq sets(S1, S2 ) The routine augment-soln-set(S, 1) is used to extend single-stem solutions by an incoming wire of length 1.
9
We examine each (p, c, q) E S and add to c the capacitance of a wire of length I and subtracts the delay of such a wire from q to give (p', c', q') as
p' = p + cl,
c' = c + cl,
Let B' = B u {s} where 9pis a "non-buffer" Sort the set F = {pI + pr + Cb pP E Si,pr E S,. b For each pi + p, + cb E F in order: [pi], SIp[P]) S - join cq sets(Sp if b $ 5 Find (c, q) E S s.t.
q' = q - di
where di indicates the Elmore delay of a wire of length I with load c. A fundamental operation in [7] was to take solution sets Si and Sr from a node v's left and right children and produce a new set S of solutions at v where a solution in S may also be buffered at v. Additionally, we must apply Property 3.1 to keep S as small as possible. This operation will also be fundamental in the computation of Sb. Letting B represent a buffer library, we use primitive join-soln-seis(SI, Sr, B) to represent this operation. Its implementation follows that of [7] and we sketch the key points here. An unbuffered solution (p, c, q) E S is created from a pair of solutions (pi, cl, q ) E Si and (Pr, cr, qr ) E Si where
Figure 5: Pseudo-code for joZn-soln-sets(S, S r)
Given: GG(N) = (V, E) Vv l. Compute S(v, i, i) 2. For I= 1..n -2 3. For i = 1..n-1-I
4.
e
V, I < i < n
j =i+I
Compute Sb(V, i, j) VV E V Compute S(v, i, j) Vv E V using results of step 5 7. S(vd, 1, n - 1) now gives the sub-solutions to be paired with the driver.
5. 6. and
Figure 6: High-Level Algorithm
Similarly, letting db, Cb and rb be the intrinsic delay, input capacitance and output resistance of buffer b e B, a solution (p, c, q) with buffer b at the root is created from a pair of solutions (pi, cl, qj) E Si and (Pr, cr, q,) E Si where
time at sink i. Since S is a generalization of Sb, we first compute Sb(V, i, j) for all v and from this we compute S(v, i j). When the algorithm terminate we have stored in S(vd, 0, n - 1) the optimal solution set at the output of the driver (where the driver is located at vertex Vd). For each (p, c, q) E S(Vd, 0, n - 1) we have an overall solution with cost p and required arrival time q-(rdc) where rd is the output resistance of the driver. The result is an entire cost/delay tradeoff curve. We propose that such a curve is useful since such net optimizations must be considered in the context of the entire circuit. For instance, a higher level tool can use such a tool to determine the marginal benefit of optimizing one net versus another or how aggressively to optimize one net before moving to another. We first sketch how to compute S(v, i. j)Vv once is computed Vv. We proceed in four Sb(V, i,j) phases, computing the following intermediate solution sets as we go (recall this is for a fixed i, j): LS(v): the solution set where trees are rooted at v with branching point v' constrained to be at v or to v's left v's row. the solution set where trees are rooted at RS(v): v with branching point v' constrainted to be in the same row as v. US(v): the solution set where trees are rooted at v with branching point v' constrained to be in v's row or a row above v (up from v). Once US(v) has been computed, we compute S(v, i, j)
P = pi + Pr + cb, and
q = min(qi, q,)
-
db
-
rb(CI + Cr).
Thus. letting S be the solution set we wish to compute, a cq-set S[p] is derived from either (1) cq-sets Sil[pi] and S[Pr] where PI + Pr = p or (2) cq-sets Sl[pi] and S[Pr] and buffer b where PI + Pr + Cb = p. The strategy taken in [7] and taken here is to visit these configurations in order of p. By building the cq-sets in increasing order of p, we have already satisfied one of the pruning conditions in Property 3.1. When building a cq-set C with cost p, we know that all lower cost solutions have already been visited and that only lower cost solutions have been visited. Thus, to determine if (c, q) C C is sub-optimal, we need to determine if there exists a previous (c', q') where c' < c and q' > q. Such a problem is a special case of a two-dimensional orthogonal range query [14] and can be solved in logarithmic time (see [7], [8] for details). This approach is summarized in Figure 5.
3.4
= {(cb, q')}
Prune S' versus solutions in S S - S uS'
q = min(qi, q,).
c = cb
B'}
1= q - rbc - db is maximized S
P = Pl + PrX
c = cl + cr
E
Overall Algorithm
The overall structure of the algorithm appears in Figure 6. The keys are in steps 5 and 6 where we compute Sb and S. The base case of computing S(v, i, i) is simply a matter of computing the distance between vertex v and sink i and the associated Elmore delay and subtracting this from qj, the given required arrival
in a final phase. Each of these sets is computed by making a linear pass through the grid graph and using the
10
previously computed intermediate solution set to bootstrap. To compute LS(v)Vv, we make a left-to-right traversal of each row inductively computing the solutions from that of our neighbor. Similarly, we compute RS(v) by right to left passes and using LS(v), US(v) is computed by traversing each column top-to-bottom and finally we compute S(v, i, j) with a bottom-to-top sweep. We illustrate the process with pseudo-code for computing US(v) in Figure 7. In the figure we use v{rc} to indicate the vertex in the r'th row and c'th column so that we may easily identify a vertex's neighbors. We also use d(u, v) to denote the physical distance between vertices u and v. US(v {j,}) - RS(v { 1 ,}) Vc E {I..n} for c = 1 to n for r = 2 to n A - augment.oln.set(LS(v{r....c}), d(v{_... US(V{rc}) - RS(v{r c}) U A Prune sub-optimal solutions from USvf,,,c
c,,
Wire Resistance Wire Capacitance Sink Capacitance Driver Resistance Buffer Resistance Buffer Intrinsic Delay Buffer Input Capacitance
v{1 , ,,))
2 Use the P-Tree algorithm to derive the routing topology T induced by the sink permutation which minimizes the cost metric. Apply a static buffer insertion algorithm to this topology. 3 The proposed simultaneous routing buffer insertion algorithm.
S
In each case, the result is a tradeoff curve from which we select the solution minimizing the metric. For each net size we ran the algorithms on 25 randomly generated point sets. Results were normalized to the result of Alg 3. As can be seen from the table, the proposed approach does in fact improve over the two phase approaches. With respect to running time, the two phase approaches have an advantage in that solutions in the basic P-Tree algorithm without buffering are characterized by load and required-time only - since there is no buffering, load also captures the notion of cost. Thus, the added complexity of the simultaneous approach must be weighed against the solution improvement yielded. Nevertheless, when high quality solutions are required, the simultaneous method appears quite practical for most typical net sizes. For instance, our relatively unoptimized implementation is able to route 12 pin nets in about 30 cpu seconds on a SUN Sparc 20. A topic of our current research is development of more powerful bounding techniques and, more generally, methods for improving performance by search space limitation. A very simple technique of this sort
Figure 8: Computation of Sb(v, i, j)
Complexity
Evaluating the algorithm in terms of the number of primitives it executes, we have an 0(n 5 ) algorithm. This can be seen in the computation of Sb: there are 0(n 4 ) sets Sb(v, i, j) (note that there are n2 vertices in GG(N)) and for each such set we execute 0(n) primitives. Of course, the the primitives are not constant time operations. However, it can be argued that the size of these sets is polynomially bounded in the parameters of the problem instance (e.g., grid size) and thus the algorithm is pseudo-polynomial overall. Additionally, this leads to a natural way of trading precision for running time by "coarsening" the problem instance (e.g., by using a coarser grid and taking advantage of the resultant discretization).
4
O.Ins 0.03pF
1 Use the P-Tree algorithm to derive the minimum area routing topology T induced by the sink permutation. Apply a static buffer insertion algorithm T.
S 0 for k = i..j - 1 S - S U join(S(v, i, k), S(v, k + 1, j)) Prune suboptimal solutions from S
3.5
270Q 500Q
approach. Since the quality of a routing solution depends on both its timing and its cost, we adopt the Cost*Delayproduct as our metric of comparison (where Delay is the maximum source to sink delay - i.e., for simplicity, we assume identical required arrival times). In our experiments we use the 0.5pm technology parameters used in [9] and [4]. We also introduced a single non-inverting buffer. These parameters are given in Table 1. We compared two different two-phases approaches to the proposed simultaneous approach under the Cost*Delay metric and the results are reported in Table 2. The three approaches are as follows.
To compute Sb(v, ij), we consider the partition points k E {i..j- 1}. Because of the bottom up nature of the algorithm, the optimal solution sets S(v, i, k) and S(v, k + 1, j) have been previously computed. Pseudocode for computation of S(v, i, j) appears in Figure 8.
-
1.0fF
Table 1: Technology Parameters
Figure 7: Computation of US(v) Vv e V
Sb(v, i, j)
.112Q/pm .039fF/pim
Experiments
The main focus of our experiments was to determine the benefit afforded by taking the proposed approach of simultaneous routing and buffering versus a two phase
11
n=6 n=9 n=12
Alg I 1.03 1.07 1.11
Alg 2 1.04 1.06 1.12
[8] J. Lillis, C. K. Cheng, T. T. Lin, "Optimal Wire Sizing for Low Power and a Generalized Delay Model," Technical Report #CS96-468, CSE Dept., UCSD.
Alg 3 1.0 1.0 1.0
[9] J. Lillis, C. K. Cheng, T. T. Lin, C.-Y. Ho, "New Techniques for Performance Driven Routing with Explicit Area/Delay Tradeoff and Simultaneous Wire Sizing," Technical Report #CS96-469, CSE Dept., UCSD.
Table 2: Relative Cost*Delay Results with which we have had some promising initial results is the following. Initially compute the min area solution in 0(n5 ) time and let qrnj be the resulting required time (this is done by the P- TreeA algorithm and is strongly polynomial). When running the timing optimization algorithm, consider a solution (p, c, q) E S(v, i, j). Let d be a lower bound on the delav from the driver to v (e.g., the delay of the driver with minimum possible load plus a lower bound on interconnect delay to vertex v). If q - d < qmin then solution (p, c, q) can be discarded since the min area solution is better. Surprisingly, this has yielded an order of magnitude speed up in some cases. We are exploring generalizations of this concept.
5
[10] W.C. Elmore, "The Transient Response of Damped Linear Network with particular Regard to Wideband Amplifiers," J. Applied Physics 19 (1948), pp 55-63. [11] N.H.E. Weste, K. Eshraghian, Principles of CMOS VLSI Design, Addison-Wesley, 1993, pp. 231-237. [12] H. Vaishnav, M. Pedram, "Routability-Driven Fanout Optimization." Proc. ACII/IEEE Design Automation Conf., 1993, pp. 230-235. [13] L.P.P.P van Ginneken, "Buffer Placement in Distributed RC-tree Networks for Minimal Elmore Delay," Proc. International Symposium on Circuits and Systems. 1990, pp 865-868. [14] F. F. Yao, "Computational Geometry," Ch. 7 in "Handbook of Theoretical Computer Science. Vol A.," Elsevier Science Publishers, 1990.
Conclusions
We have presented an algorithm for optimization of timing and cost of a net by simultaneous routing and buffer insertion. Preliminary results are promising and show improvement over 2-phase approaches.
References [1] K. D. Boese, A. B. Kahng, G. Robins, "HighPerformance Routing Trees With Identified Critical Sinks," Proc. ACM/IEEE Design Automation Conf., 1993, pp. 182-187.
[2] M. Borah, R.M. Owens, M.J. Irwin, "Fast algorithm for performance-oriented Steiner routing," Proc. Fifth Great Lakes Symposium on VLSI, 1995 pp. 198-203.
[3] J.J. Cong, K.S. Leung, D. Zhou, "Performance-driven interconnect design based on distributed RC delay model," Proc. ACM/IEEE Design Automation Conf., 1993 pp. 606-611.
[4] T. D. Hodes, B. A. McCoy, G. Robins, "DynamicallyWiresized Elmore-Based Routing Constructions," Proc. IEEE Intl. Symp. Circuits and Systems, 1994. [5] F. K. Hwang, D. S. Richards, P. Winter, "The Steiner Tree Problem," Elsevier Science Publishers, (1992), pp. 213-214. [6] F.K. Hwang, "On Steiner Minimal Trees with Rectilinear Distance," SIAM J. Applied Math. 30 (1976), pp. 104- 114. [7] J. Lillis, C. K. Cheng, T. T. Lin, "Optimal Wire Sizing for Low Power and a Generalized Delay Model," Proc. IEEE Intl. Conf. Computer-Aided Design, 1995, pp. 138-143.
12
TIMING OPTIMIZATION BY REDUNDANCY ADDITION AND REMOVAL Luis A. Entrena*, Emilio Olias*, Javier Uceda* *
* Universidad Carlos III of Madrid, Spain {entrena, olias} @ing.uc3m.es ** Universidad Politecnica of Madrid, Spain
[email protected]
ABSTRACT Redundancy Addition and Removal is a logic optimization method that has recently been proposed. This method uses Automatic Test Pattern Generation (ATPG) techniques to identify optimization transforms. It has been applied successfully to combinational and sequential logic optimization and to layout driven logic synthesis for Field Programmable Gate Arrays (FPGAs). In this paper we present an improved Redundancy Addition and Removal technique that allows to identify new types of optimization transforms and it is more efficient because it reduces the number of ATPG runs required. Also, we apply the Redundancy Addition and Removal method to timing optimization. The experimental results show that this improved Redundancy Addition and Removal technique produces significant timing optimization with very little area cost.
---
added redundancy created redundancy
Figure 1. Example of redundancy addition and removal The basic idea underlying the previous approaches in [ 1-7] can be summarized as follows. A wire is selected and tested for stuck-at fault. If no test is possible, then the wire is redundant and can be removed. Otherwise, the mandatory assignments (those assignments that are required for a test to exist) obtained during test generation suggest the additions that will force the tested wire to become redundant. However, it is not known whether these additions can be performed without changing the circuit functionality. This must be further verified by performing additional tests. In this paper we propose an efficient technique that allows to identify which connections/gates can be certainly added to the input of an existing gate in the circuit with a single test run. This technique is also extended to multiple wire addition, allowing to identify a bigger set of alternatives than with previous approaches. The Redundancy Addition and Removal technique has been applied in the past to area optimization of combinational and sequential circuits. In this paper, we apply this technique to timing optimization of combinational logic networks. Since this technique can take into account accurate area and delay estimations, it can be applied in a similar manner to technologydependent timing optimization. Logic restructuring techniques for timing optimization have been proposed based on other optimization methods [10], [11]. These techniques are commonly used in combination with other timing synthesis techniques [9]. We show that the improved Redundancy Addition and Removal technique proposed may produce significant timing optimization with very little area cost.
1. INTRODUCTION Redundancy Addition and Removal has been shown to be a powerful logic optimization method by several authors [1-7]. With this method, a logic network is optimized by iteratively adding and removing redundancies that are efficiently identified using Automatic Test Pattern Generation (ATPG) techniques. Due to the nature of redundancy, the addition of a redundant wire/gate may make some wires/gates become redundant elsewhere in the circuit. After the removal of the created redundancies, the resulting circuit may have less area or a smaller delay. The Redundancy Addition and Removal approach is illustrated with the example in Fig. 2 (taken from [1]). This is an irredundant circuit. In this circuit a connection can be added from the output of g5 as a new input to g9 without changing the logic functionality of the network. In other words, the added connection is redundant. By adding this connection, two connections, gl-g4 and g6-g7 become redundant and can be removed. The resulting network contains less gates and a shorter critical path. The added wire, g5-g9, is called an alternative wire of gl-g4 and g6g7 [3] The Redundancy Addition and Removal technique can be successfully applied to some physical design related problems, such as routing [3]. If routing cannot be completed, the unroutable wires may be substituted by alternative wires in order to complete the routing. Also, this technique is particularly well suited for resynthesis, because it allows to identify optimal functional alternatives to a wire/gate based on accurate area and delay estimations.
13
alternative wire candidate. In this section, we will describe how the connections that can be certainly added to a destination node can be identified with a single redundancy test. The optimization transforms are obtained by comparing the results of this redundancy test with the set of mandatory assigments
(SMA) of the removal candidate. We call this technique "two-way" transform identification.
In the sequel, we note a connection as a triple (S, D, P), where S is the source node, D is the destination node and P is the polarity (1 for inverted and 0 for non-inverted). Also, an input to a gate G has a controlling value Cont(G) if this
value determines the output of the gate G regardless of the other inputs. The controlling value of an AND(OR) gate is 0(1). The inverse of the controlling value is called the sensitizing value Sens(G). The sensitizing value of an AND(OR) gate is 1(0). Note that all candidate connection faults that have the same destination node have exactly the same static observability conditions. They only differ in the controllability condition. Therefore, connection faults that have the same destination node have the same mandatory observation assignments and only differ in the mandatory control assignment. Let D be a node and c be the controlling value of D. Suppose that we perform the implication of the mandatory observation assignments that are common to all connection faults that have the same destination node D. A mandatory assignment v obtained this way in a node N, such that v = c, indicates that the connection C = (N, D, 0) is redundant and therefore it can be added without changing the circuit's functionality. The demonstration of this statement is simple: the fault associated to the added connection is C stuck-at c and the necessary control assignment for this fault is N = c, which is incompatible with the previous assignment N = v = c. Analogously, if a mandatory assignment v is obtained in a node N, such that v = c, then the connection C = (N, D, 1) is redundant and therefore it can be added without changing the circuit's functionality.
Figure 2. An irredundant circuit This paper is organized as follows. Section 2 describes the improved transform identification technique, that we call "two-way" transform identification. Section 3 describes
how this technique is extended with the addition of redundant gates. Section 4 describes the timing optimization algorithm based on this approach. Section 5 presents the experimental results. Finally, section 6 presents the conclusions of this work. 2. TWO-WAY TRANSFORM IDENTIFICATION The techniques developed so far to identify logic optimization transforms by redundancy addition and removal [1-7] can be called "one-way", because the redundancy test of a fault allows to identify candidate connections for addition, but it is not known whether they can be certainly added without changing the circuit functionality. Consider for example the circuit shown in Fig. 2 and the target fault g6 stuck-at 1. When this fault is tested, a mandatory assignment g5 = 0 is obtained; in other words, all input vectors that are able to test this fault put a logic value 0 at the output of g5. The implications performed to obtain this result are shown below: (1) Mandatory control assignment: g6 = 0 (2) Mandatory observation assignments:
Example. Consider again the example in Fig. 2. The mandatory observation assignments for all connection faults whose destination node is g9 are: g8 = 1, f = 1. By implication, using recursive learning [8], we get the mandatory assignments shown below. The recursivity level is indicated by the indentation. g8 = I => Recurviviav level = I
g3 = 1, g4 = Of= I
(3) Implications: g6 = 0 => d = 0, g2 = 0 g3 = I => a = 1, b = I
Justification of g4 = i g4= I => c =1, g =1 gi =I => b =1, d = I gi = I => g5 = 1 c = 1 => g2 = 0 d = 1 => g6 = 1 Justificationof g7 =1 g7 = I => g6 = 1, g3 = 1 g3 = I => a = I, b = 1 g6 = I => Recursiviify level = 2 Justification of g2 = I g2 = I => e = 1, c = 0
d = 0=> gi = 0 gl = 0, g2 = 0 => g5 = 0 This result suggests the addition of a new connection from g5 as a new input of g9 (dotted line in Fig. 2), because when this wire is added, it blocks the propagation of the fault g6 stuck-at 1, which thus becomes redundant. The same result is obtained by the addition of wires from g6, g4, d, g2, gi, and, through an inverter, g3, a and b. However, we do not know which of these new connections can be added without changing the circuit functionality, i.e., if they are redundant connections. In order to check this, an additional redundancy test is required for each
14
g2 =I =>g5 =1 c = O=>g4 = 0 Justification of d = I d = 1, b = I => g] = I gI = I => g5 =I
g5 =1 <= b = I <= g6=1 <= g5=1 <=
Since the controlling value of the destination node g9 is Cont(g9) = 0, we obtain that the connections (b, g9, 0), (g6, g9, 0) and (g5, g9, 0), can be added without changing the circuit's functionality. It can be verified that their associated stuck-at faults are not testable because the mandatory control assignment is inconsistent with the mandatory assignments obtained previously for these connections. Fig. 3 shows several possible transforms described in [4]. The subset of mandatory assignments that are common to all candidate connection faults that have the same destination node D under Type 0 transform coincide with the SMA for the fault D stuck-at Cont(D). Similarly, the set of mandatory assignments that are common to all candidate connection faults that have the same destination node D under Type 2 transform coincide with the SMA for the fault D stuck-at Sens(D). We will call the tests for the faults D stuck-at Cont(D) and D stuck-at Sens(D) the
Figure 4. Addition of a gate redundancy test of the destination node (fault g9 stuck-at 0); (ii) g5 = 0 obtainedfrom the redundancy test of the target wire (fault g6 stuck-at 1). Then, the addition of connection (g5, g9, 0) allows to eliminate connection (g6, g7, 0), i.e., (g5, g9, 0) is a valid alternative connection of (g6, g7, 0). The two-way identification technique is complete in the sense that we can identify all possible connection/nodes that can be added to the destination node as long as all mandatory assignments can be identified. However, this is only possible if recursive learning is used. Generally, it is not possible to know beforehand what is the maximum recursion depth to obtain equivalent results to one-way identification. For instance, the transformation of the previous example can be identified using a one-way algorithm with a maximum recursion depth equal to 0, while a two-way algorithm requires at least a recursion depth equal to 2.
redundancy tests of the destination node. We consider here
Type 2 transform rather than Type 1 transform because Type 2 transform covers Type 1 transform, i.e., if Type 2 transform is possible then Type 1 transform is also possible for the same source and destination nodes.
3. ADDING GATES
Type 0
In this section, the two-way identification technique is generalized to the addition of gates. Note that a node may have a mandatory assignment even though its predecessors and successors do not. For instance, in the previous example, g6 has a mandatory assignment even though neither its predecessors (g7) nor its successors (d, g2) do. This is because the higher level mandatory assignments do only propagate to the next inferior level when they do all coincide. Therefore, the output node of a network may hold a level-O mandatory assignment even though neither its predecessors nor its successors do. The key to identify
Type I
452' Type 2 Figure 3. Several types of logic transforms
more general transformationsis the information contained in mandatory assignments of a level higher than 0. We call Extended Set of Mandatory Assignments (ESMA) a set of
mandatory assignments that is not restricted to recursion depth 0. Example. Consider the example in Fig. 4. This circuit is the same of Fig. 2, except for the absence of node g5. The redundancy test of the destination node stuck-at 0 is the following: g9 = I => g8 = If = I g8 = I => Recursivitv level = I
The optimization transformations are easily identified by comparing the mandatory assignments that are obtained in each node of the network by the redundancy test of the destination node and the redundancy test for each fault dominated by the destination node. If a node N has mandatory assignments of different value for each of these tests, then it is possible to add one connection from N to the destination node to eliminate at least one connection. Thus, for the previous example, we have the following mandatory assignments: (i) g5 = I obtained from the
Justification of g4 = I
15
g4 = I => c = 1, gI = I gi = 1 => b = 1, d = l c= 1=> g2 = 0 d= 1=>g6 =I Justificationof g7 =1 g7 = 1 => g6 = 1, g3 = 1 g3 =I => a = 1, b = I g6 = I => Recursivity level = 2 Justificationof g2 = I g2 = 1 => e = 1, c =0 c = 0=> g4 = 0 Jusnficationof d = I d = 1, b= = > g =1
d a
b
=I <= g6 = I <=
Figure 5. Example circuit
As it can be observed, there is not a level-0 mandatory assignment neither in gI nor in g2. However, all branches in the recursivity tree have a mandatory assignment gi = 1 or g2 = 1. Hence, consider a subnetwork such that its output is 1 when g 1 = 1 or g2 = 1. Such a subnetwork is an OR gate whose inputs are gi and g2. This subnetwork is redundant and can be added to the circuit without changing its functionality, since it shows a level-0 mandatory assignment in the redundancy test of the destination node.
Proof. The theorem will be demonstrated for the first set of premises. The demonstration is analogous for the second set. The demonstration is constructive, i.e., it determines exactly the types of the gate and the connections of the transformation T. Let G be the gate in transformation T. For the sake of simplicity, we will take G E {AND, OR}. The connections between A, B and G are of the following types
The following theorem characterizes the addition of a twoinput gate.
(A, G, 0) if val(A, 0) = Sens(G)
Theorem. Let A, B, D nodes in a network. Let T be a valid transformation that involves the elimination of a fault f by the addition of an elementary two-input gate with one output. The inputs are connected to nodes A and B. The output is connected to the destination node D. Let ESMAf and ESMAD* be the extended sets of mandatory assignments corresponding to fault f and to the redundancy test of the destination node, respectively. Let val(A, 0) and val(B, 0) the level-0 mandatory assignments at A and B in one these extended sets, and val'(A, pl), ..., val'(A, Pn), val'(B, Pt), ..., val'(B, Pn) the mandatory assignments at A and B for a set of supplementary branches Pl,i Pn of the other set, i.e., either val(A, 0), val(B, 0)
I
E
(A, G, l) if val(A, 0) = Cont(G) (B, G, 0) if val(B, 0) = Sens(G) (B, G, 1) if val(B, 0) = Cont(G) With this connections, we have val(G, 0) = Sens(G) Since val(A, 0) • val'(A, pi) or val(B, 0) # val'(B, pi) V pi, i= 1, ..., n, at least one of the G inputs has a controlling value V pi, i = 1, ..., n. Therefore
val'(A, pi) E ESMAD (Pi) val'(B, pi) E ESMAD (Pi) SMAD* = ESMAD*(PJ)n *--
i = I, i = .,
Since the value of G is the same at all supplementary branches of the recursivity tree, we have
n n
val'(G, 0) = val'(G, pi) r)
ESMAD*(Pn)
i = I1., n
val'(B, pi) E ESMA/p 1 )
i = 1, ..., n
SMAf = ESMA/pi ) r
...
...
rn val'(G, p,)
= Cont(G) • Sens(G)
or val'(A, pi) E ESMAp 1i)
V pi, i = 1_., n
val'(G, pi) = Cont(G)
SMAf
This demonstrates that the value of G is different for each of the sets of mandatory assignments SMAf and SMAD The polarity of the connection from G to the destination node D depends on the controlling value of D. The polarity is not inverted in valfG) = Cont(D), and inverted otherwise.
r) ESMA#P,)
val(A, 0), val(B, 0) e SMAD*
Example. Let's take the previous example shown in Fig. 4. We have the mandatory assignments gI = 0 and g2 = 0 for the fault g6 stuck-at 1. Selecting G as and OR gate, we have
A sufficient condition to guarantee that this transformation does not change the circuit's functionality is Vpi, i = l, ..., n
val(gl, 0) = Sens(G) = 0
val(A, 0) * val'(A, pi) or val(B, 0) # val'(B, Pi)
16
val(B, 0) = Sens(G) = 0
and the connection from gl to G and g2 to G are noninverted. If we perform such connections, we have
critical path
<
val(G) = val(gl, 0) + val(B, 0) = 0.
The redundancy test of the destination node was shown in a previous example. It was demonstrated that there is a mandatory assignment gl = 1 or g2 = 1 in all branches of the recursivity tree for this test. Therefore, val'(G) = 1. Since val(G) • val'(G), the addition of G allows to eliminate fault f.
Figure 6. Timing optimization approach
To complete the transformation it is necessary to determine the polarity of connection G to g9. This connection is non-inverted, since valf(G) = Cont(g9). In some particular cases it is possible to identify multiplewire addition transformations without considering recursive learning [4]. However, this cannot be generalized. For instance, consider the interesting example shown in Fig. 5.The redundancy test of the target fault g5 stuck-at 1 does not suggest any interesting candidate connection. Hovewer, by performing the redundancy test of the destination node g6 stuck-at 0, we find that the connections (g2, g6, 0) and (g7, g6, 0) can be added without changing the network functionality. If we compare the SMA of the destination node test with the SMA of the target fault, the two-way transform condition is not met because there is not a level-0 mandatory assignment neither in g2 nor in g7. However, all branches in the recursivity tree have a mandatory assignment g2 = 0 or g7 = 0 for the fault shown. Hence, consider a subnetwork such that its output is 0 when g2 = 0 or g7 = 0. Such a subnetwork is an AND gate whose inputs are g2 and g7. In other words, the addition of (g2, g6, 0) or (g7, g6, 0) does not cause the target fault to be redundant separately, but the addition of both of them does. Note that this transform cannot be identified with previous approaches.
Timing-opt ()
{
START:
Compute the arrival times and identify the critical path Foreach CPS in CP{ Foreach N in CPSf Identify-transform(N); lf(transform is found){ Optimize(,; goto START;
}
Figure 7. Timing optimization algorithm. replace a critical wire by a better alternative wire/gate, or on a general basis. On a local basis, the alternatives of the target wire are identified with the techniques described in the previous section. If a better alternative is found, the target wire is substituted by the alternative wire/gate. Note that this method can take into account accurate delay estimations at the time of searching for the alternatives. This is an advantage over other timing optimization techniques based on logic restructuring [10]. On a general basis, the timing optimization algorithm focuses on critical path segments. A critical path segment (CPS) is the portion of the critical path between two multiple fanout nodes. For each critical path segment we try to add a connection/gate as a new input of a node in the CPS to eliminate at least a connection in the critical path. If a transformation is found, the algorithm starts again by identifying the new critical path. The algorithm is shown in Fig. 7.
4. TIMING OPTIMIZATION Redundancy addition and removal techniques can be applied to timing optimization [1]. If the addition of redundant wires/gates to a circuit causes some connection(s) in the critical path to be redundant, then the transformation will result in a faster circuit. For timing optimization, the search for alternative wires/ gates is performed according to the following criteria (see Fig. 6): * The destination node of the alternative connection/gate belongs to the critical path. Although this is not strictly required to generate redundancies in the critical path, it is very unlikely that redundancies may be created in the critical path otherwise. * The arrival time of the output of the alternative connection/gate (tN) must not be greater than the arrival times of the inputs of the destination node (ti). In this way, the timing of the network is not degraded by this addition. Timing optimization can be applied on a local basis, to
The selection of a transform among the possible transform candidates is based on a cost function. The cost of a connection/gate is defined as the circuit delay reduction that can be obtained by removing/adding this connection/ gate. The cost of removing a connection is computed as the delay difference between the fault-free and faulty circuit. From this definition, the cost of removing a non-critical connection is 0. Also the cost of adding a connection following the above mentioned criteria is also 0. The cost of each segment and each connection is computed
17
be recomputed and the search for new transforms must start all over again. The CPU time consumption will be greatly reduced in a future implementation by reusing previous computations and eliminating repeated runs over already optimized critical path segments.
at the time the critical path is identified. The timing optimization algorithm iterates over the critical path segments in decreasing order of its cost function. .
5. EXPERIMENTAL RESULTS In this section we will present preliminary experimental results of timing optimization with the improved Redundancy Addition and Removal technique. The experiments were made at the technology independent level for simplicity. However, it should be noted that the redundancy addition and removal technique can be similarly applied at the technology dependent level, where more precise estimations of area and delay are available. In the experiments carried out we used a unit delay model with a fanout factor of 0.2. We have considered three types of transforms: (1) adding one connection to eliminate at least 1 connection/gate in the critical path (area cost 0); (2) adding 2 connections to eliminate at least 1 connection/ gate in the critical path; and (3) adding a 2-input gate to eliminate at least 1 connection/gate in the critical path. These transforms where applied successively in order to evaluate the improvement obtained in each case. Static timing analysis was used to determine the critical path for practical reasons. With this simple delay model, Type 1 and Type 2 transforms are not considered because they increase the length of the critical path. Also note that Type 0 transforms do not augment the circuit area, because a wire is added to remove at least another wire. Therefore, with these criteria, Type 0 transforms allow to reduce the length of the critical path without augmenting the circuit area. If the subnetwork added contains more than one connection, then the area will be augmented. The experimental results are shown in Tables 2 and 3. Table 1 shows the inicial parameters of the benchmark circuits. The initial circuits were obtained after strong area optimization with RAMBO [2] and MISII. Table 2 shows the timing optimization results obtained by adding only one connection, first without recursive learning and then with a maximum recursion depth of 3. Table 3 shows the results obtained with multiple connection addition. For each example the number of connections (#C), the number of nodes (#N), the estimated delay (D) and the CPU time consumption in a Sun Sparcstation 2 are presented. The timing improvement is significant in most of the examples. In the case of frg2, a speed-up factor 3 was obtained. Other outstanding results were obtained for vda (2.5), k2 (2.4) and x4 (2.3). The average speed-up factor was 1.25 using only one connection addition and 1.48 in total. Note that the area (estimated by the number of nodes and connections) is not degraded by applying one connection addition transforms. With more complex transforms, the area may be degraded as we add more connections/gates than we remove. However, except in one case, the area increase is less than 1.5%. This result shows that the proposed technique is well suited for timing optimization when no much area is allowed to be traded off.
6. CONCLUSIONS AND FUTURE WORK We have proposed an improved transform identification technique for Redundancy Addition and Removal. This technique allows to efficiently identify the set of redundant connections that can be added to a logic network without changing its functionality by reducing dramatically the number of test generation runs required. This technique has also been extended for the addition of gates, obtaining new transformations that could not be identified with previous approaches. Previous work in Redundancy Addition and Removal only considered area optimization. In this paper, we have extended this technique to timing optimization and obtained promising results. These results show that this technique allows to reduce circuit delay significantly with very little area increase and therefore is well suited for timing optimization when there is not much room to trade area for speed. In the future, we plan to introduce more accurate delay models and to extend the improved Redundancy Addition and Removal technique with the addition of several gates at a time, in order to obtain additional timing optimization, although at bigger area cost.
REFERENCES [1]
[2]
[3]
[4] [5] [6]
[7]
K.-T. Chen, L. A. Entrena. "Multi-Level Logic Optimization by Redundancy Addition and Removal". Proc. European Design Automation Conference (EDAC-93), p. 373-377. February, 1993. L. A. Entrena, K.-T. Cheng. "Sequential Logic Optimization by Redundancy Addition and Removal". Proc. ICCAD-93, p. 310-315. November, 1993. S. C. Chang, K.-T. Cheng, N.-S. Woo, M. MarekSadowska. "Layout Driven Logic Synthesis for FPGAs". Proc. DAC-94, p. 308-313. June, 1994. S. C. Chang, M. Marek-Sadowska. "Perturb and Simplify: Multi-level Boolean Network Optimizer". Proc. ICCAD-94, p. 2-5. November, 1994. W. Kunz, P. R. Menon. "Multi-level Logic Optimization by Implication Analysis". Proc. ICCAD-94, pp. 6-13. November, 1994. L. A. Entrena, K.-T. Cheng. "Combinational and Sequential Logic Optimization by Redundancy Addition and Removal". IEEE Transactions on CAD, vol.14, n. 7, p. 909-916. July, 1995. U. Glaser, K.-T. Cheng. "Logic Optimization by an Improved Sequential Redundancy Addition and Removal Technique". Proc. ASP-DAC. September, 1995
[8] W. Kunz y D. K. Pradhan. "Recursive Learning: an attractive alternative to the decision tree for test
There is heavy CPU time consumption in some cases. This is because when a transform is found, the critical path must
18
generation in digital circuits". Proc. International Test Conference, p. 816-825. October 1992. [9] J. P. Fishburn. "LATTIS: An Iterative Speedup Heuristic for Mapped Logic". Proceedings 29th Design Automation Conference, p. 488-491. June 1992. [10] K. J. Singh, A. R. Wang, R. K. Brayton, A. Sangiovanni-Vincentelli. "Timing Optimization of Combinational Logic". Proceedings International Conference on Computer-Aided Design, p.282-285, November 1988. [11] K. C. Chen y S. Muroga. "Timing Optimization for Multi-Level Combinational Networks". Proceedings 27th Design Automation Conference, p. 339-344. June 1990.
Initial
Name
#N 316 599 84 376 1217 1871 1433 246 436 141 439 460 381 936 385 85 100 186 455 221
C1908 C2670 C432 C499 C5315 C6288 C7552 C880 apex6
apex7 dalu k2 pair rot term ttt2 vda x3 x4
#C 712 1316 221 798 2671 3787 2992 603 1096 354 1073 1145 1162 2335 953 206 254 645 1122 571
D 44.8 46.2 33.8 31.0 62.6 131.0 217.0 49.4 29.8 24.4 45.4 62.0 65.0 70.4 33.8 16.0 25.6 52.2 20.0 28.0
Table 1: Initial benchmark circuits
Adding one connection (K=3)
Adding one connection (K=O)
l
Nombre_____ #N
#C
D
T
#N
#C
D
T
C1908
316
711
40.2
3.2
316
711
40.2
109.5
C2670
599
1316
43.8
4.5
599
1316
43.8
648.0
C432
83
220
27.8
3.9
83
220
27.8
12.8
C499 C5315 C6288
376 1217 1871
798 2671 3787
31.0 52.8 131.0
0.7 68.4 5.9
376 1217 1871
798 2671 3787
31.0 52.8 126.8
36.2 478.8 1003.5
C7552 C880 apex6 apex7 dalu frg2
1424 246 436 140 439 458
2975 603 1096 353 1073 1143
162.2 49.4 26.2 20.2 33.0 40.4
123.4 0.9 1.6 1.1 32.3 14.4
1424 246 436 140 439 458
2975 603 1096 353 1073 1142
159.4 49.4 26.2 19.2 33.0 27.8
2703.1 35.1 4.5 3.7 272.0 38.3
k2
381
1161
43.6
22.7
381
1161
26.6
4880.8
pair
936
2335
53.8
21.4
936
2335
53.8
60.7
rot term 1
385 85
953 206
32.6 16.0
1.5 0.2
385 85
953 206
32.6 16.0
6.1 3.1
ttt2 vda x3
99 186 455
253 645 1122
20.6 25.2 19.2
0.8 7.5 1.0
99 186 455
253 645 1122
20.6 25.2 19.2
8.9 505.6 5.5
x4
220
570
14.2
1.0
220
569
12.2
4.7
Table 1: Experimental results with one connection addition
19
Adding two connections
Name
Adding a gate
#N 316
#C 718
D 37.0
T 487.6
#N 316
#C 718
D 37.0
T 95.2
599
1317
42.6
190.6
596
1320
33.0
633.8
83 376 1217 246
x3
140 439 457 936 385 85 99 186 455
221 802 2674 610 1100 354 1079 1154 2339 958 206 253 682 1129
27.6 29.6 50.8 42.0 22.4 19.2 25.0 21.8 48.6 30.4 16.0 20.6 22.2 15.8
28.9 107.9 245.4 186.8 11.9 5.8 218.2 40.0 149.2 35.4 3.4 4.4 3618.5 37.5
83 376 1208 247 437 141 443 458 929 385 83 101 187 456
221 802 2673 613 1103 358 1087 1156 2335 959 208 257 684 1134
26.8 29.6 44.6 39.8 19.0 18.2 24.8 21.0 39.4 29.0 13.0 19.4 21.2 14.2
20.3 38.0 1817.0 39.0 17.9 10.0 379.0 18.1 425.2 7.4 20.9 13.9 409.4 25.0
x4
220
570
12.2
0.3
220
570
12.2
0.7
C1908
C2670 C432 C499 C5315 C880 a ex6436 apex7 dalu pair rot term I ttt2
vda
I
Table 1: Experimental results with multiple connection addition
20
Optimal Wire-Sizing Formula Under the Elmore Delay Model * Chung-Ping Chen, Yao-Ping Chen, and D. F. Wong Department of Computer Sciences, University of Texas, Austin, Texas 78712
Abstract
driver
In this paper, we consider non-uniform wire-sizing. Given a wire segment of length L, let f(x) be the width of the wire at position x, 0 < x < L. We show that the optimal wire-sizing function that minimizes the Elmore delay through the wire is f (x) = ae -bX where a > 0 and b > 0 are constants that can be computed in 0(1) time. In the case where lower bound (L > 0) and upper bound (U > 0) on the wire widths are given, we show that the optimal wire-sizing function f (x) is a truncated version of ae- b that can also be determined in 0(1) time. Our wire-sizing formula can be iteratively applied to optimally size the wire segments in a routing tree.
1
Introduction
As VLSI technology continues to scale down, interconnect delay has become the dominant factor in deep submicron designs. As a result, wire-sizing plays an important role in achieving desirable circuit performance. Recently, many wire-sizing algorithms have been reported in the literature [1, 2, 4, 5, 7]. All these algorithms size each wire segment uniformly, i.e., identical width at every position on the wire. In order to achieve non-uniform wire-sizing, existing algorithms have to chop wire segments into large number of small segments. Consequently, the number of variables in the optimization problem is increased substantially and thus results in long runtime and large storage. In this paper, we consider non-uniform wire-sizing. Given a wire segment W of length L, a source with driver resistance Rd, and a sink with load capacitance CL. For each x e [0, L], let f (x) be the wire width of W at position x. Figure 1 shows an example. Let ro and co be the respective wire resistance and wire capacitance per unit square. Let D be the Elmore delay from the source to the sink of W. We show that the optimal wire-sizing function f that minimizes D satisfies a differential equation which can be analytically solved. We have f(x) = ae-b., where a > 0 and b > 0 are constants that can be computed in O(1) time. These constants depend on Rd, CL, L, ro, and co. In the case where lower bound (L > 0) and upper bound (U > 0) on the wire widths are given, i.e. L < f (x) < U, 0 < x < L, we show that the optimal wire-sizing function f (x) is a truncated version of ae-b. which can also be determined in O(1) time. Our wiresizing formula can be iteratively applied to optimally size the wire segments in a routing tree. The remainder of this paper is organized as follows. In
wire
load
-
Figure 1: Non-uniform wire-sizing. Section 2, we show how to compute the Elmore delay for non-uniformly sized wire segments. In Section 3.1, we derive the optimal wire-sizing function when the wire widths are not constrained to be within any bounds. In Section 3.2, we consider the case where lower and upper bounds for the wire widths are given. We discuss in Section 4 the importance of our wire-sizing formula in sizing the wire segments in a routing tree. Finally, we present some experimental results and concluding remarks in Section 5.
2
Elmore Delay Model
We use the Elmore delay model [3]. Suppose W is partitioned into n equal-length wire segments, each of length Ax = A. Let xi be iAx, 1 < i < n. The capacitance and resistance of wire segment i can be approximated by coAxf(xi) and roAx/f(xi), respectively. Thus the Elmore delay through W can be approximated by
Dn=
Rd (CL
+±Zco n f jxi) A x) + i=,
f(ZcfxiA Cof0 (X,)AX + C) ,o E L)( CL).
The first term is the delay of the driver, which is given by the driver resistance Rd multiplied by the total capacitance of W and CL. The second term is the sum of the delay in each wire segment i, which is given by its own resistance ro Ax/f(xi) multiplied by its downstream capacitance E>i cof(xj)Ax+ CL. (See Figure 2.) As n - co, D,, - D where D
=
Rd(CL +
Jo
j
cof (x)dx) +
(j
cof(t) dt+ CL) dx
*This work was partially supported by the Texas Advanced
is the Elmore delay through the driver and W.
Research Program under Grant No. 003658459.
21
CL
I4
fix)
wire
Proof: Let xr E [0, ]. Assume f is continuous at ax. We consider f which is a local modification of f in a small region [x - Jx + 26]. The function i is defined as follows:
a
driver
L
- -
0
LXx
r0
fixj)
T0 ,
x
fix 3 )
fix 2 )
fix 4 )
CL
ATt
cOf(x 1 ) _X
Cofx
C of(x2 )
3)
D
=
Cofx.
rj) o
cof (s) ds + cody + C3 + CL) dt
x
+-(CONY + C3 + CL) +
Figure 2: Elmore Delay Model.
IC co f (s) ds + CL) dt.
rL
f
o(I
Optimal Wire-Sizing Function
In this section, we derive closed-form formula for the optimal wire-sizing function. It is reasonable to assume that wire-sizing functions are bounded and piecewise smooth with at most finite number of discontinuity points. We consider two cases: unconstrained and constrained wire-sizing. In unconstrained wire-sizing, there is no bound on the value of f (x); i.e. we determine f : [0, L] -s (0. cc) that minimizes D. In constrained wire-sizing, we are given L > 0 and U < cc, and require that L < f () < U, 0 < x < L; i.e., we determine f : [0, L] -+ [L, U] that minimizes D.
3.1
< x + 2
Rd(CL+Cl1+Coy+C3+CL)+
j
x
x
< t otherwise x -I
The wire W could be divide into three regions Q 1 , Q2 , and Q3 as shown in Figure 3. We denote the signal delay through Qi by Di. Hence the total signal delay D = ,3=, Di. We represent the wire resistance (capacitance) of Q, by Ri (Ci). We have R2 = r and C2 = cody. The signal delay through the wire can be calculated as follows:
roAx
-T
3
f)f(t)
f
rx, lx
X
R d
f( {
Thus
dD
=
coJ(Rd + ro
f(t)dt)
y2 By setting dD = 0, we get
2
We now consider unconstrained wire-sizing. We show that the optimal wire-sizing function satisfies a second order ordinary differential equation which can be analytically solved.
Therefore, f using y Let J5- 0, we get 2
02
r
.- dt)-
rO 5(CL + Co :+
Unconstrained Wire-Sizing
ire
J-21
10
ro(CL + co
fag
f(t)dt)
co(Rd + rO
jo+
7
dt)
ym-n gives minimum delay.
f f (t)dt) co(Rd + rO 1X f(tdt)
ro(CL + CO -
Since f is an optimal wire-sizing function, we have Ymi. f(x) and hence
03
RJ
f 2 (X)
Figure 3: Local modification of an optimal wire-sizing function.
Theorem 1 Let f be an optimal wire-sizing function. We have f 2 (X)
=
ro(CL + co Jf: f(t)dt) co(Rd + ro fj, (tdt)
ro(CL + co fJ f(t)dt) co(Rd + ro
CL
fo
I(t)dt)
For the case where f is not continuous at x, we have f is either left-continuous or right-continuous at x. All we need to do is to start with using the interval [x - 3, x] or [x, x + 6]
U
respectively.
Note that CL +CO Jf f (t)dt is equal to the downstream capacitance at point . (denoted by F(x)) and Rd + ro f(()dt is equal to the upstream resistance at point x (denoted by ,(x)). Hence we can rewrite Equation (1) as follows:
(1)
f r) =
r)o(X) CoA(x),
22
(2)
Since F is strictly decreasing and ct is strictly increasing, therefore f is strictly decreasing. By rearranging the terms in Equation (1) and differentiating it with respect to x twice, we get the following theorem.
Separating the variables and integrating both sides, we get Clr
where
C2
is a constant. It follows that
Theorem 2 Let f(x) be an optimal wire-sizing function. We have fU(X)f(_)
=
(3)
fi(X)2
Proof: We first multiply Equation (1) by the denominator of its right hand side and then differentiating both side with respect to x. We get 2f(x)f'(r)(Rd +
fr 1dt)
T
y
=
eCIC2 = ae
where a > 0 and b > 0. (Note that b > 0 follows from the fact that f is decreasing. ) In order to determine a and b, we substitute f (r) = ae- bx into Equation (4) and check the two boundary points x - 0 and x = L. We obtain the following two equations:
-2rof(x).
=
fJ0 f (t)
Iny,
+ C2 =
cobRda + roco(e
cobRda + roco(e
Since f(x) 0 0, we can divide both side by f(x) and get
)a - rebCL
-
1)a
-
-
robCLe
=
0,
=
0.
We can simplify these two equations and get f
'(x)(Rd + ro
I
J.0 f (t)
dt)
=
-ro.
ab
rO
=
Rd'
Since f is strictly decreasing, f'(x) < 0. Dividing the above equation by f'(x) and then differentiate both sides with respect to x, we obtain
2
b b [Rd 2/1eCL
-
r 0 co
~
2
-
=
00.
f"(_)f(r) = f(X) 2 . Note that the function g(z)
We can analytically solve the differential equation in (3) and obtain a closed-form solution. We have the following theorem.
Theorem 3 Let f(x) 6
b,
= aebr,
where a
-
bR
and
R~dCL(4 roco
-e
9
0.
= z
Ve0C
e-2
is a
strictly increasing function in z, g(0) < 0, and limzc> g(z) > 0. Thus g(z) has a unique root b > 0. We can use NewtonRaphson method [9] to determine b and, in practice, five to seven iterations are sufficient. Since a = j and b > 0, we have a > 0. Figure 4 shows the exponentially decreasing nature of the optimal wire-sizing function.
(4) wire width
We have that f is an optimal wire-sizing function.
f(X)
Proof: Let y = f (x) and P = y'. We have y" = differential equation (3) can be rewritten as p( dP
P)
p dP. The dy
-bx
=0.
.f(x)=ae
Since P = f'(x) < 0. we have 1....Z.. @. ., pC^AzzUrz t- .. wzre
YddP dy
- P = 0. Figure 4: Optimal unconstrained wire-sizing.
Separating P and y, we get dP -
-
dy
3.2
Constrained Wire-Sizing
.
We now consider constrained wire-sizing. It is clear that if the wire-sizing function f obtained for the unconstrained case lies within bounds L and U, then f is also optimal for constrained wire sizing. On the other hand, if for some x, f(x) is not in [LU], a simple approach is to round f(r) to either L or U; i.e. the new function is obtained by a direct truncation of f by y = L and y = U. (See Figure 5.) Unfortunately, the resulting function is not optimal. The
Integrating both sides, we get P = Cly,
where c1 is a constant. Since P = y', we have dy dx =cy.
23
wire width
wire width
flx)
ftx) U'fll)=U \-ha \flal-tie
U
U
bx
L
B
A
C
x)=ae (a)
L
,p-ABC
wire width
x wire position
wire width fla)
fla)
V U-hb
U
l -ha ffll)at
Figure 5: Direct truncation is not optimal.
L A I- 1I
reason is as follows: Suppose the curves f(x) = ae- bx and y = U intersect at x = v, from Equation (2) v must satisfy
-
(h)
I12
--
fia)
flat
F (V)
flat)=,e
(5)
fl(-L
LA A
for v to be on the optimal curve. However, from Figure 5, it is clear that v does not satisfy Equation (5), because both of its upstream resistance and downstream capacitance should be recalculated according to the new function, in which the two values associated with v are reduced because of the truncation. Thus this simple approach is not optimal. Recall that the optimal unconstrained wire-sizing function is a decreasing function. We can show that the optimal constrained wire-sizing function must also be decreasing. Theorem 4 Let f
U
ab,
U -
-
17L
wire width
wire widei
fla)=U
f(v)
C
1,-12 (a) Tire-BC
L
hpi-AB
wire width
lX=
B
B
B
-
I]
(d)
rpe-A
--
13
L (e}
(J)
,pe-B
L
hvpe-C
Figure 6: Six types of optimal wire-sizing functions.
We now define six wire-sizing functions fBC, fABC
ae-b
L
be an optimal constrained wire-sizing
function. We have, f is decreasing on [0,C]. According to Theorem 4, the optimal wire-sizing function
f, similar to the one shown in Figure 5, consists of (at most) three parts. The first part is f(r) = U, the middle part is a decreasing function, and the last part is f(r) = L. The three parts of f(x) partition W into three wire segments, A, B, and C, where A has width U, C has width L, and B is defined by the middle part of f(r). It is easy to see that the middle part of f(x) must be of the form f(x) = ae-ba for some a > 0 and b > 0. To see this, we can consider the wire segment A to be a part of the driver and its resistance to be a part of Rd. Similarly, the wire segment C can be considered as a part of the load and its capacitance as a part of CL. According to Equation (4), we can re-calculate a and b using the new values of Rd and CL, as long as we know the length of the wire segments A and B. As mentioned before, not all three parts of f(r) needed to be present. In fact, an optimal constrained wire-sizing function f(r) can be of any one of the six types of functions (type-A, type-B, type-C, type-AB, type-BC, and type-ABC) as shown in Figure 6. Note that the six function types clearly are named after the wire-segment types which are presented in W. For example, in a type-AB function, W consists only of wire segments A and B. As shown in Figure 6, 11, 12, and 13 are the length of wire segments A, B, and C, respectively.
f},
fc,
fAB,
0 < r < 11,
U f(r)w={
fA,
as follows: All six functions are of the form
,
<7
<1
11 + 12 < X
+1 2 ,
<_l1
+ 12 + 13 =
L,
where the parameters a, b, 11, 12, and 13 for the six functions are given in Table 1. Typically, the names of the functions correspond to their types, i.e., fA is of type-A, fB is of typeB, and so on, but it is not always true. For example, it is possible that after we compute the parameters for fAB we get 11 > L and hence it is of type-A; it is also possible that fAB degenerates into a type-B function. In this case, we say that fAn is degenerated. We also note that sometimes the functions may be illegal in the sense that they violate the wire-width constraints. Nevertheless, we can show that these six functions are candidates for an optimal constrained wiresizing function f(r). In fact, if we eliminate the functions that are either illegal or degenerated, an optimal wire-sizing function can be chosen as the best one (in terms of delay) among the remaining ones. We have the following theorem.
24
Theorem 5 Let G C F = {fA,
fB, fC, fAB, fBC, fABC}
be
the set of functions that are either illegal or degenerated. Let f E F-G be a function which has minimum delay. We have, f is an optimal constrained wire-sizing function. The above method always requires the computation of all six functions in F. With the help of additional analysis, we can speed up the procedure. Table 2 shows a set of six feasibility conditions {fOA, tB, PC, CAB, SCBC, SCABC} on L. Let F = {A, B, C, AB, CB, ABC}.
0
fB
fc
0
0
12-l 0
Ur,
fABC
InU( L
2
2+iY RoCL
2
_+ L
(a) = 0
L
L
0
U
IP 3 (1 3 ) -0
L2-13
+L-(1+1r-)
b 0
U
0
F 2 (11 ) =0
fBC
___
0
0
fAB
a
13
1112 fA
RLO(
'O
0
-
+.DcgL
Cr cL3
U2d
+Z.+
L-
2
-
Rd___
_
12
1_l
U
121 Red U+In-+ 11) __ _ _ _
.313
v-OCT.313
c~,RdU+,ro,
Table 1: Definitions of the wire-sizing functions
CcL
_
fA, fB, fc,
fAB, fBC,
wire
r -
(PARB
0
S BC
(PABC
~
and
fABc.
ienghr
BC
AB
A
B
R d / C L
C
ratio
Figure 7: Relationships among the six types of functions with respect to C and Rd
n
0
in In
d'
U
> max IRdln ~jRd L2< (1 + In L) C'L -I L> mar{L - C
ma'C{(1 +
(I + InLL
=
L2
According to Theorem 6, we only need to check the six feasibility conditions. Only the functions in H needed to be computed. In general, IHI < 6 and we have never encountered any case where IHI : 1.
L< minA
3
~TOC+oI-)-1
ABC
Theorem 6 Let H = {fzIz E r and L satisfies fo}. Let f e H be a function which has minimum delay. We have, f is an optimal constrained wire-sizing function.
(sP
R 5
I____
C, + c 0 Li,
Lemma 1 The six feasibility conditions 0 {.(PA, 4PB, (PC, S AB, VPBC, (PABC} cover all possible L > 0. Moreover, if L satisfies cp, where z E F, then f is legal and is of type-z.
VA
+
) cnL
L )n
-O
Cn
nn
C-
,
I
Rd&}
InL COd rpL
I
is of moderate size, optimal wire-sizing function will change speakfrom type-AB to type-BC as we increase Rd CL Roughly ghysek ing, the larger the ratio R., the smaller the wire sizes. When the wire length L is very large, optimal wire-sizing function is most likely to be of type-ABC.
C
}
and and
CL
e
4
p
Application to Routing Trees
}d.
Table 2: Feasibility Conditions.
We also have the following interesting observations. In Figure 7, we show the relationships among the six types of optimal wire-sizing functions with respect to the three parameters: wire length L, driver resistance Rd, and load capacitance CL. The horizontal axis represents the ratio of the driver resistance to the load capacitance. The vertical axis represents the wire length L. Suppose we keep Rfixed CL and varies L. When L is small, optimal wire-sizing functions tend to be of type-A, type-B, or type-C. As we increase L, wire-sizing function types will change to type-AB or type-BC when is of moderate size and will be of type-ABC when L
L
is large. Suppose we keep C fixed and varies Rd. When CL
L
is small, as we increase Rd optimal wire-sizing function will change from type-A to type-B and then to type-C. When L
Our wire-sizing formula can be applied to size a general routing tree. Recently, [2] presents a wire-sizing algorithm GWSA-C for sizing the wire segments in routing trees to minimize weighted delay. Each segment in the tree is sized uniformly, i.e. uniform wire width per segment. Basically, GWSA-C is an iterative algorithm with guaranteed convergence to a global optimal solution. In each iteration of GWSA-C, the wire segments are examined one at a time; each time a wire segment is uniformly re-sized optimally while keeping the widths of the other segments fixed. We can incorporate our wire-sizing formula into GWSA-C to size each wire segment non-uniformly. When we apply our wiresizing formula to size a wire segment in a tree, Rd should be set to be the total (weighted) upstream resistance including the driving resistance, and the CL should be set to be the total (weighted) downstream capacitance, including the load capacitances of the sinks in the subtree. (See Figure 8.) It can be shown that this modified algorithm is extremely fast and always converges to a global optimal solution.
25
CL. while processing wire segment .3
Precision Requirement (pm) 0.1 0.01 0.001 0.0001 0.00001 0.000001 I-
the downstream capacitance of W3
Rd. the upstream resistance of w 3 2 . 'I ';
4
7
WI
Wn
I
Table 4: The number of Newton-Raphson iterations.
35
Experimental Results and Concluding Remarks
a
E V I
We implemented and tested our algorithm in C on a Sun Sparc 5 workstation with 16 MB memory. The parameters used are shown in Table 3. The results are given in Table 4. The first column labeled "Precision Requirement" specifies the required accuracy of the wire width values. The second column shows the number of Newton-Raphson iterations. Our results show that even under very strict precision requirement the number of iterations is at most 7. Thus, in practice, the optimal wire-sizing functions can be computed in 0(1) time and hence our method is extremely fast. We also performed experiments to compare the nonuniform wire-sizing solutions with the uniform ones in which wires are chopped into different number of segments. The results are drawn in Figure 9. Wire widths are plotted as the functions of positions on the wire segments. It shows that the more segments a wire is chopped into, the closer the solution is to our formula. When the wire is chopped into 1000 segments, it can be shown that the corresponding curve and the non-uniform wire-size curve are almost identical. Finally, we note that the authors in [8] independently solved the unconstrained wiring-sizing problem using a different approach.
Unit Resistance: Unit Capacitance: Minimum Wire Width: Maximum Wire Width: Driver Resistance: Load Capacitance:
|
W
Figure 8: Sizing a segment of a routing tree.
5
# of iterations 5 5 5 6 6 D
25
15
Figure 9: Approximating non-uniform wire-sizing by uniform wire-sizing.
0.008 Q£/pm 6.0 * o0-,' F/pm I 1.0 pm 3.5 pm 25 Q 1.0 * 10-2 F
Table 3: RC Parameters
References [1] J. Cong and K. Leung, "Optimal wiresizing under Elmore
delay model," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 14(3), pp. 321-336, 1995.
[2] Chung-Ping Chen, D. F. Wong. "A fast algorithm for optimal wire-sizing under Elmore delay model" Proc. IEEE ISCAS, 1996. [3] W. C. Elmore, "The transient response of damped linear networks with particular regard to wide band amplifiers", J. Applied Physics, 19(1), 1948. [4] N. Menezes, S. Pullela, F. Dartu, and L. T. Pillage, "RC interconnect syntheses-a moment fitting approach", Proc. ACM/IEEE Intl, Conf. Computer-Aided Design, November 1994. [5] N. Menezes, R. Baldick, and L. T. Pillage, "A sequential quadratic programming approach to concurrent gate and wire sizing", Proc. ACM/IEEE Intl, Conf. ComputerAided Design, 1995. [6] R. S. Tasy, "Exact zero skew," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Feb. 1993. [7] Q. Zhu, W. M. Dai, and J. G. Xi, "Optimal sizing of high-speed clock networks based on distributed RC and lossy transmission line models," Proc. IEEE Intl. Conf. on Computer-Aided Design, pp. 628-633, 1993. [8] J.P. Fishburn and C.A. Schevon, "Shaping a distributedRC line to minimize Elmore delay", IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications, Vol. 42, No. 12, pp. 1020-1022, December 1995. [9] A. Ralston and P. Rabinowitz, A First Course in Numerical Analysis, McGraw-Hill, 1978.
26
Reducing Coupled Noise During Routing Ashok Vittal and Malgorzata Marek-Sadowska Department of Electrical and Computer Engineering, University of California Santa Barbara, CA 93106 Abstract - The performance of high-speed electronic systems is limited by interconnect-related failure modes such as coupled noise. We propose new techniques for alleviating the problems caused by coupling between signal lines. We show that models used by previous work on coupled noise-constrained layout synthesis do not allow the use of several important degrees of freedom. These degrees of freedom include the ability to utilize dynamic noise margins rather than static noise margins, the dependence of tolerable coupled noise on drive strength, the possibility of using overlaps to reduce susceptibility to noise and the use of jogs. We derive an expression for the coupled noise integral and a bound for the peak coupled noise voltage which is more accurate than the charge sharing model used in previous work. These results lead to a new problem formulation for interconnect synthesis constrained by coupled noise. We use the new bounds to guide a greedy channel router, which manipulates exact adjacency information at every stage, allowing it to make better informed decisions. Experimental results indicate that our algorithm compares favorably to previous work. The coupled noise is significantly reduced on benchmark instances.
smaller set of situations where simulation needs to be performed. This verification issue is addressed in Section II. As coupled noise pulse widths are typically much smaller than the clock period, the dynamic noise margin [2], [3], [6] rather than the static noise margin, applies. The noise susceptibility of digital logic gates is usually specified by a noise amplitude - pulse width plot, defining the allowed region of operation. Larger noise pulse amplitudes can be tolerated as the pulse width gets smaller. Therefore, given a layout, we need to be able to calculate the pulse width and amplitude on a victim net. We derive a new expression for the noise pulse integral and a simple bound on the noise pulse amplitude in Section II. Our expression does not involve the solution of the differential equations characterizing the system as in [7] and is simple enough to be used during design and verification. Our noise amplitude bound could be considered to be analogous to the signal delay bounds in [8] which have been the foundation for many interconnect design algorithms. We have developed a router guided by our new measure and use our analysis results to show that the charge sharing model used in previous work on coupled noise-driven layout ([9], [10], [11]) is extremely pessimistic. Coupled noise control during layout is critical as the noise pulse amplitude and width induced on a quiet (nonswitching) line by an adjacent switching line is primarily a function of the layout. Other researchers have also identified coupled noise as a major problem during layout synthesis. As parasitic control in analog circuits is critical to correct operation, there has been work on the layout of analog systems considering coupled noise. In [12], a maze router with limited analysis capability is proposed to avoid bad routes. Maze routing does not scale well to digital complexities, so that these methods cannot be used. Besides, the use of a simulator in an optimization loop is computationally too expensive. The post-route spacing algorithm proposed in [13] considers crosstalk while compacting a given layout. We address the issue of routing considering coupled noise in this paper. Our channel routes could use this post-processing for further improvement. Other approaches include track permutation of a given channel route [9] to maximize the minimum coupled noise slack among all nets using integer linear programming, the switchbox version [10] of the ILP formulation and the modification of a graph-based approach (Glitter [14]), to include coupled noise costs[1l]. These two approaches are reviewed next. The elegant integer linear programming formulation [9] finds an optimal track permutation, given an initial channel
I. Introduction* Coupled noise between signal lines is a potential cause of failure in high speed electronic systems [1], [2], [3], [4]. Aggressive scaling in lateral dimensions with relatively unchanged vertical dimensions in sub-micron CMOS VLSI causes the coupling capacitance between adjacent lines to become a significant fraction of the capacitance to the substrate [5]. This leads to increased coupled noise.Further, increasing system speeds cause signal spectra to exhibit significant energy at higher frequencies leading to increased coupled noise. When high-speed ECL circuits and lowpower CMOS circuits are integrated on a chip, the small noise margins of ECL, the large logic swings of CMOS circuits and the high current drive of ECL drivers create coupled noise problems. Besides, increasing system complexities lead to increased coupled energy, again increasing the need for techniques aimed at reducing the deleterious effects of coupled noise. It is important to be able to quickly check if a given routing solution will not lead to logic failures caused by coupled noise. A layout can be certified correct either using a simple capacitive charge sharing model to compute noise or using exhaustive simulation. The simulation method is timeconsuming and the charge sharing model is very pessimistic, so there is a need for simple methods which provide better accuracy. Such a method could at least identify a much *. This work was supported in part by the Defence Advanced Research Projects Agency under contract DABT63-93-C-0039, the National Science Foundation under Grant MIP 9419119 and in part by LSI Logic & Silicon Valley Research through the California MICRO program.
27
be assumed. The total coupled noise voltage can then be computed as the sum of the individual coupled noise contributions of each of the aggressors, rather than having to look at all possible switching combinations (there are exponentially many such scenarios which would otherwise need to be analyzed). As lines immediately adjacent to the victim net act as shields, we need to consider only the immediately adjacent lines. In Figure 1, therefore, our analysis omits the coupled noise contribution from net Z. We now analyze the coupled noise contribution from one aggressor net, with all other aggressor nets grounded. The total peak noise voltage and pulse width will later be obtained using superposition. The equivalent circuit is as shown in Figure 2. The attenuation along the interconnect is neglected (line lengths of a few mm or less). The resistance RI is the driver resistance of the aggressor (typically a few tens of kiloohms for CMOS and a few hundreds of ohms in ECL) and Cl is the total line capacitance of the aggressor net. X is the coupling capacitance and is proportional to the overlap length. R2 is the output resistance (typically several tens of kiloohms in CMOS and a few hundreds of ohms in ECL) of the victim net and C2 is the capacitance to ground of the victim net. RI and R2 are obtained from the transistor characteristics and the capacitances per unit length are obtained either from tabulated experimental results or from a commercial field solver. While RI is the familiar driver resistance (of the aggressor net), R2 is the output resistance (of the victim net). The ratio RI/R 2 can vary over a wide range (especially when transistor sizing optimizations are resorted to) as these are resistances corresponding to two different logic gates. We are interested in computing the peak voltage and the noise pulse width at node 0 for a unit step input.
route. The track permutation maximizes the minimum crosstalk slack among all nets. However, this is sub-optimal as finer grain permutations - track segment permutation rather than track permutation may lead to better results. Section III will show an example for which no track permutations are possible, while track segment permutations lead to optimal results. In [10], track segment permutations in a switchbox are considered. In Section III, we show that even this method is sub-optimal because the initial route is not driven by coupled noise considerations. Besides, drive strengths are not considered and Section II will show that the coupled noise model is simplistic. The channel routing heuristic presented in [11] modifies a well-known channel router [14], [15] to reflect coupled noise issues. The important notion of digital sensitivity is also introduced - logic and temporal information may make coupling between certain pairs of nets tolerable, i.e., noise coupled to a net may not lead to system malfunction if, for instance, the signal isn't being latched at that time. A capacitive charge sharing model is used to find the amplitude of the noise pulse: we show that this model is very pessimistic. The expression which we derive cannot be broken down into pairwise potential coupled noise contributions as required by their formulation. This is intuitive because the coupled noise contribution of a net adjacent to a victim net depends on other adjacent nets as well. This makes pairwise decomposition of noise required by the graph-based approach impossible. Coupled noise is considered only between adjacent horizontal segments. As the worst case has to be considered for coupled noise, the router may end up with poor routes as shown in Section HI. Besides, shields are assumed to be available wherever necessary and the issue of hooking up the shields to some reference supply voltage is not considered. We derive new results for the analysis of coupled noise pulse height and width in Section II, enabling the verification of dynamic noise margins. Section III uses these expressions to show that routing driven by the new model could be significantly better than routing driven by the charge sharing model. A new algorithm is also proposed and experimental results are presented. Section IV concludes with a discussion on the likely impact of this paper.
to
C2
Figure 2. Equivalent circuit for calculating coupled noise The following two theorems lead to expressions for the coupled noise pulse amplitude and width. Both the expressions are derived from the differential equations characterizing the system and no explicit time-domain solution is necessary. Theorem 1 The integral of the coupled noise over time is given by
II. Coupled noise calculation 2.1 Coupled noise bounds Consider a quiet victim net coupled to several other "aggressor" switching nets, as shown in Figure 1. Net V is
= R,
fvodt
V
A,
A
m
|
Proof: The nodal equation for the output node 0 is dv
Figure 1. A victim net V coupled to aggressors
(1)
X
(X + C2)
Al-A4
-
v + --
dv (X
-
)
=
0
Integrating this over positive time, using the initial conditions (all voltages at 0) and the final values (VO at 0 and Vm at I)and simplifying, we get the result
coupled to nets Al through A4 . Let the rise times of the signals be much larger than the propagation delays, so that a lumped RC model is adequate[3]. As the noise pulse is essentially a small signal, linearity and time-invariance can
Clearly, the proof holds even if the input has non-zero
rise time.
28
The possibility of using overlaps with nets switching slowly to decrease the overall crosstalk on a victim net. Note that overlap is never used to advantage by any of the previous routing methods. Our expression shows that increasing overlap length increases the crosstalk contribution of that particular aggressor. However, it also increases the line capacitance of the victim net and could make the sum of crosstalk contributions of other nets smaller! Thus, not all overlap is bad. Overlap with slow switching nets reduces the noise susceptibility to coupling from other nets. The limiting case of a slowly switching net is, of course, a ground net which serves to increase the line-toground capacitance of the nets adjacent to it. Nets which switch slowly are therefore a resource which needs to be shared among the nets which are coupled noise-critical. Figure 3 shows SPICE results which verify this. Overlap with S reduces the peak noise coupled to V from 1.22V to 0.93V - a significant reduction.
Theorem 2 The peak noise pulse height is bounded above by P
C2 I
(I
+-+-
X
(2)
C,
R +-)
R2
X
Proof: When the coupled noise pulse is at its maximum, the derivative of VO with respect to time is zero. Using this in the nodal equation at 0, we get VP
dv.
-
= x
R2,
-
dt v0 =VP
From the nodal equation at M, we get I-v
dv
dt vo= VP
RI
'
Vp V
(X + C,)
Using the two equations above, we get R2 V
=
R. R
X
(I
(X + C1 )
VO
0
P
The equation at 0 can also be written as v, +
ox
v.
V, + A = X
Vm.,
I... .L.
L.LA.
A.,
In order to utilize this degree of freedom, jogs or doglegs may be essential. For instance, if a net with a stringent noise margin is being routed through a channel which has only two slowly switching nets, one on the top left and the other on the bottom right of the channel, the net would have to be routed with a jog if its coupled noise constraint is to be satisfied. Note that the graph-based solution does not introduce jogs and would therefore be sub-optimal. The use of a purely capacitive charge sharing model may lead to incorrect conclusions about the coupled noise. For instance, the charge sharing model may predict that adjacency to net a is better than adjacency to net b, but the actual situation might be the opposite due to a larger drive resistance or line capacitance of net b. The noise calculations based on a capacitive charge sharing model may, therefore, show poor fidelity to the actual coupled noise. Figure 4 shows SPICE simulations to support this.
x x+
.
in (a), while in (b) it overlaps with only F. Noise in (a) is smaller.
v=
The term A is the integral of the noise pulse till the time when the maximum is reached and is strictly positive. Neglecting A and substituting for the voltage at M when the noise pulse reaches its maximum and rearranging, we get the required upper bound.E Note that in Theorem 2, when RI/R 2 = 0, the expression for the peak coupled noise voltage reduces to vP =
2
(b) time IOns Figure 3. Increased overlap leading to smaller total coupled noise The victim net, V,overlaps with the slow S net and the fast F net
Using this equation with t equal to the time when the coupled noise pulse reaches its maximum, we get (X + C 2 )
. . . . . . . . . . 2
0X v dt = X
-
.. . . . . ...
v
(a)
t
(X + C 2 )
3
v
=" V
C2
which is similar in form to the capacitive charge sharing expression. However, in this expression, C2 is the sum of the line-to-ground capacitance and all the line-to-line couplings from lines adjacent to line 2 (other than line 1). The pairwise capacitance ratio used in [11] is, therefore, pessimistic even in the limiting case of a coupled node with infinite output resistance. As the expression depends on other line-to-line couplings, the decoupling of total noise into independent pairwise contributions is not possible. The noise contribution depends on the other lines adjacent to the aggressor net and this cannot be handled by any graph-based approach - the formulation would need to be based on hypergraphs With line-to-line couplings becoming a significant fraction of lineto-ground capacitances in sub-micron ICs, the graph-based approach is less applicable. 2.2 Design implications Theorems 1 and 2 lead to several interesting design implications. These include:
v
+ X
Dox
1t 3.6 (a)
Db
II
I
time Figure 4. Pure charge sharing model exhibits poor fidelity when driver sizes vary. (a) shows twice the overlap as (b), but with a weaker driver. The coupled noise is larger for (b).
. The drive strength of ECL gates is equal to their output resistance. In this case, the expression shows that it is use-
29
ful to route nets of equal drive strengths adjacent to each other. In this way the ratio RI/R 2 is not too large when either net is considered as the victim net. Thus the optimal track assignment of a set of equal length nets entering and leaving a channel (with no other connection to be made) is obtained by sorting in order of drive strength. * Coupled noise is less of a problem for strongly driven nets. These nets have small R2, so that the peak coupled noise voltage is smaller and the noise integral is proportionately smaller. * Longer tolerable overlap lengths are obtained than using the charge sharing model. This could lead to more flexible routing. * Coupled noise could be a problem for all net lengths as it depends on the ratio of the line-to-line capacitance to the line-to-ground capacitance. The fidelity of the new expressions are evaluated next using comparisons with exact analytical solutions and SPICE simulations for 0.5 micron CMOS. Figures 5a, 5b and 5c compare the peak noise voltage computed with the capacitive charge sharing model and the new expression for the practical range of parameter ratios. On average, the upper bound is a factor of 2.5 smaller than the pessimistic prediction of the charge sharing model.
25
charge sharing model
\ \
Vu)
output voltage and the noise pulse are shown. The interconnect is modelled by 100 distributed LC sections for the SPICE simulation. The peak noise pulse height is 0.7V and the equivalent pulse width is 4 ns. The peak pulse height is calculated by our formula to be IV. The capacitive charge sharing model predicts 1.65V peak pulse height and pulse width equal to the input pulse width (iOns). Note that the SPICE results are consistent with a finite output resistance the noise voltage discharges before the end of the clock period.
05 I
1
7
Cn
A
2
,d
Normalize coupled noise
15 '.1 05 1
v,
2
charge sharing model
'.2
I
I I
T N. - A.
III
25
entire length. The total line-to-substrate capacitances are 70fF and the line-to-line coupling capacitance is 50fF. The MOSFET models are from MOSIS. The SPICE simulation results for the circuit is shown in Figure 7a and the simulation results for the RC network are shown in Figure 7b. The
Figure 7. Model fidelity. a) RC equivalent circuit. b) Simulated output and noise voltage.
15 '.1
5a. Coupled noise variation with RI/R 2
Figure 6. Coupled noise in 0.5 micron CMOS. a) Circuit configuration. b) Simulated (SPICE) output and noise voltage.
n-
4 4,'f'0*(tn!6
1.3 Normalize( coupled '.2 noise
Consider the case of two minimum size driver-receiver pairs in 0.5 micron CMOS coupled capacitively as shown in Figure 6. The lines are 1mm long and run parallel along the
III. Routing to minimize coupled noise new bound l
CI/C2
4
h
K
Sb. Coupled noise variation with C1/C2
.
..
H
..
.9
10(
30
Equations (1) and (2) in Section II could be used by coupled noise-driven routers. As we are interested in large complexities, coupled noise should be considered when an entire set of nets is being routed. We, therefore, demonstrate the use of the new expressions in a channel router. We must emphasize, however, that other routers could also utilize the formulas. We begin by showing that the two coupled noiseconstrained channel routers proposed so far are incapable of using these new expressions. 3.1 A pathological instancefor the ILPformulation The integer linear formulation for finding track permutations is not amenable to change using the new expressions as the noise coupled to a net is no longer a sum of weighted overlap lengths and an intractable non-linear programming formulation becomes necessary. Even for the ILP case, the
channel routing instance in Figure 8 shows an example where track segment permutation rather than track permutation is necessary. The C nets are critical but have been routed
1i DJ A~
*---
S I. 1 a) Crosstalk bounds violated on C nets
E;
this problem is NP-complete when total coupled noise is to be minimized and provide a travelling salesperson solution. This solution is of independent theoretical interest and can be used even in the absence of coupled noise (with crossing count based costs, for instance). 3.3 Wire ordering to minimize total coupled noise Consider the problem of ordering the nets entering a channel [17], [18]. The ordering determines the aggressor nets for each victim net and we wish to minimize the "total" crosstalk. Formally, the problem is stated as the MCWO (minimum crosstalk wire ordering) problem below. Instance: An NxN crosstalk matrix [C] where C(i,j) specifies the crosstalk on net i due to the adjacent j net and a number TC. Question: Is there an ordering of the nets such that the total crosstalk is less than TC. Theorem 3 [MCWO] is NP-complete. Proof: Reduction from the travelling salesperson problem with distance matrix C(ij) and maximum Hamiltonian path cost of TC. a The proof of Theorem 3 enables the use of the heuristics developed for the travelling salesperson problem to obtain a wire ordering. Note that this NP-completeness result does not use vertical constraints as in [11] and is therefore a stronger result. Vertical constraints make channel routing NPcomplete and our result shows that crosstalk independently makes the problem intractable. 3.4 Greedy channel routing The pivotal idea of greedy channel routing is to route the channel using a column scan and completely routing a column before moving on to the next, introducing jogs when necessary. In order to consider coupled noise, the track assignment during the scan should attempt to satisfy crosstalk constraints on all nets. This is facilitated by the fact that precise adjacency information is available for the columns already routed. Equations (1) and (2) of Section II can now be used to dynamically identify the nets which are crosstalk-critical and appropriate jogs used to diminish the noise coupled onto these nets. The cost function used is based on our bound. Theorem 4 gives a sufficient condition for any routing solution to be free of coupled noise problems. We first define the notation used in the statement of the Theorem. A(i) is the set of aggressor nets for net i and comprises all nets routed adjacent to it. X.- is the coupling capacitance between nets i and j, Cg is the line-to-ground capacitance per unit length, li is the length of net i, Rjo is the output resistance of the driver for net j, Ri is the driver resistance for net i and E i is the maximum amplitude function dependent on the noise integral divided by the output resistance. E i is determined by simulation for each receiver and is typically of the form shown in Figure 10 below. Note that this function is a property of a net. For a multi-pin net, the lumped capacitance model leads to identical coupled noise waveforms on all receivers. Therefore, we find the allowed coupled noise on the net for a given total coupling to be equal to the corresponding smallest allowed noise amplitude. For nets with bidirectional drivers,
metall line metal2 line vvia
Lu Lurs,
b) Better routing satisfies crosstalk bounds Figure 8. Track segment permutation vs. track permutation. In (a), the tracks on the top half cannot be swapped with the tracks on the bottom half due to vertical constraints imposed by the U and D nets. Tack segment permutations are used to get the solution in (b) which satisfies crosstalk bounds. adjacent to each other by a coupled noise-oblivious router. The S nets, had they been interposed between the C nets, could have served to reduce the coupled noise. Track permutations to alleviate coupled noise on the C nets are not possible as there are vertical constraints imposed on every pair of upper and lower tracks by the nets on the right. If track segment permutations had been allowed, the routing shown in Figure 8b becomes possible. Note that coupled noise is particularly a problem when the layout is dense, as in the Deutsch difficult example. On such benchmarks, the ILP formulation performs poorly as its solution space is limited by the stringent vertical constraints imposed, much like the instance shown in Figure 8a. 3.2 Pathologicalinstancefor the graph-basedapproach Graph-based approaches cannot handle interactions over sets of nets when the set size is larger than 2, so that the work presented in [14], [15], [11] is less powerful. A pathological instance for the algorithm is shown in Figure 9. YZ
YZ
11
1
Z
Z
*
(a) (b) Figure 9. The importance of using jogs or doglegs when routing is constrained by coupled noise. a) No jogs or doglegs are used leading to large coupled noise. b) A dogleg in net Z reduces coupled noise. The primary reason for the sub-optimality shown in Figure 9 is that the algorithm constrains the entire net to run on a single track, which makes the combination of coupling constraints and routing constraints difficult to handle. We therefore propose the use of a new channel router which maintains exact adjacency information at each stage and can introduce jogs when necessary, either motivated by coupled noise issues or for routing purposes. It is based on the "greedy" channel router described in [ 16]. We briefly review the work presented in [16] and outline a new technique to find the optimal "greedy move". We begin with the problem of wire ordering at the ends of the channel - we show that
31
the maximum amplitude can be similarly defined as the worst case scenario - the smallest allowed amplitude for that particular coupled capacitance for every possible driverreceiver combination. In short, the function Ei serves to formalize the dynamic noise margin concept and is defined over coupling capacitance space as this is easily derivable from the layout.
This is the standard greedy routing algorithm with two novel features. . The initial wire ordering is not simply clustering in the middle and uses the heuristic motivated by Theorem 3. . The jog insertion phases uses the dynamically updated coupled noise information to find an optimal jog, if necessary. to reduce coupled noise. Upper and lower bounds on the coupled noise expression are determined along with upper and lower bounds for the right hand side of the inequality in Theorem 4. This allows quick and accurate identification of coupled noisecritical nets. In order to keep the number of vias required from becoming excessive, only two jogs per column for coupled noise reduction are allowed. Tradeoff exploration of jogs for coupled noise reduction is possible by modifying the jog insertion heuristic. Almost every stage of the greedy channel router can be modified to reflect coupled noise concerns. Our implementation changes only two of the phases.
Maximum noise
amplitude Noise pulse width
X
Figure 9. Transforming the A-W plot to a Ei vs. X plot Theorem 4 A routing solution will not fail due to coupled noise if, for all nets i, Rj s
je~)
(
where
R
Cj .Xi
C' -I <Ej( + -+ij )
E jle A (i)
X'
Ci = CX 1i +
A
3.5. Channel routing results
In this sub-section we describe the experimental results obtained using our channel router. We compare the greedy channel router oblivious to coupled noise with the algorithm outlined in the previous sub-section, both implemented in C. The implementation in [11] was not available[19] and therefore could not be compared. The average normalized (to the supply voltage) coupled noise results are presented in Table 1. On average, the algorithm leads to about 22% lower cou-
X jj)
xj
j e A (i)
Proof: The sum of the left hand side of the inequality is just the sum of the upper bounds on noise contributions from all aggressor nets, from Theorem 1. This amplitude must be smaller than the maximum allowed amplitude for this amplitude-pulse width product. The expression for the amplitudepulse width product is substituted from Theorem 2 to obtain the result.C Theorem 4 directly suggests a linear time verification procedure which scans the layout and updates the corresponding maximum peak noise (the right hand side of the inequality in Theorem 4) and noise sums (the left hand side of the inequality) for each net. This verification procedure is optimal in time complexity as any verification procedure has to scan the entire layout before pronouncing it correct. The layout determines the sets A(i), the Cis and the Xijs. Note that during any stage of a greedy routing process, we can determine upper and lower bound on all relevant capacitances to find all nets which are potentially coupled-noise critical. An optimal jog is inserted to improve the coupled noise situation. The algorithm template is defined below. Algorithm Xtinguish
TABLE 1. Channel routing results Normalized average crosstalk CMOS ECL Bench- # #Colmark nets umns Xtinguish Greedy Xtinguish Greedy
Input: Channel routing instance, technology parameters Cg, Ri, Xo, X functions. Output: Channel routing solution satisfying crosstalk bounds. begin{ initial wire ordering using a travelling salesperson heuristic route channel from left to right( make top and bottom connections collapse split nets add jogs to reduce coupled noise I/ this is new add jogs to reduce split net range add jogs to raise rising nets and lower falling nets widen channel if necessary proceed to next column 1 update coupled noise information H/this is also new I
3a
30
45
.136
.166
.072
.097
3b
47
62
.148
.155
.085
.087
3c 3cr
54 54
103 103
.154 .146
.239 .227
.088 .091
.138 .131
ddr
72
169
.217
.242
.131
.137
exI
235
417
.083
.091
.051
.052
ex2
282
421
.063
.066
.033
.037
ex3
291
421
.043
.067
.028
.039
ex4
270
421
.060
.072
.036
.042
nI
77
139
.185
.262
.099
.150
n2
77
117
.115
.155
.071
.090
n3
78
123
.169
.157
.096
.091
n4
74
150
.197
.257
.119
.147
rl
77
139
.187
.252
.109
.143
r2
77
117
.124
.152
.070
.090
r3
78
123
.153
.158
.091
.092
r4
74
150
.218
.244
.121
.140
r5
112
150
.131
.141
.076
.082
157
.229
.232
.131
.132
Deutsch 52
32
References
pled noise for CMOS and ECL. Drive strengths are assumed to vary from lx to lOx. The number of tracks is typically the same for both solutions, i.e., there is no area penalty. The time required for each of these is at most a few seconds on a DEC 3100 workstation. The parameters used are representative of 0.5 micron CMOS and ECL.
[1] 1. Catt, "Crosstalk (noise) in digital systems", IEEE Transactions on Electronic Computers, Vol. 16, No. 6, pp.743-763, 1967. [2] P. Larsson and C. Svensson, "Noise in digital dynamic CMOS circuits", IEEE Journal of Solid-State Circuits, June 1994, pp. 655-662. [3] S.I. Long and S.E. Butner, Gallium Arsenide Digital IC Design, McGraw-Hill, 1990, Ch. 5. [4] R.R. Tummala and E.J. Rymaszewski, Microelectronics Packaging Handbook, Van Nostrand Reinhold, 1989. [5] L. Gal, "On-chip crosstalk - the new signal integrity challenge", Proceedings of the Custom Integrated Circuits Conference, 1995, pp. 12.1.1 - 12.1.4. [6] G.A. Katopis, "Delta-I noise specification for a high-performance computing machine", Proceedings of the IEEE, September 1985, pp. 1405-1415. [71 T. Sakurai, "Closed form expressions for interconnection delay, coupling and crosstalk in VLSIs", IEEE Transactions on Electron Devices, Vol. 40, No. 1, 1993, pp. 118-123. [8] J. Rubinstein, P. Penfield and M.A. Horowitz, "Signal delay in RC tree networks", IEEE Transactions on Computer-Aided Design of ICs and Systems, Vol. 2. No.3, 1983, pp. 202-210. [9] T. Gao and C.L. Liu, "Minimum crosstalk channel routing", Digest of Technical Papers of the International Conference on Computer-Aided Design, 1993, pp. 692-696. [10] T. Gao and C.L. Liu, "Minimum crosstalk switchbox routing", Digest of Technical Papers of the International Conference on Computer-Aided Design. 1994, pp. 610-615. [11] D. Kirkpatrick and A. Sangiovanni-Vincentelli, "Techniques for crosstalk avoidance in the design of high-performance digital systems", Digest of Technical Papers of the International Conference on Computer-Aided Design. 1994, pp. 616-619. [12] S. Mitra, S.K. Nag, R.A. Rutenbar and L.R. Carley, "Systemlevel routing of mixed-signal ASICs in WREN", Digest of Technical Papers of the International Conference on Computer-Aided Design, 1992, pp. 394-399. [13] A. Onozawa, K. Chaudhary and E.S. Kuh, "Performance driven spacing algorithms using attractive and repulsive constraints for submicron LSIs", IEEE Transactions on CAD of ICs and Systems, Vol. 14, No. 6, 1995, pp. 707-719. [141 H.H. Chen and E.S. Kuh, "Glitter: a gridless variable width channel router", IEEE Transactions on Computer-Aided Design of ICs and Systems, Vol. 5, No. 4, 1986, pp. 459-465. [15] U. Choudhury and A. Sangiovanni-Vincentelli, "Constraintbased channel routing for analog and mixed analog/digital circuits", IEEE Transactions on Computer-Aided Design of ICs and Systems, Vol. 12, No. 4, 1990, pp. 497-5 10. [16] R. L. Rivest and C.M. Fiduccia, "A greedy channel router", Proceedings of the DAC, 1982, pp. 418-424. [17] P. Groenveld, "Wire ordering for detailed routing", IEEE Design and Test of Computers, December 1989, pp. 6-17. [18] M. Marek-Sadowska and M. Sarrafzadeh, "The crossing distribution problem", IEEE Transactions on Computer-Aided Design of ICs and Systems, Vol. 14, No. 4, 1995, pp. 423-433. [19] D. Kirkpatrick, private communication, May 1995. [20] D. Theune, R. Thiele, W. John and T. Lengauer, "Robust methods for EMC-driven routing", IEEE Transactions on Computer-Aided Design of ICs and Systems, Vol. 13, No. 11, 1994, pp. 1366-1378. [21] G.L. Matthaei, J.C.-H. Shu and S.I. Long, "Simplified calculation of wave coupling between lines in high-speed integrated circuits", IEEE Transactions on Circuits and Systems, Vol. 37, No. 10, 1990, pp. 1201-1208.
IV. Discussion and conclusions The analysis results of Section II enable quick computation of bounds for coupled noise which are intuitive and enable better design. We believe that these bounds will spawn a new class of coupled noise-constrained layout systems. Section III has shown that routing algorithms could utilize these bounds to improve layouts. While the focus has been on channel routing, this is by no means the only routing formulation which could be modified to include coupled noise. Area routers, switchbox routers, etc. could also use our work. We believe that our channel routing results of Section IV will lead to a paradigm shift away from graph-based approaches to algorithms which maintain exact adjacency information, especially with coupled noise becoming a major issue. We have considered only channels where a lumped capacitance model is appropriate and the question of long channels remains open. We are currently addressing the issue of bounds on crosstalk for layout where transmission line analysis is necessary. This is particularly essential for PCBs and MCMs. It is usually handled by grouping nets into net classes and conducting simulations to determine allowable overlap lengths [20]. It appears to be difficult to obtain simple, elegant bounds for these cases which capture relevant parameters and are accurate. The RC model is considerably in error for these cases[21] and could be optimistic. The wide variety of termination possibilities of these lines also make good abstractions difficult. For sub-micron VLSI, however, our methods appear to be adequate. Timing analysis can be used by routers [5], [11] to identify pairs of nets between which interaction is allowed. Our algorithm can be extended easily to handle this information too. Post-layout optimization for crosstalk such as the work in [9] and [13] could be used to further improve our results. Note that jog insertion is not attempted by these techniques. Our algorithm addresses this issue and therefore complements these methods well. Besides, our models (after suitable linearization) should improve the results [9] and [13] obtain. In conclusion, we have presented new results for coupled noise computation in VLSI circuits. We have used these to show several novel design implications and have presented innovative routing techniques for coupled noise reduction.
Acknowledgments We would like to thank D. Kirkpatrick of UC, Berkeley for providing the benchmarks and for many discussions. We would also like to thank C.-C. Lin of UCSB for providing us his greedy channel router implementation.
33
SIMULTANEOUS TRANSISTOR AND INTERCONNECT SIZING USING GENERAL DOMINANCE PROPERTY Jason Cong and Lei He Department of Computer Science University of California, Los Angeles, CA 90095 *
given cell library for performance optimization. Recent gate sizing works can be found in [1, 2, 3]. However, all these works ignored the sizing of interconnects. The interconnect sizing problem, often called the wiresizing problem, was first introduced in [6, 7] where the authors developed the first polynomial-time optimal wiresizing algorithm to minimize the weighted Elmore delay between the unique source and a set of critical sinks. Later on, the wiresizing problem to minimize the maximum delay along a RC tree was formulated as a posynomial programming problem and solved in [12] by the sensitivity-based algorithm similar to that in [9]. In addition, the optimal wiresizing problem for interconnects with multiple sources was formulated and solved optimally in [4]. All these works, however, did not consider the need to size the driving transistors again after interconnects have been changed. Several recent studies consider both gate and interconnect sizing. The work in [5] formulated the simultaneous driver and wire sizing problem to size a single routing tree driven by a chain of cascaded drivers and developed an efficient optimal algorithm for both delay and power optimization. The authors of [11] studied the simultaneous wire sizing and buffer insertion problem for a single RC tree and solved it by a dynamic programming approach. Finally, the concurrent gate and wire sizing problem was studied in [15] using a sequential quadratic programming technique with the assumption that all transistor sizes in a gate are scaled isotropically. However, if we assume that all transistor in a gate are sized isotropically, it often leads to suboptimal designs, especially in the full-custom layout. In this paper, we shall study the simultaneous transistor and interconnect sizing (STIS) problem, where the optimal size for each transistor (instead of a gate or cell) and the optimal wire width for each wire segment are computed independently in order to achieve more optimized designs. We show that the STIS problem under a number of transistor and interconnect models has the objective functions of the following form:
ABSTRACT We study the simultaneous transistor and interconnect sizing (STIS) problem in this paper. We define a class of optimization problems named CH-posynomial programs and show a general dominance property for all CH-posynomial programs (Theorem 1). Based on this property, a set of lower and upper bounds for the optimal solution of a CH-posynomial program can be computed through local refinement operations very efficiently (in polynomial time). We show that the STIS problem under a number of transistor and interconnect models is CH-posynomial programs, for example, when we use the RC tree model for interconnects and the step or the slope model for transistors. Preliminary experimental results show that in nearly all cases, the optimal solution is achieved because the recursive application of local refinement operations using the dominance property leads to the identical lower and upper bounds. Moreover, the STIS algorithm produces the more optimized solution when compared with optimal transistor sizing only. 1. INTRODUCTION It is well recognized that interconnect delay has become the dominating factor in determining the circuit performance in deep submicron designs. We believe that the most effective way for performance optimization in deep submicron design is to consider both logic and interconnect designs throughout the entire design process. As part of our effort to develop a unified methodology and platform for simultaneous logic and interconnect design and optimization, we study the simultaneous transistor and interconnect sizing problem (STIS) for delay minimization in this paper. Most previous works consider the device sizing and the interconnect sizing problems separately. The device sizing problem includes both gate sizing and transistorsizing problems. In [9], the transistor sizing problem was formulated as a posynomial programming problem under the Elmore delay formulation for the RC tree model and solved by a sensitivity-based heuristics. Later, the authors of [13] applied the delay model developed in [10] for their transistor sizing formulation and solved it by a convex programming technique. The gate sizing problem usually assumes that all transistor sizes within each gate scale isotropically [14] (i.e., all transistor sizes increase or decrease by an uniform factor), or each gate has a discrete set of implementations (cells) with different driving capabilities pre-designed as a
f(X)
=
±. 5bhi .
E
p4i
pqji'
where
zi, z,
E X =
X,
YZP +
,z'i pti
,n)
p,q E (1,2,-,m),
apq,ij, bp,i and cp,i > °
(1)
and its coefficients have the following symmetry:
* This work is partially supported by ARPA/CSTO under contract J-FBI-93-112, the NSF Young Investigator Award MIP9357582 and a grant from Intel Corporation under the NYI matching award program.
1. apq,i > 0 if and only if a,,ji > 0; 2. b,i > 0 only if cp,, > 0 or a,,i, > O for any q and j;
34
3. cpi > 0 only if bpi > 0 or apq,i, > 0 for any q and j; Following the notations in [8], we call the class of functions as CH-posynomials.
Gate2
Definition 1 Eqn. (1) is a simple CH-posynomial if all coefficients are constants independent of X. Definition 2 Eqn. (1) is a general CH-posynomial if coefjicients are functions of xi and x, satisfying the following conditions: ap,,ij monotonically increases with respect to zx while monotonically decreases with respect to x,, and br,, monotonically increases with respect to xi while cp,, monotonically decreases with respect to xi.
M9
Gatel Gate3
M10
(a)
(b)
Figure 1. (a) the gate-level circuit diagram where (b) the gate2 and gate3 are fanout of gatel. transistor-level circuit diagram where gatel and the routing tree linked to its output comprise a DCConnected-Component DCC,. The output of gatel, denoted as N., is the root of the routing tree. The inputs of gate2 and gate3 are sinks of the routing tree.
Furthermore, we call an optimization problem to minimize a simple CH-posynomial as a simple CH-posynomialprogram, and to minimize a general CH-posynomial a general CHposynomial program. We study the following dominance property for CH-posynomial programs. Definition 3 (Dominance Relation) For two vectors X and X', we say that X dominates X' (denoted as X > X') if x, > z$ for all i.
2. FORMULATIONS We consider the CMOS static logic in this paper. Since the transistor channel length is usually fixed to the minimum feature size, we only allow the channel width to change during transistor sizing and shall use width to refer both the channel width of a transistor and the wire width of an interconnect. We will first formulate the delay as a function of the transistor/wire widths, then show the STIS problem for delay minimization is a CH-posynomial program.
Definition 4 (Local Refinement Operation) The local refinement operation of a solution vector X, with respect to any particularvariable zi and function f (X), is to minimize f (X) subject to only evaluating xi while keeping the value of any xj(j - i). We say that the result solution vector is the local refinement of X (with respect to zi). For simplicity of presentation. we shall use solution instead of solution vector.
2.1. Delay Formulation Because an MOS transistor is a voltage-controlled device, an MOS circuit can be partitioned into a number of DCConnected Components (DCCs) [18]. A DCC is a set of transistors and wires that are connected by DC-current paths containing only transistor channels or wires. The DC current can not cross the boundary of a DCC. In most cases, a DCC consists of a gate G and a routing tree connecting the output (denoted as N.) of G to the inputs of all gates driven by G (see Figure 1). Our delay computation is similar to that in the switch level timing analysis tool Crystal [16]. The delay will be computed based on a stage, which is a DC-current path from a signal source (either the Vdd or the ground) to the gate of a transistor, including both transistors and wires (see Figure 2). The delay of a stage is the summary of delays through all transistors and wires in the stage.
Definition 5 (Dominance Property) Let X* be the optimal solution to minimize f (X). If X dominates X*, a local refinement of X still dominates X*; If X is dominated by X*, a local refinement of X is still dominated by X* We proved the following important Theorem 1 that will lead to our STIS algorithm later on. Theorem 1 The dominance property holds for both simple and general CH-posynomial programs. The authors of [7] first proposed the dominance property for their single-source optimal wiresizing formulation. Our results greatly generalize the concept of the dominance property and reveal that the dominance property holds for a large class of optimization problems instead of the single optimization problem in [7], which is an instance of the simple CH-posynomial program. The dominance property leads to an efficient algorithm to compute a set of lower and upper bounds of the optimal solution to a CH-posynomial program by local refinement operations very efficiently (in polynomial time). The algorithm has guaranteed convergence and optimality and can be applied to many optimization problems in VLSI CAD and other domains. We will show that the STIS problem is CH-posynomial programs when we use the RC tree model for interconnects and the step or the slope model for transistors. Preliminary experimental results show that in nearly all cases, the optimal solution is achieved because the recursive application of local refinement operations using the dominance property leads to the identical lower and upper bounds. So the algorithm is optimal in the practical sense. Besides, the STIS algorithm produces the more optimized solution when compared with optimal transistor sizing only.
A. Delay through transistors A transistor can be modeled by the source-drain effective resistance r and the gate, source and drain capacitances cg, c, and Cd. Let 2 be the transistor width, r, c5 , c, and Cd can be written as the following: r
=
ro/x
C9
=
Cg5
X
CS
=
c'o
X
Cd
=
CdO
X
Where c,0, co and Cdo are the gate, source and drain capacitances for a unit-width transistor and can be viewed as constants without loss much accuracy. In addition, ro is called unit effective resistance that is defined in the following: Let
35
width x and length I are No M2
M6 M,9 (-)
N.
No
M3
H
M4
H (')
5
TO I/x
=
co
I
I + ci
I
Tk. Let Tk be the resistance of the uni-segment Ek with downstream node at Nk, the delay t(P'(No, N,)) along the
unique path PI(N0 , Nt) between node No and sink Nt is t(P'(N, N,)) =
:
Tk
(3)
.Ck
Nk EP'(NoTVt )
C. Delay through a stage (3), the delay (2) and Eqn. With respect to Eqn. t(P(NsNt), X) of stage P(Ns, Nt) can be written as according to [19]:
a rising input drive an inverter with total capacitance loading CL. If the 50% delay is 7, we say that r = r/CL is the effective resistance of the n-type transistor and the unit effective resistance ro is given by r x with x being the size of the n-type transistor. The unit effective resistance of the p-type transistor can be defined similarly by the delay under the falling input waveform. If X = {x1 ..-. ,xn} is the sizing solution for all transistors and wires, in general, ro shall be a function of X. For simplicity of presentation, we use rO instead of ro(X). However, it is worthwhile to mention that the unit effective resistance can consider the nonlinear characteristic of the transistor and the waveform slope effect. High accuracy can be achieved when using a table based method and more discussions will be given in Section 2.3. Under this transistor model, the gate part of a DCC becomes an RC network. Let PM(N,, N0) denote the path corresponding to all transistors in a stage. When computing the delay through these transistors, we only consider the effective resistances in path PM(N',, N) and the capacitances connected to nodes in path PM(N,, No). Let cl denote the total capacitance at node Nk due to source/drain capacitances of all transistors linked to Nk and C, the total capacitance due to the routing tree and its sinks. If R(PM (Ns, Nk)) is the total resistance of the partial path from the source N, to node Nk in path PM(N , Nk), the Elmore delay through path PM(Ns, Nk), denoted as t(PM(N,, No)) is =
=
C
We treat node N. as the root of the routing tree. Consider node Nk in the routing tree and let Tk denote the subtree rooted at node Nk (including node Nk). We denote the total capacitance within Tk as Ck, including the total wire capacitances and the total sink capacitances within
Figure 2. For DCCI in Figure 1, (a) a stage from the Vdd to the gate of transistor Mg; (b) a stage from the Vdd to the gate of transistor Mg; (c) a stage from the ground to the gate of transistor M 6 . Clearly, a transistor and a wire may belong to multiple stages.
t(PM(N,, No))
r
(4)
t(P(N,, NO)I X) t(PM(N,, No)) + t(P'(N,,.N,))
-
)+(1, X,
t,
Zfl t 0ia
1,
stS
hi
i
.
5i
I +
ixi
1i*l,*lJ ± h(
Ii
where xi is the width for a transistor Mi or a wire unisegment Ei, and 1i is the length for a wire uni-segment Ei or 1I= 1 for a transistor Mi. The coefficients f~st, f st gt /h't and hl t can be determined for stage P(N7 , Nt) with respect to the given rO, CgO, cA 1cdO co and cj for either transistors
or wires. 2.2.
STIS Formulation to Minimize Delay for Multiple Critical Paths In order to simultaneously minimize delay along multiple critical paths in a circuit, we propose to minimize the weighted delay t(X) of all stages in these critical paths:
t(X)
At t(P(N, Nt), X)(5)
= P(Ns,Nt)Ecr~itic. poth,
R(PY (N,, N,)) *c
where the penalty weight A"t indicates the criticality of stage P(Ns, Nt). A simplified weight assignment scheme is used in this paper. The weight of a stage is 1 if the stage is in a critical path, otherwise, it is 0. Let
N;,EPM(N-,N,)
R(PM(N,, No)) - Co
(2)
B. Delay through wires A routing tree is modeled as a distribute RC tree, similarly to [7, 4]. Each sink has an extra capacitance due to the gate capacitance of a transistor in a gate driven by the routing tree. Each wire segment is divided into a sequence of sub-segments. Each sub-segment is treated as a 7r-type RC circuit. Since we assume that the wire width is uniform within a sub-segment, a sub-segment is called a uni-segment. Note that the segment division controls how aggressively we perform wiresizing optimization. Clearly, if the unit-width unit-length wire has wire resistance ro, wire area capacitance co and wire fringing capacitance cl, the resistance r and the capacitance c for a uni-segment with
Fo(i, j)
=
E P(N
Fi (i, j)
=
G(i)
=
A' t . fV(i,j)
N,)ECriti-CI poths
I:
As' -fl t(i, j)
E
Ast , gst (i)
P(N, Ni)Ecr-iti-l poths
Hi (i)
=
5 P(N-Nt)EcriticaI poth,
36
A
t
t
.
hi (i).
Theorem 3 The STIS problem under a DP-slope model is a general CH-posynomial program with the dominance property.
and eliminate those terms independent of X, Eqn. (5) becomes
t(X) =
(6)
Foi, j) -
, I., +
+ aG(i)- I' +EHxl(i)
F (i, j) -
1
An example of DP-slope model is the model developed in [10]. For an inverter, let 7o be the delay under the step input and T, be the delay under the input with the transition time of s, [10] derived the following relation
I,
I'
7
= -
a
s
+
7Th
(7)
where ce is a constant determined by the technology. According to Eqn. (7), the unit effective resistance of a transistor is an increasing function of its input transition time. Because increasing the size of a transistor always increases the gate capacitance of the transistor, the input waveform will become slower due to a larger capacitance loading. Thus, the unit effective resistance of a transistor is an increasing function of its size. Since Eqn. (7) is an accurate solution for the inverter delay, we believe that at least most models to consider the waveform slope effect are DP-slope models. It is worthwhile to mention that if Eqn. (7) is used to compute a gate delay by assuming that the input switch time is twice the Elmore delay in the previous stage, like the transistor sizing formulation in [13], the path delay is a simple CHposynomial and the STIS problem to minimize the weighted delay of all stages in multiple critical paths is also a simple CH-posynomial program with the dominance property. However, Theorem 3 is much more general in the sense that it is applicable to a DP-slope model of any form and even without a closed form, as long as the effective unit resistance is an increasing function of the transistor size. A slope model without using a closed form will be discussed in Section 3.2. We would like to emphasize that the STIS algorithm will be developed for any DP-slope model which satisfies Theorem 3.
With respect to Eqn. (6), we define the following STIS problem to minimize delay through multiple critical paths: Formulation 1 Given a circuit and the lower and upper bounds for the width of every transistor/wire, the STIS problem is to determine the width for every transistor/wire (or equivalently, a sizing solution X) such that the weighted delay through multiple critical paths given by Eqn. (6) is minimized. In practice, it is often the case that we want to size the transistors and wires without increase in the layout area (using the free space in the current layout) or with bounded increase in the layout area. Therefore, there is an upper bound associated with each transistor and wire during the optimization. On the other hand, there is a lower bound associated with each transistor and wire due to the technology feature sizes and reliability concerns (like electromigration). Thus, the lower and upper bounds are used to handle these constraints. It will be seen later on that the lower and upper bounds are also the starting point for our STIS algorithm. 2.3. Dominance Property for STIS Problems Coefficient functions Fo, F1 , G and HI in Eqn. (6) are determined by parameters rT, c 9 Og,co,cdo, co and cl. Since we assume that the unit resistance ro for wires and all capacitance parameters are constants independent of X, the property of these coefficients will be determined by the unit effective resistance ro for the transistor. The unit effective resistance ro for the transistor defined in Section 2.1.A is a function of the input waveform slope. The step model assumes that the input waveform is always a step so that ro is a constant independent of the sizing solution X. As a result, all coefficients of Eqn. (6) are positive constants independent of X. Thus, we have the following theorem.
3. ALGORITHMS Generic Algorithms to Exploit Dominance Property For a CH-posynomial f(X), let X be the lower bound of its definition domain and X the upper bound. Since its optimal solution X* must be bounded by X and X, a simple algorithm scheme, the Local Refinement Algorithm (LRA) scheme, can be used to compute a set of tighter lower and upper bounds for X* by applying the local refinement operations beginning with either X or X. We introduce the concept of LR-tight bound in the following. 3.1.
Theorem 2 The STIS problem under the step model is a simple CH-posynomial program with the dominance property.
Definition 7 A lower or upper bound is LR-tight if it can not be tightened any more by a local refinement.
The step model has been used in [9] for transistor sizing and in wiresizing works [7, 12, 4] to model the driver. It was also used in [5] for simultaneous driver and wire sizing. However, the step input is just an ideal assumption and it is well known that the delay under real waveforms will be larger than that under the step input. In order to consider the waveform slope effect on the unit effective resistance for the transistor, we define the following DP-slope model for the transistor.
The LRA scheme is a greedy algorithm based on iterative local refinement operations. If beginning with a solution X = X, the LRA scheme traverses every xi in certain order to perform a local refinement operation on it. Because X is dominated by X' its local refinement is still dominated by X*. This process is repeated and X becomes increasingly closer to and remains dominated by X*. This process is stopped until no improvement is achieved on any ri in the last round of traversal and we obtain a LR-tight lower bound. A LR-tight upper bound can be obtained in the similar way by performing local refinement operations beginning with X = X. In essence, the LRA scheme generalize the greedy wiresizing algorithm GWSA first developed in [7]. If r is
Definition 6 The DP-slope model is a transistor model where the unit effective resistance for the transistor is an increasingfunction of its size. We proved that the STIS problem under a DP-slope model has the dominance property.
37
the maximum number of the possible evaluations for any xi(i = .1,.-. , n}), the LRA scheme will converge in the
in the technology. The allowed transistor widths are {0.5gm, 0.6am,... . 200.0gm } with step of 0.1gm, which are determined by the design rules. Note that the local refinement operation does not depend on how feasible widths are defined, thus our algorithms are applicable to any width scheme for transistors and wires.
polynomial time Q(r * n3).
3.2. Implementation of the DP-slope model We assume a DP-slope model of the most general form with the only requirement to give the unit effective resistance ro for each discrete transistor size and apply a table based method in order to achieve the satisfactory trade-off between accuracy and complexity. In general, the effective unit resistance ro of a transistor is a function of its size, the input waveform slope and the capacitance loading. However, [17] proposed that all the three parameters could be combined into one factor called slope ratio to solely determine the unit effective resistance ro for the transistor. Thus, a one-dimensional table can be used instead of a three-dimensional table. We built a one-dimensional table for every type of transistors based on SPICE simulation results. Our implementation is similar to that in [16].
4.1. Transistor Sizing The dominance property was only used for the optimal wiresizing problem in the past. In this experiment, the STIS algorithm based on the dominance property is applied to the transistor sizing problem. The full adders from 2-bit to 16-bit implemented by complex gates are sized by assuming that all transistors are critical. Although we use an extreme upper bound (200.0 gim) for each transistor, the performance of the STIS algorithm is still quite good. In Table 1, nFET is the total transistor number in a circuit, average nLoc is the average number of local refinement operations for a transistor, time is the total CPU time to size a circuit and average width is the average channel width for all transistors after transistor sizing. A transistor on average reaches its optimal width after 6-8 local refinement operations on it, and the time to size 514 transistors is just 19.78 seconds in a Sparc-10 workstation. The critical delay reduction by the optimal transistor sizing is up to 23.7%.
3.3. Overview of Near-Optimal STIS algorithm The overall STIS algorithm includes three steps: to initialize the coefficient functions, to tighten lower and upper bounds of the optimal solution and to search the optimal solution between the LR-tight lower and upper bounds. Besides, the coefficient functions will be updated during the procedure to tighten lower and upper bounds because the unit effective ro for the transistor under the DP-slope model is a function of the current solution X. In order to efficiently initialize and update the coefficient functions, a circuit containing both transistors and interconnects is pre-partitioned into DCCs. Although the sizes of coefficient function Fo and F. are n x n, their operation complexities are reduced greatly by DCC partitioning because these coefficients are only needed to be computed for transistors and wires within a DCC. It is worthwhile to mention that the LR-tight lower and upper bounds have the zero sensitivity. In other words, the sensitivity based method can not obtain a solution more optimized than the LR-tight lower or upper bound. If the LR-tight lower and upper bounds are identical for every transistor/wire, the optimal solution is achieved immediately, which happens almost all cases in practice. Because both the coefficient operations and the lower and upper bound operations are completed in polynomial-time, the optimal STIS solution is achieved by the polynomial-time in practice. When the LR-tight lower and upper bounds do not meet, it is observed that the gap between the lower and upper bounds are very small, often just of one width in our experiments, and the percent of divergent transistors and wires is also very small, thus enumeration can be carried out in reasonable time. 4.
4.2.
Comparison between STIS and Other Sizing Schemes A 4-bit adder is used to driven a lcm wire in IC technology. Three sizing schemes, i.e., minimum transistor/interconnect width, transistor sizing only, and STIS are used (see Table 2). When compared with the minimum transistor and wire sizing solution, transistor sizing only reduces the maximum delav bv 13.58% and STIS reduces the maximum delav by 27.56%. Clearly, more optimized solution is achieved by the simultaneous transistor and wire sizing. 5.
CONCLUSIONS
We formulated the STIS problem using a distributed RC tree model with consideration of the waveform slope effect for transistors, and developed efficient STIS algorithm based on recursive local refinement computations. The preliminary experiments have shown that the STIS algorithm produces the solution more optimized than that obtained by optimal transistor sizing only. We plan to integrate our STIS algorithm with a timing analysis tool like Crystal [16] and test more circuits in the future. ACKNOWLEDGMENTS The authors would like to thank Professor C.-J. Richard Shi at University of Iowa, Kei-Yong Khoo and Cheng-Kok Koh at UCLA for their helpful discussions and assistance.
EXPERIMENTAL RESULTS REFERENCES
We have implemented the STIS algorithm in ANSI C for the Sun SPARC station environment. Preliminary experiments will be presented in this section. The delays to be reported are computed using HSPICE. The use of HSPICE simulation results, instead of calculated Elmore delay values, not only shows the quality of our STIS solutions, but also verifies the validity of our transistor/interconnect modeling and the correctness of our STIS problem formulation. The MCNC 0.5gm CMOS process technology is used. The wire width choices are { W 1, 2W 1. 3W 1, 4W 1 , 5W 1 }, where WI is the minimum wire width (0.95pm)
[1] M. Berkelaar, P. Buurman and J. Jess, "Computing the Entire Active Area/Power Consumption versus Delay Trade-off Curve for Gate Sizing with a Piecewise Linear Simulator", Proc. IEEE Int'l. Conf. on ComputerAided Design, 1994, pp. 474-480. [2] W. Chuang, S. S. Sapatnekar and I. N. Hajj, "Timing and Area Optimization for Standard-Cell VLSI Circuit Design", IEEE Tran. on Computer-Aided Design, March 1995, pp. 308-320.
38
Adder
nFET
Average nLoc
Time (s)
Average Width
2bit 4bit 8bit 16bit
66 130 258 514
6.82 7.55 7.90 8.07
0.22 1.23 4.40 19.78
2.030 1.923 1.868 1.840
Critical nin-width 0.6021 1.3511 2.8681 5.8878
Delay (ns) opt-width 0.4597 (-23.7%) 1.0592 (-21.6%) 2.4440 (-14.8%) 4.6227 (-21.5%)
Table 1. Critical delay comparison between the minimum-width solution and the optimal-width solution. min FET + rain Wire opt FET + min Wire STIS Table 2. solution.
Total FET Area 828 1119 1268
Total Wire Area 1000 1000 4493
Critical Delav 2.3159ns(0.007c) 2.0012ns(-13.58%) 1.6776ns(-27.56%o)
Critical delay comparison among minimal sizing scheme, transistor sizing only, and the STIS
[14] N. Menezes, S. Pullela, and L. T. Pilegi, "Simultaneous Gate and Interconnect Sizing for Circuit-Level delay Optimization", Proc. ACM/IEEE DAC, 1995, pp. 690695. [15] N. Menezes, R. Baldick, and L. T. Pileggi, "A Sequential Quadratic Programming Approach to Concurrent Gate and Wire Sizing", Proc. IEEE ICCAD, 1995, pp. 144-151. [16] J. K. Ousterhout, "A Switch-Level Timing Verifier for Digital MOS VLSI, " IEEE Trans. on CAD, 4(3) (1983) pp. 336-349. [17] D. J. Pilling and J. G. Skalnik, "A Circuit Model for Predicting Transient Delays in LSI Logic Systems", Proc. 6th Asilomar Conf. on Circuits and Systems, 1972, pp. 424-428. [18] V. B. Rao and I. Hajj, "Switch-Level Timing Simulation of MOS VLSI Circuits", Proc. IEEE ISCAS, 1985, pp. 229-232. [19] J. Rubinstein, P. Penfield, and M. A. Horowitz, "Signal Delay in RC Tree Networks", IEEE Trans. on CAD, 2(3) (1983) pp. 202-211.
[3] G. Chen, H. Onodera and K. Tamaru, "An Iterative Gate Sizing Approach with Accurate Delay Evaluation", Proc. IEEE Int'l. Conf. on Computer-Aided Design, 1995, pp. 422-427. [4] J. Cong and L. He, "Optimal Wiresizing for Interconnects with Multiple Sources", Proc. IEEE Int'l. Conf. on Computer Design, Nov. 1995 (full version as UCLA Computer Science Dept. Tech. Report CSD-00031, 1995). [5] J. Cong, and C.-K. Koh, "Simulataneous Driver and Wire Sizing for Performance and Power Optimization", IEEE Trans. on VLSI, 2(4), December 1994, pp. 408423. [6] J. Cong, K. S. Leung, and D. Zhou, "PerformanceDriven Interconnect Design Based on Distributed RC Delay Model", Proc. ACM/IEEE Design Automation Conf., 1993, pp. 606-611. [7] J. Cong and K. S. Leung, "Optimal Wiresizing Under the Distributed Elmore Delay Model", IEEE Trans. on CAD, 14(3), March 1995, pp. 321-336 (extended abstract in Proc. IEEE Int'l. Conf. on Computer-Aided Design, 1993, pp. 634-639). [8] J. G. Ecker, "Geometric Programming: Methods, Computations and Appicaltions", SIAM Review, Vol. 22, No. 3, July 1980, pp. 338-362. [9] J. P. Fishburn and A. E. Dunlop, "TILOS: A Psoynomial Programming Approach to Transistor Sizing", Proc. IEEE Int'l. Conf. on Computer-Aided Design, 1985, pp. 326-328. [10] N. Hedenstierna, and K. 0. Jeppson, "CMOS Circuit Speed and Buffer Optimization", IEEE Tran. on CAD, 1987, pp. 270-281. [11] J. Lillis, C. K. Cheng and T. T. Y. Lin, "Optimal Wire Sizing and Buffer Insertion for Low Power and a Generalized Delay Model", Proc. IEEE Int'l. Conf. on Computer-Aided Design, Nov. 1995, pp. 138-143. [12] S. S. Sapatnekar, "RC Interconnect Optimization Under the Elmore Delay Model", Proc. ACM/IEEE Design Automation Conf., 1994, pp. 387-391. [13] S. S. Sapatnekar, V. B. Rao, P. M. Vaidya, and S. M. Kang, "An Exact Solution to the Transistor Sizing Problem for CMOS Circuits Using Convex Optimization", IEEE Tran. on CAD, November 1993, pp. 1621-1634.
39
HIERARCHICAL CLOCK-NETWORK OPTIMIZATION Daksh Lehtherl, Satyamurthy Pullela 2 , David Blaauw3, Shantanu Ganguly 4 Somerset Design Center, Motorola Inc., 9737 Great Hills Trail, Austin TX 78759 1 daksh @ibmoto.com, 4 [email protected] Motorola Inc., 6501 William Cannon Drive West, Austin, TX 787352 2 [email protected], 3 [email protected]
ond-order delay model is used to evaluate delays and slopes at the clock-pins. Wire sizing is based on a sensitivity based technique. General network topologies such as clock-meshes and non-binary trees are handled by this tool.
ABSTRACT Clock-distribution network design for high-performance microprocessors has become increasingly challenging in recent years due to lower-skew tolerances, larger networks, and low-power requirements. The design of a typical clock-network entails a substantial amount of designer time and effort to meet these interrelated objectives. The work presented in this paperaims at automating the clock-network design process while being able to achieve near optimal design solutions. Skew optimization is performed by partitioningclock-networks and then hierarchically sizing wires, to reduce overall design time.
The following sections describe the use of this wirewidth optimization tool in a-hierarchical fashion to achieve quicker turnaround time for large networks. The efficacy of the approach is seen in terms of low run times on realistic examples. 2. BACKGROUND The problem of designing clock-distribution networks entails the design of the routing from a clock-source to all clocked-elements, in a manner that minimizes skew between various clocked-elements. This problem has been addressed in the past with a wide range of techniques [1, 2, 3]. The focus of recent approaches has been to reduce skew by balancing the Elmore-delay from a source to various clock-targets. Notable among these is the Tsay's algorithm [4]. This approach aims at achieving "zero-skew", by recursively constructing balanced binary clock-trees. The delay is balanced by selecting a tapping-point on the route between two Elmore-delay balanced sub-trees. The design of clock-trees by the selection of tapping-points in this manner may not always be possible in practice due to constraints on available routing area. An alternative to this approach, was presented in [5] and was based on ensuring Elmore-delay balance by varying wire widths. This approach has the advantage that the widths of wires of a routed clock-network can be optimized for skew, and hence requires minimal changes to existing floor-plan, and placement. In order to consider higher order delay models, the current tool uses the techniques described in [11] to generate the target waveform at the clock-nodes.
1. INTRODUCTION The design of clock-networks for microprocessors has become a formidable task due to contemporary clockspeeds, large die sizes and complexity of clocked logic. Optimality of clock-network design is crucial toward meeting performance criteria of high-speed designs. In addition, considerations for low-power and stability of power supplies dictate that the total network capacitance be bounded. In addition to meeting performance criterion, clock-routing and optimization tools have to account for complex placement configurations. In view of these facts it is becoming increasingly important to develop tools that would optimize general clock trees, as well as meshes. This paper reports on the design methodology being developed at Somerset design center for the automated design of clock-networks of PowerPCTM family of microprocessors. A wire-width based skew-optimization tool CLOSYT (CLOck-network SYnThesis) forms the core of the clock-network synthesis. This tool aims at providing designers with the ability to synthesize near optimal clocknetworks in a reasonable amount of time. Desired slope and delay targets can be specified as parameters to the optimizer. The tool sizes the wires in the clock-net to achieve these delay-slope requirements, while meeting specific constraints on the wire-width. An AWE based sec-
3. DESIGN METHODOLOGY Clock signal is distributed to latches through several layers of buffers or regenerators. Typical design methodol-
40
ogies use tree or mesh type structures to distribute the signal from the central signal source to these regenerators. This network forms the primary clock-network and is main cause of signal skew. The regenerators then distribute the signal to the cells or latches that are geometrically closest to this regenerator through secondary networks. Although skew is effected both by the cell assignment to a regenerator and the relative location of cells, as these auxiliary nets are relatively small, their impact on overall skew is negligible.
not cause the initial network to be excessively unbalanced. This is important because the final wire-width optimization solution has to meet width constraints and a limit on the network capacitance and hence excessive metal cannot be added during the optimization phase. In order to achieve a reasonably balanced load assignment, clock-regenerators are grouped into what will be referred to here as "clusters". The assignment of a regenerator to a cluster depends on the physical location of regenerator and the estimated delay from the cluster source to the regenerator. The locations of the clock-regenerators are known from the placement of the cells. The delay from a particular branch of the central network to a clock-regenerator is dependent on the input-capacitance of a regenerator, the Manhattan distance between the closest central-network branch and regenerator location. The distance to the regenerators is approximated by the Manhattan distance. The delay to every target clock-regenerator is then estimated using RICE[6]. A clock-regenerator is then assigned to a branch of the central network that has the shortest delay. Detailed routing of these clusters, is performed later, based on this assignment. These regenerators are now deemed to belong to their respective auxiliary networks and will henceforth be referred to as "cluster-networks". This entire procedure is automated.
For state-of-the-art microprocessors, given that the size of the primary clock-network is excessively large, for design purposes, it is efficient to further consider them to comprise of two levels (with no intermediate buffers), a central network, and a number of auxiliary networks that are fed by the central network. The auxiliary clock-networks consist of the routing from specific branches of the central network to the input pins of clock-regenerators. The design methodology presented here focuses on the physical design and skew-optimization of the primary clock-network which includes both the central and auxiliary networks. The following steps outline the process that aims at achieving an initial clock-network for subsequent wire-width optimization. 4. INITIAL TOPOLOGY GENERATION The approach described here is primarily used as a post-routing optimization. Therefore it is essential to generate the initial topology of both the central and auxiliary networks. Once the topologies are known both the central and auxiliary networks are considered for skew minimization. The following steps outline the topology generation of an initial clock-network.
4.2.2. Subclustering The regenerators belonging to various clusters are divided into smaller groups termed as "subclusters". This subclustering is performed such that the estimated skew per subcluster is limited to a specific value. Each subcluster is then routed as an individual net, rooted at its assigned branch. The process of subclustering aims at minimizing the skew due to daisy-chaining of clock-pins, that occurs quite frequently with conventional routers that tend to reduce the overall path length. Hence subclustering results in multiple branches from the central network feeding groups of clock-regenerators with in a cluster.
4.1. Central Network The initial design of central network is currently performed manually. The intent here is to give designers the freedom to layout wires optimally with respect to the existing floor-plan and cell-placement. As we do not expect the central structure to be very complicated, this manual step requires very little effort. In addition it helps to fully utilize designers knowledge of the current design and potential changes that the design may undergo.As the tool is capable of handling meshes and non-binary structures, designers have the freedom to chose from a wide variety of design practices.
4.2.3. Routing of Cluster Networks The routing from every branch of the central network to its corresponding targets is performed by a maze routing tool. These wires are routed with the maximum permissible widths, to ensure that router allocates the sufficient blockage-area for the wires. The wire-width optimization tool is permitted to size the wires with this value of width as a maximum width constraint. This ensures that the width-optimization will not violate any design rules. Figure 1. depicts a typical primary clock-network after the clusters have been routed.
4.2. Auxiliary Networks The initial design of auxiliary networks consists of several steps each of which are described below: 4.2.1. Clustering and Load Balancing
It is desirable to ensure that the auxiliary networks that connects to the leaf branches of the central network do
41
-
I
(A +,XI) AP = SI (y -y,)
I
240.00
(1)
220-0
where A = STS and S is the
200-00
n X v Jacobian matrix(i.e.,
Si. = ayilpj ) and y, = f (13), the current solution
5SO OO 160,00
andy is the target solution. X in (1) is the Lagrangianmultiplier determined dynamically to achieve a rapid convergence to the final solution. This method combines the convergence properties of steepest descent methods during the initial stages and the convergence properties of methods based on Taylor series truncation. The method of setting X dynamically is shown in the flow chart Figure 1. k(i) is the value of X at ith iteration.
I4Q,00 120-00 100-00
90.00 60.00
*0,00 20.00
I
SO 0M
100.00
I
I
190.00 -w.00
;:
Figure 1. A Typical Primary Clock-Network 5. 5.1.
CLOSYT OPTIMIZATION
Optimization Parameters
The initial clock-network resulting from the above mentioned steps is described to CLOSYT in terms of a set of wires with their lengths, initial widths and connectivity information. CLOSYT optimizes the widths of the wires for skew subject to the following specifications * * * * * *
The slew-rate/transition-time at the output of the clock-driver. The delay and slope requirements at the clock-pins. The maximum and minimum width constraints on wire segments. Upper and lower bound on the phase-delay of the clock-network. The maximum capacitance allowable for the clocknetwork. Maximum acceptable skew.
5.2. Skew Optimization Approach
The Levenberg-Marquardt algorithm [8,10,12] is utilized to minimize the mean-square error between the desired and actual delays and slopes. Given a set of functions yi = fi (x, 3) , the Levenberg-Marquardt algorithm addresses the problem of finding the vector 1, such that the mean square error between a specified set of vectors yi and the functions yi evaluated at
P is minimized.
The solution is obtained by iteratively finding a vector of increments AP3, incrementing the parameters by AP, and recomputing the Jacobian repeatedly until a satisfactory convergence is obtained. More specifically at each iteration we solve the equation:
For clock-network synthesis, the set of wire-widths form the vector of parameters (AP in (1)) to be determined. The functions fi correspond the evaluation of slope and delay as a function of widths of wires in the network.
42
As one can observe the Levenberg-Marquardt method is an approach for unconstrained optimization as the parameters are allowed to take any value. In order to account for maximum and minimum width constraints, we cast clock-network synthesis as a constrained optimization problem - determine the vector of widths W such that the sum-of-squares error between the 2N target delays and slopes the current slopes and delays at the clock-pins is minimized. The wire widths are increased by AW obtained by solving (1) after each iteration. If, after incrementing, the width of any wire is outside the permissible range, the width is set to the corresponding limit: if
wj(k-1) + AWi < wi
W.i(k) I
if
wi(k-1) +AWI.>Wi-
W-(k) = W. I
networks by partitioning the problem into two or more hierarchical levels. This optimization is performed bottom-up and improves the total run-time of the tool substantially, without significant loss in accuracy. For example if a clock-network divided into a central network with p wires, and m wires at the auxiliary network level partitioned into k-clusters, the time complexity is proportional to ( 3 + m3 /k2) in comparison to (j+m) for the entire network. The following steps outline the hierarchical optimization: 1). As described in Section 4, the networks corresponding to each cluster, form the first level of the hierarchy. The clock-regenerators at the leaves of cluster-networks are modeled as capacitances. All cluster-networks are optimized individually for skew, and a specific value of delayslope target. The widths of wires at this level are constrained to be between the initial routed width and a minimum width.
= Wimin W.ii Im
where w (k) is the width of wire i at kh iteration. The sensitivity of delay and slope at all targets with respect to every wire in the network is computed by the adjoint-sensitivity technique [7]. The wires with the highest sensitivity are selected for width changes.
2). The second stage of optimization involves sizing the wires of the central network to minimize the global skew. Each cluster is replaced by it's equivalent driving point model, and the average delay from the root of the cluster to all its targets is estimated. The wires of the central-network are then sized taking into account the average delays of the clusters. As we assume that the size of the clusters is small, we expect that the signal slope integrity is preserved for propagation through the clusters. Therefore the user specified slope target can be fed directly as slope target to the central network. The delay targets for the central network are generated as follows. Considering a central network feeding n cluster-networks, each with average delay ti, if the delay up to the root of the cluster networks is
5.3. Sensitivity Computation From (1) it is clear that we need the sensitivities of delays and slopes with respect to widths of wires in the network. We obtain these sensitivities in three steps: 1). Form the equivalent circuit of the network using a imodel for each segment of the route. We then compute the moment sensitivities of delay and slope at a target node (a clock-pin or central network branch tip) with respect to the resistances and capacitances in the circuit. 2). These sensitivities are then translated into delay/slope sensitivities [11].
-
\
3). Sensitivities with respect to wire widths are then derived from the resistive and capacitive sensitivities as described in [9]. The resulting sensitivity matrix is used to iteratively solve (1).
-
t151(
\ 'I
-
/ t2, C2
t3, C 3 -
6. HIERARCHICAL OPTIMIZATION Due to the fact that the sensitivity computation has an f
t4 C4 I
-
t, C.
j
As solving the matrix in (1) is an 0 (n 3 ) (where n is the number of wires) operation, this solution is computationally intensive and therefore time consuming. We use heuristics proposed in [10] for identifying the most sensitive wires and then discard the insensitive wires. This results in a dramatic reduction in the size of the matrix and therefore a quick convergence is achieved as evidenced by our results.
0(n 3 ) compjlnn
-
I
-
-
I -
Figure 2. Optimization with Cluster Estimates
is desirable to optimize large clock-
43
required to be Td, then the central network is optimized by settingy in (1) as
hierarchical optimization was found to reduce run-times significantly for large networks. 9.
Yi = Td - ti,
FUTURE WORK
To ensure low-skew values in reality it is desirable to take into account the process variations as a part of the clock tree design. From the reliability perspective it is necessary to be able to take into account certain electro-migration constraints while sizing the wires for skew. Future enhancements to the tool will aim at including these criterion as a part of the optimization.
wherey = (Y], Y2. -n)¾
7. EXPERIMENTAL RESULTS The design methodology and the wire-width optimization was tested with a clock-network design problem of a PowerPCTM microprocessor. The optimization was performed both as a complete network and hierarchically. The estimated capacitance, average delay, skew for individual clusters for this network are summarized in Table 1. The capacitance and delay estimates were used to optimize the wire widths of central network. A global skew of less than 5OpS were achieved with given wire-width constraints. The total run time for the entire design process described above, when performed in a hierarchical fashion was a little more than 3 hours on a IBM RISC System 6000/Model 560. The run-time for the width-optimization was less than 5 minutes on an average for the cluster networks and approximately 15 minutes for optimization of the central network with the estimated capacitance and delay. In comparison the time taken to optimize the wires for the clocknetwork as a whole was approximately 7 hours.
REFERENCES [1] H. B. Bakoglu, J.T. Walker, and J.D. Meindl "A Symmetric Clock-Distribution Tree and Optimized High Speed Interconnection for Reduced Clock Skew in ULSI and WSI Circuits," Proc. IEEE International Conference on Computer Design, pp. 118122, 1986. [2] J. Cong, A. B. Kanhng, and G. Robins, "Matching-Based Methods for High-Performance Clock Routing", IEEE Trans. on Computer-Aided Design of Circuits and Systems," vol. 12, no. 8,
pp. 1157-1169, Aug. 1993. [3] M. A. B. Jackson, A. Srinivasan and E. S. Kuh, "Clock Routing for High Performance ICs," Proc. 27th ACM/IEEE Design Automation Conference, pp. 573-579, 1990. [4] R. S. Tsay, "Exact Zero-Skew," Proc. IEEE International Conference on Computer-Aided Design," pp. 336-339, 1991.
Number Cluster
Nae
Of
Net
regenerat
(pF)
Clock-
Cap
Delay
(nS)
[5] S. Pullela, N. Menezes, L. T. Pillage, "Reliable Non-Zero Skew Clock Trees Using Wire Width Optimization," Proc. 30th ACM/IEEE Design Automation Conference, pp. 165-170, 1993.
Skew
(Ps)
[6] C.L. Ratzlaff, N. Gopal, and L. T. Pillage, "RICE: Rapid Interconnect Circuit Evaluator," Proc. 28th ACM/IEEE Design Automation Conference, 1991. [7] S.W. Director, and R.A. Rohrer, "The Generalized Adjoint Sensitivities," IEEE Transactions on Circuit Theory, vol CT-16, no 3, Aug 1969.
ors fxu-sw
35
6.062
0.1085
19.509
fpu-se
18
3.588
0.1068
17.588
fpu-sw
6
1.273
0.1014
2.3210
biu-lmw
20
3.381
0.1028
7.101
biu umw
16
1.501
0.1027
5.796
biu-sw
16
2.090
0.1019
4.430
[8] Q. Zhu, W.-M. Dai, and Joe G. Xi, "Optimal Sizing of HighSpeed Clock Networks Based on Distributed RC and Lossy Transmission Line Models," Proc. International Conference on Computer Aided Design 1993, pp 628-633 [9] N. Menezes, S. Pullela, and L. T. Pillage, "RC Interconnect
fpu-nw
1
0.230
0.1003
0.000
Synthesis, - A moments Approach," International Conference on ComputerAided-Design, Nov. 1994.
fpu-ne
9
1.117
0.1014
4.407
fxu-nw
12
1.835
0.1069
9.794
[101 S. Pullela, N. Menezes, and L. T. Pileggi, "Skew minimization via wire-width Optimization," Submitted to IEEE Transactions on CAD.
[11] N.Menezes, R. Baldick, and L. T. Pileggi, "A Sequential Quadratic Programming Approach to Concurrent Gate and Wire
Table 1: Summary of Clusters
8. CONCLUSION
Sizing," International Conference on Computer Aided-Design
A clock-network design flow has been developed to facilitate the design of large clock-networks. An overview of this wire-width optimization based tool was presented. The efficacy of the approach has been seen by testing the same with a typical clock-network design scenario. The
44
1995. [12] D. W. Marquardt, "An algorithm for least-squares estimation of nonlinear parameters," J. Soc. Indust. App. Math., vol. 11, no. 2, pp. 431 - 441, June 1963
Making MEMS Kaigham J. Gabriel Deputy Director Electronics Technology Office Defense Advanced Research Projects Agency 3701 N. Fairfax Drive Arlington, VA 22203-1714 [email protected] http://www.darpa.mil
Introduction As information systems increasingly leave fixed locations and appear in vehicles and in our pockets and palms, they are getting closer to the physical world, creating new opportunities for perceiving and controlling our environment. To exploit these opportunities, information systems will need to sense and act as well as compute. Filling this need is the driving force for the development of microelectromechanical systems (MEMS). Using the fabrication processes and materials of microelectronics as a basis, MEMS processes construct both mechanical and electrical components. Mechanical components in MEMS, like transistors in microelectronics, have dimensions that are measured in microns and numbers measured from a few to millions. MEMS is not about any one single application or device, nor is it defined by a single fabrication process or limited to a few materials. More than anything else, MEMS is a fabrication approach that conveys the advantages of miniaturization, multiple components and microelectronics to the design and construction of integrated electromechanical systems. MEMS devices are and will be used widely, with applications ranging from automobiles and fighter aircraft to printers and munitions. While MEMS devices will be a relatively small fraction of the cost, size and weight of these systems, MEMS will be critical to their operation, reliability and affordability. MEMS devices, and the smart products they enable, will increasingly be the performance differentiator for both defense and commercial systems.
45
MEMS Market and Industry Structure
MEMS Market and Industry Structure MEMS Market Forecasts for MEMS products throughout the world show rapid growth for the foreseeable future. Early market studies projected an eight-fold growth in the nearly $1 billion 1994 MEMS market by the turn of the century. More recent estimates are forecasting growth of nearly twelve to fourteen times today's market, reaching $12-14 billion by the year 2000 (Figure 1). While sensors (primarily pressure and acceleration) are the principal MEMS products today, no one product or application area is set to dominate the MEMS industry for the foreseeable future, with the MEMS market growing both in the currently dominant sensor sector and in the actuator-enabled sectors. Furthermore, because MEMS products will be embedded in larger, nonMEMS systems (e.g., automobiles, printers, displays, instruments, and controllers), they will enable new and improved systems with a projected market worth approaching $100 billion in the year 2000.
Projected Growth of Worldwide MEMS Market IA
15
Market Segments
12
n 2000
10
m 8. i!2 0
4. 2 0.
I1993
1994
1995
1996
1997
1998
1999
11-
11
2000
Year
FIGURE 1.
Projected worldwide MEMS market. Note inset pie chart that shows the non-sensor market segments influid regulation and control, optical systems and mass data storage are projected to be about half of the total market by the year 2000.
Present MEMS markets and demand are overwhelmingly in the commercial sector, with the automobile industry being the major driver for most micro-
Making MEMS
46
MEMS Market and industry Structure
machined sensors (pressure, acceleration and oxygen). In 1994 model year cars that were manufactured in the US, there are an average of 14 sensors, one-fourth of which are micromachined sensors, increasing in number at a rate of 20% per year. As one example, a manifold pressure sensor is currently installed in vehicles by all three major US automakers. This amounts to more than 20 million micromachined manifold pressure sensors being manufactured per year.
Production/Revenue Share E us
1.5
0
E
Asia
*
Europe
-
El
Acceleration
.
Pressure
F___1
1
I
Cu
I___
a)
06
*e
0.5-
HI-
C1993
FIGURE 2.
-Hi 1994
1995 (projected)
Worldwide annual pressure and acceleration sensor markets with associated (on top) regional production and revenue percentages for the combined sensor markets. More recently, the market for accelerometers used in airbag deployment systems has also grown. Nearly 5 million micromachined accelerometers for airbag systems were manufactured and installed in 1994 vehicles. Increasingly biomedical sensors, particularly disposable blood pressure and blood chemistry sensors are fast approaching the automobile industry in both sensor unit numbers and market size. Over 17 million micromachined pressure
Making MEMS
47
MEMS Market and Industry Structure
sensors, with a market value of nearly $200 million, were manufactured, used and disposed of in 1994. While the MEMS sensors market will continue to grow, particularly sensors with integrated signal processing, self-calibration and self-test (pressure sensors, accelerometers, gyroscopes, and chemical sensors), a substantial portion of the growth in the next few years (and of the MEMS market by the year 2000) will be in non-sensing, actuator-enabled applications. These applications include microoptomechanical systems, principally in displays, scanners and fiber-optic switches; integrated fluidic systems, primarily in fuel-injections systems, ink-jet printheads, and flow regulators; and mass data storage devices for both magnetic and non-magnetic recording techniques. Two non-sensor markets alone, printing and telecommunications, are projected to match the present sensor market size by the year 2000. MEMS Industry Structure Those companies which have so far been directly involved in producing MEMS devices and systems are manufacturers of sensors, industrial and residential control systems, electronic components, computer peripherals, automotive and aerospace electronics, analytical instruments, biomedical products, and office equipment. Examples of companies manufacturing MEMS products worldwide include Honeywell, Motorola, Hewlett-Packard, Analog Devices, Siemens, Hitachi, Vaisala, Texas Instruments, Lucas NovaSensor, EG&G-IC Sensors, Nippon Denso, Xerox, Delco, and Rockwell. Of the roughly 80 US firms currently identified as being involved in MEMS (Figure 2), more than 60 are small businesses with less than ten million dollars in annual sales. The remaining 20 firms are large corporations distributed across different industry sectors with varying degrees of research activities and products in MEMS (the front cover of the 1993 annual shareholders' report for Hewlett-Packard featured a MEMS flow-valve developed for use in their analytical instruments division). Of the nearly $300 million worldwide market in pressure sensors, US manufacturers account for nearly 45% of production and revenue. In the growing accelerometer market, the US position is very similar. Of the nearly 5 million accelerometers made in 1994, US manufacturers accounted for nearly 50% of the market. Because of the combination of an advanced technology base and a strong manufacturing capability in these two key sensor areas, US manufacturers are poised to expand their MEMS market share and are already beginning to penetrate both the European and Japanese automotive sensors market. Accounting for slightly more than half of the worldwide MEMS manufactured products and revenue, the US MEMS industry is a major player in all key segments of the world MEMS market. One notable distinction in industry structure is that few small businesses in Europe or Japan are involved in MEMS. In the US, nearly 60 of the 80 identified firms with MEMS activities are small businesses, each typically generating on average less than five million dollars in annual revenues. Most of
Making MEMS
48
MEMS Market and Industry Structure
these businesses do not have or need their own dedicated fabrication resources. New approaches to the development of manufacturing resources can both exploit this distinctive structure for DoD-specific needs and accelerate the innovation and commercialization of MEMS products. Given the varied applications of MEMS devices and the most likely evolution of their associated fabrication processes, the development of support and access technologies will be even more important and challenging in MEMS manufacturing than in microelectronics manufacturing. Unlike microelectronics, where a few types of fabrication processes satisfy most microelectronics manufacturing requirements, MEMS, given their intimate and varied interaction with the physical world, will have a greater variety of device designs and a greater variety of associated manufacturing resources. For example, the thin-film structures created using surface micromachining techniques, while well-suited for the relatively small forces encountered in inertial measurement devices, are not adequate for MEMS fluid valves and regulators. Similarly, the thicker structures created using a combination of wafer etching and bonding while well-suited to the higher forces and motions in fluid valves and regulators consume too much power to be used for the fabrication of microoptomechanical aligners and displays. There is not likely to be a MEMS equivalent of a CMOS process like that in microelectronics that will satisfy the majority of MEMS device fabrication needs. These different MEMS fabrication processes will often be developed by larger firms with a particular and large commercial market as the target. Typically the firm developing the manufacturing resources needs to be focused on the production of products for those one or two driving applications. But in most cases, once the manufacturing resource is developed, numerous (hundreds) of products for smaller (<$10 million per year) markets could be addressed with the same manufacturing resources. No single one of these smaller market would have justified the development of the fabrication process. For the firms that have developed the manufacturing resource, addressing small and fragmented markets is not presently economically justifiable given the market diversity and the current state of electronic design aids. Most of these specialized markets will only be attractive and economically justifiable to smaller businesses who, however, do not have (nor would they want to duplicate) the manufacturing resources. By gaining access to manufacturing resources through a domestic MEMS infrastructure, businesses would be in a better position to field competitive MEMS products and also be able to use existing resources at higher capacities, speeding return on investments for those companies with the resources. Furthermore, since most MEMS defense applications and products are some of these smaller and fragmented markets, access to MEMS manufacturing resources would also support rapid and affordable fielding of MEMS defense products.
Making MEMS
49
The DoD Investment Strategy for MEMS
One step towards acquiring such a MEMS manufacturing infrastructure is to make product-neutral investments in the development of support and access technologies that include; electronic design aids for the free-form MEMS device designs and coupling of simulation tools for the variety of physical effects and properties encountered in MEMS applications, * better understandingand control of processes to assure repeatableand predictable mechanical and other non-electricalpropertiesof materials, * manufacturing equipment optimized for MEMS requirements (thicker film deposition, deeper etching, handling and packaging techniques which selectively contact and sealportions of the MEMS device), and * measurement tools and techniquess that characterizeelectrical and other performanceparameters(.e.g., motion, fluid flow) for operationaltesting and device qualification. Since most DoD applications will be early drivers of advanced MEMS devices or require the adaptation and qualification of commercial devices, DoD investments in the manufacturing resources serves not only its own needs for rapid, flexible and affordable access to MEMS technology but does so in a way that complements and enhances the US industrial capability in MEMS.
The DoD Investment Strategy for MEMS A strong US MEMS technology and manufacturing base is essential to assure early, affordable, and responsive access to MEMS technology for DoD needs. Relatively small investments in MEMS will leverage the vast and historic national investments made in capital equipment, materials, processes and expertise for the microelectronics industry to create a superior, national MEMS capability. While ongoing industry investments in MEMS will continue to grow, the bulk of these investments are by individual companies focused on gaining incremental improvements in performance and manufacturing costs for their one or two major products. Because DoD will be the early customer for advanced and integrated MEMS devices and systems (ranging from inertial navigation on a chip to advanced maneuverability aircraft), DoD investments will focus on the development of advanced MEMS materials, devices, systems and manufacturing resources and will target the development of supporting capabilities that enable rapid and flexible access to those resources. The DoD MEMS research and development strategy is to:
invest in advanced MEMS device and systems developments leading towards MEMS with higher levels of functional capability, higher levels of integrated electronics, and larger numbers of mechanical
Making MEMS
50
The DoD Investment Strategy for MEMS
components. Activities in this area will accelerate the development of actuator-enabled applications and the shift from discrete MEMS component manufacturing to the manufacturing of integrated MEMS devices. Focused thrusts include the development of new materials, devices, systems, fabrication processes, and interfacing/packaging techniques. Example target devices and applications include navigation-grade inertial guidance systems on a chip, complete hand-held analytical instruments, and distributed aerodynamic control of aircraft;
invest in the development of a MEMS infrastructure by developing support and access technologies including electronic design aids and data bases, shared fabrication services, and test/evaluation capabilities. Infrastructure activities will increase and broaden the pool of MEMS designers, enable rapid, timely and affordable access to MEMS technologies for evolving DoD needs, and create a national mechanism for cost-effective MEMS prototyping and low-volume production. An on-going project supported by the Defense Advanced Research Projects Agency (DARPA) offering regular, shared access to a single, common MEMS fabrication process has already been used by over three hundred users at service/federal laboratories, domestic companies, and universities. More than haif the users (and all the small businesses) are getting their first and only access to MEMS technology through the shared fabrication service.
invest in activities to accelerate insertion of presently available or near-term commercial MEMS products into military systems and operations. Examples include munitions safing & arming and condition-based maintenance. Investments in this area are focussed on improved, affordable manufacturing resources and methods of assessing and qualifying device performance and reliability for DoD applications. Activities in this area encourage and are aligned with industry-formed teams that speed the introduction and use of MEMS fabrication processes and products;
coordinate and complement federal programs within DoD and at other agencies by establishing a DoD and interagency MEMS specialists group, chaired by a representative of DARPA. Examples of ongoing activities in this area include coordinated projects in fluid dynamics and integrated MEMS fluidic devices (AFOSR and DARPA), materials standards and databases (NIST and DARPA), and a project to broaden education and training programs in MEMS, increase the number of qualified MEMS instructors, and couple them to shared fabrication services (NSF and DARPA). DoD funding of MEMS research and development projects over the last three years, primarily at DARPA, have created a strong US MEMS science and technology base which has demonstrated multiple and varied DoD applications, made accessible commercially-based MEMS manufacturing resources and devices for DoD systems, and sparked a rapid growth in domestic MEMS commercialization activities. Continued DoD MEMS R&D funding, growing to and sustained at a projected $75 million per year in fiscal 1998, builds on existing accomplishments and capabilities to produce future MEMS devices and processes with Making MEMS
51
References
the higher functionalities and flexibilities required to meet present and future DoD needs.
OSD (DARPA) Service Labs & XORs Total
TABLE 1.
1995
1996
1997
1998
1999
22
31
38
50
50
3
15
21
25
25
25
46
59
75
75
Past and Projected DoD funding profile in MEMS R&D ($M).
Starting in fiscal year 1996, service investments of approximately $3 million for each service growing to roughly $7 million for each service by 1997 will harvest device and systems developments to qualify and adapt MEMS technology for service needs, positioning MEMS devices for procurement and insertion into weapons systems starting in 1998-1999. DoD will also be the early beneficiary and user of an accessible MEMS infrastructure that opens maturing manufacturing resources for high-volume products and makes them available for the production of related, but lowvolume DoD products. Continuing cross-company, product-neutral investments in manufacturing resources will increase the level of integrated mechanical components and electronics, expand the range and types of MEMS-specific electronic design aids, manufacturing equipment, generic packaging & interfacing techniques and characterization tools. Finally, focused DoD investments for the assessment, qualification and adaptation of commercially available MEMS technology are accelerating the incorporation of existing and near-term MEMS device capabilities into existing and planned weapons systems. With a strong MEMS technology base, a growing MEMS manufacturing capability, and coordinated Federal and industry investments, the US can cost-effectively leverage its semiconductor industry leadership into industry leadershipin MEMS.
References
Microelectromechanical Systems: A DoD Dual Use Technology Industrial Assessment Final Report. December 1995. (50 references) Gabriel, Kaigham J., "Engineering Microscopic Machines" Scientific American, September 1995.
Making MEMS
52
PHYSICAL DESIGN FOR SURFACE-MICROMACHINED MEMS Gary K Feddert*and Tamal Mukherjeet tDepartment of Electrical and Computer Engineering and*The Robotics Institute Carnegie Mellon University Pittsburgh, PA, 15213-3890 E-mail: [email protected], [email protected]
ABSTRACT We are developing physical design tools for surfacemicromachined MEMS, such as polysilicon microstructures built using MCNC's Multi-User MEMS Process service. Our initial efforts include automation of layout synthesis and behavioral simulation from a MEMS schematic representation. As an example, layout synthesis of a folded-flexure electrostatic comb-drive microresonator is demonstrated. Lumped-parameter electromechanical models with two mechanical degrees-of-freedom link the physical and behavioral parameters of the microresonator. Simulated annealing is used to generate global optimized layouts of five different resonators from 3 kHz to 300 kHz starting with mixed-domain behavioral specifications and constraints. Development of the synthesis tool enforces codification of all relevant MEMS design variables and constraints. The synthesis approach allows a rapid exploration of MEMS
domains. Several groups are addressing the deficiency in MEMS design tools, including MEMCAD [1] (Microcosm/M.I.T.), IntelliCAD [2] (IntelliSense Corp.), and CAEMEMS [3] (Univ. of Michigan). These tools focus on analysis using 3D modeling from layout and process integrated with self-consistent electromechanical numerical simulation. In a complementary approach to existing analysis tools, we are developing circuit-level design tools and layout synthesis tools tailored to general surfacemicromachined systems. The planar '2 1/2-D' topology of surface-micromachined MEMS lends itself to abstraction at a higher level than numerical simulation. As in circuit design, a schematic representation of MEMS provides a critical link between layout and behavioral simulation that enables high-level design automation. Many existing surface-micromechanical designs can be partitioned into discrete components, such as beam springs, plate masses, and electrostatic actuators, that are modeled as lumped-parameter elements. Conversely, new MEMS devices can be created by connecting together these lumped elements.
design issues.
1. INTRODUCTION Microelectromechanical systems (MEMS) are commonly defined as sensor and actuator systems that are made using integrated-circuit fabrication processes. The main advantage of MEMS-based systems when compared with conventional electromechanical systems is the miniaturization and integration of multiple sensors, actuators, and electronics at a low cost. These attributes are obtained by leveraging standard integrated-circuit batch-fabrication processes. In the past, MEMS technology has primarily been driven by the development of new processes to meet specific needs. However, over the past decade there has been a shift in emphasis from process design to device design. There is a growing demand for CAD tools to support rapid design of complex MEMS involving physical interactions between mechanical, electrostatic, magnetic, thermal, fluidic, and optical
In this paper, we will describe initial work involving the rapid layout synthesis of a surface-micromachined resonator from high-level design specifications and constraints. Our approach to layout synthesis involves modeling the design problem as a formal numerical synthesis problem, and then solving it with powerful optimization techniques. This synthesis philosophy has been successful in a variety of fields such as analog circuit synthesis [4] and chemical plant synthesis [5]. The process of modeling the design problem involves determining the design variables, the numerical design constraints and the quantitative design objective. The microresonator architecture used in this study has been thoroughly analyzed in the literature. It represents a good starting point for synthesis work since proper operation can
53
1) isolation and interconnect definition
2) contact cut for mechanical anchor It00
IT
I
iD
I ::
3) structural definition
I :7 I ,,,
E:
I77
I
M
I __f
'
I
4) structural release from substrate
Fig. 2. Scanning electron micrograph of a released folded-flexure comb-drive microre-onator fabricated in the MUMPs process.
(a)
con nitride is first deposited on the silicon substrate to provide electrical isolation between microstructures. An electrical interconnect layer of polycrystalline silicon (polysilicon) is then deposited and patterned. Next, a 2 gm-thick layer of phosphosilicate glass (PSG) is deposited. The PSG acts as a sacrificial spacer layer for the microstructures. After contact cuts are made in the PSG, a 2 jm-thick layer of polysilicon is deposited and patterned to form the microstructures. Further process steps in MUMPs are not necessary for microresonator fabrication and will not be shown. A final wet etch in hydrofluoric acid (HF) dissolves the PSG and releases the microstructure so it is free to move. The PSG contact cuts act as mechanical anchor points that fix the microstructure to the substrate surface.
Fig. 1. Abbreviated process flow for MCNC's MultiUser MEMS Process service. (a) Cross-sectional view. (b) Top view (layout). be easily verified using existing analysis tools and experimental measurements. We begin with an overview of surface-micromachining and the microresonator architecture, followed by a description of design variables and lumpedparameter models. Next, the design constraints are specified along with the synthesis algorithm and a discussion of the layout synthesis results.
2. MICRORESONATOR DESCRIPTION 2.1. Surface Micromachining
2.2. Microresonator Design
One set of events that has fueled the trend toward device design in fixed processes is the establishment of MEMS process services by MCNC [6], Analog Devices [7], CMP [8], and MOSIS [9] (Currently, post-foundry processing is required for MOSIS designs). These services produce micromechanical structures made out of thin films on the surface of the substrate. We refer to these thin-film microstructures as 'surface-micromachined MEMS' although, in some cases, bulk silicon micromachining is required to release the microstructures from the substrate. MCNC's Multi-user MEMS Process service (MUMPs) is the technology chosen for the synthesis work presented in this paper. A simplified and truncated process flow is shown in Fig. 1. Low-stress sili-
A microresonator fabricated in MUMPs is shown in Fig. 2. The specific microresonator design was first described and analyzed by Tang [10] and is commonly used as for MEMS process characterization. In one application, the resonator has been integrated with CMOS circuitry to form a micromechanical oscillator [11]. The resonator components are made entirely from the homogeneous, conducting, 2 jmthick polysilicon film. The spacer gap of 2 jim above the substrate is set by the PSG thickness. The movable microstructure (in the center of the micrograph) is fixed to the substrate at only two points. Simplified layout and schematic views of the device are shown in Fig. 3. The resonator is a
54
comt drive
N
i
tI
I
I a N I a I .
II
III.ItI1i11 III i1ii 11
-
ii1ll~lllll
,x I
Y
mr
I
shuttle mass
I.
I ill
parameter elements: the shuttle mass, two foldedflexure springs, and two comb-finger actuators which are displayed as time-varying capacitors. A voltage source that drives one actuator is included in the schematic. Lateral translational modes of the mass-springdamper system are modeled by second-order equations of motion:
\ folded flexure
I1I,,I1I.1,;It
l 1lluh1ll III
S (a)
Fe
anchor points
= mx + Bx +kx
F e,y = mY+By+k y Y Yx
x
(1) (2)
where Fex and Fey are lateral components of the external electrostatic force generated by the comb drives. The effective masses (mx and my), damping coefficients (Bx and By), and spring constants (kx and ky) for these modes are calculated from the geometry and material parameters of the lumped elements. The vertical (z) mode, rotational modes, and other higher order modes are left out of the present study because the equations unnecessarily complicate the analysis without providing for significantly greater insight into the design and synthesis issues.
Y
k
1E7),anchor point (b) Fig. 3. Circuit-level views of the lateral foldedflexure comb-drive microresonator. (a) Physical view (layout). (b) Mixed-domain structural view (schematic), including a voltage source, V, for comb-
2.3. Design Variables All design variables of the microresonator are structural parameters of the folded flexure and comb drive elements, with the exception of the comb-drive voltage. The 14 variables used in the synthesis algorithm, along with upper and lower bounds, are listed in Table 1. Most of the layout parameters are detailed in Fig. 4. The choice of upper and lower bounds is discussed in the section on design constraints. Several geometric variables, such as the width of the anchor supports, wa and was, are not included in Table 1. These variables are necessary to completely define the layout, but do not affect the resonator behavior. We refer to these variables as 'style' parameters, because they primarily affect the stylistic look of the finished device. Redundant state variables can be defined that depend on the design variables. For example, the shuttle axle length, Lsa, is a state variable which is dependent on the truss beam length and the gap between the beam anchor and the shuttle yoke. In our formulation of the problem, this gap is a style parameter.
mechanical mass-spring-damper system consisting of a central shuttle mass that is suspended by two folded-beam flexures. The folded flexure is a popular design choice because it is insensitive to buckling arising from residual stress in the polysilicon film. Instead of buckling, the beams expand outward to relieve the stress in the film. The resonator is driven in the preferred (x) direction by electrostatic actuators that are symmetrically placed on the sides of the shuttle. Each actuator, commonly called a 'comb drive,' are made from a set of interdigitated comb fingers. When a voltage is applied across the comb fingers, an electrostatic force is generated which, to first order, does not depend on x. The suspension is designed to be compliant in the x direction of motion and to be stiff in the orthogonal direction (y) to keep the comb fingers aligned. In the schematic view of Fig. 3.(b), the resonator is represented as an interconnected set of lumped-
55
Table 1. Design variables for the microresonator. Upper and lower bounds are in units of glm except N
1
and V vaTr description Lb length of flexure beam Wb width of flexure beam Lt length of truss beam wt width of truss beam Wsa width of shuttle axle width of shuttle yoke Ly length of shuttle yoke wcywidth of comb yoke Lc length of comb fingers WC width of comb fingers g gap between comb fingers x0 comb finger overlap N number of comb fingers V voltage amplitude
(a)
min. max. 2 400 2 200 2 200 4 400 11 400 11 400 84 400 11 400 8 200 2 400 2 100 4 100 15 100 5 V 50 V
12
mX = ms +4mt + 3 5 mb
(3)
8 my = mS +-m +mb 35 t b
(4)
where m. is the shuttle mass, mt is the total mass of all truss sections, and mb is the total mass of all long beams. For operation at atmospheric pressure, damping is dominated by viscous air forces generated by the moving shuttle. Viscous air damping is proportional to velocity with a damping factor given by [12] B1 = + 05At + 05Ab) (-do)+-1 (As g] (5) 5
Bx =
where p. is the viscosity of air, d is the spacer gap, 8 is the penetration depth of airflow above the structure, AC is the gap between comb fingers, and As, At, Ab, and AC are bloated layout areas for the shuttle, truss beams, flexure beams, and comb-finger sidewalls, respectively. Damping factors of the other lateral modes do not enter into the design constraints and are not calculated. Linear equations for the folded-flexure spring constants in the lateral directions are [13]
(b)
-
2
Etwb
L2 + 14xLLLb + 36a2L2 (6)
3
ky =
I-,
(d) Fig. 4. Parameterized elements of the microresonator. (a) shuttle mass, (b) folded flexure, (c) comb drive with N movable 'rotor' fingers, (d) close-up view of comb fingers.
Lb
4L2 +41aLLLb +36a 2L2
2Etw 3
8L2 +88aLLLb +a Lb
3
(7) 4L1 + lOaLtLb +5a ab2L2
where E is the Young's modulus of polysilicon, t is
the polysilicon thickness and a = (wt/wb) 3. General analytic equations for the lateral combdrive force, Fx, as a function of wC, g, t, and d are derived in [14], but are too lengthy to repeat here. For the special case of equal comb-finger width, gap, thickness, and spacing above the substrate (wC = g = t = d), each comb drive generates a force that is proportional to the square of the voltage, V, applied across the comb fingers.
2.4. Lumped-Element Modeling A very brief description of the models used in the synthesis algorithm are given in this section. The models for the spring constants, damping, and combdrive force are derived in detail in the references listed with each equation. The effect of spring mass on resonance is incorporated in an effective mass for the entire structure in each lateral direction.
F e, x =-1.12eN -V 2 0 g
56
(8)
where s, is the permittivity of air. If the comb fingers are not perfectly centered, a y-directed electrostatic force is also present. Assuming a small perturbation y and that only one comb actuator is activated, the destabilizing force is found to be Fe y
1.12s 0NV 2(x +x)ty/g3
sticking and breakage during the wet release etch. We have constrained beam lengths to less than 400 gm to avoid these problems. If all the above constraints are met, then a design with minimum area can be found which is considered optimal.
(9)
3.2. Synthesis Algorithm
3. LAYOUT SYNTHESIS
In our approach, the synthesis problem is mapped onto a constrained optimization formulation that is solved in an unconstrained fashion. As in [15], the circuit design problem is mapped to the non-linear constrained optimization problem (NLP):
3.1. Design Constraints Several design specifications must be defined to constrain the layout synthesis of the microresonator. An essential specification is resonant frequency of the lowest mode (x), which is determined by the spring constant and effective mass of the resonator.
k minu
21A
= i = 1
s.t. A valid layout must have a resonant frequency within 10% of the desired value. Resonant frequency of the orthogonal mode, fy, is set at least 10 times greater than f to decouple the modes. Specifications for minimum displacement and maximum applied voltage act as additional constraints. The displacement amplitude at resonance is related to the spring constant, damping, and combdrive force. Assuming the system is underdamped, the displacement amplitude is Xmax = QFx/kx
where Q =
h(u,x) = 0
L (NLP)
(13)
g(y, x) • 0 UE Up
where u is the vector of independent variables, such as geometries of micromachined devices that we wish to change to determine the MEMS structure performance; x is the vector of state variables; f (y, x) is a set of objective functions that codify performance specifications the designer wishes to optimize, e.g., area; and h(u, x) = 0 and g(,x) < 0 are each a set
(11)
of constraint functions that codify specifications that must satisfy a specific goal. For example, resonant frequency is constrained to greater than 20 kHz by the function 20000 -fx(y, x.) < 0. Scalar weights, wi,
2
mTk/Bx is the quality factor. We
have constrained 2 glm < xm,, < 5 gm at a drive voltage of V < 50 V to enable easy visual confirmation of resonance, and Q 2 5 to ensure underdamped resonant operation. For stability, the restoring force of the spring in the y direction must be greater than the destabilizing electrostatic force from the comb drive. Fe,y < ky
Wi ' fi(u, x)
(10)
balance competing objectives. The decision variables can be described as a set u E Up, where U is the set of allowable values for u (described by the bounds in Table 1).
(12)
To allow the use of simulated annealing, we convert this constrained optimization problem to an unconstrained optimization problem with the use of additional scalar weights. As a result, the goal becomes minimization of a scalar cost function,
The layout is constrained by the MUMPs design rules. Several design rules set minimum beam widths and minimum spaces between structures. Maximum structure size is limited by undesirable curling due to stress gradients in the structural film and by possible
C (y) , defined by
57
k C(u) =
I
Wjfj(LX)
i= 1
+ IWigiX) i= 1
m
(14)
+ z wj"h(y, X)
The key to this formulation is that the minimum of C (u) corresponds to the circuit design that best matches the given specifications. Thus, the synthesis task is divided into two sub-tasks: evaluating C (y) and searching for its minimum. Evaluating the cost function involves firing the lumped-element macro-models to determine the extent to which the design constraints are met, for the current values of the design variables, u. This cost function has multiple minima due to the complex non-linear characteristics of the individual equations in the lumped-element macro-model. We use simulated annealing [16] as the optimization engine to drive the search for the minimum; it provides robustness and the potential for global optimization in the face of many local minima. Because annealing incorporates controlled hill-climbing it can escape local minima and is essentially starting-point independent.
I................
......... .......I M
................................... .............. .............-...... I..
(b)l
(C)
=H
I2 IN!
(d)
V79S ; q ; 1171,111,717,99M11`11171719M (e) Fig. 5. Layout of five resonators synthesized from specifications. (a)fr = 3 kHz, (b) 10 kHz, (c) 30 kHz, (d) 100 kHz, (e) 300 kHz.
4. RESULTS AND DISCUSSION Five lateral comb-drive resonator structures synthesized from specifications are shown in Fig. 5. For visualization of the synthesis results, we used the Consolidated Micromechanical Element Library (CaMEL) parameterized module generation software [17] from MCNC which provides CIF output when given resonator layout parameters. The CaMEL generators automatically place holes in the large plates that are over 30 gm in size. Several iterations of the design variables and constraints were necessary to produce synthesized designs that followed manual design convention and common sense. The layout visualization was instrumental in debugging the equations. Feedback from the synthesis iterations directed our efforts to codify the design variables and constraints. In many cases, a quick inspection of a synthesized layout is all that was need to determine errant or missing equations. As expected, the devices shown in Fig. 5 become smaller with increasing values of resonant frequency.
Smaller devices have less mass, and smaller flexures are stiffer. Both effects increase the resonant frequency. Values of selected design variables and behavioral parameters for the five resonator examples are given in Table 2. For high frequency resonators, the mass becomes limited by the lower bounds on the shuttle mass and comb drive dimensions. The algorithm always chooses a device at the high end of the frequency specification, since that will yield a minimum size device. Quality factor is smaller for the larger resonators which have more air drag. The maximum beam length is 400 gm, however the 3kHz design is not able to take advantage of that due to the stylistic design constraint that the structure should be less than 700 glm in the y-direction. In our formulation, the number of comb fingers, N, is tied directly to the shuttle size. Therefore, N is large for
58
enced by the resonators. However, the first-order spring model in our analysis does not account for spring softening for non-zero values of x deflection. More realistic models may raise the significance of this 2D constraint.
Table 2. Selected behavioral and physical parameters for the five synthesized resonators. Spec. [kHz] 3±0.3 10±1 30±3 100±10 300±30 mx [ng]
435.
39.9
25.7
23.4
26.7
Lb [pm]
304
302
168
77
36
k., [N/m]
0.187 0.191
1.10
11.2
122.
[kHz]
3.30
11.0
33.0
110
340
Q N V [V] x,,x[gim]
9.35 50 14.0 4.97
20.0 21 15.0 5.00
56.2 15 25.5 5.00
181 15 45.1 4.99
503 19 50.0 1.93
Vcit [V]
9190
14200 16700 16500
5. CONCLUSIONS Synthesis algorithms have been successfully applied to automatic layout of surface-micromachined resonators. A prerequisite for synthesis is a set of lumpedparameter models that adequately link device behavior with physical design variables. One great benefit of creating synthesis tools is that it forces the CAD developer to codify every design variable and design constraint.
15300
Once a structured design methodology is established for surface-micromachined MEMS, the synthesis techniques may be extended to general parameterized designs. Then we can integrate structural synthesis with electronic design using the similar formulation for circuits in [4]. Our long-term goal is to enable rapid, intuitive exploration and analysis of the design space for MEMS.
the low-frequency (large mass) resonators. Very low frequency resonators are limited by the upper bounds imposed on geometry. The upper bound on displacement amplitude of 5 gm is achieved for all of the devices in Fig. 5 except the 300 kHz resonator. The optimization does not directly evaluate all the equations in each iteration. Instead it builds a local loworder macro-model of the equations which is regularly updated. This can sometimes lead to the optimizer believing it has met a constraint when postsynthesis simulation (used to generate the performance numbers in Table 2) indicates that the optimizer actually overshot the constraint. This occurred in the resonant frequency and maximum displacement specifications of the 300 kHz design. Note that although N is more than doubled from the 10 kHz to 3 kHz device, the Q is reduced by about 1/2. Therefore, the applied voltage stays nearly constant for these devices. The lower limit for N (=15) is reached for intermediate frequency resonators. For high-frequency resonators, the voltage limit is reached and N must be increased to provide adequate electrostatic force to achieve the 2 g~m minimum displacement. Very high frequency resonators cannot be synthesized because the necessary increase in comb fingers generates a more massive device, which drives the resonant frequency down. A critical voltage, Vcnt, is defined as the applied voltage necessary to crash the movable comb fingers into the stator comb fingers. The values for Vcnt in Table 2 are much larger than any voltages experi-
ACKNOWLEDGEMENT The authors thank Karen Markus and Ramaswarny Mahadevan of MCNC for use of the CaMEL tool.
REFERENCES [1]
[2] [3]
[4]
59
S. D. Senturia, R. Harris, B. Johnson, S. Kim, K. Nabors, M. Shulman, and J. White, "A Computer-Aided Design System for Microelectromechanical Systems," J. of Microelectromechanical Systems, v.1, no.1, pp. 3-13, Mar. 1992. IntelliCAD, IntelliSense Corporation, 16 Upton Dr., Wilmington, MA 01887. S. B. Crary, 0. Juma, and Y. Zhang, "Software Tools for Designers of Sensor and Actuator CAE Systems," Technical Digest of the IEEE Int. Conference on Solid-State Sensors and Actuators (Transducers '91), San Francisco, CA, pp. 498-501, June 1991. T. Mukherjee, L.R. Carley, and R.A. Rutenbar, "Synthesis of Manufacturable Analog Circuits," Proceedings of ACM/IEEE ICCAD, pp. 586-593, Nov '94.
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
I. E. Grossmann and D. A. Straub, "Recent Developments in the Evaluation and Optimization of Flexible Chemical Processes," Proceedings of COPE-91, pp 49-59, 1991. D. A. Koester, R. Mahadevan, K: W. Markus, Multi-User MEMS Processes (MUMPs) Introduction and Design Rules, available from MCNC MEMS Technology Applications Center, 3021 Cornwallis Road, Research Triangle Park, NC 27709, rev. 3, Oct. 1994, 39 pages. J. T. Kung and S. Lewis, BiMOS Technology Stage One Design Rules, Analog Devices, 831 Woburn St., Wilmington, MA 01887, 14 pages (available from http://www-mtl.mit.edu:8001/ htdocs/starting.html). Micromachines Program, available from Multi-Project Circuits (CMP) Service, 46, avenue Felix Viallet, 38031 Grenoble Cedex, Oct. 1994, 29 pages. G. K. Fedder, S. Santhanam, M. L. Reed, S. Eagle, D. Guillou, M. S.-C. Lu, and L. R. Carley, "Laminated High-Aspect-Ratio Microstructures in a Conventional CMOS Process," Proceedings of the IEEE Micro Electro Mechanical Systems Workshop, San Diego, CA, pp. 13-18, Feb. 1996. W. C. Tang, T.-C. H. Nguyen, M. W. Judy, and R. T. Howe, "Electrostatic Comb Drive of Lateral Polysilicon Resonators," Sensors and Actuators A, vol.21, no.1-3, pp. 328-31, Feb. 1990. C. T.-C. Nguyen and R. T. Howe, "CMOS Micromechanical Resonator Oscillator," Technical Digest of the IEEE Int. Electron Devices Meeting, Washington, D.C., pp. 199-202, 1993. X. Zhang and W. C. Tang, "Viscous Air Damping in Laterally Driven Microresonators,"Proceedings of the IEEE Micro Electro Mechanical Systems Workshop, Oiso, Japan, pp.199-204, Jan. 1994. G. K. Fedder, Simulation of Microelectromechanical Systems, Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, University of California at Berkeley, Sept. 1994. W. A. Johnson and L. K. Warne, "Electrophysics of Micromechanical Comb Actuators," J. of Microelectromechanical Systems, v.4, no.1, pp.49-59, Mar. 1995.
[15] E. S. Ochotta, R. A. Rutenbar, and L. R. Carley, "ASTRX/OBLX: Tools for Rapid Synthesis of High Performance Analog Circuits," Proc. 31st ACM/IEEE DAC, pp. 24-30, June 1994. [16] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, no. 4598, May 1983. [17] CaMEL Web Page, http:/lwww.mcnc.org/ camel.org, MCNC MEMS Technology Applications Center, 3021 Cornwallis Road, Research Triangle Park, NC 27709.
60
CONSOLIDATED MICROMECHANICAL ELEMENT LIBRARY Ramaswamy Mahadevan
Allen Cowen
MCNC, MEMS Technology Applications Center PO BOX 12889 Research Triangle Park, NC 27709 USA [email protected] http://mems.mcnc.org tors for user customized elements as well as other technologies. The PME library is currently available on Sun-Sparc, HP 9000 workstation platforms as well as on Macintosh and IBM personal computers. The MEMS libraries and the MUMPs process are described in greater detail in the rest of the paper. Section 2 provides a brief overview of the MUMPs process while Sections 3, 4 describe the NPME and PME libraries.
ABSTRACT The Consolidated Micromechanical Element Library, CaMEL. consists of two independent parts; a nonparameterized cell database and a parameterized microelectromechanical element library, PME. The MEMS cell libraries are intended to be a design aid for both novice and experienced MEMS designers. Both libraries are intended to assist the user in the design and layout of MEMS devices by providing an initial layout for components of a MEMS system. The parameterized library also allows the users to write their own customized generator using the primitives available in the library. The user can modify these elements and customize them as desired and assemble designs using a suitable mask layout editor.
2. MUMPS
1. INTRODUCTION The nonparameterized cell library is a database of MEMS designs in various process technologies contributed by different sources. Further design contributions from the MEMS community for addition to the library are actively solicited! The parameterized library, PME, includes a set of generators that can be used to create customized layout for many common MEMS components that use a surface micromachined process technology such as the MUMPs process. Technology specific design rules are used to ensure that the layout generated will conform to process requirements. The generators support CIF (Caltech Intermediate Form) [I] and GDS IITM™1[2] mask formats, as well as PostScript®2 [3] for display and printing purposes. The library framework can also be used to write genera-
The Multi-User MEMS Processes or MUMPs is an ARPA-supported program that provides the domestic (USA and Canada) industry, government and academic communities with cost-effective, proofof-concept surface micromachining fabrication. MUMPs is designed for general purpose micromachining by outside users who would like to fabricate MEMS devices. The front-end support activities and access to the technologies are provided by the MCNC MEMS Technology Applications Center. The following is a general description of the MUMPs process. For more details and design rules please refer to [4,5]. The three-layer polysilicon micromachining process is derived from work performed at the Berkeley Sensors and Actuators Center at the University of California. Several modifications and enhancements have been added to increase the flexibility and versatility of the process for the multi-user environment. Figure 1 is a cross section of the three-layer polysilicon surface micromachining MUMPs pro2. PostScript is a registered trademark of Adobe Systems Incorporated.
1. GDS II is a trademark of Calma.
61
4. PARAMETERIZED MICROMECHANICAL ELEMENT LIBRARY
cess. This process has the general features of a standard surface micromachining process: (1) polysilicon is used as the structural material; (2) deposited oxide (PSG) is used as the sacrificial layer, and silicon nitride is used as electrical isolation between the polysilicon and the substrate. The polysilicon and metal M
M
[3
Nstide
Poty0
1s Oxid.
ED Poly1
2,d Oid,
Poly2
The Parameterized Micromechanical Element (PME) library is a set of generators that allow the user to create customized micromechanical elements in a quick and easy manner. It also provides a framework for writing MEMS cell generators. It enables generators to be relatively process independent and allows limited cell hierarchy. Designs can be generated in CIF, GDS II, or PostScript output formats. Technology dependent design rules are read in from an environment specified technology file. The framework provides various geometric primitives and a library of available generators. The library framework and its usage are described in this section. More complete information on the generators available can be found in [6].
11111 Metal
Fig. 1. Cross Sectional view of the three-layer polysilicon MUMPs process (not to scale). layers are also used for electrical interconnects. The process is different from most customized surface micromachining processes in that it is designed to be as general as possible, and to be capable of supporting many different designs on a single silicon wafer. Since the process was not optimized with the purpose of fabricating any one specific device, the thicknesses of the structural and sacrificial layers were chosen to suit most users, and the layout design rules were chosen conservatively to guarantee the highest yield possible.
4.1 PME Framework 4.1.1 Geometry Primitives The PME library provides various geometry primitives for use in the creation of generators. Rectangle, circle, sector, polygon, and wire primitives are available. Primitives on structural layers can be generated with etch holes if they are parts of structures that will be released from the substrate. These primitives generate the appropriate layout depending on the output format selected. Currently, these primitives are accessible to the user in a limited capacity for writing user customized generators. The main purpose for incorporating such primitives is to ease the generation of all angle geometry including arcs and sectors and enable generation of etchholes. Some of these features are often not available or tedious to use in many existing VLSI layout editors.
3. NONPARAMETERIZED MICROMECHANICAL ELEMENT LIBRARY The intent of the nonparameterized element library is to provide the novice MEMS designer easy access to MEMS designs without having to extract information from various sources. Cells may be retrieved through the use of a simple perl script or electronically via the World Wide Web. In either case the cells are requested by sending mail to MCNC and an automated system electronically retrieves and mails back the requested cell in the desired format. Cells in stream format are uuencoded before mailing to the user. Cell categories available include test structures, motors, linear actuators, and out-of-plane structures. The majority of cells available were designed for the MUMPs process, but some designs from other processes such as LIGA are also available.
4.1.2 Process Dependence The generators available in the PME library assume a two layer surface micromachined process. The process is assumed to have two structural layers, two sacrificial layers, and two electrical connect layers. Process specific mask levels and layer names are specified through a process file and are compiled into the library. Technology specific design rules are specified through a separate technology file that is accessed at execution time. The technology design rule file to use can be specified by the user through
62
Reflection and rotation are performed about the instantiated cell's local coordinate system. Reflection is performed first, rotation is performed second, and the cell is finally translated to place the local origin of the cell instance at the specified location within the MAINCELL. Rotation is specified by passing the desired angular rotation value in degrees. All geometrical length parameters for the generators and locations of instances are specified in microns. Permitted values for reflection are: '*': no reflection 'x': changes sign of x values; i.e., reflects about yaxis 'y': changes sign of y values; i.e., reflects about xaxis
the environment variable PMETECH. The generators have been written to conform to the technology specific design rules specified via the PMETECH file. However, a design rule checker is not a part of the library and all layout generated should be checked using an external design rule checker. For PC and Macintosh versions of the library the file dsgnruls is used as the technology design rule file. It must be located in the directory where the library is located. 4.1.3 Cell Hierarchy
The library allows a limited cell hierarchy in both the generators and the output layout. The layout generated for any cell is not stored in program memory but is written out in the sequence generated. Hence any leaf cells used inside the top level cell, must be defined before being called. The same applies to instances within generators too, allowing a generator to be called inside another generator.
4.2.2 Generating Layout
After the PME input file has been created, layout can be generated in the desired format using the command pmegen -[cif I gds I ps]. To generate layout in
4.2 Library Usage
CIF format on Unix and PC Dos platforms pmegen -cif pme-inputjfile output-file.cif.
4.2.1 PME Input File
The PME input is specified in an ascii text file and defines cells and places instances of defined cells at desired locations within the top level cell MAINCELL. The syntax used is similar to C language syntax. The input file should declare PME objects, call desired generators with appropriate parameter lists and assign them to PME objects, and place instances of these objects within MAINCELL. PME objects are declared first using the statement: PME celll,
cell2,
Similarly, to generate GDS or PostScript versions of the layout use, pmegen -gds pme-input-file output file.gds pmegen -ps pme-input-file output-file.ps.
On Macintosh systems the program prompts for the necessary arguments. The top level cell in the layout generated will be named MAINCELL. The CIF or GDS layout can then be read into the mask layout editor of choice and modified or assembled with other designs.
etc.;
Cells are defined using generators in the library: pme-object = generator(parameterlist, cell-name); celll = gen-namel(plval, p2val,.... cellnamel); cell2 = gen name2(plval, p2val,.... cellname2);
4.3 Parameterized Micromechanical Elements A variety of active, passive, and test MEMS structures have been parameterized. In most cases the geometric parameters have been determined by their importance in the overall design of the element. In some cases, physical quantities such as residual strain are also used. The elements in the library are designed to work closely with each other. One or more active elements would typically be used along with one or more passive elements to form a micromechanical system. For instance, a rotary side drive
Finally, instances are placed at desired locations in the MAINCELL: instance (pme-objectname,reflection, rotation, origin-x, origin-y);
63
actuator could be combined with a journal bearing to create a rotary variable capacitance motor. Most generators have two versions: one using structural layer 1, and the other using structural layer 2 and are identified by the use of 1 or 2 at the end of the name of the generator. Details about available generators are listed in [6].
*Wire - wirel, wire2 4.4 Layout Examples The following examples illustrate how elements of the library are used in conjunction with each other to generate typical MEMS devices. 4.4.1 Rotary Side Drive Motor Example
4.3.1 Active MicromechanicalElements
A rotary side drive motor on the first structural layer is created using the active element rsdml and the passive element bearing].The rotary side drive is generated with inner ring radius of 21rm, inner rotor tooth radius of 27gtm, outer rotor tooth radius of 51gLm, stator inner radius of 53gLm, stator outer radius of 80gm, rotor pole angle of 18°, rotor gap angle of 27', stator pole angle of 18', and stator gap angle of 120. The rotor is aligned with the first stator pole and the cell is named rsdma. The bearing is created with a cap radius of 14gtm, journal rotor inner radius of 10gLm, and journal rotor outer radius of 27im.
The following active elements are currently available in the CaMEL PME library: *Harmonic Side Drives
*Linear Comb Drives adcombl,
-lcombl,
adcomb2,
*Linear Side Drives
hsdm2
-hsdml,
lcomb2, adcomb3 lsdm2
-lsdml,
* Rotary Comb Drives
rcdm2,
-rcdml,
rcombdl,
rcombd2,
rcornbu2,
rcombula,
rcombul,
rcombu2a
-Rotary Side Drives - rsdml,
rsdm2
/* Rotary Side Drive Example */ /* Declare PME Objects PME pl, p2; /* Create rotary side drive active element */ pl=rsdml(21.0,27.0,51.0,53.0,80.0,18.0,2 7.0,18.0,12.0,0.0,rsdma); /* Create central journal bearing */ p2 = bearingl(14.0,10.0,27.0,jnla); /* Create motor using instances of cells generated inside MAINCELL */ instance(pl,'*',0.0,0.0,0.0); instance(p2,'*',0.0,0.0,0.0);
4.3.2 Passive MicromechanicalElements The following passive elements are currently available in the CaMEL PME library: -Journal Bearings - bearingl,
bearing2
*Linear Crab Leg Suspensions - l c 1 s 1, lcls2, 1cisib, lcsl2b, lcls3b *Linear Folded Beam Suspensions - 1 fbsl, lfbs2
*Spiral Springs - spirall,
spiral2 4.4.2 Linear Comb Resonator Example
The following example shows a linear comb resonator on the first structural layer created using the lcomb] linear comb drive and lfbsl linear folded beam suspension. The fingers in the comb are 4gm wide with an air gap of 3 Rm and the beams in the suspension are 150 gm long and 4gm wide.
4.3.3 Test and ElectricalElements The following test/measurement elements are currently available and are intended to measure mechanical or electrical characteristics of the process: *Area Perimeter Test Structure - aptest
*Crossover Test Structures
-
cotest,
coat-
/* Linear Comb Resonator with Folded Beam Suspension */ PME pl,p2; /* Create comb drive and folded beam suspension */ pl = lcombl(98,12,14,60,4,3, 30,lcomb); p2 = lfbsl(150,4,50,12,30,25,12,98 lfbsl);
est
*Euler Columns - dsbeaml, *Guckel Rings - gringl, gringsl,
grings2
ePad -pad,
padframe
dsbeam2
gring2,
64
Fig. 3. MAINCELL layout generated by the linear comb resonator example PME input file. Fig. 2. Layout of rotary side drive motor generated by the PME input file shown above. Both cells rsdma and jnla are located at the origin of the MAINCELL in this case. The radii of the rotor ring and journal have been chosen to overlap and provide mechanical interconnection of the bearing and rotor ring.
structure incorporated within the generator is used to calculate the ring radii required for the given critical strain values and generate the layout accordingly in a cell named rings].
/* Instantiate cells to create linear resonator */ instance(pl,'*',0.0,0.0,75.0); instance(pl,'y',0.0,0.0,-75.0); instance(p2,'*',0.0,0.0,0.0);
/* Guckel Rings Example */ PME p1; generate rings for critical strains from 0.05% to 0.25% in steps of 0.025% with a ring width of 20 and beam width of 10, for a film thickness of 2 and Poisson's ratio of 0.23.
4.4.3 Example of Guckel Ring Test Structures A set of Guckel ring test structures[7] to measure residual tensile stress in the first structural layer is generated using the gringsl test/measurement element. Guckel rings are generated to measure strains from 0.05% to 0.25% in steps of 0.025% using a ring width of 2ORm and a beam width of 10~L.m. The film thickness is specified as 2km and Poisson's ratio for the film is 0.23. A mechanical model of the ring
*/ pl = gringsl(0.0005,0.0025,0.00025, 20,10,40,2,0.23,ringsl); /* place instance in MAINCELL */ instance(p1,'*',0.0,0.0,0.0);
Fig. 4. Guckel ring test structures on the first structural layer generated by the PME input file shown above.
65
[2] Calma Company, Stream Format, GDS II Release 5.2, Calma Company, 1985.
4.5 PME Generator Development CaMEL V2.0 allows users to design their own generator; but, in a limited capacity as only one generator may be added to the code at a time. Many library functions and geometry primitives are available to the user for writing their own generators. Functions are available to initialize and call generators, set the current drawing level, look up design rules for levels, create or parse argument lists for a generator, verify values passed to a generator and create layout using geometry primitives such as rectangles, circles, sectors, polygons, and wires. Geometry primitives on structural layers can be drawn with or without release etch holes. Detailed information on how to write generators is described in [6].
[3] Adobe Systems Incorporated, PostScriptLanguage Reference Manual, Addison-Wesley Publishing, 1990.
[4] Koester, D. A., Mahadevan, R., and Markus, K. W., "Multi-User MEMS Processes - Introduction and Design Rules," October 1994. [5] Koester, D. A., Mahadevan, R., Shishkoff, A. and Markus, K. W., SmartMUMPs Design Handbook, MCNC, 1996. [6] Mahadevan. R, and Cowen. A, CaMEL User's Guide MCNC, 1994, 1996. [7] Guckel, H., Burns, D. and B. Choi., "Diagnostic Microstructures for the Measurement of Intrinsic Strain in Thin Films," Journal of Micromechanics and Microengineering,Vol. 2, pp. 86-95, 1992.
REFERENCES [1] Mead, C. and Conway, L., Introduction to VLSI Systems, Addison-Wesley Publishing, 1980.
66
SYNTHESIS AND SIMULATION FOR MEMS DESIGN Erik C. Berg', Nanping R. Lo', Jonathan N. Simon2 , Hee Jung Lee1 , and Kristofer S. J. Pister1 2
'Department of Electrical Engineering Department of Mechanical and Aerospace Engineering University of California at Los Angeles 405 Hilgard Avenue, Los Angeles, CA 90095-1594 [email protected] modelling and simulation of the system. Both of these require time-consuming manual changes for iterative design. Taking inspiration from VLSI CAD techniques, the authors advocate MEMS systems-level synthesis, extraction, and simulation (Fig. 1). We have developed software tools which enable rapid generation and simulation of a broad class of surface micromachined and LIGA systems. These tools are intended to complement MEMS tools for process and device design [1,2].
ABSTRACT To facilitate growth and innovation in micro-electricalmechanical systems (MEMS) research and development, techniques for high-level design of these systems are needed. Using these methods and commercially available standard manufacturing processes, non-experts will be able to design, simulate, and fabricate complicated devices and systems. This paper presents methodology and tools developed to enable designers, starting from a high-level abstraction of coupled their system, to extract parameterized electromechanical models, perform full time-domain or frequency-domain simulation, optimize the design, and finally synthesize layout to produce lithography masks. A MEMS surface-micromachined, electronically-controlled micromechanical resonator fabricated using standard CMOS is demonstrated to illustrate the tools and approach.
2. HIGH-LEVEL SYSTEM SYNTHESIS To demonstrate this approach, a micromechanical resonator with active control using velocity feedback was designed. This device was based on work done by Clark Nguyen and his colleagues [3-5], and it includes both mechanical and MOS electronic devices on a surface-micromachiningcompatible substrate. Figure 2 shows a "schematic" layout of the system that uses symbols to represent the electronic and mechanical "leaf cells" of the system [6]. Each leaf cell contains specific parameters that describe it, and these can be edited in the schematic editor. For example, a "spring" leaf cell will have parameters that specify either the spring constant or the geometry of the spring.The leaf cells also have terminals that are used to connect the elements together, forming the electrical and mechanical networks of the design. In Figure 3, the symbols have been replaced by machinesynthesized layout, but each leaf cell retains its parametric data and terminal information. This representation can easily be converted to a mask definition for fabrication.
1. INTRODUCTION To facilitate growth and innovation in micro-electricalmechanical systems (MEMS) research and development, techniques for high-level design of these systems are needed. Using these methods and commercially available standard manufacturing processes, non-experts will be able to design, simulate, and fabricate complicated devices and systems. Modern VLSI CAD tools allow synthesis of lower-level circuits from high-level abstractions, extraction of relevant features, and rapid simulation of circuit performance. In stark contrast, the design of MEMS systems is an art, not a science. A typical MEMS system design uses two separate processes: hand layout of circuit geometry, and manual
Text Descriptio
.-
-_
ymbols + Interconnect I A
Block Generatic
Parameterized SPICE Netlist
Synthe
Graphical InpL
Layout + Interconnect |
LALtaLruinI
cALI atIIVI
Place and Route
Hand I 1
I Mask Pattern
I
Figure 1: VLSI Based MEMS Design Process
67
CMOs Transimpedance Amplifier
Sense Feedback A A- A
uMuO
Transimpedance Amplifier
Drive Comb
Folded Spring
Sense Combs
Feedback Comb
I
Capacitor
Resistor CDorveb
I
Sprngd
\
Mass
Figure 2: Schematic Representation of Q-Controlled Resonator
Figure 3: Physical Representation of Figure 2 with Symbols Replaced by Machine Synthesized Layout
3. EXTRACTION AND SIMULATION
Figure 5 shows an output frequency-domain plot near resonance for several values of the feedback resistor, and the variation of the Q factor that occurs with changing this resistance value is shown in Figure 6. Figure 7 demonstrates the invariance-of the quality factor for a wide range of system pressure; the rolloff at high pressure is due to the viscous damping force becoming larger than the electronically-controlled damping. Physical variables such as displacements and forces can be easily monitored, and Figure 8 shows the magnitude of the displacement of the moving parts of the resonator for the same set of resistance values as Figure 5. Note that the displacement, as expected for a second-order spring-massdamper mechanical system, is a lowpass function that has a two-pole rolloff. Tools were also developed that synthesize layout directly from user performance specifications. Figure 9 shows a micromechanical resonator that was automatically generated and fabricated at MCNC. Layout synthesizers such as this enable rapid, error-resistant MEMS design.
Extraction is performed on either of the representations, producing a SPICE netlist (Fig. 4). Each leaf cell produces an element in the netlist with a set of attached parameters. Each type of leaf cell has an associated macromodel used by SPICE that models its performance. The mechanical models use electrical analogs to simulate the differential equations of the network, and both the mechanical and electrical networks created by each mechanical leaf cell are represented in the simulation model. This allows, for example, explicit coupling between the varying overlap of a comb drive and its capacitance, allowing capacitive velocity sensing to be simulated. The micromechanical resonator is designed to have an electrical voltage input and output and a bandpass frequency characteristic. The relative bandwidth of the device's output is described by the quality factor, or "Q." and applications such a filters usually require precise control of this value. In this design, the Q is controlled by the value of the feedback resistance in the amplifier.
spice deck conversion of qcontrol:schematic generated by talos4 on Wed Apr 3 12:41:20 1996 Include Subcircuit, CMOS, and Process Information: .INCLUDE 'MEMSmodels.spice' $ MEMS Models .INCLUDE 'ELECmodels.spice' $ Electrical Models .INCLUDE 'TRANSmodels.spice' $ BSIM Level 13 Models .INCLUDE 'PROCESS-PARAM.spice' $ Sample Process Parameters
* *
XcombOOO XcombOOl XcombOO2 XspringO03 XmassOO4 XpmosOOS XpmosO06 XnmosO07 XnmosO08 XpmosOO9 COOOOO10 XnmosOll XnmosO12 R0000013
inm leftm ine lefte comb-geo NG=113 GAP=2e-6 W=2e-6 XO=lOe-6 DIR=-l sinm leftm sine lefte comb-geo NG=226 GAP=2e-6 W=2e-6 XO=lOe-6 DIR=-l outm rightm oute righte comb-geo NG=339 GAP=2e-6 W=2e-6 XO=lOe-6 DIR=l biasm topm biase tope spring-geo L=134e-6 W=2e-6 NSP=4 RF=4 leftm topm rightm lefte tope righte mass3-geo W=50e-6 L=50e-6 nnl2e nnl2e Vdde Vdde pmos W=lOOe-6 L=2e-6 nnl2e stagele Vdde Vdde pmos W=l00e-6 L=2e-6 Outbiase stagele nnlOe nnl0e nmos W=SOOe-6 L=2e-6 Vbiase oute GNDe GNDe nmos W=400e-6 L=2e-6 stagele oute Vdde Vdde pmos W=800e-6 L=2e-6 stagele oute lOp Vbiase nnlOe GNDe GNDe nmos W=lOOe-6 L=2e-6 sine nnl2e nnlOe nnlOe nmos W=500e-6 L=2e-6 oute sine R=rfeedb
Figure 4: Extracted Parameterized SPICE Netlist of Q-Controlled Micromechanical Resonator
68
l
MD022
96/04/032
,0'V0
00
X~
1 .
0.0914
1 MED
Figure 5: SPICE Simulation of Q-Control Transimpedance Amplifier Output
Figure 6: SPICE Simulation Showing Variation of Q with Feedback Resistance
4. SIMULATION MODELS
Table 1: Electromechanical Analogs
System simulation is performed using the widely-available SPICE program, which is designed to solve systems of ordinary differential equations (ODEs) such as those that result from the coupled electrical and mechanical element models of these systems. The electronic elements use the standard models provided in SPICE such as resistors, capacitors, and transistors, but models for the mechanical devices had to be developed to simulate their performance. The ODEs of the mechanical system are simulated using electrical analogs. First-order electromechanical models relating inertial, damping, spring, and electrostatic forces to the time derivatives of the displacement are used, but more sophisticated models or empirical data could be used for more precision. The modeling technique uses a parallel-element approach in which the parallel forces exerted on a node are modeled as currents entering the node and the displacement of a node is represented by its voltage variation. Just as the current entering a node must sum to zero, the sum of the forces (including inertial terms) on a node must also have zero sum. Similarly, adding either displacements or voltage drops around a closed loop gives a zero net result. The first-order analogs used for this example are shown in Table 1. Note that many mechanical devices can be directly simulated using electrical elements, while some must use controlled sources as their analogs.
Mechanical Model
Fspring
Electrical Analog
=kx
Ires
= kRI
I
=CV C
Fdamp =Bx pcap Fmass F
=mx
2 source
R =
=
'orce
eiecrro.tatic =V 2~etosai jx cap
Element Values -
C = B aV C =m
2
axV cap
ax 2ax
5. SUMMARY The goal of this work is to develop tools which allow MEMS designers to easily produce fully-simulated complex designs with reasonable confidence in the system's predicted performance. For designers, this high-level approach has the advantage that parameterized models enable quick and efficient exploration of the design space, analysis of sensitivity to process variations, and optimization of performance. 5. ACKNOWLEDGEMENT This work was supported in part by a grant from NSF and ARPA under award 1R19321718 and ARPA award DABT63-95-C-0050. Software available by http and ftp from synergy.icsl.ucla.edu.
I
-P
1ot
0.0101010:Dnrle
II '10
If
I
Iag
I
o ('~
0.
..
.
Figure 8: SPICE Small-Signal Simulation of Resonator Displacement
Figure 7: SPICE Simulation Showing Variation of Q with Pressure
69
50..035I
Figure 9: SEM of Machine-Synthesized Resonator Fabricated at MCNC REFERENCES [1] Crary, S. and Zhang, Y, "CAEMEMS: An Integrated Computer-Aided Engineering Workbench for MicroElectrical-Mechanical Systems." Proc. IEEE Workshop on MicroElectroMechanicalSystems, Napa, California, pp. 113-114, February 11-14, 1990. [2] Senturia, S., et al., "A Computer-Aided Design System for MicroElectroMechanical Systems (MEMCAD)." IEEE J. MicroElectroMechanicalSystems, vol. 1, pp. 3-13, March 1992. [3] Nguyen, C. T.-C. and Howe, R.T., "Quality Factor Control for Micromechanical Resonators." Technical Digest, IEEE International Electron Devices Meeting, San Francisco, California, pp. 505-508, Dec. 13-16, 1992. [4] Nguyen, C. T.-C., Micromechanical Signal Processors, Ph.D. Dissertation, University of California, Berkeley, 1994. [5] Nguyen, C. T.-C. and Howe, R.T., "Design and Performance of CMOS Micromechanical Resonator Oscillators." IEEE International Frequency Control Symposium, 1994. [6] "Octtools/vem Integrated IC Design System." Industrial Liaison Program, 479 Cory Hall, University of California, Berkeley, CA 94720.
70
CAD FOR INTEGRATED SURFACE-MICROMACHINED SENSORS: PRESENT AND FUTURE Stephen F. Bart Analog Devices, Inc., Wilmington, MA, USA Stephen.Bart tuanalog.com
ABSTRACT The present state of the art in Micro-electro-mechanical systems (MEMS) design methods can be characterized by the use of a disjoint set of tools and techniques which have been gathered from the many disciplines that MEMS encompass. This requires the MEMS designer to master a broad spectrum of unrelated tools and often requires translation of relevant data from one simulation to another by hand. Further, the designer must integrate the results to form an overall prediction of the system's behavior. This type of piecemeal design environment is inefficient and prone to human error. As MEMS progress towards ever more complicated systems, the present piecemeal approach will become less and less satisfactory. In particular, system level simulations will become more and more difficult and their trustworthyness will decrease just as they become more and more necessary. This paper will discuss the simulation tools used to design a typical surface-micromachined lateral accelerometer such as the Analog Devices, Inc.. ADXL50. This will highlight the types of analyses which are required and typical tools that are presently used. Then it will examine the shortcomings of these tools, as well as analyses that are not practically possible at this time, as a way to explore the MEMS design tools that will be required in the future. 1.
,nchor
Figure 1. Schematic diagram of the accelerometer sensor displaced by an applied acceleration. tems, the present piecemeal approach will become less and less satisfactory. In particular. system level simulations will become more and more difficult and their trustworthyness will decrease just as they become more and more necessary. This evolution will place increasing demands on the required design tools which argues for a careful examination of the design framework into which these tools will be placed. This paper will examine the simulation tools used to design a typical surface-micromachined lateral accelerometer such as the Analog Devices, Inc. ADXL50. This will highlight the types of analyses which are required and typical tools that are presently used. Then we will examine the shortcomings of these tools, as well as analyses that are not practically possible, as a way to explore the MEMS design tool requirements of the future.
INTRODUCTION
Integrated Micro-electro-mechanical systems (MEMS) have become commercially viable products which are increasingly being used as high reliability, low cost replacements for standard electromechanical devices. For example, integrated surface micromachined accelerometers such as the Analog Devices, Inc. ADXL50, are seeing increased use in high-volume, low-cost applications such as crash sensors for airbag deployment modules in automobiles [5]. Such applications make it very important that the sensor be produced at the highest quality for the minimum cost. This requires efficiency at all stages of the device's production, particularly in its design. The present state of the art in MEMS design methods can be characterized by the use of a disjoint set of tools, often borrowed from other disciplines. This requires the MEMS designer to master a broad spectrum of unrelated tools, and often requires translation of relevant data from one simulation type to another by hand. Further, the designer must integrate the results to form an overall prediction of the system's behavior. This type of piecemeal design environment is inefficient and prone to human error. As MEMS progress towards ever more complicated sys-
1.1. A MEMS Accelerometer Figure 1 is a schematic diagram of the electromechanical sensor portion of a typical surface micromachined accelerometer. The fixed fingers are attached to the substrate and do not move. The moving fingers are attached to the moving mass which is suspended by four tethers. The moving mass and the tethers make up a mechanical spring-mass system in which the damping is dominated by the viscous drag of the surrounding air. Each moving finger with its two adjacent fixed fingers forms a pair of lateral series capacitors called a "unit cell" (see Fig. 1). The ADXL50 accelerometer structure consists of 42 such unit cells. An acceleration causes the moving mass and its fingers to move, creating imbalances in the series capacitor pairs. During normal operation, complementary clocks (antiphase square waves) are applied to the
71
0o
Tether I
.I .I .I 0
0
.I
I !-0.1
I I I I I I I
2-
-0.2
-02f
I I I Center Line
AA
20
A
40
A'A
.. A
. AA
60 80 100 Posison along finger (urn)
.AA
120
140
Figure 3. Simulated warpage of a fixed finger cantilever.
I
Denotes Anchor
component to the electric field and the capacitance will be significantly different from the simple parallel-plate value. At present we overcome this problem by using constant correction factors to modify the parallel-plate solutions for capacitance and its spatial derivative.
Figure 2. Schematic diagram of the ADXL50 moving mass. fixed fingers in each unit cell. When the moving fingers are centered, the series capacitors are equal and the capacitive coupling of the complementary clocks cancel each other, yielding a zero voltage on the moving mass electrical node. In the case of a non-centered beam, the clock signals are capacitively coupled to the moving mass in proportion to its distance from its neutral position. Thus, the amplitude of the ac signal at the moving mass node is monotonically related to the magnitude of the deflection. This signal is then amplified and demodulated to yield the output signal. To insure linearity and long-term stability. micromachined accelerometers are often closed-loop, force-rebalance devices. In this case, the output signal is also used as a feedback signal which alters the moving beam voltage and thus applies an electrostatic force which balances the inertial force due to the applied acceleration [5, 8, 3]. However, surface-micromachined inertial sensors tend to be relatively low-mass, high stiffness devices [1]. Thus, their deflections are quite small. This means that they tend to be quite linear devices and often do not require force-rebalancing for linearization. 2.
.
C = K, eoA -g-r dC
-= dx
Kf
A
(g - X)2
(1)
(2)
These correction factors are generated with either a 2-D finite element solver or with a 3-D boundary element solver (FastCap[7]). These solutions are not self-consistent with the mechanics. For the very small displacements typical of the accelerometer devices (tens to hundreds of angstroms), this can be tolerated. For structures that undergo relatively large deflections, such as resonant structures, this is more of a problem. In particular, electrostatic instability (pull-in) can be a problem for such devices. A self-consistent solution is required if pull-in is to be accurately modeled. 2.1. Mechanical Simulation Static finite-element model solutions are used to verify several aspects of the design. The first is the structural warpage. The ADI poly-silicon is deposited with tensile residual stress which causes the structures to shrink slightly. In addition, the poly has a stress gradient through its thickness which causes the structures to warp. This can cause large structures to come into contact with the substrate. Since this would be catastrophic, a simulation is required to check for contact. We model the fabrication induced residual stress gradient as a thermal gradient of 26.5 deg. with a thermal expansion coefficient of 2.0 x 10-6 (deg.-l). An average temperature is also applied to model the average tensile stress. These thermal parameters were obtained by matching the maximum simulated tip deflection of a fixed finger and the maximum simulated height of the center of the moving mass to average measured values for many hundreds of ADXL50 structures. Fig. 3 plots the simulated warpage of a typical cantilever finger of length 135 pm. Fig. 4 plots the simulated warpage along the center line of the ADXL50 accelerometer's moving mass. Static solutions are also used to apply static acceleration loads to the structure. This allows the sensitive and
BASIC DESIGN SIMULATION METHODS
The basic design iterations for the ADXL50 and similar sensors were performed using simple closed form models of the appropriate physics. Since these sensors are inertial sensors, the fundamental parameters are the mass and the spring constant. The mass can be accurately calculated from the area of the device. A simple model for the spring constant of the tethers can be derived from simple beam theory [4]. Accelerometers have been designed with both straight, non-stress relieved tethers as shown in Fig. 2 [1] and folded, stress relieved tethers as shown in Fig. 1 [3]. In the case of non-stress relieved tethers, the stress must be accounted for as well. Here the difficulty is knowledge of the stress value and not the accuracy of the model. Simple models for the electrostatic domain are more problematic. The basic model is that of an infinite parallel-plate capacitor. The difficulty here is that the aspect ratio of typical surface micromachined capacitor gaps are not much better than 2-to-i. Hence there is a large fringing field
72
02
the use of SPICE constructs to perform electromechanical or mathematical functions. As a consequence, these models are very hard to modify and debug by the designer.
0.45
aE: 0.4
4.
Several tools exist which can perform self-consistent electromechanical simulation. At present, the problem with these systems is the size of the structure that they can practically solve due to both time and memory limitations. To simulate an entire interdigitated accelerometer structure has not been possible. One option is to use the symmetry of the structure to reduce the size of the problem. However, because these devices owe much of their sensitivity to their symmetric structure, it is important to have a simulation tool that allows you to see the effects of manufacturing variations that can break the symmetry; for example, the effect of nonsymmetric tethers. Another option is to simulate one set of capacitive finger cells and use the solution for all of the equivalent cells. However, in the case of the ADI structures, this redundancy is broken because the structures are warped. Due to this fabrication induced warpage, each unit cell has a different force contribution to the displacement of the total moving structure. A modeling method, called the lumped-model selfconsistent analysis method, was developed to overcome this problem [9]. The method is based on the calculation of an intermediate look-up table which relates the electrostatic forces on a finger cell to the position of the moving finger in both the sensitive axis and the warpage axis. Since the fingers are stiff relative to the tether, we can apply the cell electrostatic force vector at the intersection center of the moving finger and the moving mass. This use of a precomputed look-up table greatly reduces the computation time and memory requirements in comparison to a standard self-consistent electromechanical analysis scheme. The lumped-model self-consistent analysis method is computed as follows. First, the structure's warped static shape is modeled as described above. The second step requires calculating the cell electrostatic energy by using FastCap to compute the capacitance matrix in the relation
C 0.3 02o 0.2 0.15
0.1
-
-- 400 .
-35,l -350
-30.4J -300
0 -. 0-. 5 -250 -200 -150 -100 Position alng moving mass (um)
.5 .50
COUPLED ELECTROMECHANICS
I II
Figure 4. Simulated warpage of the moving mass along the cross section. cross-axis spring constants to be confirmed. Also, it allows us to determine the maximum acceleration that will cause the structure to come into contact with the substrate or surrounding structures. This is important for determining maximum acceleration specifications. 2.1.1. Modal Analysis For the accelerometer structures, modal analysis allows you to examine the relative compliance of various structural motions to be sure that any such motions will not interfere with the primary sensing. Also, for systems with switched voltages, the excitation of unanticipated resonant motions can be examined. Modal analysis becomes critical for resonant structures. In such structures you generally wish to excite one resonant mode and avoid all others. Thus a knowledge of the spacing and Q of the structure's nodes is required. 2.1.2. Harmonic Analysis Harmonic analysis is primarily useful for resonant structures. It allows you to apply realistic forces and examine the amplitude and Q of the motions that are excited. Clearly, to examine the effects on all pertinent modes, a reasonably accurate solution for the applied forces must be obtained. Since a simple parallel-plate capacitance model for the electrostatic force, even if corrected for fringing fields as described above, only yields an estimate of the on-axis force, a simulation for the cross-axis forces is required.
E = IZCi,,jV,j2.
(3)
'ij
Fig. 5 shows the FastCap mesh for a finger cell. Since these accelerometer structures are designed to be much stiffer in the non-sensitive in-plane axis (y axis), we assume that the moving mass can move in the acceleration sensitive axis (x axis) and the out-of-plane, or levitation axis (z axis). The electrostatic energy is thus differentiated with respect to the x and z displacements to build a table of cell electrostatic force versus finger position values. Fig. 7 shows the electrostatic energy distribution which was differentiated to build the force versus position table. Next, for each finger's position, the x and z axis electrostatic force components from the lumped-model table are attached to the moving mass structural model as indicated in Fig. 6. Finally, we self-consistently analyze the structural model with the applied finger forces using ABAQUS [6]. The final two steps are repeated until the displacement stops changing. In order to test the accuracy of the simulations obtained with this method, the change in resonant frequency with applied DC bias voltage was simulated and compared to measured values for several open-loop ADXL50 accelerometers. Figure 8 shows the resonant frequency data versus
3. SPICE MODELS The sensors used as examples here are integrated sensors. As a consequence, the designer of the interfacing electronics needs to have a model of the sensor which can be run within the context of a circuit simulation tool. At ADI we use SPICE based circuit simulation tools. We have developed a model which uses voltages to represent force and position variables and uses SPICE expressions to calculate the behavior of the sensor electromechanics. The mechanics are modeled as a set of independent, single axis, second order mechanical systems. The capacitances and electrostatic forces are modeled as parallel-plate capacitors with fringing field corrections. Parasitic capacitance can dominate the response of these tiny sensors and therefore, models for parasitic capacitance must be included. Although these model are functional, their inner workings are obscured by
73
sac
_6A13. 4t-.15
! -6.28- . us46.25~
l
46.3~ 0.4 -
____1 -
0
-k
-
.
068
0.2 n
-
-0.4
f a tv
vary
L.~ii-
~Vlw~ UI
0
I_
-
S i
Drr~di
(um)
,
Figure 7. Electrostatic energy distribution.
29 28
Figure 5. 3-D FastCap mesh of a unit cell. 26
star --
masmurrne
circle- measurromrenI 24 i23
2
21
}
1
-
1.5
-
-
2
2.5
-
A
3
^
3.5 -
4
-
4.5
DC bias(vots)
Figure 8. Resonant frequency versus DC bias. 0
the DC bias voltage difference on the fixed fingers. The DC bias voltage on the horizontal axis of Fig. 8 was applied to the right-hand fixed finger of each finger cell (see Fig. 1). The left-hand fixed finger was grounded. The DC potential of the moving mass and its fingers (as well as the groundplane under the structure) was centered between these values (ie, one-half the horizontal-axis potential). The change in resonant frequency with applied DC bias voltage in Fig. 8 is caused by the reduction in the effective spring constant due to the electrostatic forces. The code used to implement this method is hand-crafted and would require considerable effort to use on a regular basis. However, there is no fundamental reason why it could not be automated. A more general problem with this method is that it relies on a repeated finger cell geometry like that found in the ADI accelerometer products. It is easy to imagine structures where this approach would not be particularly helpful.
0 0 0
Computed finger forces
5.
l
SIMULATION REQUIREMENTS FOR MEMS SYSTEMS
There are several basic simulation functions that are needed to allow MEMS structure designers to obtain accurate and functionally useful models. The first is a self-consistent electromechanical modeler. The system must be able to handle structures with a level of geometric complexity at least as
Figure 6. Computed x and z axis forces are applied to the moving mass.
74
a sensitivity analysis is important. Such simulations will require the ability to build a parametric simulation "tree" and to call upon an entire network's resources to efficiently compute.
great as present commercial accelerometer structures. And it must be able to solve them accurately in a reasonable amount of time. Among other things, efficient mesh generation will be important here. Since there are different requirements for optimization in the mechanical and electrical domains, an adaptive meshing capability in both domains will probably be required. The availability of dielectric materials is also desirable. Since these MEMS structures will increasingly be connected to more and more sophisticated circuits, the circuit designer requires a model for the MEMS device in the circuit simulation environment. Thus, the automatic generation of a SPICE type model is required. Since computing power will, in general, not allow a full electromechanical simulation to be performed at each SPICE time step, a flexible structure for encapsulating a behavioral model of the MEMS structure will be required. A set of electromechanical simulations would generate the parameters required for this SPICE framework. An example would be a model which linearizes the desired behaviors or degrees of freedom around a typical operating point. The self-consistent electromechanical modeler would provide the parameters for this linearized model. The circuit simulation could monitor how close the system is to the modeled operating point, calling for a new computation about a new operating point when necessary. Finally, it should be noted that some of the most important circuit parameters are the various parasitic capacitances. The ability to extract not only air gap parasitics, but also parasitics which have semiconductor behavior, such as those created by a diffused interconnect, is important.
6. CONCLUSION The state of computer aided design tools for MEMS is, at the present time, inadequate. Although a fundamental strength of MEMS systems is the transduction of multiple energy domains, most modeling is still performed on tools which only handle a single domain. The tools which do couple the two most important domains, electric and mechanical, are too computationally inefficient to handle problems of a practical size. Further, they cannot generate models which can couple to the circuit simulation environment. This slows the ability of the designer to evaluate novel designs to a crawl and greatly increases the chance for errors to invade the simulation path from the sensor's layout to the modeling or circuit simulation results. Finally, the lack of a unified simulation environment makes performing a parametric sensitivity analysis to examine the effects of dimensional variations very difficult. REFERENCES [1] S. Bart, J. Chang, T. Core, L. Foster, A. Olney, S. Sherman, and W. Tsang, "Design Rules for a Reliable Surface Micromachined IC Sensor," Proc. of the 33rd Annual International Reliability Physics Symposium, Las Vegas, NV, April 4-6, 1995, pp. 311-317. [2] S. F. Bart, M. Mehregany, L. S. Tavrow, J. H. Lang, and S. D. Senturia, "Electric Micromotor Dynamics," IEEE Transactionson Electron Devices, vol. 10, March 1992. pp. 566-575. [3] K.H.-L. Chau, S.R. Lewis, Y. Zhao, R.T. Howe, S.F. Bart, and R.G. Marcheselli, "An Integrated Forcebalanced Capacitive Accelerometer for Low-G Applications." Proc. of the 8th International Conference on Solid-State Sensors and Actuators, Stockholm, Sweden, June 25-29, 1995, pp. 593-596. [4] G. K. Fedder, Simulation of Microelectromechanical Systems, PhD Thesis, University of California at Berkeley, CA, 1994. [5] F. Goodenough, "Combining Micromachining with Analog IC Technology," Electronic Design, August 8, 1991. [6] Hibbit, Karlsson, and Sorensen, Inc., Providence, R.I. [7] K. Nabors and J. White, "FastCap: A multipoleaccelerated 3-D capacitance extraction program,' IEEE Transactions on Computer-Aided Design, vol. 10, Nov. 1991, pp. 1447-1459. [8] S. Sherman, W. Tsang, T. Core, R. Payne, D. Quinn, K. Chau, J. Farash, S. Baum, "A Low Cost Monolithic Accelerometer; Product/Technology Update," Proc. IEEE 1992 Int. Elec. Dev. meeting, San Francisco, CA, Dec. 13-16, 1992, pp. 19.1.1-19.1.4. [9] H. Yie, S. F. Bart. J. White, and S. D. Senturia. "A Computationally Practical Approach to Simulating Complex Surface-micromachined Structures with Fabrication Non-idealities," Proceedings of the IEEE Micro Electro Mechanical Systems Workshop, Amsterdam. the Netherlands, Jan 29-Feb 2, 1995. pp. 128132.
5.1. Damping and Other Energy Domains One domain that has been somewhat neglected is simulation of the structure's damping. Accurate damping calculations will become increasingly important for sensitive resonant structures such as gyros. At this point it is not clear whether a fluid mechanical analysis is required or just an appropriate application of known closed form solutions for low Reynold's number flows [2]. In either case, appropriate parameters should be extractable from the structure geometry and provided to the SPICE level model. The modeling of the thermal domain can also be important in some devices. Since thermal modeling has well known duals in mechanical or electrostatic analysis, it is easily added to the simulation environment. 5.2. System Confirmation Circuit and layout environments provide extensive tools for design rule checking and circuit-to-layout verification. As MEMS systems become more complicated, verification through the simulation chain becomes more and more important. The modeling tools must be capable of using appropriate layers from the layout to construct the structure model. The results must pass, without human manipulation of the data, to the SPICE type circuit model. 5.3. Parametric Sensitivity Analysis Although micromachining techniques allow the fabrication of very small structures, the relative accuracy can be quite poor. In a typical manufacturing fabrication line it is not unusual to see lot-to-lot variations of 10%-30% for small dimension lateral features such as capacitive gaps. As a consequence it very important that the MEMS designer be able to predict the effect of such variations on the device's operation. Thus the ability to easily run a set of simulations using known manufacturing variation and generate
75
A VISION OF STRUCTURED CAD FOR MEMS Gary K Fedder
Department of Electrical and Computer Engineering and The Robotics Institute Carnegie Mellon University Pittsburgh, PA, 15213-3890 E-mail: [email protected]
ABSTRACT Computer-aided design tools tailored for microelectromechanical systems (MEMS) are needed to enable design of complex systems with multiple energy domains. In an analogy to the VLSI design methodology, physical, structural, and behavioral views of MEMS can be formed and coupled together in an integrated toolset. Of key importance is the formation of parameterized MEMS component libraries to support these views. Fast coupled-domain numerical (physical) simulation and behavioral simulation are required to move freely between the views.
logic, register, to system level. At each of these levels, a design can be viewed in physical, structural (schematic), or behavioral form. Similar design views and hierarchical levels for MEMS are feasible and sorely needed. Analogous hierarchical levels for MEMS up to the VLSI circuit level are easily made. Even higher levels of abstraction, which may be different from the VLSI paradigm, will evolve for MEMS. Complications with implementing a MEMS design methodology stem from the difficulty in handling the coupled energy domains. A first task in development of structured MEMS design tools is the formation of standard data representations and standard cell libraries. An enormous effort is necessary to identify and to model reusable MEMS processes, elements, devices, and architectures. MEMS CAD tools must be integrated, with appropriate links available to the designer to switch between different lateral views and hierarchical levels. In this paper, a brief overview of current MEMS CAD tools, design practices, and process services is presented. A vision of structured design and synthesis for MEMS is then given.
1. INTRODUCTION One prevailing trend in MEMS is toward monolithic systems where multiple micromechanical devices are integrated with sense electronics, digital 1/0, selftest, auto-calibration, digital compensation, and other signal processing functions. There is a growing demand for rapid design, analysis, and synthesis tools for MEMS that include coupling between multiple energy domains, including mechanical, electrostatic, magnetic, thermal, fluidic, and optical domains. Presently, most development of MEMS involves concurrent design of devices and their associated fabrication processes. More rapid development of MEMS requires a structured design methodology, supporting tools, and supporting model libraries for common MEMS processes. Eventually, MEMS processes that lend themselves to structured design will evolve into de facto standards, because it will become easier to design new devices in these processes. One key to rapid design will be the ability to reuse design knowledge through hierarchical component and model libraries. Structured design methods for MEMS are not completely new; they are borrowed from the VLSI design methodology. CAD for VLSI spans many levels of abstraction from materials, device, circuit,
2. CURRENT MIEMS CAD TOOLS Several groups have existing research programs to address the deficiency in MEMS design tools. Examples from the U.S. include MEMCAD (M.I.T. [1][2], Microcosm [3]) and CAEMEMS (Univ. of Michigan)[4]; examples from Europe include CAPSIM (Catholic Univ. of Leuven, Belgium)[5], SENSOR (Fraunhofer Institute, Germany)[61, and SESES (ETH, Zurich)[7]. These tools involve general numerical analysis of layout and generation of macro-models for simulation. MEMCAD has evolved into a MEMS modeling framework with rapid self-consistent electromechanical 3D numerical simulation. Recent advances have
76
Design concepts are implemented in a manual layout. The performance is then analyzed using numerical analysis tools, usually resulting in iterations on both the layout and the underlying process. The present state-of-the-art in MEMS CAD relies on device-level extraction of macro-models in a limited set of energy domains for behavioral simulation. Current commercial design tools cannot deal with the complex multidomain architectures that will be necessary to create the next-generation of commercial MEMS.
I
I tI
II II
Much future work should focus on creating very fast multi-domain numerical simulation tools to ease both process development and device macro-modeling. However, these numerical tools by themselves may not be practical for rapid iterative design since the physical layout (and perhaps the process) must be changed for each iteration without necessarily knowing what to change to best to improve the device performance. Currently, a self-consistent electromechanical analysis of even a simple device requires many man-hours to create the 3-D geometry and perform the numerical simulation. Plus, the time to complete a manual design cycle in MEMS has not decreased significantly over the past few years since knowledge from previous development efforts cannot be easily reused by future developers.
Fig. 1. Flowchart of current MEMS design practice. been made in simplifying the input and visualization of 3D models of micromechanical structures from layout using the MEMBuilder tool [8]. CAEMEMS is a framework in which the users chooses among modules that address specific design domains. CAEMEMS automatically generates a set of parameterized response surfaces by launching multiple finiteelement analyses. IntelliCAD[9] available from IntelliSense Corp. is a commercial MEMS CAD tool with automated 3D modeling from layout and process integrated with numerical analysis. Other commercial tools by Tanner Research[10] cater to the MEMS community by allowing layout of non-manhattan geometry and supplying MEMS technology files with design rule checking. These tools are definite improvements over use of Magic or KIC for layout and stand-alone numerical analysis tools (e.g. ABAQUS, ANSYS, Ansoft Maxwell). For general MEMS devices, concurrent design of process and structure is important, but there have been only a few efforts to improve CAD in this area. One promising activity at the University of Michigan involves MEMS process synthesis from design specifications [11].
4. MEMS PROCESS SERVICES MEMS covers a broad, evolving spectrum of fabrication processes. In the U.S., two process services are available that produce surface-micromachined MEMS, where the microstructures are patterned out of thin films on the substrate surface. Polysilicon MEMS can be built in MCNC's MUMPs process [12], and laminated oxide/aluminum MEMS can be built using MOSIS followed by an in-house dry-etch release step [13]. There are a several important benefits of making microstructures with stable fabrication services such as MUMPs and MOSIS: 1) sensor fabrication is fast and reliable, so prototypes can be reproduced anytime, 2) all, or most, fabrication steps are done externally, so resources can be invested in design, not standard processing, 3) the process is repeatable and characterized, so circuit and microstructure designs can be re-used, 4) devices improve as the process technology improves (e.g. scaling).
3. CURRENT MEMS DESIGN PRACTICES Current MEMS design practice, shown in Fig. 1, focuses on iterative device and process development.
77
_°9
e "Ie
MA1
uctural I 5utai
' 0•
DRC
iylre~l
2D/3D
ccept
-I
synthesis
macro-model xtraction
Fig. 3. CAD tools coupling the MEMS schematic, behavioral, and physical views.
imam
evaluation of the concepts are accomplished by moving back and forth between views until a suitable design is found and sent to the process service for fabrication. The physical view can take the form of either a 3D solid model or a 2D layout. The structural view specifies connectivity between micromechanical elements in a schematic. The behavioral view specifies the governing equations of the system, such as electrical node equations, equations of motion, and heat transfer equations. It is important to have the flexibility to move freely between these views.
fabrication Fig. 2. Parallel views and supporting libraries in the MEMS design and synthesis methodology.
5. STRUCTURED DESIGN AND SYNTHESIS In a complementary approach to existing analysis tools, we are developing circuit-level design and synthesis tools tailored to general surface-micromachined systems. The planar '2 1/2-D' topology of surface-micromachined MEMS lends itself to abstraction at this higher level than that offered by numerical device simulation alone. These tools will increase the performance, complexity, and level of integration designed into such MEMS as inertial sensors (accelerometers, gyroscopes), x-y-z servomechanisms for probe-based data storage, communications circuits (filters/resonators/mixers), displays (micromirrors, light valves), infrared imagers, pressure and tactile sensors, and thermal flow sensors. Once a working structured design methodology is established for surface-micromachined MEMS, the techniques may be extended to other processes, such as bulkmachined Si or a dissolved-wafer process. The existing IC CAD infrastructure can partially support the circuit-level MEMS design. In contrast to VLSI design, however, MEMS design has a tight coupling between form and function. The inclusion of mixed-signal, multi-domain functionality requires a re-tooling of the IC CAD software to handle the job. The three parallel views - physical, structural (schematic), and behavioral - for MEMS design are shown in Fig. 2. Design starts with the engineering specifications and concepts. Implementation and
Most existing surface-micromechanical designs can be partitioned into discrete components which are modeled as lumped-parameter elements, such as beam springs, plate masses, and electrostatic actuators. Conversely, new MEMS devices can be created by connecting together these lumped elements in different configurations, much like analog circuit design is accomplished. Simplified physical and behavioral views of MEMS are currently used by designers, while the schematic view has been missing. The MEMS schematic provides a critical link between the physical and behavioral views and may often be the starting point in design. Additional key features of the design methodology lie in the integration and automation of coupling between the views, as shown in Fig. 3. These coupling mechanisms include behavioral equation extraction and simulation, structural synthesis, and layout synthesis, layout extraction from schematic, and parameter extraction from layout. An example design session might start with construction of a MEMS schematic, then synthesize layout, extract parasitics, and simulate the mixed-signal response.
78
Depending on the simulation results, an inadequate design may be iterated by modifying the schematic, whereas a suitable design may be verified with 3D numerical simulation. Bi-directional coupling between views must be implemented to support this kind of design flexibility. Efficient mixed-signal mixed-domain simulation is critical to the iterative design process. Fast behavioral simulation will enable rapid exploration of different design concepts. During the initial iterative design phase, the designer will be freed from doing detailed layout and 3D numerical simulation. Many groups are already exploring behavioral MEMS simulation using device macro-models extracted from numerical analysis. An enabling feature of future MEMS design systems will be the automation of behavioral macromodel generation from layout. Physically correct and extensible models of microelectromechanical components are essential if one is to simulate, analyze, and synthesize MEMS. If the models are inadequate, the design will fail, regardless of how good the tools are. Efficient multi-domain numerical analysis is critically important for both generating lumped-element macro-models and for verification of final designs. In order to demonstrate the design tools and drive the effort to automate modeling, a core library of elements and models must be developed to support integrated MEMS design. When appropriate, parameterized models should be generalized with links to manufacturing variables to ease the extension to new MEMS process technologies.
*
fast modeling and verification tools; coupled-domain, numerical analysis (e.g. finite-element method, boundary-element method) * MEMS schematic capture * mixed-signal multi-level multi-domain behavioral simulation * layout of arbitrarily shaped objects with design rule checking * parameter extraction from layout * layout synthesis and verification * cross-linking of manufacturing, physical, and behavioral variables By providing circuit-level representations, MEMS design tools will enable rapid, intuitive exploration and analysis of the design space for large mixed-signal multi-domain systems. The high-level tools will speed up the design cycle from the order of several months to days.
REFERENCES [1]
[2]
6. CONCLUSIONS
[3]
An initial wish-list for the MEMS CAD toolset includes: * standard MEMS data representations and interchange formats * standard MEMS cell libraries supporting behavioral, schematic, and physical views (e.g. materials database, technology files, layout cells, schematic component library, and macro-model library) * standard MEMS process-module libraries and standard process flows * process visualization, simulation, synthesis, and technology file generation * 3D solid model generation, visualization and animation
[4]
[5]
[6]
79
S. D. Senturia, R. Harris, B. Johnson, S. Kim, K. Nabors, M. Shulman, and J. White, "A Computer-Aided Design System for Microelectromechanical Systems," Journalof MicroelectromechanicalSystems, v.1, no.1, pp. 3-13, 1992. J. R. Gilbert, R. Legtenberg, and S. D. Senturia, "3D Coupled Electro-mechanics for MEMS: Applications of CoSolve-EM," Proceedings of the IEEE Micro Electro Mechanical Systems Workshop, Amsterdam, The Netherlands, pp. 122- 127, Jan. 1995. MEMCAD 2.0, Microcosm Technologies, Inc., 201 Willesden Dr., Cary, NC 27513. S. B. Crary, 0. Juma, and Y. Zhang, "Software Tools for Designers of Sensor and Actuator CAE Systems," Technical Digest of the IEEE Int. Conference on Solid-State Sensors and Actuators (Transducers '91), San Francisco, CA, pp. 498-501, June 1991. B. Puers, E. Petersen, and W. Sansen, "CAD Tools in Mechanical Sensor Design," Sensors andActuators A, v.A17, pp. 423-429, 1989. B. Folkmer, H.-L. Offereins, H. Sandmaier, W. Lang, P. Groth, and R. Pressmar, "A Simulation Tool for Mechanical Sensor Design," Sensors and Actuators A, v.A32, pp. 521-524, 1992.
[7]
J. G. Korvink, An Implementation of the Finite Element Method for Semiconductor Sensor Simulation, Ph.D. Thesis, Swiss Federal Insti-
tute of Technology (ETH), Zuirich, Switzerland, Nov. 1993. [8]
P. M. Osterberg and S. D. Senturia, ""MEMBUILDER": An Automated 3D Solid Model Construction Program for Microelectromechanical Structures," Technical Digest of the 8th Int. Conf. on Solid-State Sensors and Actuators (Transducers '95), Stockholm Sweden,
v.2, pp. 21-24, June 1995. [9]
IntelliCAD, IntelliSense Corporation, 16 Upton Dr., Wilmington, MA 01887.
[10] L-Edit, Tanner Research, 180 North Vinedo Ave., Pasadena, CA 91107. [11]
B. Gogoi, R. Yeun, and C. H. Mastrangelo, "The Automatic Synthesis of Planar Fabrication Process Flows for Surface Micromachined Devices," Proceedingsof the IEEE Micro Electro Mechanical Systems
Workshop,
Oiso,
Japan, p.153-157, Jan. 1994. [12]
D. A. Koester, R. Mahadevan, K. W. Markus, Multi-User MEMS Processes (MUMPs) Introduction and Design Rules, available from
MCNC MEMS Technology Applications Center, 3021 Cornwallis Road, Research Triangle Park, NC 27709, rev. 3, Oct. 1994, 39 pages. [13] G. K. Fedder, S. Santhanam, M. L. Reed, S. C. Eagle, D. F. Guillou, M. S.-C. Lu, and L. R. Carley, "Laminated High-Aspect-Ratio Microstructures In A Conventional CMOS Process," Proceedings of the IEEE Micro Electro Mechanical Systems Workshop, San Diego,
CA, pp. 13-18, Feb., 1996. [14] Micromachines Program, available from Multi-Project Circuits (CMP) Service, 46, avenue Felix Viallet, 38031 Grenoble Cedex, Oct. 1994, 29 pages.
80
The Need for Composable CAD for Composite Systems Randolph E. (Randy) Harr Electronics Technology Office Defense Advanced Research Projects Agency 3701 N. Fairfax Drive Arlington, VA 22203-1714 rharr~darpa.mil
and material support libraries and standards to allow distributed and lumped element modeling and development of composite systems;
In the near future, it will be practical to fabricate microelectromechanical systems (MEMS), electronic, electro-optical, and micro-fluidic devices on a monolithic substrate or highly integrated module. In order to take advantage of these emerging micro-devices and manufacturing processes, we need to develop the design technology (tools, methodology, and architectures) to support device and systems design of mixed-technology, highly integrated systems. Of particular interest is design technology to support composite systems composed of hundreds to millions of tightly coupled, mixedtechnology devices. Such systems are envisioned to be completely self-contained with integrated control circuitry, sensors, and interface logic. Actuation, displays and energy storage devices might also be included. The mixed domain (kinematic, electric, electrostatic, and fluidic) analysis of micromachined, fabricated and possibly assembled devices, systems of devices and corresponding electronic circuits needs to be developed to support the design of these composite systems. Technical challenges that need to be addressed by such a design environment are: *
Physical 3D distributed-element modeling and design rule checking (especially against manufacturing process rules) tools and composable interface standards for mixed technology devices and interconnect;
*
Parameter-based, primitive device models
*
Development of new, usable languages (textual and/or graphical) for system specification, analysis, and design refinement allowing partitioning a design down to realizable physical devices and interconnect from implementation independent specifications; and
*
Development of new algorithms and "backplanes" to allow the simultaneous manipulation (modeling, analysis and results feedback: tuning) of the physical (distributed) and functional (lumped element) views of the system.
*
Robust physical design using in light of expected sensitivity to processing tolerances.
The overall need is to develop composable Computer-Aided Design (CAD) systems which allow the integration of all the mixed domains of analysis into a common architecture of tools. That is, an architecture which would allow a (CAD) system to be constructed from tightly integrated, interoperable tools from each domain of interest in a particular design situation. In this way, tools are more easily composed or integrated to allow multidomain analysis of heterogenous element systems. Designers who are not experts in any particular domain of technology can then com-
81
tronic circuits but valves, pumps and storage reservoirs, and c) the design, analysis and inclusion as primitive components of testing chambers with embedded sensors is considered.
pose highly integrated, mixed technology composite systems. The design of micro-fluidic components and systems for controlled on-chip processing of biological and chemical fluids is an example system focus to consider. One can envision needing models which support the analysis of flow for homogeneous chemicals and complex biological fluids. A challenge for this area is the modeling and analysis of mixed electronic control, MEMS sensing and actuation, and micro-fluidic systems where a) the design of interconnect is comprised of electrical, fluid, and gaseous conductors, b) the composition of devices consists not only of switching elec-
The needs for designing composite systems poses many new challenges to physical CAD design systems. One where domains are not simply the electrical and abstract physical but also electrostatics, heat transfer, fluid flow, and mechanical coupling. There are many more views, abstractions, design parameters and couplings to consider to create an optimized, manufacturable system.
82
STRUCTURED DESIGN METHODS FOR MEMS Ramaswamy Mahadevan
MCNC, MEMS Technology Applications Center PO BOX 12889 Research Triangle Park, NC 27709 USA [email protected] http://mems.mcnc.org/ tern generation software must support arcs and freeform structures in an efficient and accurate manner. Separation of form and function is not always present in MEMS fabrication techniques [5]. For surface micromachined devices, the function of a device may be considered to be relatively independent of its position and orientation. However, the relative positions and orientations of devices in a bulk micromachining [6] process are critical to determining the structural shapes and functional behavior of the device. MEMS wafer fabrication and design may be considered to be relatively cleanly separated where surface micromachined processes are concerned. In fact independence of the fabrication process from the mask pattern is generally the ideal sought. Such a separation is also possible for MEMS processes such as LIGA that incorporate electroplating even though the fabricated device structure can depend on the pattern and fill factor of the mask. However, in bulk micromachined MEMS devices the fabricated structure depends on the orientation, location, and size of the layout pattern making the separation of design and fabrication difficult. VLSI systems use a small number of elements such as transistors, capacitors and resistors to build all other functional blocks and systems. Unfortunately MEMS does not appear to have a small basis set of elements that can be utilized to synthesize any generic system functionality with a similar degree of flexibility. However, it should be possible to cover a moderately large functional design space using multiple instances and interconnection of elements from a set of basic electromechanical elements. Examples of such approaches are available in mechanical design and are used for synthesis of hydraulic systems, articulated mechanisms, and compliant mechanisms [7]. Currently, MEMS design is akin to analog VLSI, printed circuit board, and multi-chip module
ABSTRACT Is there a sufficient similarity between MEMS and VLSI systems to borrow from VLSI design techniques? Current MEMS CAD tools predominantly concentrate on the analysis domain and generally lack any synthesis or top-down system design and optimization capabilities. Some of the unique characteristics, constraints, and difficulties associated with the design of MEMS systems are discussed and certain key areas that should be addressed are highlighted. 1. MEMS DESIGN CONSIDERATIONS The VLSI revolution was enabled by the separation of the design and fabrication phases in the development of an integrated circuit. This was achieved through the standardization of a simplified interface between designers and fabricators[l] and the fact that a two dimensional shape representation adequately modeled the 2.5 dimensional IC fabrication technology. The choice of geometrical shapes that represent the final view of the IC chip made the fabrication line dependent features and variations invisible to the IC designers and resulted in portable designs [2]. Unlike VLSI, in MEMS the 2-D shape representation alone is not sufficient to model the electromechanical behavior of the system. It is necessary to incorporate process cross sectional information as well to generate the 3-D structures that will result when using a given mask layout and process combination. This requires the use of suitable device and technology models and representations. A few existing MEMS CAD packages use mask and process descriptions to generate the 3-D structure that would result [3], [4]. However, there is a need to standardize the design and process description and database formats. Selected formats/representations and mask pat-
83
(b) An integral layout and solid modeling/viewing tool to help designers visualize 3-D structures that would result from the combination of layout and process description. (Visualization of structures generated from a given layout and process appears to be the biggest obstacle for new MEMS designers.)
design. That is, functional blocks like actuators, sensors, mechanical suspensions, springs, bearings, etc. are used in lieu of operational amplifiers, capacitors, resistors, and switches and interaction between blocks must be taken into account. In addition packaging is integral to the design of a MEMS system.
(c) An open CAD framework and data translators for sharing design information between existing and new MEMS specific CAD tools. (d) MEMS specific solid model and mesh generation, analysis tools that are optimized for structures with thin layers. Tools to extract macro-models irom device level simulations.
2. CAD FOR MEMS Despite these differences, MEMS can borrow from many of the VLSI design methods and CAD tools. Top-down and bottom-up design, synthesis, device and/or block level detailed simulation, functional or behavioral models and system level simulations are all equally applicable to MEMS. Even a version of extraction and layout-schematic comparison is possible for MEMS. The main obstacle hindering the implementation of such an approach is the multiplicity of physical phenomena that may be utilized in a MEMS system requiring (possibly coupled) mechanical, electromagnetic, fluid, and thermal analysis. For detailed simulations (equivalent to circuit or device level simulations in VLSI) this can be done using existing finite element or boundary element solvers. This requires an open CAD framework with a database format that includes mask layout and process technology information (process cross section and related mechanical properties) that can be easily exported/imported to/from the appropriate solver. For system level design, functional representations and macro-models would be necessary in association with a bond graph, signal flow graph or differential equation based simulator to model all the phenomena. Existing simulators such as SPICE may be used for functional or behavioral simulations of MEMS at the system level. There is also a need for simulators that are faster than FEA (and perhaps less accurate) analogous to switch level and event driven simulators in VLSI design and techniques for simulating the effects of, and sensitivity to process variations in order to assess the manufacturability of a design. The following would help facilitate structured design and virtual prototyping for MEMS.
(e) High level representations and simulators for computationally efficient modeling and optimization of MEMS at the systems level. (It should handle multiple, coupled energy domains and allow the use of sensing, actuation, and electronic subsystems.) (f) Tools to model system performance dependence on process variability. (g) Tools for the synthesis of mechanisms, structural elements, or a class of MEMS systems using libraries of elements with macro-models. REFERENCES [1] Mead, C. and Conway, L. Introduction to VLSI
Systems, Addison-Wesley Publishing, 1980. [2] Sequin, C. H. and McMains, S. "What Can We Learn from the VLSI Revolution". Report of NSF Workshop on Structured Design Methods for MEMS, Nov. 1995.
[3] Gilbert, J. R. etal., "Implementation of a MEMCAD System for Electrostatic and Mechanical Analysis of Complex Structures from Mask Descriptions". Proceedings, IEEE Micro Electro Mechanical Systems Workshop, Fort Lau-
derdale, pp. 207-212, Feb. 1993. [4] Hubbard, T. J., and Antonnson, E. K., "Emergent Faces in Silicon Micromachining" Journal of MEMS, vol 3-1, pp. 19-28, Mar. 1993.
(a) A layout and process representation that allows efficient representation of arcs and freeform shapes along with process cross-sectional information, material properties, and perhaps even mesh information.
84
[5] Bryzek, J., Petersen, K. and McCulley, W., "Micromachines on the March" IEEE Spectrum, vol 31, No. 5, pp. 20-31, May 1994. [6] Petersen, K. E., "Silicon as a Mechanical Material". Proceedingsof the IEEE, vol 70. No. 5, pp. 420-457, May 1982. [7] Ananthasuresh, G. K., Kota S. and Gianchandani Y. "A Methodical Approach to the Design of Compliant Mechanisms". Technical Digest, IEEE Solid-State Sensor and Actuator Workshop, Hilton Head, pp. 189-192, June 1994.
85
AFFORDABLE MEMS CAD TOOLS John E. Tanner, Peter T. Parrish,Mary Ann C. Maher, Rodney Morison Tanner Research, Inc., 180 N. Vinedo Avenue, Pasadena, CA 91104 USA John.Tanner(tanner.com, Peter.Parrish(tanner. corm, MaryAnn.Mahergtanner.com, Rod.Morison~tanner.com MCNC, the ADXL50 process from Analog Devices, and CMOS from MOSIS with post processing (e.g. NIST). Foundries eliminate the requirement for designers to own expensive equipment. Foundry interfaces decouple the designer from fabrication details. The reduction of these barriers increases dramatically the number of potential MEMS designers. The high price of traditional CAD tools also represents a barrier to the growth of the MEMS design community, but fortunately the potential for volume sales encourages low-cost CAD vendors like Tanner Research to enter the market.
ABSTRACT The large number of integrated circuit designers supports high-performance yet affordable design tools. The advent of MEMS foundries has enabled an increase in the number of MEMS designers. Tanner Research proposes to develop a comprehensive MEMS tool suite by extending our existing integrated circuit tools and creating new tools.
1. THE TANNER RESEARCH BUSINESS MODEL
1.3.
Tanner Research is dedicated to providing low-cost high-productivity software tools and libraries to the engineering community. In order to keep prices low, we must concentrate on high volume markets in order to generate enough revenue to support continued rapid product development. To keep volumes up we provide software for all the most popular platforms including PC, Macintosh, and Unix workstations. Based on this low-cost highvolume strategy, Tanner Research has recently taken the lead position with an installed base of 6,500 licenses.
1.1.
Price and Quality
Low-cost tools appeal to all segments of the market, including those customers who could afford to pay much more for them. Everyone benefits from ease of use, intuitiveness of operation, freedom from bugs, and integration with other tools-features that are required in the lowcost/high-volume market. At Tanner Research these values are driven by the economic necessity of controlling our customer support costs and maintaining a solid reputation across a large, demanding user base. Even high-end customers that require certain specialized niche tools, often mix them with moderately priced tools to reap the benefits of reduced overall tool costs, reduced training and maintenance costs, and higher productivity.
Traditional MEMS Design
Until recently, the market for MEMS CAD tools was too limited to fit our company business model. Most MEMS design was done by large companies that owned their own fabrication line and could afford to develop a custom fabrication process for each MEMS device produced. The need for both process knowledge and capital equipment resulted in such a barrier to entry that there were very few MEMS designers. With a small customer base over which to amortize tool development costs, tool vendors by necessity had to charge high prices.
2. PROPOSED MEMS CAD TOOL SUITE Tanner Research proposes to develop a suite of low-cost MEMS design tools and libraries by extending our existing integrated circuit and multichip module design tools. Figure 1 shows a block diagram of the proposed tool suite and the major data paths between tools.
1.2. New MEMS Design The emergence of standard MEMS processes, offered to the community by way of foundry services, has changed the outlook of MEMS design dramatically. A growing number of MEMS designers have successfully used the MUMPS process from
2.1.
Existing IC Tools
Our existing integrated circuit tools include many modules that are of direct value to MEMS designers, such as schematic and layout editing. Our automatic place-and-route tool includes standard cell placeand-route, pad frame generation, and pad routing.
86
Our verification suite includes design rule checking, extraction of circuit topology from layout geometry, and comparison of circuit topologies from schematic and layout. We presently support a C-language compiled interface to our layout tool, with an interpreted version planned for the next major release. This interface allows users to add custom layout generators to the tool. Cross sections provide a valuable view of MEMS designs. Our layout editor can automatically construct and display cross sections. The engineer indicates a cut line on their layout and a window pops up displaying the cross section view. The software uses a simplified process definition file to build up the view, step by step. We presently have MEMS process definition files for the MUMPS, ADXL50, and MOSIS/NIST processes. While not a true three-dimensional tool, our cross-section viewer represents a significant and useful step along the path to true 2D to 3D conversion and visualization. Our schematic editor allows the engineer to easily create custom symbols and connect them together. The schematic editor can produce netlists for input to the standard cell place-and-route, the layout verification tools and for simulation in our circuit simulator. Our circuit simulator allows the user to add custom models that could represent MEMS components via a C-language interface. We are presently working with UCLA to develop design examples where precharacterized MEMS cells are connected on a schematic and the netlist that is passed to the circuit simulator contains both electrical and mechanical nodes and behavior models for a combined electrical-mechanical simulation.
2.2.
capability and enhance the process modeling and libraries to include anisotropic and isotropic etch models. Our visualization tools must be enhanced to allow for arbitrary cross-section views and full 3D perspective views, both of the raw geometry and of the results of three-dimensional simulation. The core of the complete suite will include tightly coupled mechanical, electrical, and thermal simulation based on a single data structure shared by multiple finite-element and boundary-element solvers. This multi-domain co-simulator represents the largest development cost in our proposed suite. Our circuit simulator, with a custom model capability, will be closely coupled to the finiteelement/boundary-element co-simulator to allow portions of a design to be simulated at a high-level of detail and other portions to be simulated with less computationally-intensive models. Fluid flow analysis and collision detection are each critical simulation components for a segment of MEMS designs and could be included in our suite. Our simulation control capability needs to be developed into a central design manager tool to coordinate the automatic generation of layout, schematics, and netlists for predefined MEMS devices and coordinate the simulation and display tools. We will include a flexible capability for optimization of MEMS system performance.
2.4.
We expect the source representation within our tools to be in the form of 2D geometry-a combination of hand drawn polygons, cells from custom libraries or parameterized libraries, and interconnect from automatic placement and routing with connectivity information coming from schematics. In this tool suite, 3D representations are created by the tools automatically from the 2D geometry by the process simulator. The resulting 3D solid model is passed to the multi-domain cosimulator for analysis. The complete suite will allow the designer to easily traverse from schematic and polygon input to both high-level and detailed simulations and to produce foundry-ready output.
Existing MCM Tools
Our existing multi-chip module design tools include a finite-element thermal analysis tool and a boundary-element 2D electromagnetic field solver. We have designed these two independent point tools to both operate from a common physical representation and meshing data structure to allow for future co-simulation.
2.3.
Tool Flow
3. CONCLUSION The existing Tanner Tools are being productively used by a growing number of MEMS designers world wide. We hope that our implementation of new affordable MEMS-specific capabilities will continue to expand access to MEMS design.
Extensions and New Tools
To develop a complete MEMS tool suite, we need to extend some of our existing tools and develop new tools. In particular, we hope to work with MCNC to port their CaMEL parameterized MEMS library to work with our language interface. We need to extend our cross-section viewer to full 3D
87
Mechanical Simulation (FEA)
Fluid Simulation
2D and 3D Visualization Thermal Simulation (FEA)
ElectroMagnetic Simulation (BEM)
Process Simulation (2D to 3D Conversion)
Software Interface
Layout Editing, Automatic Place-and-Route, and Verification
Figure 1: Proposed MEMS tool suite. Thick borders indicate existing Tanner Tools. Medium borders indicate tools with partial functionality or tools under development. Thin borders indicate proposed Tanner Tools.
88
WE'RE SOLVING THE WRONG PROBLEMS Lou Scheffer'
'Cadence Design Systems, San Jose, California, USA email: louQcadence.com
ABSTRACT
* The compiler generated code that didn't quite work on the machine you were using.
We are working on the wrong problems. We are wasting a lot of time improving things that are good enough while ignoring the things that will determine how we design in a few years. These errors of commission are improving tools that are already good enough, improving tools where improvements are likely to be marginal, and building tools that won't be used in tomorrow's design flows. The errors of omission include not building tools for real problems, not building tools that will work with almost inevitable process changes, and not considering methodology, tools, and process as a whole.
1.
* The math functions you wanted to use were not available in your language. All of these were very real problems when compilers and computers were new, and a lot of very smart people put a lot of hard work into solving them. Now, however, these problems have very little, if any, impact on the code you write. A brilliant person could spend several years improving (for -example) register allocation. Although the result would be a welcome improvement, it probably would not change your day to day work in the least. The solutions that have been found to these problems are, in a very practical sense, 'good enough'. In fact, you probably compile '-g', giving up a factor of 2 in both speed and code density, in order to make your programs easier to debug. Nowadays. the problems that worry programmers are of an entirely different nature - design of algorithms, source code control, portability, memory allocation, regression testing, and other high level concerns. If you spend as much as one week a year on compiler problems you are probably wasting your time. The CAD field (that's us) is at the same point that programmers were years ago. In the past, and maybe the present, the tools limited how much functionality could go on a chip. In the future, between bigger chips, shorter design cycles, and better tools, the limit will shift to brainpower instead of tools. The CAD field as a whole has not acknowledged this change, however - people are still more concerned with finding a slightly better algorithm for some old problem when they should be worrying about how in the world they are going to use 50 million transistors in any reasonable amount of time.
INTRODUCTION
A traditional error of armed forces is being perfectly prepared to fight the last war. We are doing exactly the same thing in CAD - we are solving the problems that were important yesterday, and ignoring those that will be important in the future. We are making marginal improvements to algorithms that are already good enough, or building tools that were useful once, but won't be useful when the main task is getting a 50 million gate chip out the door. On the other hand, there are problems either here today, or coming down the road shortly, that the field as a whole is not addressing. 1.1. An analogy with software Chips are getting bigger at an exponential rate (Moore's law) while being designed by people who are getting better at a much slower rate, if at all. This very simple fact will drastically change the way we design chips, but we are not preparing for it. The software industry has already gone through a similar transition. When computers were new, often the kind of program you could write was limited by the computer or compiler, not by the creator's brainpower. So people in the field spent a lot of time and effort improving compilers, building machines with bigger address spaces, creating subroutine libraries, and so on. They have done an excellent job of this. Just ask yourself when was the last time you could not write the program you wanted because:
2.
PROBLEMS WE SHOULD NOT BE
WORKING ON There are at least three categories of problems that people are working on that are unlikely to pay high dividends. These are tools that will not be needed in tomorrow's flows, tools where the existing solutions are 'good enough', and tools where additional improvements are likely to be small.
* The compiler wasn't fast enough.
2.1. An example of solving last year's problem Sematech recently asked for bids on portions of a new CAD system. Among the things they wanted was a program that
* The compiler could not compile a program as big as the one you wanted to write.
89
could analyze all the interconnect on a 28 million gate chip and report any crosstalk problems, using at most 30 hours of CPU time. An analogy to computer science shows how useless this is. What would you say if a salesman came to your office and said, "Here's our great new program. In only 30 hours it examines all your machine code and reports cases where the compiler generated code that won't work due to pipeline interlocks." Your reaction is entirely predictable - you'd say "If I needed this tool at all, what I'd really need is a new compiler." Another way of looking at this is to ask how you would use it in your design flow. First, you design your 28 million gate chip. Next you synthesize, place, and route it. Now you run this checker. How many nets will it report as having problems? If your methodology knows nothing of crosstalk, probably hundreds of thousands (all the long nets). If your methodology does know about crosstalk, why not tighten up the bounds a little and eliminate the need for the checking step entirely? That's exactly what compiler writers have done. No one will put up with a compiler that generates very fast, but sometimes wrong, code. The key idea is that you only need to back off a little on the performance to get a design that works every time, and most of the analysis can be done up front. Another example where this is done is design rules. Everyone knows that the yield vs. spacing function is not a step function, that the focus is better in the middle of the chip than in the corners, and so on. In the interests of expediency, however, we make and enforce a simple rule - any spacing less than X is an error; any greater spacing is OK. Of course this gives up some performance, but the simple rule is easy to enforce and good enough. In computer science, everyone realizes that it is the combination of compiler and machine architecture that determines performance, not either one alone. The chip analogy is a design methodology in combination with tools and a particular process. If done right, the combination of the methodology, tools, and process will generate a working design. The same input, fed to another such combination, will produce another working design that varies only in performance. Since the tools only make sense in combination, for each problem (such as crosstalk) we should ask ourselves whether the best solution is changing the methodology, the tools, or the process. This is seldom discussed, much less analyzed.
workstation size and speed track the size of the design task is of course not coincidence - workstations are built from a small number of current generation chips. Thus when bigger and faster chips are designed, they are immediately used to build bigger and faster workstations, and the ratio of chip size to computer speed stays roughly constant. Therefore, if a design problem has a O(N) solution, we can consider it solved. In practice, we can consider an 0(N log N) problem solved as well, since log(N) goes up by only 50 percent as N goes from 1 million to 1 billion. An algorithm can achieve O(N) performance in several ways - the basic algorithm can be O(N), or the design problem can be split into many independent problems. If, as the chip gets larger, you just get more of these problems, and not bigger instances of them, then O(N) overall performance can be achieved even if the algorithm itself has worse characteristics. An example of an algorithm that is O(N) in time and space is timing analysis by means of a longest path algorithm. Examples of algorithms that are intrinsically O(N - log N) are minimum spanning tree generation and DRC checking by means of scan line operations. These operations will continue to be practical for any size of chip. Furthermore, many computations that are difficult have approximate solutions that are O(N log N) or better. For example, travelling salesman and steiner tree (two NP complete problems) can be approximated by O(N . log N) algorithms for a most a small constant penalty. Examples of algorithms that are decomposable are logic synthesis and detailed routing. In each case the basic algorithm is performed on small chunks of the design, and the results stitched together to form the complete solution. A further advantage of this type of algorithm is that it can easily take advantage of parallel processing. 2.3.
Problems where big improvements are unlikely There are a number of CAD problems where the solution space is smooth. In these cases you would expect a heuristic to get close to the global minimum, although it may not achieve it exactly. Buffer sizing is an example of such a problem. If the buffer sizes are not quantized, a small change in any buffer size can be made independently of any other buffer, and the system timing will only vary a small amount as a result. Compaction is another example of such a smooth problem. For these problems, we would expect heuristics to do well, and they do. So fancier optimization methods will not buy us much.
2.2. O(N log N) problems In this field we have a very interesting phenomenon - an O(N) algorithm takes constant time as N increases! This seeming contradiction is easily explained - computer scientists measure the execution time as the number of machine instructions, and in fact an O(N) CAD algorithm does take more instructions as N increases. In the CAD field, however, the speed of the available computers goes up as the problems become bigger. If today we can design a 1 million gate chip using a 100 MIP machine with 100 MBytes of main memory, then when the time comes to build a 4 million gate chip, we can expect 400 MIP machines with 400 MB of memory. So the same O(N) algorithm, running on each case, would take the same elapsed time. The fact that
3.
PROBLEMS WE ARE NOT WORKING ON, BUT SHOULD BE
The flip side of the coin is important problems that are not getting addressed at all, or not with the vigor they deserve. 3.1. Looking under the lamp post There is an old joke about a drunk looking under a lamppost for his car keys. Someone asks him if he thinks he lost them there, and he replies, "No, but the light is better here." The same thinking applies to CAD problems, but with less excuse. For example, people are spending huge amounts
90
of time and energy trying to get accurate cross coupling capacitances. If you ask users what they do with these capacitances, they will tell you they calculate delays. When you point out that effective coupling capacitance for delay calculation can vary by ±100% depending on the behavior of the neighboring signal, they shrug their shoulders and say that it's too complicated, or someone else's problem. So CAD tool developers continue to work on this subset of the real problem because it is well defined and has a clean analytical solution. The real users, who have to produce working chips, then must take their carefully derived estimates, and multiply them by some random number ranging from 1 to 2, derived from a combination of hope and guesses. If they make it 2, their circuit will be foolproof, but they will leave half the potential performance on the table. If they make it 1, they will be right on the average, but a worst case may cause their chip to malfunction.
3.4.
4.
Multiple active layers
Someday soon, a process wizard will figure out how to deposit a decent layer of crystalline silicon on top of a chip that already has a few interconnect layers on it. This will allow multiple active layers, drastically increasing the achievable density of chips. However, at the very least, placement, routing, and compaction will need to be re-written to accomodate this. 3.2.2.
CONCLUSIONS
As a whole, the CAD research community is solving yesterday's problems rather than tomorrow's. We need to allocate a greater proportion of our resources towards solving the design problems of chips that are much bigger than those of today. The incentive to do so is clear - the people who solve these problems will be the heros of the academic world and the successes of the commercial arena.
3.2. Preparing for process improvements There are some process improvements that are not too far fetched, for which the CAD community is unprepared. 3.2.1.
Process portability
To use 50 or 100 million transistors in any reasonable amount of time, we'll need to build chips that include large chunks of existing designs (cores). We could map at the process level, the symbolic layout level, the relative placement level, the structural gate level, the RTL level, or any combination of these. What are the tradeoffs between these methods? Which ones work when? These are the kind of questions which will be crucial in the future, but are not being seriously addressed now.
Superconducting interconnect
At some point, at least for stationary applications, it will make sense to build systems working at liquid nitrogen temperatures. This is mostly waiting for improvements in refrigerator technology. Working at 77 degrees K has a number of advantages - CMOS is very fast, subthreshold effects are reduced, lower supply voltages are practical, and you can use superconducting interconnect. Unfortunately, we have no idea of how to analyze superconducting connections. If the R goes to 0, what is left is the self and cross coupling inductances. These are much harder to compute than resistances or capacitances, and we don't even have decent approximations for them. 3.3. Methodology Instead of building (for example) a new signal integrity checker, we should be looking at methodologies designed to prevent such problems in the first place. For example, 3 ways to eliminate crosstalk errors might be * Every Nth signal on every Mth layer must be a power or a ground. * Every gate has a limit to the length of connection it can drive. If this is exceeded, you must insert a repeater. * Every line over a certain length is routed as a differential pair. It would be an excellent research project to analyze under which conditions each of these solutions will work, what the overhead in size and performance of each solution is, how easy the condition is to meet and verify, and so on.
91
VLSI CIRCUIT PARTITIONING BY CLUSTER-REMOVAL USING ITERATIVE IMPROVEMENT TECHNIQUES Wenyong Deng
Shantanu Duttl
2
Department of Electrical Engineering, University of Minnesota, Minneapolis, MN 55455, USA [email protected] 2 LSI Logic Corporation, Milpitas, CA 95035, USA [email protected]
ABSTRACT
simple implementations and flexibility. However, this class of iterative improvement algorithms have a common weakness, viz., they only find solutions corresponding to local minima. Because of their iterative improvement nature, they can only evolve from an initial partition through very shortsighted moves. Thus the results strongly depend on the initial partition. In order to get a local minimum that is close to the optimum partition, multiple runs on randomly generated initial partitions are needed. As the circuit size becomes large, the probability of finding a good local minimum in one run will drop significantly. This makes FM an unattractive choice for partitioning large circuits. As will become clear later, FM gives good results on small to medium size circuits, but performs very poorly on large circuits. Some clustering [8] or compaction [15] techniques have been proposed to remedy the above weakness. Very good results have been obtained at the cost of considerable CPU time increases and implementation complexities. In this paper, we will propose a technique that significantly improves the ability of iterative improvement methods like FM and LA for finding good local minima. The new technique pays more attention to the neighbors of moved cells and encourages the successive moves of closely connected cells. This implicitly promotes the move of an entire densely-connected group (a cluster) into one subset of the partition. The large reduction in both the minimum and average cutsize of multiple runs indicates that the new technique is a more robust and stable approach. The increase in implementation complexity and run time is minimal. We also propose a sophisticated extension of this basic technique, which explicitly identifies clusters during the move sequence, and dynamically adapts the move sequence to facilitate the move of clusters into one subset of the partition. Very good results have been obtained at reasonable CPU times. In the next section, we briefly describe the FM and LA algorithms and point out their shortcomings. Then in Section 3. we present our rationale for the new technique mentioned above, and also propose a cluster-detecting algorithm based on iterative improvement methods. Extensive experimental results are presented in Section 4. along with discussions. Conclusions are in Section 5..
Move-based iterative improvement partitioning methods such as the Fiduccia-Mattheyses (FM) algorithm [3] and Krishnamurthy's Look-Ahead (LA) algorithm [4] are widely used in VLSI CAD applications largely due to their time efficiency and ease of implementation. This class of algorithms is of the "local improvement" type. They generate relatively high quality results for small and medium size circuits. However, as VLSI circuits become larger, these algorithms are not so effective on them as direct partitioning tools. We propose new iterative-improvement methods that select cells to move with a view to moving clusters that straddle the two subsets of a partition into one of the subsets. The new algorithms significantly improve partition quality while preserving the advantage of time efficiency. Experimental results on 25 medium to large size ACM/SIGDA benchmark circuits show up to 70% improvement over FM in cutsize, with an average of per-circuit percent improvements of about 25%, and a total cut improvement of about 35%. They also outperform the recent placement-based partitioning tool Paraboli [11] and the spectral partitioner MELO [12] by about 17% and 23%, respectively, with less CPU time. This demonstrates the potential of iterative improvement algorithms in dealing with the increasing complexity of modern VLSI circuitry. 1.
INTRODUCTION
The essence of VLSI circuit partitioning is to divide a circuit into a number of subcircuits with minimum interconnections between them. This can be accomplished by recursively partitioning a circuit into two parts until we reach the desired level of complexity. Thus two-way partitioning is a basic problem in circuit partitioning and placement. Kernighan and Lin [1] proposed the well-known KL heuristic for graph partitioning. The KL algorithm starts with a random initial two-way partition and proceeds by swapping pair of cells iteratively. Schweikert and Kernighan [2] extended KL to hypergraphs so that it can partition actual circuits. Fiduccia and Mattheyses [3] reduced the complexity of the algorithm to linear-time with respect to the number of pins in the circuit. This is done by moving one cell at a time and using an efficient bucket data structure. Krishnamurthy [4] enhanced FM by adding higher level lookahead gains and improved the results for small circuits. Recently, a number of clustering algorithms [9, 10, 11, 12, 15] have been proposed and excellent results have been obtained. FM and LA are the most commonly used two-way partitioning algorithms largely due to their excellent run times,
2.
PREVIOUS ITERATIVE IMPROVEMENT ALGORITHMS
A circuit netlist is usually modeled by a hypergraph G = (V, E), where V is the set of cells (also called nodes) in the circuit, and E is the set of nets (also called hyperedges). We will represent a net ni as a set of the cells that it connects. A two-way partition of G is two disjoint subsets VI and V 2 such that each cell v E V belongs to either V1 or V 2 . A net
92
is said to be cut if it has at least one cell in each subset and uncut otherwise. We call this the cutstate of the net. All the nets that are cut form a set called the cutset. The objective of a two-way partitioning is to find a partition that minimizes the size of the cutset (called the cutsize). Usually there is a predetermined balance criterion on the size of the subsets V 1 , V2, for example, 0.45 < VilfVI < 0.55, where i = 1, 2. The FM algorithm [3] starts with a random initial partition. Each cell u is assigned a gain g(u) which is the immediate reduction in cutsize if the cell is moved to the other subset of the partition: g(u) =
E n
EE(u)
c(ni)-
E
c(nj)
addition to FM gain, higher order gains are used to break the ties. 3.
CLUSTERING-BASED ITERATIVE IMPROVEMENT METHODS
3.1. Case for a Cluster-Oriented Approach A real VLSI circuit netlist can be visualized as an aggregation of a number of highly connected subcircuits or clusters. This fact has motivated the proposition of many clusteringbased algorithms. It is conceivable that there are many levels of clusters with different degrees in the density of their connectivities. A small group of densely interconnected cells may be part of a larger but less densely connected cluster. The goal of two-way partitioning is to determine a cut that goes through the most weakly connected groups. Iterative improvement algorithms like FM and LA start with a randomly assigned partition that results in a binomial distribution of cells in V1 and V2. In such a distribution, the probability of finding r (r < m) cells in V, and m - r cells in V2 in some group of m cells is:
(1)
njGI(u)
where E(u) is the set of nets that will be immediately moved out of the cutset on moving cell u, and 1(u) is the set of nets that will be newly introduced into the cutset. Put in another way, a net in E(u) has only u in u's subset, and a net in I(u) has all its cells in u's subset. c(ni) is the weight (cost) of the net ni which is assumed to be unity in this paper unless otherwise specified. The goal of FM is to move a cell at a time from one subset to the other subset in an attempt to minimize the cutsize of the final partition. The cell being selected for the current move is called the base cell. At the start of the process, the cell with maximum gain value in both subsets is checked first to see if its move will violate the balance criterion. If not, it is chosen as the base cell. Otherwise, the cell with maximum gain in the other subset is chosen as the base cell. The base cell, say u1, is then moved to the other subset and "locked"-the locking of a moved cell is necessary to prevent thrashing (a cell being moved back and forth) and being trapped in a bad local minimum. The reduction in cutsize (in this case, the gain g(ui)) is inserted in an ordered set S. The gains of all the affected neighbors are updated-a cell v is said to be a neighbor of another cell u, if v and u are connected by a common net. The next base cell is chosen in the same way from the remaining "free" (unlocked) cells and the move process proceeds until all the cells are moved and locked. Then all the partial sum Sj = Zt g(ut), 1 < j < n, are computed, and p is chosen so that the partial sum Sp is the maximum. This corresponds to the point of minimum cutsize in the entire moving sequence. All the cells moved after u, are reversed to their previous subset so that the actually moved cells are {u1, . . .,u,}. This whole process is called a pass. A number of passes are made until the maximum partial sum S, is no longer positive. This is a local minimum with respect to the initial partition [VI, V2]. The FM algorithm has been criticized for its well-known shortsightedness [4, 13]-it moves a cell based on the immediate decrease in cutsize. Thus it tends to be trapped in local minima that strongly depend on the initial random partition. We will later point out some other consequences of this shortsightedness that are related to the removal of natural clusters, which occur in real circuits, from the cutset. The FM gain calculation only considers critical nets whose cutstate will change immediately after the move of the cell. It is conceivable there will be many cells having the same gain value since the gain is bounded above by pmaz and below by -pa. where Pma. is the maximum degree of a cell. Krishnamurthy has proposed a lookahead gain calculation scheme which includes less critical nets [4]. In
P(m, r)
=
(rm)
pq
m
(2)
where p (q) is the probability of a cell being assigned to V1 (V2 ). For a random partition, p = q = 0.5. The probability distribution maximizes at r =-m/2 with standard deviation a = V/i/2. For example, a group of 100 cells will have the expected distribution of 50 cells in each subset with a standard deviation of 5 cells. Therefore, for a cluster with a fair number of cells, there is a very high probability that it will initially be cut. Hence in an initial random partition, most clusters will straddle the cutline, which is an imaginary line that divides the cells into the two subsets of the partition. This situation is illustrated in Figure 1(a). For an iterative improvement algorithm to succeed, it must be able to pull clusters straddling the cutline into one subset. It is easy to visualize that there will be many cells in different clusters with similar situations and therefore the same gain values. Since there is no distinction between cells with the same gain values but belonging to different clusters, the FM algorithm may well start to work on many clusters simultaneously, trying to pull them out of unfavorable situations. However, cell movement is a two-way process, and while some cells in a cluster are moved from V2 to V1 , other cells in the same cluster might be moved from V1 to V2 . Thus the cluster can be locked in the cutset at an early stage -a cluster is said to be locked in the cutset if it has locked cells in both subsets of the partition. This is the situation of clusters C, and C2 in Figure 1(b). Unfortunately, the moves made at an early stage (before the maximum partial sum point) are the actual moves. Hence these clusters will not be pulled out from the cutset in the current pass, and in later passes the same scenario may reappear. Undoubtedly. FM does a good job of pulling small and highly connected clusters to one side. This is because many nets of a small cluster will be incident on each cell of the cluster, and thus their gains capture significant information about the cluster. Once a cell is moved from V, to V2 , its neighbors in VI might have their gains raised and hence have a better chance of being moved to V2 , while its neighbors in V2 will get a negative gain contribution from nets connected to the moved cell and hence tend to stay in V2 . Therefore a small cluster has a good likelihood of being moved entirely to V2. However, when the size of a cluster is large, its
93
C''F,..4 C,
C ,2
6-Lv~
CD
-
I
C'~ V
Vln C
V,
VA
Cotll/,
col,,.
iVg
A'~ (b)
v,
i
v,
Culling A'
(0)
Figure 1. (a) In the initial partition, clusters straddle the cutline as a result of random cell assignment. (b) FM locks clusters on the cutline by moving cells within one cluster in both directions. (c) Better approaches pull clusters out from the cutline by moving cells within one cluster in a single direction. structural properties cannot be simply represented in the immediate connectivities of cells such as in FM and LA gain calculations; for example, the cluster may consist of subclusters. Although it might be easy for FM to move out subclusters, it is also very likely that it will lock the bigger clusters in the cutset. To demonstrate the validity of the above observations, let us consider the simple graph shown in Figure 2(a) that shows a two-level clustered structure. Cells u11 , u2 1, u, and u41' form a strongly connected subcluster Ci; other subclusters C1, C2 and C2 are similarly formed. Subclusters C1 and CI construct a higher level but less densely interconnected cluster C1. Similar is the case for C2, which is composed of sublusters C2 and C2. After a random partition, all the clusters as well as the subclusters straddle the cutline. Initial FM gain calculation gives the gain values indicated beside each cell in the figure. Cells ull and u2 belong to different clusters, but have similar situations, and hence the same gain of 4. We assume a 50%-50% balance criterion in which cells move alternately between the two subsets VI and V2 . The first four moves are shown by the numbered dashed arrows in Figure 2(a). FM quickly reaches the local minimum of cutsize 4 (further moves will be reversed finally since the current point is the maximum partial sum point). While FM succeeded in moving out subclusters, it locked the higher level clusters Cl and C2 on the cutline. Therefore it missed the optimal cut of one that can be easily identified in the figure. It is obvious now that a mechanism is needed to aid iterative improvement algorithms in pulling out clusters from the cutset. We propose a cluster-oriented framework for gain calculation and base-cell selection that focuses on nets connected to moved cells. It can be overlaid on any iterative-improvement algorithm with any cell-gain calculation scheme. It implicitly promotes the move of an entire cluster by dynamically assigning higher weights to nets connected to recently moved cells. This greatly enhances the probability of finding a close-to-optimum cut in a circuit. We also propose an extended version of this algorithm that tries to identify clusters explicitly and then move them out from the cutset.
CA, A
(a)
Cutline
(b)
Figure 2. (a) FM only pulls out subclusters and finds a local minimum in cutsize. (b) The new approach pulls out clusters and finds the optimum cut. are updated. At any stage in the move process, the total gain of a cell can be broken down as the sum of the initial gain component and the updated gain component. The total gain indicates the overall situation of a cell, while the updated gain component reflects the change in the cell's status due to the movements of its neighbors. An intuitive solution to the problem of an iterativeimprovement scheme "jumping around" and working on different clusters simultaneously, as illustrated in Figs. 1(b) and 2(a), thus locking them in the cutset, is to make cell movement decisions based primarily on their updated gain components. This minimizes distractions during the cluster-pulling effort caused by cells not in the cluster currently being moved, but with high total gains. In other words, it allows the algorithm to concentrate on a single cluster at a time for moves in one direction; note that the updated gain component of a cell reflects its goodness for moving with regard to the cluster currently being pulled from the cutset. The initial gain of a cell, however, provides useful information for choosing the starting seed for removal of a cutset-straddling cluster-the cell with the highest gain is most likely in such a cluster, and thus a very good starting point. Once the move process has begun, nets connected to moved cells should be given more weights so that the updated gain components of cells become more important than their initial gains. The utility of giving more weight to nets connected to moved cells (and hence to the updated gain components of cells) in facilitating the movement of clusters from the cutset is established in the following set
of results [14]. We consider an iterative improvement partitioning process like FM and assume that the probability (f.it) that an edge connects a pair of cells inside the cluster is uniformly distributed, the probability (fet) that an edge connects a cell in C to a cell outside C is also uniformly distributed, and fint > fext. This is similar to the uniformly distributed random graph model used by Wei and Cheng in [6]. Theorem 1 If a cluster C is divided by the cutline into subsets C1 e V1 and C2 E V 2, and C, is moved to V2 by a sequence of moves of its cells, then the cutsize of the partition will decrease, if initially IC1l < IC21, or first increase and then decrease, if initially OCil > IC2 I.
3.2.
Considering Clusters in Iterative Improvement Methods We first re-examine the cell gain calculation of FM. Initially, cell gains are calculated based on the immediate benefits of moving cells. After a cell is moved, the gains of its neighbors
Figure 4 illustrates Theorem 1. Assume originally all net weights are one and when updating the gain of a cell, each net connected to moved cells
94
Algorithm CLIP 1. Calculate the initial gain of all cells according to the iterative improvement algorithm of choice (e.g., FM, LA, PROP[13]). 2. Insert the cells into some sorted data structures (free-cell store) T1 and T2 for subsets V1 and V2, respectively. Select the maximum gain cell u E V as the first base cell to move. 3. Clear the gain of all cells to zero while keep their original ordering in the data structure. 4. Move u and update the gain of its neighbors and their ranks in the data structure as done in the chosen iterative improvement algorithm. The gain of a cell now only contains the updated part. 5. Choose the base cell based on the cell's updated gain and the balance criterion. Move the cell, update its neighbors. 6. Repeat Step 5 until all cells are moved. 7. Find the point in the move sequence which corresponds to the minimum cutsize, and reverse all the moves after this point. Figure 3.
V2
V1
Cluster
LI
Cutsize
Lo
L2 End of Cluster
Improvement
starting points
One pass of CLIP (CLuster-oriented Iterative-
improvement Partitioner)
0 2
is assigned a weight of at least pmax, where recall that pmax is the maximum cell degree in the circuit.
Figure 4.
C'
-2
IC
IC1I
The cutsize change with the move of a cluster as
indicated in Theorem 1. When the cutsize does not improve, it
Theorem 2 Once a cluster starts to move from V1 to V 2 , there is a high probability that the whole cluster will be removed from the cutset.
indicates the end of a cluster. clusters from one subset to the other. By rearranging clusters between the two subsets in this way, subsets V1 and V 2 of the final partition will become the two largest but most weakly connected superclusters, which implies that the cutsize will be small. As opposed to FM, which tends to do only local improvement within large clusters, the above new scheme can explore a wider solution space, and hence has less dependence on the initial partition. Compared to other clustering-based approaches, such as bottom-up compaction [15], top-down clustering [8] and vertex ordering [10], CLIP does not explicitly bind cells together as inseparable clusters. Instead, cells can be implicitly regrouped into different clusters in subsequent passes. Both the moving and possible regrouping of clusters are guided directly by the ultimate objective cutsize reduction. A possible advantage of this approach is that CLIP has more freedom in searching for the optimum cut.
The example of Fig. 2 can be used to demonstrate the advantage of the above approach. The cell gains are first computed and the base cell is again u 3 . The first two moves of u31 and u31 bring large negative gains to cells 122th u312 and u3 through the weighted edges. Therefore in the subsequent two moves, they are not selected as would be the case in FM. Instead, u412 becomes the top cell in V1I, and is selected as the next cell to move. The sequence of the first few moves are indicated by numbered arrows in the figure (for details see [14]). After eight moves, CI and C2 are moved out from the cutset, and we obtain the optimal cut of one. Thus this process escapes the local minimum of four in which the original FM algorithm was trapped. 3.3.
A Cluster-Oriented Iterative-Improvement Partitioner From the above discussion, we propose a general gain calculation and base-cell selection framework CLIP (for CLusteroriented Iterative-improvement Partitioner) presented in Figure 3, that can be applied to any FM-type iterative improvement algorithm. For implementation convenience, we set the cell gains to zero after the initial gain calculation. Cell gains are updated as in the original algorithm over which CLIP is overlaid. Zeroing of initial gains followed by gain updating is equivalent to giving nets connected to moved cells a weight of infinity over nets with no moved cells. The initial gain information is only reflected in the initial ordering of cells. After the first pass, most strongly connected clusters will probably have been removed from the cutset. The few clusters left in the cutset can be removed in the subsequent passes. In later passes, another advantage of the above cluster-oriented scheme is that clusters lying entirely in one subset can be easily moved to the other subset. This is because cell gains being cleared to zero in the initial stage causes cells in a cluster to have less inertia in staying inside their original subset. The benefit of cluster movement between subsets is that larger but less densely connected clusters (we call them superclusters) can be removed from the cutset by moving their densely-connected constituent
3.4. A Cluster Detection Method Although the new framework CLIP has significant advantages over the traditional iterative improvement approach, it is possible to do even better. We start by asking the following questions. First, how do we know when a cluster has been pulled out? Furthermore, once we finish pulling out the first cluster, how do we select the next starting point? We address the former question first by determining what happens when a cutline sweeps across a cluster-this is equivalent to a cluster being pulled out from the cutset. From Theorem 1, as we move a cluster from the cutset, the overall cutsize will decrease until the cluster is entirely removed from the cutset. In a practical partitioner, some external cells may be moved across the cutline due to their connections to moved cells in the cluster. However, since they are randomly distributed across many clusters (and thus do not belong to a specific cluster), their contribution to the overall cutsize change will not be significant. As a result, we obtain a cutsize change similar to that illustrated in Figure 4, which is a pictorial depiction of Theorem 1. Referring to this figure, the movement of a cluster starts from either point L1 or L2 . After it is removed from the cutset, there is an overall improvement in cutsize. If in subsequent moves no other cluster starts getting pulled out from the cutset, the cutsize won't improve anymore.
95
Algorithm CDIP
1. Calculate the initial gain of all cells according to the iterative improvement algorithm of choice.
2. Insert the cells into sorted data structures Ti and T2 for subsets VI and V2, respectively. Select the maximum gain
cell u
C V as the first base cell to move. 3. Clear the gain of all cells to zero while keeping their original
ordering in Ti (i = 1,2). 4. Move u and update the gain of its neighbors and their ranks in Ti (i = 1,2) as done in the chosen iterative improvement algorithm. Start to count the move index j and to calculate the partial sum -I1 for this first cluster, where u E Vi. The gain of a cell now only contains the updated part. 5. Repeat Steps 6 to 7 until all cells are moved and locked. 6. Choose the base cell based on the cell gain and balance criterion. Move the cell, and update the neighbors as done before. 7. If the current maximum partial sum Sp' > 0, and the current move index q > p + 3, then (a) Reverse the moves from q to p + 1. (b) Choose the free cell v E Vi with the maximum total gain as the next base cell. (c) For each free cell in V1, clear the cell gain except the gain component from nets connected to the locked cells in the same subset Vi. Reorder cells in Ti according to the modified gain. (d) Move the base cell v, update neighbors and start the count of new move index j and the calculation of new partial sum S k+ from this move. 8. Find the point in the moving sequence which corresponds to the minimum cutsize, and reverse all the moves after this point.
Test
#ofl
# ofl # of I Test
#of
Case
Cells
Nets
Cells
s1423 sioo s1488 balu p1 bml t4 t3 t2 t6 struct t5 l9ks
619 664 686 801 833 882 1515 1607 1663 1752 1952 2595 2844
Pins
538 1528 408 1882 667 2079 735 2697 902 2908 903 2910 1658 5975 1618 5807 1720 6134 1541 6638 1920 5471 2750 10076 3282 10547
Case 2
p s9234 biomed s13207 s15850 industry2 industry3 s35932 s38584 avq.small s38417 avq.large
1
3014 5866 6514 8772 10470 12637 15406 18148 20995 21918 23949 25178
# Nets
Pof#no Pins
3029 5844 5742 8651 10383 13419 21924 17828 20717 22124 23843 25384
11219 14065 21040 20606 24712 48404 68290 48145 55203 76231 57613 82751
Table 1. Benchmark circuits' characteristics. that the move of the current cluster ended at the point of maximum partial sum Silk. We then reverse the moves to this point, and select the cell with the maximum total gain, which very likely belongs to an unmoved cluster, as the base cell. After selecting this cell, the free cells are reordered in a manner that reflects their relevant connectivities to previously moved clusters. Since some cluster C was previously moved from the cutset, say, into V2 , it is not desirable to move the free cells of C in V2 to VI-doing so will lock the cluster in the cutset. Therefore, as at beginning of the pass, all gain components of cells are cleared to zero, with the exception of those components that correspond to negative gains corresponding to connections to locked neighbors in the same subset. These high-weight negative gains that are retained reflect the fact that some clusters were moved previously in the pass, and that free cells strongly connected to moved cells in these clusters likely belong to them and thus should be given lower priorities for movement.
Figure 5. One pass of CDIP (Cluster-Detecting Iterativeimprovement Partitioner) From this reasoning we propose the following cluster detecting criterion: After the move process reaches a positive maximum improvement point, and there is no further improvement in the following 3 moves, we say that a cluster has been moved out at the maximum improvement point;-3 is a parameter of the algorithm. Referring to the cutsize curve in Figure 4, the 3 cells moved after the minimum cutsize is reached do not belong to the previous cluster. This is in contrast to the two cluster detection criteria that Saab proposed in his compaction algorithm [15], viz., (1) The cutsize decreases for the first time after a sequence of moves; (2) The last moved cell in the sequence has a positive gain. We derived our detection criterion from the analytical results in Section 3.2., and we use the partial sum of gains of the sequence of node moves in our criterion, instead of individual cell gains as in [15]. We now address the second question raised at the beginning of this subsection. After reversing the 3 moves, we come back to the end point of the current cluster. Subsequently, we need to select the next seed to start the move of another cluster. For this purpose, the updated gain components of cells should not be the determining factor. Rather, the total gains of cells, which reflect their overall situation, is more useful. Just like the situation at the beginning of the pass, the cell with the maximum total gain is a good seed to start with. From the above discussion, a more sophisticated algorithm CDIP (Cluster-Detecting Iterative-improvement Partitioner) is presented in Figure 5. This is an extension of CLIP and can also be applied to any FM-type iterative improvement algorithm. The detection of the end of the kth cluster is done by monitoring the partial sum Sk (i = 1, 2) for each cluster and each subset separately. After S, k becomes positive and does not increase for 3 moves, we infer
By using either of the two new partitioning algorithms, CLIP or CDIP, we can find a good cut through weakly connected clusters. In order to obtain even better results, we can apply the original iterative improvement algorithm as a post-processing phase to fine-tune the partition. 3.5.
Complexity Analysis
In an implementation, both CLIP and CDIP have to be overlaid on some chosen iterative improvement algorithm. Let n be the number of cells, e the number of nets, p the number of pins and d the average number of neighbors of a cell. It is easy to show that CLIP doesn't increase the order of time complexity. CLIP-FM and CLIP-LA (CLIP applied to FM, LA) can still be implemented in 0(p) if a bucket list structure is used. CDIP has two major additional operations beyond those in the CLIP algorithm. After each detection of a cluster: (1) The 3 moves are reversed, and (2) The free cells are reordered. Assuming c clusters are detected in a pass, the first operation implies c6 additional moves over the entire pass, and the second operation causes c reorderings of all free cells. For a bucket list structure, where the insertion of a cell into a bucket is a constant time operation, the complexity of the first operation is 0(cdd) (each extra move requires 0(d) time for updating d neighbors and reinserting them in the bucket data structure), and the complexity of the second operation is 0(cn) over the entire pass. Thus
the complexity of CDIP is 0(max(cbd,cn,p)) for CDIPFM and CDIP-LA for one pass. Empirical results presented later show that CDIP is quite fast.
96
Minimum of 20 runs Cut Size Improvement V%
Test jCase
LP
FML31_FM s1423 SiOO s1488 balu p1 bml t4 t3 t2 t6 struct t5 l9ks 2 p s9234 biomed s13207 s15850 Industry
17 31 48 27 47 54 87 75 149 67 46 127 140 212 59 83 98 109 264
16 25 42 27 52 53 82 80 126 70 44 99 130 149 43 90 85 87 422
SubtotalJ 1740[1722] industry3 s35932 s38584 avq small s38417 avq large
272 85 100 347
15 37 43 27 52 49 56 57 89 60 37 75 119 149 49 84 98 80 260
15 25 41 27 52 52 52 57 90 60 36 74 105 152 44 83 70 67 190
1436] 1313] 261 102 49 223 78 216
504 168 85 608 284 398
261 73 55 146 73 138
jj240 jj350 fSubtotal] 1394 2047] 929 Total ]3134 f3769] 2365
-FM [-LA3
__A
16 25 42 27 52 52 51 57 92 60 33 80 107 142 47 84 68 73 205
11.8 -16.2 10.4 0.0 -9.6 9.3 35.6 24.0 40.3 10.4 19.6 40.9 15.0 29.7 16.9 -1.2 0.0 26.6 1.5
4.0 73 -16.7 47I 51.0 148 35.7 79 67.5 145 jJ38.3
-
5.9 19.4 12.5 0.0 -9.6 3.7 41.4 24.0 38.3 10.4 28.3 37.0 23.6 33.0 20.3 -1.2 30.6 33.0 22.3
17.51 24.51
12921 2431
746] 7351 2059] 20271
Average of% improvement
[
ILCI_
_LI_
____
LA3
4.0 14.1 45.0 57.9 69.6 60.6
-IU1-U
L)A3
~FM
LA31I -FM
11.8 19.4 14.6 0.0 -9.6 3.7 40.2 24.0 39.6 10.4 21.7 41.7 25.0 28.3 25.4 0.0 28.6 38.5 28.0
24.2 47.5 53.5 38.1 74.9 79.5 129.3 106.8 182.1 94.2 58.0 183.6 171.7 273.9 84.7 117.4 122.6 176.9 627.5
22.3 21.8 25.4 49.9 49.1 46.9 36.1 38.9 68.5 65.8 67.5 65.0 117.2 77.0 106.2 72.3 148.1 105.2 84.4 70.1 49.6 45.6 165.0 89.0 169.0 150.3 233.4 233.2 81.1 89.5 170.7 108.4 118.9 123.5 140.4 140.9 724396332.8
L693.4
25.01
47.3f 35
FCI
L-LA3
19.6 25.3 45.5 32.5 61.8 60.4 72.9 71.6 106.8 71.8 46.8 90.7 136.1 208.8 80.8 102.1 100.5 106.7
LA
376.6 127.1 83.2 335.1 136.7 305.2
LPICI
j-M
20.6 25.1 46.4 33.9 61.5 59.8 71.7 66.6 101.0 70.0 46.8 89.8 134.6 193.2 77.2 102.2 93.9 107.0 236
19631 17731 1694]
25.7 f264612585
f299.8
[
-LA31J
-LA3
9.9 -4.8 12.3 -2.1 12.1 18.3 40.4 32.2 42.3 25.5 21.3 51.5 12.4 14.8 -5.4 7.7 -0.8 20.3 41.1
18.8 46.7 14.8 14.6 17.6 24.1 43.6 32.9 41.4 23.7 19.3 50.6 20.7 23.8 4.5 13.0 180 397 470
14.7 47.1 13.2 11.2 17.9 24.8 44.6 37.4 44.5 25.6 19.4 51.1 21.6 29.5 8.9 1 2.4 39.5 53.2
25.8]
3.01
60
16.7T
29.11
62.4 65.5 46.5 70.3 53.8
60.5 68.1 46.1 71.7 62.8
421.6 358.6~ 25.6 39.6 79.0 83.0 103.3 95.7 72.2 309.9 311.7 42.1 114.0 108.71 64.4 349.1 260.8 59.6
2734 [3178J 13631 13771 1238 [I49.1 38.2 5380 5763 19631 17731 1694
-__
26.11
f
of 20 runs Improvement
cut-size
10.7 f506.01758.0 14.1 210.3 j231.4 53.0 271.2 57.3 j578.6 815.5 67.1 1384.1 408.2 58.6 755.0
33.4J 46.51 24.51 34. t17.81
ifAverage
48.6 [53.8] 41.41 45.5]
[i26.1
__-
I
33.2
[
52]
Table 2.
Comparisons of CLIP and CDIP (applied to FM and LA3) to FM. CLIP-LA3 results are for 6 = 50. Subtotals shown correspond first to medium-size circuits and then to large circuits.
Test
I
Case
IParaboli
Cut Size
FM
J
___
s1423 Si~o s1488 balu p1 struct
16 45 50 41 53 40 146 74 135 91 91 193
p2 s9234 biomed s13207 s15850 idtr2
f~Subtotal] industry3 1
17 25 46 27 47 41 182 51 83 78 104 264
97519651 -
CLIP
EIP CT
f
-LA3f
-LA3f
-ROPf
1 %Improvement TF Ff C'LIP 1 A3F j __ _ -FMf J _LA3f
M CLIP I f
lFi I -LA3f I_-PROPL_
15 25 43 27 51 33 152 42 84 71 56 192
7901 241 -
800
77
791
260 73 50 129 70 127
243 73 47 139 74 137
243 42 51 144 65 143
1.5 -27.1 -12.7 -24.6 -66.7 -60.3
9.7 -25.3 14.5 10.7 -25.8 -24.9
2.6 -15.1 9.1 42.4 -30.0 8.6
688
-33.9
-3.2
10.9
1479
-22.5
8.8
14.8
15.8
4.2
11.6
14.8
15.5
83 47 200 66 185
Ii
796
Total cut [I
1771
]1205 32170
1612
822
of per-ckt % improvements
] ]
709
713
1509
1492
3 ] --
Table 3.
-5.9 44.4 8.0 34.1 11.3 -2.4 -19.8 31.1 38.5 14.3 -12.5 -26.9
1.0]
i
over Paraboli
15 25 41 27 47 36 151 44 83 69 59 8
85 63 297 147 350
LIAverage
_ CLIP
15 25 42 27 51 33 142 45 83 66 71 200
-263
3Subtotal
____
CDIP
15 25 43 27 47 33 148 44 83 76 75 174
267 62 55 224 49 139
s35932 s38584 avq.small s38417 avq.large
1
6.2 44.4 14.0 34.1 11.3 17.5 -1.4 40.5 38.5 16.5 17.6 9.8
6.2 44.4 16.0 34.1 3.8 17.5 2.7 39.2 38.5 27.5 22.0 -3.5
6.2 44.4 18.0 34.1 11.3 10.0 -3.3 40.5 38.5 24.2 35.2 .
6.2 44.4 14.0 34.1 3.8 17.5 -3.9 4. 37.8 22.0 38.5 0.5
19.0 [
17.9]
20.1
18.9
9.0 -15.1 14.5 37.9 -33.8 1.4-
9.0 32.3 7.3 35.7 -24.6 -2.8
3
10.4
[
173.6
] ]
17.5 16.5
Comparisons of various iterative improvement algorithms to Paraboli [111. The results for the clustering-based iterativeimprovement algorithms in the table have been further improved by their corresponding original schemes (indicated by the subscript f). FM and CLIP-FMf results are the best cutsizes from 100 runs, while results for CLIP-LA3f, CDIP-LA3f and CLIP-PROPf are the best cutsizes from 20 runs. CDIP-LA3f results are for 6 = 50. Subtotals shown correspond first to medium-size circuits and then to large circuits.
97
I
Test
~
MELO
Case balu pI bml t4 t3 t2 t6 struct t5 l9ks 2 p s9234 biomed s13207 s15850 industry2
J 28 64 48 61 60 106 90 38 102 119 169 79 115 104 52 319
Total cut 1
UAverage
1554
of per-ckt
I
Cut Size FMFTIF |CLIP _CLIP -FMf -LA3f 27 27 27 47 47 51 49 47 51 80 53 49 62 56 56 124 87 92 60 60 60 41 33 33 104 74 80 130 109 104 182 148 142 51 44 45 83 83 83 78 76 66 104 75 71 264 174 200
~ ~
1486
[
1193
1210
CDIPCLP T II~_PC IF -LA3 -PROPf 27 27 47 51 47 47 48 52 57 57 89 87 60 60 36 33 74 77 104 104 151 152 44 42 83 84 69 71 59 56 182 192
[
1177
improvements
% Improvement over MELO l C DIP L _fl IFCLIP CICI CLIW CLIP -FMf -LA3f -LA3f -PROPf 3.6 3.6 3.6 3.6 26.6 20.3 26.6 20.3 2.1 -5.9 2.1 2.1 13.1 19.7 21.3 14.8 6.7 6.7 5.0 5.0 17.9 13.2 16.0 17.9 33.3 33.3 33.3 33.3 13.2 13.2 5.3 13.2 27.5 21.6 27.5 24.5 8.4 12.6 12.6 12.6 12.4 16.0 10.7 10.1 44.3 43.0 44.3 46.8 27.8 27.8 27.8 27.0 26.9 36.5 33.7 31.7 -30.7 -26.8 -11.9 -7.1 45.5 37.3 42.9 39.8
1
TFM 3.6 26.6 -2.0 -23.8 -3.2 -14.5 33.3 -7.3 -1.9 -8.5 -7.1 35.4 27.8 25.0 -50.0 17.2
1192 1
4.4
1
3 2
]
23.2
22.1
24.3
17.4
17.0
18.8
23.3 |
18.5|
Table 4. Comparisons of various iterative improvement algorithms to MELO [11]. The results in the table have been further improved by the original schemes (indicated by the subscript f). FM and CLIP-FMf results are the best cutsizes from 100 runs, while results for CLIP-LA3f, CDIP-LA3f and CLIP-PROPf are the best cutsizes from 20 runs. CDIP-LA3f results are for 6 = 50.
4.
EXPERIMENTAL RESULTS
clustering-based iterative improvement algorithms are further improved by the corresponding original schemes as indicated at the end of Section 3.4. (e.g., CLIP-FMf is CLIPFM followed by FM improvement, CLIP-PROPf is CLIPPROP followed by PROP improvement, etc.). Since FM is
All experiments have been done on ACM/SIGDA benchmark circuits whose characteristics are listed in Table 1. The circuit netlists were acquired from the authors of [10] and [11]. All cutset results are for the 45-55% balance criterion.
very fast, we perform 100 runs of both FM and CLIP-FMf; all other iterative improvement algorithms' results are for 20 runs. First, it is clear from the tables that the original FM algorithm can obtain good results for medium-size circuits. For this set of benchmarks, it is about 4% better than MELO, and 1% better than Paraboli in total cut. However, for large size circuits, it falls far behind Paraboli (by -22.5% in total cut). This confirms our earlier discussion on the shortcomings of previous iterative methods. After using the clustering-based techniques, CLIP and CDIP, all
4.1. Comparisons to FM Table 2 presents the results of applying CLIP to FM and LA3 (LA algorithm with lookahead level of 3). Both the minimum and average cutsizes over 20 runs are greatly improved compared to their corresponding original schemes. The overall minimum-cutsize improvements are 24.5% for CLIP-FM over FM and 45.4% for CLIP-LA3 over LA3. Note also from the table that while LA3 performs slightly better than FM for small to medium-size circuits, it performs much worse for large circuits-for an explanation of this phenomenon the interested reader is referred to [14]. However, CLIP-LA3 now performs much better than FM (by 24.5% for medium-size benchmarks and 46.5% for largesize benchmarks, for an overall improvement of 34.3%), as does CLIP-FM (by 8.6% and 19.7% for medium and large size circuits, respectively). As is clearly evident, the most improvements of the new schemes over FM are obtained for large circuits. The largest improvement of CLIP-LA3 over FM is about 70% for the circuit s38417. This clearly demonstrates the ability of the new clustering-based schemes to tackle large circuits. The cluster detection method CDIP-LA3, obtained by overlaying the CDIP scheme of Figure 5 on LA3, performs even better. The minimum and average cutsizes are improved over those of FM by 35.3% and 45.5%, respectively. Both the minimum and average cutsizes are also superior to those of CLIP-LA3. This indicates that CDIP is a better and more stable partitioner than CLIP.
of the four new algorithms CLIP-FMf. CLIP-LA3f, CLIP-
PROPf and CDIP-LA3f, are able to obtain cutsizes that are overall better than Paraboli's. Total cut improvements range from 8.8% to 17.5%. This demonstrates that iterative algorithms can also partition large-size circuits very effectively. The best results are obtained by applying CLIP to PROP, a probability-based iterative improvement partitioner [13]. PROP calculates cell gains based on the probability of a cell being actually moved in a pass. Thus the cell gain calculation is more accurate than that of either FM or LA. Further, when CLIP is applied to FM and LA, neighbors of moved nodes get updated only if they are connected to them by critical or somewhat critical (for LA) nets. On the other hand, in PROP, all nets are probabilistically critical, and thus all neighbors get updated, leading to a more accurate reflection of a cell's move on them. The PROP algorithm combined with CLIP overcomes the two fundamental shortcomings in traditional iterative improvement methods-inaccurate gain calculation and lack of a global view of the cluster-oriented structure of circuits. Thus it emerges as a very powerful partitioning tool and performs about 17% better than Paraboli. When compared to MELO [12], for which only results on medium-size circuits are given, the differences between the new algorithms are small, all showing about 23% better results in total cutsize
4.2. Comparisons to Paraboli and MELO Finally, in Tables 3 and 4, we compare the original iterative improvement and the new cluster-oriented iterative
improvement algorithms to two state-of-the-art partitioning methods, the placement-based algorithm Paraboli [11] and the spectral partitioner MELO [12]. Here, all the new
98
Test Case
FM [CLIP CLIP CDIP] CLIP MELO | -FMf -LA31 -LA3f -PROPf l X100l x100 x20 x20 x20
s1423 sioo s1488 balu pI bml t4 t3 t2 t6 struct t5 l9ks 2 p s9234 biomed s13207 s15850 industry2 industry3 s35932 s38584 avq.small s38417 avq.large
0.15 0.10 0.19 0.25 0.33 0.27 0.58 0.76 0.58 0.57 0.54 1.13 1.59 1.81 2.78 3.89 4.23 4.24 9.10 11.07 11.82 13.70 18.44 15.36 19.49
0.20 0.11 0.20 0.35 0.44 0.43 0.90 0.96 0.99 0.88 0.69 1.62 2.23 2.37 3.14 3.34 5.01 6.87 13.17 16.35 13.21 15.73 20.50 17.70 24.07
(16 ckts.)
32641 43361
(18 ckts.) 1 11754 1143461 To
0.54 0.68 0.35 0.44 0.59 0.74 1.59 1.55 1.86 2.36 1.78 2.42 4.07 5.29 4.41 5.35 4.97 6.20 2.54 2.75 2.25 2.72 7.07 8.11 8.92 10.83 8.33 10.52 8.74 13.48 11.56 18.13 11.03 21.47 13.33 27.13 56.47 72.64 70.93 97.18 23.16 48.19 37.38 66.93 63.01 125.35 40.58 86.65 71.50 157.26
29951
4218 |
8464 115070
0.61 0.77 1.44 1.69 1.81 1.84 5.70 4.74 5.46 8.73 3.75 9.39 10.96 17.64 13.22 28.61 19.02 28.80 106.33 96.01 54.26 97.48 104.08 84.49 106.28
535j 153251 1
5. CONCLUSIONS We proposed a new clustering-based approach that greatly enhances the performance of iterative improvement methods. The new approach incorporates clustering mechanisms naturally into traditional FM-type algorithms. This revives the power of fast move-based iterative improvement algorithms, making them capable of dealing with large-size circuits. They are significantly better, in terms of both cutset quality and speed, than current state-of-the-art algorithms like Paraboli [11] and MELO [12] that are purely clusteringbased, and deserve new attention in the development of VLSI CAD tools.
Paraboli 7.7 15.8 17.0 15.5 18.3
7 8 9 24 27 29 31 38 35.2 67 79 89 137.4 516 490.3 496 710.9 710 2060.4 1197 2730.9 1855 1367.3 760.7 2626.7 6517.5 4098.9 2041.5 4135.0
5177 ||
1! 277871]
Table 5. Comparisons of CPU times of various algorithms in secs per run, and total times over all circuits and all runs made. MELO was run on SUN SPARCIO, Paraboli on DEC3000 Model 500 AXP, all others on SUN SPARC5 Model 85.
than MELO.
4.3.
Run Time Comparisons
The run times of the iterative improvement algorithms are very favorable compared to other purely clustering-based algorithms like Paraboli and MELO (Table 5). Run times of Paraboli and MELO are reported for the DEC3000 Model 500 AXP and SUN SPARC10 workstations, respectively, while we have executed all CLIP and CDIP based algorithms, as well as FM and LA, on the SUN SPARC5 Model 85 workstation. The data structures used to store free cells for FM and LA are bucket structures as proposed in [3] and [4], respectively. Despite the O(maz(c~d,cn, p)) worstcase time complexity of CDIP-LA3f, in practice it uses less than twice the CPU time of CLIP-LA3f, which has a linear run time. PROP uses a tree structure which makes it easy to accommodate arbitrary net weight as is required in performance-driven partitioning [7, 5]. Yet the run time of CLIP-PROPf is quite reasonable. The total CPU times of all four new algorithms are less than that of Paraboli. Assuming the same speed for the three different workstations, CLIP-FMf is 1.9 times faster, CLIP-LA3f is 3.3 times faster, and both CDIP-LA3f and CLIP-PROPf are 1.8 times faster than Paraboli. CLIP-PROPf is comparable with MELO in run time, while CLIP-FMf, CLIP-LA3f and CDIP-LA3f are faster than MELO by factors of 1.2, 1.7 and 1.2, respectively. This also means that if equal CPU times are allocated, the new algorithms can perform more runs and generate even better cutsizes than those presented in Tables 3 and 4.
99
REFERENCES [1] B. W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs", Bell System Tech. Journal, vol. 49, Feb. 1970, pp. 291-307. [2] D. G. Schweikert and B. W. Kernighan, "A Proper Model for the Partitioning of Electrical Circuits", Proc. 9th Design automation workshop, 1972, pp. 57-62. [3] C. M. Fiduccia and R. M. Mattheyses, "A lineartime heuristic for improving network partitions", Proc. ACM/IEEE Design Automation Conf., 1982, pp. 175-181. [4] B. Krishnamurthy, "An improved min-cut algorithm for partitioning VLSI networks", IEEE Trans. on Comput., vol. C-33, May 1984, pp. 438-446. [5] M. Marek-Sadowska and S.P. Lin, "Timing driven placement", Proc. IEEE/A CM International Conference on CAD, 1989, pp. 94-97. [6] Y.C. Wei and C.K. Cheng, "Towards efficient hierarchical designs by ratio cut partitioning", Proc. Int'l. Conf. Computer-Aided Design, 1989, pp. 298-301. [7] M.A.B. Jackson, A. Srinivasan and E.S. Kuh, "A fast algorithm for performance driven placement", Proc. IEEE/ACM International Conference on CAD, 1990, pp. 328-331. [8] Y. C. Wei and C. K. Cheng, "An Improved Two-way Partitioning Algorithm with Stable Performance", IEEE Trans. on Computer-Aided Design, 1990, pp. 1502-1511. [9] L. Hagen and A. B. Kahng, "Fast Spectral Methods for Ratio Cut Partitioning and Clustering", Proc. IEEE Intl. Conf. Computer-Aided Design, 1991, pp. 10-13. [10] C. J. Alpert and A. B. Kahng, "A General Framework for Vertex Orderings, With Applications to Netlist Clustering", Proc. IEEE Intl. Conf. Computer-Aided Design, 1994, pp. 63-67. [11] B. M. Riess, K. Doll and F. M. Johannes, "Partitioning Very Large Circuits Using Analytical Placement Techniques", Proc. ACM/IEEE Design Automation Conf., 1994, pp. 646651. [12] C. J. Alpert and S-Z Yao, "Spectral Partitioning: The More Eigenvectors, the Better", Proc. ACM/IEEE Design Automation Conf., 1995. [13] S. Dutt and W. Deng, "A Probability-Based Approach to VLSI Circuit Partitioning", submitted to DAC'96. [14] S. Dutt and W. Deng, "VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques", Technical Report, Department of Electrical Engr., University of Minnesota, Nov. 1995. This report is available at ftp site ftp-mount.ee.umn.edu in file pap-pdw96-ext.ps in directory /pub/faculty/dutt/vlsicad/papers. [15] Y. G. Saab, "A Fast and Robust Network Bisection Algorithm", IEEE Trans. Computers, 1995, pp. 903-913.
A HYBRID MULTILEVEL/GENETIC APPROACH FOR CIRCUIT PARTITIONING Charles J. Alpert'
Lars W. Hagen2
Andrew B. Kahng'
'UCLA Computer Science Department, Los Angeles, CA 90095-1596 2Cadence Design Systems, San Jose, CA 94135
ABSTRACT We present a genetic circuit partitioning algorithm that integrates the Metis graph partitioning package [15] originally designed for sparse matrix computations. Metis is an extremely fast iterative partitioner that uses multilevel clustering. We have adapted Metis to partition circuit netlists, and have applied a genetic technique that uses previous Metis solutions to help construct new Metis solutions. Our hybrid technique produces better results than Metis alone, and also produces bipartitionings that are competitive with previous methods [20] [18] [6] while using less CPU time. 1.
INTRODUCTION
A
netlist hypergraph
{V,
iV2. . ..
H(V E) has n modules V = C E is defined to be a subset of V with size greater than one. A bipartitioning P = {X, Y} is a pair of disjoint clusters (i.e., subsets of V) X and Y such that X U Y = V. The cut of a bipartitioning P = {X, Y} is the number of nets which contain modules in both X and Y. i.e., cut(P) = I{e I efnX $A0,e nY $ 0i1. Given a balance tolerance r, the min-cut bipartitioning problem seeks a solution P = {AX Y) that minimizes cut(P) such that '(I-r) < 1X I' < n(i+r) The standard bipartitioning approach is iterative improvement based on the Kernighan-Lin (KL) [16] algorithm, which was later improved by Fiduccia-Mattheyses (FM) [8]. The FM algorithm begins with some initial solution {X, Y} and proceeds in a series of passes. During a pass, modules are successively moved between X and Y until each module has been moved exactly once. Given a current solution {X', Y'}, the module v e X' (or Y') with highest gain (= cut({X' - v, Y' + v}) - cut({X, Y})) that has not yet been moved is moved from X' to Y'. After each pass, the best solution {X', Y'} observed during the pass becomes the initial solution for a new pass, and the passes terminate when a pass does not improve the initial solution. FM has been widely adopted due to its short runtimes and ease of implementation. One significant improvement to FM addresses the tiebreaking used to choose among alternate moves that have the same gain. Krishnamurthy [17] proposed a lookahead tie-breaking mechanism, and Sanchis [22] extended this approach to multi-way partitioning. Hagen, Huang, and Kahng [9] have shown that a "last-in-first-out" scheme based on the order that modules are moved in FM is cV,: a hyperedge (or net) e
100
significantly better than random or "first-in-first-out" tiebreaking schemes. More recently, Dutt and Deng [7] independently reached the same conclusion. Finally, Saab [21] has also exploited the order in which modules are moved to produce an improved FM variant. A second significant improvement to FM integrates clusteringinto a "two-phase" methodology. A k-way clustering of H(V, E) is a set of disjoint clusters p 5 = {C, , 0 ... Ck} such that C, UC2 U. .. UCk = V where k is sufficiently large.' We denote the input netlist as Ho(Vo, Eo). A clustering 5 P = {C, C2,. Ck I of Ho induces the coarser netlist HI(Vl,,E,), where V, = {C,,C2,..,Ck} and for every e e Eo, the net e' is a member of El where e' = {Ci I 3v E e and v E C0 unless Ie'l = 1 (i.e., each cluster in e' contains some module that is in e). In two-phase FM, a clustering of Ho induces the coarser netlist Hi, and then FM is run on HI (½V, El) to yield the bipartitioning Pi = {Xi, Yl }. This solution then projects to the bipartitioning Po = {Xo, Yo} of Ho, where v E Xo(Yo) if and only if for some Ch £ V½, v E Ch and Ch E X,(Y,). FM is then run a second time on Ho(Vo, Eo) using Po as the initial solution. Many clustering algorithms for two-phase FM have appeared in the literature (see [2] for an overview of clustering methods and for a general netlist partitioning survey). Bui et al. [5] find a random maximal matching in the netlist and compact the matched pairs of modules into 2 clusters; the 2 matching can then be repeated to generate clusterings of size 4,8- etc. Often, two-phase FM (not including the time needed to cluster) is faster than a single FM run because the first FM run is for a smaller netlist and the second FM run starts with a good initial solution, allowing fast convergence to a local minimum. The "two-phase" approach can be extended to include more phases; such a multilevel approach is illustrated in Figure 1 (following [15]). In a multilevel algorithm, a clustering of the initial netlist Ho induces the coarser netlist HI, then a clustering of HI induces H2, etc. until the coarsest netlist Hm is constructed (m = 4 in the Figure). A partitioning solution Pm - {Xm_,Y} is found for Hm (e.g., via FM) and this solution is projected to Pm-l {Xm-=, Yi-l I 'A partitioning and a clustering are identical by definition, but the term partitioning is generally used when k is small (e.g., k < 10), and the term clustering is generally used when k is large (e.g., k = e(n) with constant average cluster size). Although a bipartitioning can also be written as P' = {Cl, C2), we use the notation P = {X, Y} to better distinguish between partitioning and clustering.
Pm-i is then refined, e.g., by using it as an initial solution
netic algorithm. Section 4 presents experimental results for 23 ACM/SIGDA benchmarks, and Section 5 concludes with directions for future work.
for FM. In the Figure, each projected solution is indicated by a dotted line and each refined solution is given by a solid dividing line. This uncoarsening process continues until a partitioning of the original netlist Ho is derived.
Initial
2.
GRAPH PARTITIONING USING METIS
The Metis package of Karypis and Kumar has multiple algorithm options for coarsening, for the initial partitioning step. and for refinement. For example, one can choose among eight different matching-based clustering schemes including random, heavy-edge, light-edge, and heavy-clique matching. The methodology we use follows the general recommendations of [13], even though their algorithm choices are based on extensive empirical studies of finite-element graphs and not circuit netlists. Before multilevel partitioning is performed, the adjacency lists for each module are randomly permuted. The following discussion applies our previous notation to weighted graphs: a weighted graph is simply a hypergraph Hi and lel = 2 for each e e Ei with a nonnegative weight function w on the edges. To cluster, Karypis and Kumar suggest Heavy-Edge Matching (HEM), which is a variant of the random matching algorithm of [5]. A matching M of Hi is a subset of Ei such that no module is incident to more than one edge in M. Each edge in the matching will be contracted to form a cluster, and the contracted edges should have the highest possible weights since they will not be cut in the graph Hi+,. HEM visits the modules in random order: if a module u is unmatched, the edge (u, v) is added to M where w(u, v) is maximum over all unmatched modules v; if u has no unmatched neighbors, it remains unmatched. This greedy algorithm by no means guarantees a maximum sum of edge weights in M, but it runs in OQ(Ei ) time. Following [15], our methodology iteratively coarsens until IVmL < 100. An initial bipartitioning for Hm is formed by the Greedy Graph Growing Partitioning (GGGP) algorithm. Initially, one "fixed" module v is in its own cluster Xm and the rest of the modules are in Y_. Modules with highest gains are greedily moved from Ym to Xm until Pm = {Xm, Ym} satisfies the cluster size constraints. Since the solution is extremely sensitive to the initial choice of v, the algorithm is run four times with different initial modules. and the best solution observed is retained for the next step. Despite its simplicity, the GGGP heuristic proved at least as effective as other heuristics for partitioning finite element graphs [13]. The refinement steps use the Boundary Kernighan-Lin Greedy Refinement (BGKLR) scheme. Despite its name, the heuristic actually uses the FM single-module neighborhood structure. Kumar and Karypis label the KL algorithm "greedy" when only a single pass is performed, and propose a hybrid algorithm which performs "complete" KL when the graph is small (i.e., less than 2000 modules) and greedy KL for larger graphs. They show that greedy KL is only slightly inferior to complete KL, but saves substantial CPU time. A "boundary" scheme is also used for updating gains: initially, only modules that are incident to cut edges (i.e., boundary modules) are stored in the FM bucket data structure and are eligible to be moved; when a module that is not in the data structure becomes incident to a moved module, it is inserted into the bucket data structure only if it has
Partitioning
Figure 1. The multilevel bipartitioning paradigm. Multilevel clustering methods have been virtually unexplored in the physical design literature; the work of Hauck and Borriello [10] is the notable exception. [10] performed a detailed study of multilevel partitioning for FPGAs and found that simple connectivity-based clustering combined with a KL and FM multilevel approach produced excellent solutions. However, multilevel partitioning has been wellstudied in the scientific computing community, e.g., Hendrickson and Leland [11] [12] and Karypis and Kumar [13] [14] [15] have respectively developed the Chaco and Metis partitioning packages. The Metis package of [15] has produced very good partitioning results for finite-element graphs and is extremely efficient, requiring only 2.8 seconds of CPU time on a Sun Sparc 5 to bipartition a graph with more than 15.000 vertices and 91,000 edges. Our initial hypothesis, which our work has verified, was that Metis adapted for circuit netlists is both better and faster than FM. Metis runtimes are so low that we can easily afford to run it over 100 times to generate a partitioning. However, instead of simply calling Metis 100 times, we propose to integrate Metis into a genetic algorithm: our experiments show that this approach produces better average and minimum cuts than Metis alone. Overall. our approach generates bipartitioning solutions that are competitive with the recent approaches of [20] [18] [6] while requiring much less CPU time. The rest of our paper is as follows. Section 2 reviews the Metis partitioning package and presents our modifications for circuit netlists. Section 3 presents our Metis-based ge-
101
positive gain. The cost of performing the boundary version of KL is small, since only the boundary modules are considered. The overall Metis methodology is presented in Figure
Given a set S of s solutions, the s-digit binary code C(i) for module vi is generated by concatenating the ith entries of the indicator vectors for the s solutions. We construct a clustering by assigning modules vi and v. to the same cluster if C(i) and C(j) are the same code. Our strategy integrates this code-generated clustering into Metis, in that we use HEM clustering and force every clustering generated during coarsening to be a refinement of the codebased clustering.2 Our Genetic Metis (GMetis) algorithm is shown in Figure 3.
2.
'The Metis Algorithm Input: Graph Ho (IVY Eo) Output: Bipartitioning Po = {Xo, Yo} 1. i = 0; randomly permute the adjacency lists of H0 .
2. while IVI < 100 do 3. Use HEM to find a matching M of Hi 4.
Contract each edge in M to form a clustering.
Construct the coarser graph Hi+,(Vi+1,Ei+0). Set Zto i + 1. 5. Let m = i. Apply GGGP to Hm to derive Pm. Refine Pm using BGKLR. 6. for i = m-1 downto 0 do 7.
Project solution Pi+, to the new solution Pi.
Refine Pi using BGKLR. 8. return Po. Figure 2. The Metis Algorithm To run Metis on circuit netlists, we use an efficient hypergraph to graph converter that constructs sparse graphs. The traditional clique net model (which adds an edge to the graph for every pair of modules in a given net) is not a good choice since large nets will destroy sparsity. Since we observed that keeping large nets generally increases the cut size regardless of the net model, we removed all nets with more than T modules (we use T = 50). For each net e, our converter picks F - lel random pairs of modules in e and adds an edge with cost one into the graph for each pair. Here, F is a constant; our experiments show that the value of F is not too significant as long as it is large enough (we use F = 5). Table 1 shows how the Metis cuts vary with various values of F and T. Our converter retains the sparsity of the circuit, introduces randomness to allow multiple Metis runs, and is fairly efficient. 3.
A GENETIC VERSION OF METIS
Our experiments in Section 4 show that over the course of 100 independent runs Metis generates at least one very good solution, but that its performance is not particularly stable, generating average cuts much higher than minimum cuts. To try to stabilize solution quality and generate superior solutions, we have integrated Metis into a genetic framework. An indicatorvectorp = {pi,P2,. p} for a bipartitioning P = {X, Y} has entry p, = 0 if v, G X and entry p, = 1 if vi E Y, for all i = 1, 2, . n. The distance between two bipartitionings P and Q with corresponding indicator vectors p and 4is given by - qij, i.e., by the number of module moves needed to derive solution Q from the initial solution P. Boese et al. [41 showed that the set of local minima generated by multiple FM runs exhibit a "big valley" structure: solutions with smallest distance to the lowest-cost local minima also have low cost, and the best local minima are "central" with respect to the other local minima. Thus, we seek to combine several local minimum solutions generated by Metis into a more "central" solution.
En=
102
The Genetic Metis (GMetis) Algorithm Input: Hypergraph H(V, E) with n modules Output: Bipartitioning P = {X, Y} Variables: s: Number of solutions numgen: Number of generations C(i): s-digit code for module vi S: set of the s best solutions seen G: graph with n modules 1. Set C(i)= 00 ... 0 for I < i < n 2. for i = 0 to numgen - 1 do 3. for j = 0 to s -1 do 4. if ((i *s) + j) modulo 10 = 0 then convert H to graph G 5. P = Metis(G) (HEM based on codes C(i)) 6. if BQ E S such that Q has larger cut than P then S = S + P - Q. 7. if i > 0 and (s(i -1) + j) modulo 5 = 0 then recompute C(i) for 1 < i < n using S. 8. return P c S with lowest cut. Figure 3. The Genetic Metis Algorithm Step 1 initially sets all codes to 00. . . 0 which causes GMetis to behave just Eke Metis until s solutions are generated. Steps 2 and 3 are loops which cause numgen generations of s solutions to be computed. Next, Step 4 converts the circuit hypergraph into a graph, but this step is performed only once out of every 10 times Metis is called. We perform the conversion with this frequency to reduce runtimes while still allowing a variety of different graph representations; the constant 10 is fairly arbitrary. In Step 5, Metis is called using our version of HEM described above. Step 6 maintains the set of solutions S; our replacement scheme replaces solution Q G S with solution P if P has smaller cut size than Q; other replacement schemes may work just as well and need to be investigated. Step 7 computes the binary code for each module based on the current solution set, but only after the first generation has completed and five solutions with the previous code-based clustering have been generated. As in Step 4, the constant 5 is fairly arbitrary. Finally, the solution with lowest cut is returned in Step 8. 4.
EXPERIMENTAL RESULTS
All of our experiments use a subset of the benchmarks from the ACM/SIGDA suite given in Table 2: hypergraph formats of these circuits are available on the world wide web 2 A clustering pk is a refinement of Q' (k > 1) if some division of clusters in Q' will yield pk.
T/F 10 15 20 25 35 50 100 200 500
1 289(238) 276(231) 320(261) 321(243) 309(243) 316(233) 310(231) 325(252) 471(366)
2 241(184) 224(188) 252(202) 251(189) 248(172) 258(190) 274(184) 265(182) 427(333)
3 239(185) 239(185) 259(180) 250(174) 239(170) 250(177) 256(173) 266(170) 418(318)
4 238(180) 228(184) 258(189) 254(170) 227(168) 251(173) 260(172) 257(174) 412(327)
5 225(176) 222(178) 252(173) 243(169) 249(173) 245(169) 256(173) 288(184) 414(294)
6 228(184) 228(175) 253(187) 238(162) 245(171) 240(167) 254(175) 258(182) 429(295)
8 230(174) 228(165) 261(165) 255(173) 240(166) 255(159) 248(166) 261(187) 399(311)
10 220(169) 215(176) 269(190) 232(162) 247(164) 255(178) 237(170) 260(192) 408(321)
12 225(178) 241(181) 265(176) 245(176) 254(176) 232(162) 245(180) 271(181) 414(296)
15 227(169) 228(174) 253(178) 266(174) 239(169) 240(175) 252(176) 266(186) 411(270)
Table 1. Average(minimum) cuts for the avqlarge test case for 50 runs of Metis shown for various values of T (rows) and F (columns). at http://ballade.cs.ucla.edu/-cheese. Our experiments assume unit module areas, and our code was written in C++ and was compiled with g++ v2.4 on a Unix platform. Our experiments were run on an 85 Mhz Sun Sparc 5 and all runtimes reported are for this machine (in seconds) unless otherwise specified. We performed the following studies:
are better than others), we compare to the best FM results found in the literature.
Test Case balu bml primaryl test04 testO3 testO2 testO6 struct testO5 l9ks primarv2 s9234 biomed s13207 s15850 industry2 industry3 avqsmall avqlarge
* We compare Metis against standard and two-phase FM, to show the effectiveness of the multilevel approach. e We show that the GMetis algorithm is more effective than running Metis multiple times. * Finally, we show that GMetis is competitive with previous approaches while using a fraction of the runtime. Test Case balu bml primaryl testO4 testO3 testO2 testO6 struct testO5 l9ks primary2 s9234 biomed s13207 s15850 industry2 industry3 s35932 s38584 avqsmall s38417 avqlarge golem3
# Modules
# Nets
801 882 833 1515 1607 1663 1752 1952 2595 2844 3014 5866 6514 8772 10470 12637 15406 18148 20995 21918 23849 25178 103048
735 903 902 1658 1618 1720 1541 1920 2750 3282 3029 5844 5742 8651 10383 13419 21923 17828 20717 22124 23843 25384 144949
# Pins 2697 2910 2908 5975 5807 6134 6638 5471 10076 10547 11219 14065 21040 20606 24712 48404 65792 48145 55203 76231 57613 82751 338419
.
f
Minimum cut (100 runs) CPU (s Metis I MIT 2-FM I Metis FM . [6] 1 [9l 1] L91 [ 34 53 55 53 61 99 94 36 107 116 158 49 83 84 62 218 292 175 171
32 55 57 86 72 115 71 45 97 142 236 53 83 92 112 428
171
52 53 56 60 97 68 43 93 121 182
83
124
275 312 373 406
438 328 399 518
56
36
23 22 22 37 39 43 53 41 69 59 90 72 134 111 123 349 399 293 355
21 24 24 41 56 46 50 46 81 115 128 222 296 339 339 727 l
Table 3. Comparison of Metis with FM. Dutt and Deng [6] have implemented very efficient FM code; their exact bisection results for the best of 100 FM runs are given in the third column of Table 3 and the corresponding Sparc 5 run times are given in the last column. Hagen et al. [9] have run FM with an efficient LIFO tie breaking strategy and a new lookahead function that outperforms [17]; their bisection results are reported in the fourth column. Finally, we compare to various two-phase FM strategies. In the fifth column, we give the best twophase FM results observed for various clustering algorithms as reported in [1] and [9]. Metis does not appear to be faster than FM for circuits with less than two thousand modules, but for larger circuits with five to twelve thousand modules, Metis is 2-3 times faster. In terms of cut sizes, again Metis is indistinguishable from FM for the smaller benchmarks, but Metis cuts are significantly lower for the larger benchmarks. We conclude that multilevel approaches are unnecessary for small circuits, but greatly enhance solution quality for larger circuits. For these circuits, more than two levels of clustering are required for such an iterative approach to be effective.
Table 2. Benchmark circuit characteristics. 4.1. Metis vs. FM and Two-phase FM Our first set of experiments compares Metis against both FM and two-phase FM. We ran Metis 100 times with balance parameter r = 0 (exact bisection) and recorded the minimum cut observed in the second column of Table 3. Since there are many implementations of FM (some of which
103
4.2.
Genetic Metis vs. Metis
found that with this implementation, GMetis with r = 0.1 was sometimes outperformed by GMetis with r = 0 (exact bisection). Hence, in Table 5, we present results for GMetis with r = 0.1 and r = 0 (given in parentheses). 3 Since for r = 0.1, GMetis runtimes sometimes increase by 20-50%, we report runtimes for r = 0 in the last column. These experiments used the somewhat arbitrary parameter values of s = log2 in (jVj = n) solutions and 12 generations. Observe that GMetis cuts are competitive with the other methods, especially for the larger benchmarks s15850, industry2, and avqsmall. However, the big win for GMetis is the short runtimes: generating a single solution for avqlarge and golem3 respectively takes 417/(12 log 2 25178) = 2.5 and 450/(21og2 103048) = 15 seconds on average. For golem3, we only ran 2 generations since the results do not improve with subsequent generations; the solution with cost 2144 was achieved after only 210 seconds of CPU time.
The next set of experiments compares Metis with the GMetis. We ran GMetis for 10 generations while maintaining s = 10 solutions so that both Metis and GMetis considered 100 total solutions. The minimum and average cuts observed, as well as total CPU time, are reported for both algorithms in Table 4. Test
[[
Case
|[
balu bml primaryl testO4 test03 testO2 testO6 struct testO5 19ks primarv2 s9234 biomed s13207 s15850 industrv2 industry3 s35932 s38584 avqsmall s38417 avqlarge golem3
min
Metis [avg
CPFU
|min
34 53 55 53 61 99 94 36 107 116 158 49 83 84 62 218 292 55 55 175 73 171 2196
47 65 66 68 76 113 117 52 125 132 195 66 149 90 84 280 408 71 101 241 110 248 2520
26 23 23 37 42 44 59 41 70 59 95 71 145 106 126 336 384 257 310 289 294 318 1592
32 54 55 52 65 96 97 34 109 112 165 45 83 78 59 204 291 56 53 148 74 144 2196
GMetis
11
avg I CPU 38 59 59 58 74 101 121 40 117 116 174 52 134 89 74 230 313 62 67 174 104 181 2648
24 22 21 37 39 42 55 39 69 59 91 68 143 112 125 339 423 265 368 322 301 355 1928
5.
This work integrates the Metis multilevel partitioning algorithm of [15] into a genetic algorithm. We showed (i) Metis outperforms previous FM-based approaches, (ii) GMetis improves upon Metis alone for large benchmarks, and (iii) GMetis is competitive with previous approaches while using less CPU time. There are many improvements which we are pursuing: * Find sparser and more reliable hypergraph conversion algorithms. * Try alternative genetic replacement schemes, instead of simply inserting the current solution into S if it is a better solution. * Tweak parameters such as F, T, s, and the number of generations in order to generate more stable solutions in fewer iterations. * Experiment with various schemes to control cluster sizes in the bipartitioning solution. That GMetis frequently finds better 50-50 solutions versus 45-55 solutions is not acceptable. * Finally, we are integrating our own separate multilevel circuit partitioning code into a new cell placement algorithm.
Table 4. Comparison of Metis with Genetic Metis. The minimum cut, average cut and CPU time for 100 runs of each algorithm are given. On average, GMetis yields minimum cuts that are 2.7%, lower than Metis. and significantly lower average cuts (except for golem3). For the larger benchmarks (seven to twenty-six thousand modules) GMetis cuts are 5.7% lower, with significant improvements for industry2, avqsmall and avqlarge. We believe that GMetis can have the greatest impact for larger circuits. Note that golem3 is the one benchmark in which Metis outperforms GMetis in terms of the average case - the quality of GMetis solutions gradually became worse in subsequent generations instead of converging to single good solutions. 4.3.
CONCLUSIONS
REFERENCES [1] C. J. Alpert and A. B. Kahng, "A General Framework for Vertex Orderings, with Applications to Netlist Clustering", to appear in IEEE Trans. on VLSI. [2] C. J. Alpert and A. B. Kahng, "Recent Directions in Netlist Partitioning: A Survey", Integration, the VLSI Journal, 19(1-2), pp. 1-81, 1995. [3] C. J. Alpert and S.-Z. Yao, "Spectral Partitioning: The More Eigenvectors, the Better," Proc. A CM/IEEE Design Automation Conf., 1995, pp. 195-200. [4] K. D. Boese, A. B. Kahng, and S. Muddu, "A New Adaptive Multi-Start Technique for Combinatorial Global Optimizations", Operations Research Letters, 16(20), pp. 101-13, 1994. 3We attribute this undesirable behavior to improper modification of the Metis code. We believe that a better implementation should yield r = 0.1 results at least as good as those for r = 0 without increasing runtimes.
Genetic Metis vs. Other Approaches
Finally, we compare GMetis to other recent partitioning works in the literature, namely PROP [6], Paraboli [20], and GFM [19], the results of which are quoted from the original sources and presented in Table 5. All these works use r = 0.1, i.e., each cluster contains between 45% and 55% of the total number of modules. The CPU times in seconds for PROP, Paraboli, and GFM are respectively reported for a Sun Sparc 5, a DEC 3000 Model 500 AXP, and a Sun Sparc 10. We modified GMetis to handle varying size constraints by allowing the BGKLR algorithm to move modules while satisfying the cluster size constraints. "Ae
' 04
Test
._
Case
. PROP
balu bml primaryl test04 testO3 testO2 testO6 struct testO5 l9ks primary2 s9234 biomed s13207 s15850 industrv2 industrv3 s35932 s38584 avqsmall s38417 avqlarge golem3
cuts 27 50 47 52 59 90 76 33 79 105 143 41 83 75 65 220
.
l
Paraboli
|GFM |
41
27
53
47
40
41
146 74 135 91 91 193 267 62 55 224 49 139 1629
139 41 84 66 63 211 241 41 47 81
27(32) 48(53) 47(54) 49(52) 62(66) 95(96) 94(93) 33(34) 104(109) 106(110) 142(158) 43(45) 102(83) 74(70) 53(60) 177(204) 243(286) 57(55) 53(53) 144(145) 69(77) 145(144) 2111(2144)
l
CPU
GMetis( bal) | PRP KU 16 20 19 49 51 64 75 42 97 87 139 139 250 177 291 867
araboli
|GEM
16
24
18
16
35
80
137 490 711 2060 1731 1367 761 2627 6518 4099 2042 4135 10823
224 672 1440 1920 2560 4320 4000 10160 9680 11280
|G
ei 14 12 12 21 23 26 32 27 46 39 53 58 95 102 114 245 299 266 397 328 281 417 450
Table 5. Comparison of GMetis with PROP, Paraboli. and GFM for min-cut bipartitioning allowing 10% deviation from bisection. Exact bisection results for GMetis are given in parentheses in the fifth column. [5] T. Bui, C. Heigham, C. Jones. and T. Leighton, 'Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms". Proc, ACMI/IEEE Design Automation Conf., pp. 77578, 1989. [6] S. Dutt and W. Deng. "A Probability-Based Approach to VLSI Circuit Partitioning", to appear in Proc. ACM/IEEE Design Automation Conf., 1996. [7] S. Dutt and W. Deng. "VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques", Technical Report, Department of Electrical Engineering, University of Minnesota, Nov. 1995. [8] C. M. Fiduccia and R. M. Mattheyses, "A Linear Time Heuristic for Improving Network Partitions", Proc. ACM/IEEE Design Automation Conf., pp. 175-181, 1982. [9] L. W. Hagen, D. J.-H. Huang, and A. B. Kahng, '`On Implementation Choices for Iterative Improvement Partitioning Algorithms", to appear in IEEE Trans. Computer-Aided Design (see also Proc. European Design Automation Conf., Sept. 1995, pp. 144149). [10] S. Hauck and G. Borriello, "An Evaluation of Bipartitioning Techniques", Proc. Chapel Hill Conf. on Adv. Research in VLSI, 1995. [11] B. Hendrickson and R. Leland, "A Multilevel Algorithm for Partitioning Graphs", Technical Report SAND93-1301, Sandia National Laboratories, 1993. [12] B. Hendrickson and R. Leland, "The Chaco User's Guide", Technical Report SAND93-2339, Sandia National Laboratories, 1993. [13] G. Karypis and V. Kumar, "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs",
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]
[22]
105
Technical Report #95-035, Department of Computer Science, Universitv of Minnesota, 1995. G. Karypis and V. Kumar, "Multilevel k-Way Partitioning Scheme for Irregular Graphs", Technical Report #95-035, Department of Computer Science, University of Minnesota, 1995. G. Karypis and V. Kumar, "Unstructured Graph Partitioning and Sparse Matrix Ordering", Technical Report. Department of Computer Science, University of Minnesota, 1995 (see http://www.cs.umn.edu/"kumar for postscript and code). B. W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs", Bell Systems Tech. J., 49(2), pp. 291-307, 1970. B. Krishnamurthy, "An Improved Min-Cut Algorithm for Partitioning VLSI Networks", IEEE Trans. Computers, 33(5), pp. 438-446, 1984. J. Li. J. Lillis, and C.-K. Cheng, "Linear Decomposition Algorithm for VLSI Design Applications", Proc. IEEE Intl. Conf. Computer-Aided Design, pp. 223-228, 1995. L.-T. Liu, M.-T. Kuo, S.-C. Huang, and C.-K. Cheng, "A Gradient Method on the Initial Partition of Fiduccia-Mattheyses Algorithm", Proc. IEEE Intl. Conf. Computer-Aided Design, pp. 229-234, 1995. B. M. Riess, K. Doll, and F. M. Johannes, "Partitioning Very Large Circuits Using Analytical Placement Techniques", Proc. ACM/IEEE Design Automation Conf., pp. 646-651, 1994. Y. Saab, "A Fast and Robust Network Bisection Algorithm", IEEE Trans. Computers, 44(7), pp. 903-913, 1995. L. A. Sanchis, "Multiple-Way Network Partitioning", IEEE Trans. Computers, 38(1), pp. 62-81. 1989.
MIN-CUT REPLICATION FOR DELAY REDUCTION James Hwang'
Abbas El Gamal 2
1
Xilinx, Inc., USA jim.hwangxtilinx.com 2 Stanford University, USA abbas~isl . stanford. edu
ABSTRACT Min-cut replication has been shown to substantially improve min-cut partitions without substantial increase in network size. This paper addresses the use of min-cut replication to reduce delay in partitioned networks. It is shown that mim-cut replication never increases delay in combinational networks or in sequential networks when registers are not replicated, and demonstrated that in practice, min-cut replication reduces delay significantly. Experimental results comparing a min-cut approach with the results of delay-optimal clustering algorithms indicate that min-cut replication can reduce partition size with modest increases in delay. 1
a,
bh
c,
h,
i,
I
'4I>
2
Ii
k
j I
'
(a)
(b)
Delay minimization example from [8] Figure 1. (node delays subscripted). :/ a
C"
a' "
b',
b
c'
INTRODUCTION
All known network partitioning algorithms that efficiently minimize delay subject to capacity constraints require replication. The problem has been solved for acyclic networks when replication is allowed, by Lawler et al. for the unit delay model [6], and by Rajaraman and Wong [11] for a more general delay model proposed in [9]. These approaches minimize delay subject to any monotone component constraint. Furthermore, it has been observed that the min-delay partitioning problem with the non-monotone pin constraint and no capacity constraint can be solved by the min-depth technology mapping algorithm for lookup table-based FPGAs proposed in [2]. A heuristic that combines elements of [2, 11] was proposed in [12] for the min-delay clustering problem under simultaneous gate and pin capacity constraints, with reported optimal or near optimal min-delay partitions. However, the min-delay clustering algorithms described in [6, 11], despite their elegance, have serious practical limitations. They involve massive amounts of replication, and in practice increase network size by roughly a factor of twenty. Merging heuristics have been proposed to reduce the amount of replication [9, 12], but these heuristics increase the running time substantially, and the resulting partition size is still at least doubled. Such substantial size increases can lead to additional delay, for example, when a multi-chip partition becomes too large to fit on a single PCB. In this paper we show that in contrast, the min-cut replication approaches described in [5, 13] can be effective in reducing delay in a partitioned network without the excessive size increase of min-delay solutions. As a simple example, consider the ISCAS85 benchmark design, c17, shown in Fig. la. A delay-optimal clustering, obtained using the algorithm in [11], is shown in Fig. lb, where the component size limit is three nodes and the cut-edge delay is equal to
Ik,
(a)
(b)
Figure 2. A min-cut approach can minimize delay with fewer components. three. The partition was obtained by merging components in the original solution. By beginning instead with the initial partition without replication shown in Fig. 2a and applying replication to minimize cut size, we obtain the partition in Fig. 2b. This partition is delay-optimal, even though the initial partition was not. Moreover, the it contains one fewer component than the partition in Fig. lb. The paper is organized as follows. Section 2 contains definitions and a brief review of min-cut replication. In Section 3, we prove that min-cut replication never increases delay in combinational networks and sequential networks without replicated registers, and show that when registers can be replicated, delay will never increase by more than one cut edge delay. In Section 4, we show that in practice, min-cut replication often reduces delay substantially. In Section 5, we compare the results of a min-cut approach with partitions obtained using the algorithm in [12], demonstrating that min-cut replication can reduce partition size with modest increases in delay. We conclude in Section 6 by discussing future work. 2 2.1.
PRELIMINARIES
Min-Cut Replication
Let V = {V,, V2 , ... , Vk} be a partition of a graph G = (V, E), where the Vi are not required to be disjoint as long as vertices occurring in more than one component
106
are assumed replicated. The min-cut replication problem is to determine a collection of vertex sets to replicate from each component to every other component which minimizes the cut size in the resulting network. Efficient solutions to this problem, called min-cut replication algorithms, are based on the following three ideas [5, 13]. * The replication problem can be solved by solving the k independent problems of determining the min-cut optimal set to replicate into (or out of) a component Vi from (to) its complement Vi. * Determining the min-cut vertex set to replicate into (or out of) a single component V, from (to) its complement Vi can be done efficiently using flow techniques. * If a replication set found by flow techniques is infeasible because of capacity constraints, the solution can be approximated by using a partitioning heuristic.
Figure 3. Choosing the clone to replicate is essential for minimizing delay.
2.2. A Delay Model for Partitioned Networks The general delay model proposed by Murgai et al. [9], is characterized by two parameters: a function 6, defined on the vertex set, and constant delay D associated with every cut edge in a partition.
Definition 2.5 A combinationalpath p is a critical path if it has maximal combinational delay.
JuI
I
/I -
k
(hj
(a)
We wish to consider sequential as well as combinational networks, assuming only that any cycle in a network contains at least one register node. Definition 2.2 Let X C V be the set of all register nodes in G. where X is empty for a combinational network. A path p = (vo, v, ,em) is a combinational path if vi R 7 for i = 1, m - 1. The gate delay of combinationalpath p, 6(p) -
m
6(vo),
iil
d V(v)
to be the delay induced by applying min-cut replication to the cut V.
Definition 2.6 The cycle time associated with cut V,
max
vev
3
MIN-CUT REPLICATION DOES NOT INCREASE DELAY If implemented properly, min-cut replication will never increase delay in combinational networks or in sequential networks if registers are not replicated. Furthermore, when registers can be replicated, min-cut replication will never increase delay by more than the external delay D. It might first appear that the difference in the delay for two clones can be unbounded, for example by considering the example in Fig. 3a. As can be seen in Fig. 3b, after min-cut replication the delays from w to u3 and Uk differ:
6(P)
...
A(wu)
=
2D+zA(w,u).
Proposition 3.1 If, after min-cut replication, a network with partition V has the property that for every cut edge (ui,,)vj, vertex ui has the minimal delay of all its clones, then for any clones v, v*. we have Idk(v) - d'v(*)l < D. Furthermore, min-cut replication never increases cycle time, i.e., maximal delay in a combinational network or in a sequential network when registers are not replicated.
{ (p) + D c(p,V)})
combinational path p=(,
=
The refinement is: whenever (u,, vj) is a cut edge with dr(ui) > dr(Uk) for some clones ui,uk, simply replace (ui, vj) by the edge (uk, v). It then follows that an edge (ui, v,) is a cut edge only if ui has the minimal delay of any of its clones.
6
max
dV(u,) dr(Uk)
However, as shown in Fig. 3c, a simple refinement of mincut replication ensures that the difference in delay between two clones is bounded above by the external delay D.
Definition 2.4 A cut V = {½l, V2 , ... , Vk} induces a delay function on the vertex set V under the general delay model. Let c(p, V) be the number of cut edges in a combinational path p. The combinational delay, or more simply, the delay of a node v, =
vEV
the cycle time associated with the cut after applying min-cut replication.
p=(u,...,v)
dv(v)
maxdv(v)
is defined to be the maximal combinational delay in a partitioned network. Because every cycle in G contains at least one register node, the cycle time is always finite. We denote by 4I ± maxdt (v)
Definition 2.3 The maximum gate delay along any combinationalpath p from u to v is denoted by combinational path
{ 6 (p) + D cr(p, V)},
max
combinational path p=(u,. .,v)
is the delay from the output of vo to the output of ve.
A(u, v)-
(,)
number of cut edges in p after applying min-cut replication to the partition V, we define
'Dv
Definition 2.1 Given a network G = (V, E), the function 6 : V - N assigns a gate delay 6(v) to every vertex v e V. The external edge delay D E N is a constant delay that is assigned to every cut edge in a partition; non-cut edges have zero delay. Choosing the external delay D to be unity and gate delay 6(v) = 0 for all v E V results in the unit delay model of [6].
/-
k
,v)
is defined to be the maximum combinationalpath delay (gate plus external) to the output of v. Letting cr(p, V) be the
107
Proposition 3.2 Design
i. Min-cut replication never increases delay in combinational networks or in sequentialnetworks if no registers are replicated.
MCNC c1355 c1908 c3540 s1238 c2670 c5315 c6288 c7552 s13207 s15850 s35932 s38584 7 s53 8 s9234 Industrial addresspart cat control lookl240 pdt vrcl biga entmisc gme-a seq avg
ii. If registers can be replicated, min-cut replication can increase the delay by at most D. Hence, 4§r < (v for combinational networks and 4)r (v + D for sequential networks. 4
<
RESULTS: CYCLE TIME REDUCTION
By Proposition 3.2, it is possible that min-cut replication can increase cycle time by an external delay D, but we have found that in practice, it never increases cycle time, and it in fact often decreases it. This is consistent with intuition, since by removing cut edges, min-cut replication removes cut edges along many paths, possibly critical paths. This can be demonstrated empirically under the unit delay model. Although simplistic, the unit delay model suffices to show that the maximum number of cut edges along any path in the network can be reduced by min-cut replication. Using TAPIR [5], we partitioned the fourteen largest designs in the MCNC Partitioning93 benchmark suite as well as eight designs obtained from Actel. The partitions were generated in a sequence of rounds that maintain a set of components, terminating when all components satisfy the capacity constraints. Initially the entire design is a partition component. In each round, the largest infeasible component is selected and bipartitioned using the Fiduccia-Mattheyses algorithm [3]. Then the bipartition defined by every pair of components in the partition is also refined using FM. If there is an infeasible component, the next round begins, otherwise the algorithm terminates. After partitioning, the cycle time 4part is calculated as the maximum number of cut edges along a path from a primary input or register to a primary output or register: (Drep is the cycle time after applying min-cut replication. As can be seen from the data in Tab. 1, min-cut replication is effective in reducing unit delay. For 16 of the 24 input designs, replication reduces the cycle time, with an average reduction of 26% taken over all the designs. In no cases did replication increase the cycle time. We note that TAPIR incorporates a delay oblivious implementation of min-cut replication; if the underlying partitioning routines were timing driven, min-cut replication would expressedly aim to reduce delay in addition to cut size. 5
RESULTS: MIN-CUT REPLICATION VS. CLUSTERING
The problem of partitioning for minimum delay has been solved if replication is allowed, although interestingly, it remains open if replication is not permitted. In this section we compare a straightforward min-cut approach implemented in TAPIR [5, 4] with an 'optimal' min-delay clustering algorithm implemented in the program sis-cluster [12, 11]. The min-delay clustering algorithm, valid only for acyclic networks, consists of two phases. In the first phase, each vertex is labelled with the minimum delay over all clusterings in the subgraph consisting of the vertex and its predecessors. In the second phase, the labelled nodes are grouped together greedily, in reverse topological order. If a node is an ancestor of nodes in distinct clusters, it is replicated. Essentially, the algorithm unrolls a directed acyclic graph and replicates all overlapping fanin cones. This replication increases the network size by over an order of magnitude, so
Partitioning FPGAs
1 Replication bars
Ji
1
.p
a
I
6 5 12 8 4 8 4 5 12 13 24 28 8 7
6 6 8 8 5 5 13 5 4 10 4 5 4 5
5 6 6 0 4 4 10 4 4 6 4 5 3 5
0.17 0.00 0.25 1.00 0.20 0.20 0.23 0.20 0.00 0.40 0.00 0.00 0.25 0.00
6 3 6 6 4 3 10 10 7 6
22 2 4 3 2 3 5 62 19 4
7 2 3 1 2 3 3 24 12 3
0.68 0.00 0.25 0 67 0.00 0.00 0.40 0.61 0.37 0.25 026
Table 1. Unit delay reduction from min-cut replication.
[
I Tapir
-mpts
delay D | c1355 c1908 c3540 c2670 c5315 c6288 c7552 c880
Table 2. nents.
5 6 11 15 22 15 26 5
TAPIR vs.
[
sis 4
'In'mpts
2
6
8
10
7 11 16 22 39 46 48 7
12 22 15 29 41 71 49 7
12 23 12 29 40 92 46 6
10 23 13 34 40 99 44 5
10 23 15 35 41 97 44 5
sis-cluster partition compo-
sis-cluster applies a heuristic procedure to merges components and reduce the network size. We used the MCNC ISCAS85 Logic Synthesis benchmarks for the comparison [1], since the available version of sis-cluster did not parse the Partitioning93 benchmark suite, specified in Xilinx's xnf netlist format. The sis-cluster partitioner has input parameters including component size, pins, and the external delay, currently assuming unit delay for every node in the network. Each of the designs was partitioned with size 200 and 50 pins, since otherwise the relatively small designs in the ISCAS85 suite led to trivial partitions (similar results were obtained using gate capacity 100 and pin capacity 50). TAPIR partitions were generated by combining min-cut partitioning and min-cut replication as described in [5] to reduce partition size. The external delay D was varied from 2 to 10, a representative range for many multiple-FPGA partitions (every internal connection has unit delay). For instance, the ratio of external delay to internal delay typically lies between 3 and 7 for an emulated circuit implemented in the Xilinx family of FPGAs [10]. Tab. 2 contains the number of partition components for
108
delay D
[
c1355 C1908 c2670 c3540 c5315 c6288 c7552 c880 I
_ _ _ _ _
6
60 92 78 104 110 274 94 56
70 102 90 116 120 300 100 64
80 112 102 128 130 326 106 72
50 82 66 96 100 252 88 50
50 84 68 100 103 254 88 50
l
c1355 C1908 c2670 c3540 c5315 c6288 c7552 C880
Table 3.
lTapir 4
2
11I
8
101
90 122 114 140 140 352 112 80
100 132 126 154 150 378 118 88
b SiS-Clo 52 50 86 88 70 72 102 104 104 106 256 258 88 88 50 50
54 90 76 106 108 260 88 50
TAPIR VS. sis-cluster
cycle time.
partitioned designs. delay increases essentially linearly with the external/internal delay ratio, since increasing the ratio simply adds a delay for each interchip signal - the partition itself does not change (although the critical path may). From the data, we observe that in the range of external to internal delay ratios that arise in practice for FPGAbased logic emulation systems, the time/area tradeoff may in fact sometimes favor a min-cut partitioning/replication approach over delay optimal solutions such as [11]. Certainly the results are sufficiently encouraging to suggest that by incorporating timing information into the partitioning and replication algorithms, one can expect a min-cut replication approach to produce substantially smaller partitions with competitive delay characteristics. 6 FUTURE IMPROVEMENTS Despite TAPIR'S delay obliviousness, we observed that a min-cut approach to partitioning with replication produces substantially smaller partitions with modest delay penalties. Clearlv the effect of min-cut replication depends heavilv upon the initial partition, and some work has been done to combine replication with determining the partition [8, 7]. We have tried several strategies for deriving partitions without replication from the delay-optimal clusterings produced by sis-cluster, including merging components to
eatonal delay
Figure 4. TAPIR vs. cycle time.
sis-cluster components and
each design and Fig. 4 contains a plot of the average ratio AF
#FPGAs with TAPIR #FPGAs with sis-cluster
of partition components for TAPIR and sis-cluster, as a function of the ratio of external delay to internal delay. Over a realistic range of delay ratios for FPGA partitioning, TAPIR generates partitions with about one half the number of components as sis-cluster, which performs the merging after clustering. Tab. 3 shows the cycle times for each partitioned design and Fig. 4 contains a plot the average ratio of cycle times
minimize cut size, merging components along critical paths, unreplicating nodes into the clones that minimize cut size, and unreplicating into min-delay and max-delay clones. No combination of these approaches we tried produced uniformly better results than TAPIR's delay obilivious min-cut partitloner, and in many cases, for most values of external delay D, after min-cut replication, TAPIR produced partitions with less delay. However, we expect that combining performance-driven partitioning with min-cut replication will yield smaller partitions than the algorithms in [11, 12], with competitive delay. A combined min-delay/min-cut partitioning heuristic can be incorporated in the min-cut replication algorithm as described in [5], adding a performance-driven capability to min-cut replication. This paper presented a first step in assessing this approach, by comparing a simple implementation of partitioning with replication (both delay oblivious), with the min-delay clustering approach. ACKNOWLEDGEMENTS The authors would like to thank Hannah Yang for providing her program sis-cluster, as well as answering questions
regarding its algorithms and use. We also thank an anonymous reviewer for correcting an error in the original version of the paper. REFERENCES [1] Franc Brglez. MCNC Partitioning93 benchmark suite. Microelectronics Center of North Carolina, 1993.
ITAPIR lsis-cluster
[2] Jason Cong and Yuzheng Ding. An optimal technology mapping algorithm for delay optimization in lookuptable based FPGA designs. In Digest of Technical Papers, ICCAD-92, pages 48-53, 1992. [3] C.M. Fiduccia and R.M. Mattheyses. A linear-time heuristic for improving network partitions. In Proceedings of the 19th Design Automation Conference, pages 175-181, 1982. [4] James Hwang. Replication in Partitioned Networks. PhD thesis, Stanford University, 1995.
as a function of the ratio of external to internal delay. As expected, the delay in the TAPIR partitions is larger than sis-cluster, which produces either optimal or close to optimal partitions. However, when the external delay D is less than four times the internal delay, TAPIR'S partitions are on average about 20% slower than those for sis-cluster, and when D is seven times the internal delay, cycle time is still only about 40%A slower for TAPIR partitions. In the TAPIR
109
[5] James Hwang and Abbas El Gamal. Min-cut replication in partitioned networks. IEEE Transactions on CAD, V-14(1):96-106, January 1995. [6] E.L. Lawler, K.N. Levitt, and J. Turner. Module clustering to minimize delay in digital networks. IEEE Transactions on Computers, C-18(1):47-57. January 1969. [7] L.-T. Liu and M.-T. Kuo and C.-K. Cheng. A replication cut for two-way partitioning. IEEE Transactions on CAD, V-14(5):623-630, May 1995. A cell[8] Chuck Kring and A. Richard Newton. replicating approach to mincut-based circuit partitioning. In Digest of Technical Papers, ICCAD-91, pages 2-5, 1991. [9] R. Murgai, R.K. Brayton, and A. SangiovanniVincentelli. On clustering for minimum delay/area. In Digest of Technical Papers, ICCAD-91, pages 6-9, 1991. [10] Quickturn Design Systems, Inc. private communication. [11] Rajmohan Rajaraman and D. F. Martin Wong. Optimal clustering for delay minimization. In Proceedings of the 30th Design Automation Conference, pages 309314, 1993. [12] Honghua Yang and D.F. Martin Wong. Area/pinconstrained circuit clustering for delay minimization. In FPGA '94 Workshop. IEEE and ACM, 1994. [13] Honghua Yang and D.F. Martin Wong. New algorithms for min-cut replication in partitioned circuits. In Digest of Technical Papers, ICCAD-95, pages 216-222, 1995.
110
TWO-DIMENSIONAL DATAPATH REGULARITY EXTRACTION Raymond X. T NijssenI and Jochen A. G. Jess 1Design Automation Section/ES' Eindhoven University of Technology, The Netherlands [email protected]
flows for certain parts of the circuit not only add cost and integration overhead, but also seriously decrease generality and flexibility. Furthermore, while such dedicated tools yield dense layouts of fully regular circuitry, they rapidly perform worse as the circuit is less regular, causing considerable area waste due to their limited flexibility [12]. This leaves a large class of circuits which would benefit from a regular placement with the same cell library as in the rest of the circuit, but for which neither dedicated systems, nor general layout systems produce satisfying solutions. Among the first addressing this open field, Odawara [11] proposed a methodology which was later refined [8][2][3]. This method is based on improving placement by searching logical designs for a structural characteristic feature typical for datapaths, namely bit-latches repeated over all bits connected via the same terminal type at each latch to one common net. A cell cluster, called location macro, is then grown around all such groups so as to serve as placement initializers for subsequent conventional standard cell layout generation. A similar method [14] uses primary outputs instead of latch chains attempting to find strongly connected subcircuits called cones in which all cells have a path to the same primary output. While both approaches yield some gain in terms of density and run-time over general placement, they are fundamentally unable to fully extract datapath regularity because they disregard the essentially two-dimensional nature of this feature. Consequently, the resulting placements are still not nearly as regular as those produced by dedicated datapath synthesis tools, hence the potential benefits of datapath regularity are only partially exploited. So far, no method is known to us from literature that is capable of extracting this two-dimensional structure which is needed for generating truly regular placements similar to those made by dedicated design flows.
ABSTRACT This paper presents a new method to automatically extract regular structures from logic netlists containing datapath circuitry. The goal of datapath extraction is the exploitation of structural regularity to efficiently obtain regular placements which are typically more compact. Datapaths constitute increasingly sizeable parts of ever more and larger circuits, hence flexible technology-independent layout tools, unlike state of the art datapath compilers, will become critical in the design flow. Our method transforms a circuit's existing functional hierarchy, if any, into a 2-dimensional hierarchy that is more suitable for subsequent cell-placement, thereby also automating the currently mostly handcrafted task of selective partial hierarchy flattening. Once the two-dimensional structure is known, the remaining placement task is greatly reduced to arranging just one row and one column of the discovered matrix-like structure, allowing for much larger circuits to be placed in one go. Experiments show superior extraction results compared to existing approaches. 1 INTRODUCTION Bitwise parallelism has become the predominant technique in the design of datapaths in high performance data processing circuits. Due to the repetition of per-bit operators across the width of the data representation, both interconnect structure and component geometries of datapath circuitry are inherently regular. These effects can be exploited to obtain high density layouts as reported in [5] and in other publications. However, the current two mainstream placement methods Gordian/Domino [9] and TimberWolfSC [13] are fundamentally unable take advantage of this structural regularity because these methodologies are based on optimizing objective functions in which regularity cannot be expressed. Several fully tailored datapath synthesis environments called datapath compilers using specialized standard cell libraries like [4] have been developed to answer this need. These systems explicitly put in regularity at the logical level and deal with this information in a very explicit manner throughout the entire design flow down to the layout phase using specialized tools and dedicated cells. An important drawback of such separate technology dependent design
2 CONTRIBUTIONS OF THIS PAPER We have developed a fast and efficient technique to automatically extract the two-dimensional datapath regularity from circuit netlists enabling explicit placement of the extracted circuitry as regular as by fully dedicated systems. While performing the extraction, the netlist is decomposed to form a new hierarchy that matches placement criteria much more closely than, if available, the usual functional hierarchy-implied locality used by most other placement methods. The target hierarchy is based on both the interconnect
*This research was supported by ESPRIT BRA 6855 LINK
111
I
CONTROLLER
Z7>
---S I.-
I
MULTIPLIER
.- - - - - - - - - -
Figure 1. Circuit hierarchy transformation structure and the physical geometry of the cells, namely blocks with discovered regularity, a glue logic part and any number of large hard macros. Figure I illustrates the effect of this transformaton on the floorplan. Note that this transformation, selective hierarchy flattening so as to obtain macros containing a suitable number of more or less related cells, is still mostly carried out by hand. The method described in this paper automates this task. Unlike the other approaches mentioned, the regular parts of circuitry generated by conventional non-dedicated synthesis tools are placed regularly, hence densely. Moreover, the transformed hierarchy reduces the solution space of the placement, allowing for much larger circuits to be placed in one go than without extraction. In addition, regular placement of regular structures is known to facilitate accurate clock and data skew control. Note that our approach is not technology dependent like dedicated datapath compilers, which enables to seamlessly integrate regular and non-regular circuitry, thus helping to prevent waste area. Furthermore, we believe that datapath placement using standard cells as against specialized cells will pay off even more as more routing layers are available. As depicted in figure 2, the proposed regularity extraction and hierarchy transformation method is an add-on which is plugged into a conventional design flow after the logical netlist generation, before the layout phase. The regularity extraction effectively performs a multi-decomposition of the circuit, yielding a restructured netlist, as well as the discovered 2-dimensional structure, if any. The remainder of this paper is organized as follows: The next section provides some necessary terms and preliminaries on datapath regularity. The modeling of datapath regularity we use is presented in section 5. Section 6 introduces a metric quantifying the extent of regularity of the circuit surrounding a partially reconstructed datapath. This metric guides the search-wave used by the regularity extraction algorithm presented in section 7 to expand into the most regular extension. Expenmental results are presented in section 8 Finally, in section 9 conclusions and remarks are given. 3
Figure 2. Extended Design Flow At the same time, the highly similar if not identical bit slices of the datapath are stacked alongside. Perpendicular to the slices, cells of the same type occurring at similar places in all slices are forming a datapath stage. The circuit is thus fitted onto a matrix of rectangular buckets containing the cells, where each slice coincides with a row, and each stage coincides with a column. The fact that all cells in a stage have the same type, hence form guarantees zero cell width variation per column. At the same time, as standard cells occupy only one row of transistors, the height variation within the rows is also negligible. Together, both properties establish a high degree of geometrical regularity yielding maximum density cell placement. Note that above properties are also found in many other popular layout styles.
PRELIMINARIES
Crucial to this approach, in addition to geometrical regularity, the interconnectregularity of datapaths have the following property: (almost) all nets running through the matrix are fully contained either within one slice or within one stage. This is caused by
Datapath cell-placement essentially maps the structural regularity onto topological regularity by cell alignment in 2 directions. Figure 3 shows a part of a fully regular 4-bit wide datapath. Cells associated with the same bit-slice are lined up honzontally.
112
slices
Figure 3. An ideally a ligned datapath * glue logic including insufficiently regular circuitry
the perpendicularity of data and control flows. Because of this orthogonality of the interconnect structure, the composition of each column is not affected by swapping rows in the matrix, and likewise for swapping columns. Under this interconnect orthogonality condition, ordering optimizations of rows and columns are mutually independent tasks that can be carried out in separate steps. The more nets violate this, the less valid it becomes to treat column and row orderings independently. Considering that ordering only one row and one column directly yields the complete relative placement of the entire matrix, the complexity of placement of datapath circuitry is thus reduced very significantly from one general 2-dimensional placement problem of all datapath cells at the same time, to two independent much smaller linear arrangement problems of just one single row and one single column. While the problem of regular placement remains NP-complete, the problem size is drastically reduced by many orders of a magnitude, as compared to the general placement task that would otherwise have to be carried out. Even for the small circuit in figure 3, the reduction ratio amounts to (8 x 4)!/(8! x 4!). This vast placement problem size reduction clearly already allows for much larger circuits to be placed in one go. Simplifying the task even further, the typical interconnect between the slices is such that ordering the slices with respect to each other is mostly straightforward. The linear arrangement problem under various constraints is a well known problem from literature, eg. [7][10], [I] or [6], which is therefore not elaborated on in this paper. 4
In addition, the extracted regularity is described by two decompositions of the datapath part, namely a set of stages and a set of slices. Figure 4 shows the result of this process. The main objective of this process is to maximally satisfy the orthogonality condition and regularity goals. This objective implies that all extracted bit slices will be identical or highly similar. 5
REGULARITY MODELING
Given a circuit as a set of modules M nets N and pins P C M x N. Each module m E M is an instantiation of a module-type ti. Each pin p = (m, n) E P instantiates a terminal-type T(p) = r7 of m. Importantly, any terminal-type uniquely belongs to one single function-type. For convenience, let E = M U N be the set of circuit entities. The desired datapath regularity information of the circuit can be fully described by two separate decompositions of M and N into a number of stage sets si of entities and a number of slice sets bj. Any entity occurs in exactly one slice set and exactly one stage set at the same time. Consider figure 5 showing a part of
PROBLEM FORMULATION
To be able to perform datapath placement in the above way, the membership to both one slice and one stage for each cell belonging to the datapath must be known. This information is generally completely or largely unavailable, inconsistent or even, placementwise, unreliable in most design flows. It must therefore be extracted automatically from the netlist before placement. This task results in a decomposition of the circuit into * a number of datapath chunks containing regular circuitry Figure 5. Part of a datapath
* large and/or prefabricated macros like memory blocks
113
Z C
rm.
unexpandable (leaf cell
expandable module
'Em
stages
[Es
slices
Figure 4. Regularity induced circuit hierarchy transformation an example datapath circuit and a reference stage s, = si. The pairs of nets {nl, n2}, {n 3 , n4} and {ns, ne } are each in a distinct slice, bl, b2 and b3 , respectively. Together, they form stage sl = {{fnl,fn2}, {n 3 ,n 4 }, {n 5 ,n 6 }},outlinedinthefigure. Note that a slice within a stage is actually is set of entities. The function S: E - N returns the unique stage index i of the entity which is in stage si. All entities that are not (yet) part of any stage are in the complement stage set s?. Recall that for alignment, all modules in the same stage s, have the same type, but note also that there may be many other entities with that type outside si. Likewise, entities in b? are not (yet) member of any slice, and function B : E - N returns the slice index of an entity. All entities are initialized with an undefined stage/slice membership: s? = b? = E. Our modeling is founded on the basis that datapath regularity in a circuit is an essentially relative notion, in the sense that it is expressed in terms of certain attributes of the interconnect structure between the entities in a current reference stage that is known to be regular, referred to as Sr, and entities outside s,. Many different sorts of netlist attributes that to some extent characterize datapath regularity can be distinguished. The most obvious attribute is the terminal-type associated with a pin between two entities. In addition, the degree of the adjacencies, their use (eg. signal flow direction), and possibly even explicit annotations concerning buses may be used if available. The set of attributes used for characterizing datapath regularity of a connection p = (el, e2) between entities e1 and e2 is called generally the regularity signatureor RS of p, denoted R(p). Using more characteristics may help reducing certain ambiguities, thereby possibly increasing the amount of regularity found. In practice, using only terminal-type attributes already provides sufficient information to be able to extract almost all regularity present a netlist, hence R(p) = T(p). This is because some of the other attributes are partially implied by T(. Nonetheless, the description in the next section is kept general to be able to accommodate more comprehensive signatures in the model. The extent of regularity between sr and its adjacent entities that are connected via incidences of the same RS is now determined by
the nature of the statistical distribution of the frequencies of that RS over the slices of s,. A uniform distribution corresponds with maximum regularity. For example, in figure 5, the incidences via the same terminaltype r2 to modules adjacent to those in so are clearly uniformly distributed over its slices bl, b2 -and b3 . Hence, the modules m2, m 3 and m4 which are of the same type t4 associated with r2 have a regular interconnect structure towards s,. The same does obviously not apply to the module of type t5. Entity types like t4 are called multi-slice types. These essentially form datapaths if the associated entities m2, m3 and m4 are repeated over the width of the datapath. Alternatively, this may be due to a single multi-slice entity, incident to multiple slices, like net n7 or module mi. In that case, it may be a non-expandable block such as a hard macro, so its slice membership will be left undetermined, e E b?, while it does belong to some stage. Otherwise, the multi-slice entity may even contain another datapath block which may also be considered by expanding it into the current circuit level. Finally, the two decompositions S and B of E can thus be inferred by repeatedly composing new reference stages if they are sufficiently regular. 6
LOCAL REGULARITY METRIC
In order to be able to quantify the extent of regularity between the bitslices in the current reference stage sr and the RSes of the connections to the neighborhoods of all members of s,, a numerical relation between the occurrence of each RS in the neighborhood and each bitslice in this reference stage is formulated. Only notknown entities in these neighborhoods are considered. An entity e is said to be known if at least its membership to a slice or a stage are known, so e ss, A e i b,. The analysis proceeds as follows: Suppose entity e is known to be in stage s,. Let P(e) denote the set of pins of e, then the set of RSses adjacent to s, is given by R(s,) =
U CEs,.PEP(e)
114
R(p)
Next, we use the function structure between the slices in
to express the connectivity and the RSses:
F(sr)
Sr
r(sr) : B(sr) x R(sr) -
2P
where B(sr) = U
B(e)
eEs,
is the set of slices that are found in the reference stage. r(sr) is formally defined as r(sr, b,, r,) = {p E P(e)Le e Sr n bi A R(p) = r,} Thus F(sr, b,, r, ) returns the set of pins attached to entities in slice bi of stage sr that have RS r,. The complete bipartite graph in fig-
PINSET
SIGNATURES
SLICES -
--
-
(bI)'
'Ti
(nl,n2)
tl
tr2
-t4
{n3,n4}
b2
In general, the uniformity of the distribution of X decreases as the corresponding regularity decreases. The simplest uniformity R - R measure of the number series X is its range L: w is the where min,(x[i]), = maxi(x[i]) L(X) defined as number of entries of X. Considering only the range would already suffice if only fully regular relations need to be detected. For instance, L(X(si, ri)) = 0 implies complete regularity, while L(X(si, r3 )) = 1 indicates non-regularity. The range does not provide much information about the extent of irregularity. For instance, L([1,1,1,1,1, 0]) = L([1, 0,1,1, 0, 0]) = 1, whereas the former vector is clearly preferable over the latter. To be able to distinguish between large and smaller irregularities, we also consider the number Z(X) of zero-entries in X and the average X of the vector in a sum of weighted terms. We propose the following local relative regularitymetric p(sr) R - R between stage sr and signature ri defined as follows: p(sr, ri)
= CZZ(X(Sr,
ri))+cLL(X(sr, ri))+ca,(X(sr, ri)-1)
where cz, cL and cay are weight factors, chosen such that aliasing between the terms cannot occur. In our experiments, we used 10000, 100 and 1, respectively. The metric has following important properties: p(sr, ri) is inversely proportional to the extent of regularity from Sr with respect to its adjacent cells with signature Ti.
* Maximally regular: p(Sr,
_t5
,
t3
{}
* Maximally irregular: p(s, ri ) = °° * The value of p(Sr, ri) increases monotonically as the regular-
n5,n6)
i.[ ' .
ity decreases These properties enable comparisons of the extent of regularity between different stages of the datapath and between different signatures making it suitable for the regularity extraction algorithm described in the next section.
Figure 6. Signature to bit-relation graph r(s 1 ) ure 6 depicts r(s. ). The pinsets implementing the adjacency of the elements in the respective classes are shown on the edges. For example, if ri = r1, then I(sl, b2 , ri) = {pl, p2}. We can now quantify the extent of regularity of the neighborhood of sr with regard to RS ri by interpreting a the distribution of the numberof pins to the individual slices of Sr. We therefore construct a score vector X(sr, rl) in which entry z[i] holds the connection count between bitslice bi of s, and signature class ri, hence 2[f(rs"
rT)= 0
7
REGULARITY EXTRACTION ALGORITHM
Our regularity extraction algorithm works by expanding searchwaves through the network, stage by stage. It uses the relative regularity metric introduced in the previous section to determine how to expand the wave such that every expansion is as regular as possible, while remaining able to deal with a certain amount of nonregularity. Suitable initializing reference stages can be found using another characteristic of datapath circuitry present in a subset of candidate stages, namely the occurrence of many nets that satisfy the condition it is connected once to one terminal type, and multiple times (typically 4 or more) to one other terminal-type. For example, see net n7 in figure 5. This datapath property is due to the fact that datapaths are formed by repeating bitwise operators that are operated in parallel. Such nets typically carry the control signals that apply to all bits of the datapath like clock lines, enable lines, multiplexor address selectors, etc. Any such net with a high numberof pins may induce a suitable first reference stage. Altematively, the user may explicitly specify initial reference stages.
rl) = Ir(sr$b,, ri)I
These counts may vary from many times in all slices to zero in all slices except one. A uniform distribution of all elements of X (sr, rl) corresponds to maximum datapath regularity at stage Sr with respect to the adjacent entities in rl. For example, the perfect regularity between stage si and the modules of type t 1 and in the circuit of figure 5 is reflected by X(Si,rl) = [I{Pl,P2}1,I{P6,P7}1,l{Pll,P12}1] = [2,2,2] Conversely, regularity deviations are manifested by non-uniform = 73 , since distributions of X, like incidences with r3 X(si,r3) = [1,1,0].
115
8
Some particular non-regularities occur in most circuits, such as some bits, notably MSB and LSB which are different at some spots. The extraction algorithm will usually still be able to expand the wave, and since the wave often encloses irregular spots from several directions, entities in non-regular parts of the datapath will be fit into a suitable position later. The algorithm is outlined below:
RESULTS
We implemented our algorithm in C++. The regularity extraction and hierarchy transformation tool is part of a larger framework under development, aimed at performing fully automatic placement and routing in an environment where the designs were automatically generated from an abstract specification where human intervention in the synthesis backend will no longer be a viable option. Input to the program is a EDIF netlist file which may or may not be hierarchical. Figure 2 shows the relevant part of the system. Output are the restructured netlist in EDIF, and a file describing the regularity found. The latter file can then read programs that perform both linear orderings. The partial placement is then supplied to a standard placement and routing backend to complete the placement. Since the emphasis of this paperpertains to regularity extraction, we did not elaborate on the two subsequent linear orderings. Lacking a general way to quantify the success of regularity extraction of circuits that are not completely regular, we used indirect metrics indicating the usefulness of the results, namely the percentage of regular circuitry. Table I presents some results of the extraction algorithm on a number of examples. These times were measured on a HP9000/735 workstation. In all examples, we used the default value of all tunable parameters. The first 3 circuits are automatically generated by an HLS system. TTA and 8048 are microprocessor cores. Circuit CDFilter is a signal processor for CD audio. The remaining circuits come from the standard cell benchmark set. The percentage of the total number of cells assigned to the datapath by the extraction process should be interpreted with care, since some circuits include controllers and other non-regular circuitry. In most benchmark netlists, the identifiers are stripped so that they do not provide information regarding the curcuit's structure which could have served as a reference. One notable advantage of a nonflattened circuit description is that they contain more multi-slice modules, which can be automatically selectively opened to keep memory requirements low. Note that not all extracted slices have to be identical.
1. Find as many as possible seed-stages 2. If there are no (more) seeds, exit 3. The seed-stage with the highest number of slices is selected as the first s, to start a search-wave. 4. Build F(s,) 5. Compute p for every RS in F(s,.) 6. If threshold not satisfied goto 8 7. Enter the pinset returned by r(sr) in queue Q keyed by p. 8. If Q empty Goto 2 9. Extract the pinset from Q with the lowest p 10. Create a new stage 11. For each pin p in the pinset Add the entity connected to via p to the new stage in the slice inherited via p from the reference stage. 12. The new stage becomes the reference stage s, 13. Goto4 A number of threshold values can be are used to control the expansion process. The algorithm does not work well if there are too few slices. A minimum datapath width of 4 slices seems sufficient. Waves that die before a configurable minimum of stages is reaches are discarded, etc. Also, if the extent if irregularity exceeds a tunable value, the current candidate stage will be dropped. The thresholds and weigh factors can be set such that the algorithm will only find fully identical slices, if present. A post-processing phase resolves undefined stage and slice tags for entities for which, a posteriori, a clear choice can now be made. This means that if for a module, a slice and stage tag is induced by a majority of its environment, and if the conditions for it being part of a datapath are met, it will still be added to the datapath. Otherwise, it is identified as being part of insufficiently regular logic. The run-time complexity of our algorithm is only O(I PI) since every pin is analyzed at most once from a net, and once from a module. Actual run times may even be significantly smaller, since the search-wave can never expand into non-regular areas of the circuit, hence no time is wasted in non regular circuitry. The space complexity is basically determined by the number of candidate extensions in the wavefront which takes just a very small amount of storage.
9
CONCLUSIONS AND REMARKS
This paper presents a very fast new technique for datapath extraction. It is based on a new metric quantifying the extent of regularity between a known regular part of a datapath and its neighborhood. A search-wave guided by this metric constructs the rest of the datapath regaining its 2-dimensional regular structure, allowing fast, dense and technology independent placement of the datapath's cells. The algorithm can deal with large circuits that need not be fully regular. Note that minor irregularities in datapath circuits such as carrylook ahead logic per 4 bits in a 16 bit wide datapath have a minor effect on the usefulness of the results regarding subsequent placement for two main reasons. The first reason is that the postprocessing takes care of the larger part of these cases. Secondly, the remaining cells which might qualify for being placed in the datapath will, if sufficiently strongly connected to other cells which
16
Circuit name wave digital filter diffeq8 elliptic8 register file i8048 w/ ctrl w/o mem TTA- 16 CDFilter struct fract biomed avq-large avq-small
total t cells 9180 1273 1857 730 948 6720 7218 1888 125 6417 25114 21854
e regular cells found 8041 855 1370 694 333 5418 5088 1879 72 5458 18928 16451
regular % 87% 67% 74% 96% 35% 80% 70% 99% 58% 85% 75% 75%
: DP chunks 5 1 2 2 2 9 12 2 1 1 1 1
MAX width 32 8 8 8 8 16 42 16 9 20 16 16
time (sec) 6.7s 0.5s I.s 0.4s 0.7s 5.6s 4.7s 1.3s 0.Is 1.9s 8.Os 7.2s
Table 1. Datapath extraction results were already explicitly preplaced regularly, be pulled into the regularly placed area because of the wire-length reduction performed by placement tool. Finally, in the simplified layout model we used, subsequent placement is assumed to be row-based with only one single row of standard cells per bit slice. Clearly, in case of a very large number of datapath stages compared to the number of slices, the aspect ratio of the datapath matrix may become unfavorable with respect to the global floorplan of the chip. Allowing 2 or 3 rows per slice can greatly alleviate this effect while hardly affecting the advantages of regular placement generation. Alternatively, the datapath can be folded.
[8] M. Hirsch and D. Siewiorek. Automatically extracting structure from a logical design. In Proceedingsof the International Conference on Computer Aided Design, pages 456459. IEEE, 1988. [9] J.M. Kleinhans, G. Sigl, F.M. Johannes. and K.J. Antreich. Gordian: Vlsi placement by quadratic programming and slicing optimization. IEEE Transactionson ComputerAidedDesign, 10(3):356-365, 1991.
REFERENCES
[10] H. Nakao, 0. Kitada, M. Hayashikoshi, K. Okazaki, and Y. Tsujihashi. A high density datapath layout generation method under path delay constraints. In Proceedingsof the Custom Integrated Circuits Conference, pages 9.5.1-9.5.5. IEEE, 1993.
[1] T. Asano. An optimum gate placement algorithm for mos one-dimensional arrays. Journal of Design Systems, 6(1):127, 1982.
[11] G. Odawara, T. Hiraide, and 0. Nishina. Partitioning and placement technique for cmos gate arrays. IEEE Transactions on ComputerAided Design, CAD-6(3):355-363, May 1987.
[2] H. Cai, S. Note, P. Six, and H. De Man. A data path layout assembler for high performance dsp circuits. In Proceedings of the Design Automation Conference, pages 306-311. ACM/IEEE, 1990. Paper 18.1.
[12] Leveugle R. and Safinia C. Generation of optimized datapaths: bit-slice versus standard cells. IFIP TransactionsA, A22:153-66, Sept. 1992.
[3] C.E. Cheng and C.-Y. Ho. Sefop: A novel approach to data path module placement. In Proceedings of the International Conference on ComputerAided Design, pages 178181. IEEE, Nov 1993. [4] Compass Design Automation. CompassDatapath Compiler, v8r3 edition, 1991. [5] Marshburn et al. Datapath: a cmos datapath silicon assembler. In Proceedingsof the Design Automation Conference, pages 722-12. IEEE, 1986.
[13] C. Sechen and K.W. Lee. An improved simulated annealing algorithm for row-based placement. In Proceedingsof the International Conference on ComputerAided Design, pages 478-481,1987. [14] Y.-W. Tsay and Y.-L. Lin. A row-based cell placement method that utilizes circuit structural properties. IEEETransactions on Computer Aided Design, 14(3):393-397, Mar 1995.
[6] C.M. Fiduccia and R.M. Mattheyses. A linear-time heuristic for improving network partitions. In Proceedingsof the Design Automation Conference, pages 175-181,1982. [7] S. Goto, I. Cederbaum, and B.S. Ting. Suboptimum solution of the back-board ordering with channel capacity constraint. IEEE Transactions on Circuits And Systems, 24(11):645652, Nov 1977.
117
HIERARCHICAL NETLENGTH ESTIMATION FOR TIMING PREDICTION Gerhard Zimmermann 2
Wolfgang Hebgen1 1
Rost+Partner, Kaiserstr. 42, D-60329 Frankfurt, Germany e-mail: [email protected] Computer Science Department, University of Kaiserslautern. D-67653 Kaiserslautern, Germany [email protected]
ABSTRACT With decreasing feature sizes of VLSI chips the importance of wiring capacitances and resistances increases. Thus timing prediction has to include wire length information. Our goal is the estimation of the length of individual nets or even net segments based on hierarchical netlists and on properties of the layout primitives, e.g. standard cells. These data can be fed into a normal timing analyzer. Our basic assumption is that layout properties, regardless of the used placement and routing methods, can be modeled by slicing trees, which can be deducted from netlists by good partitioning algorithms. The assumption was successful for area estimation. This paper shows that the length of individual nets can be estimated with good confidence based on the same assumption. Individual netlengths are necessary if logic path delays and circuit performance have to be estimated. Prior work has not made as much use of the structural information in the netlists and therefore only made statements about statistical properties of the ensemble of all nets. The paper also shows experimental data and theoretical foundations to support the claims. But the properties of layout synthesis algorithms cannot be modelled analytically today and empirical knowledge has to be included in the models. A procedure using the theoretical model and empirical data is explained together with first experimental results. The paper has practical applications in VLSI chip design as well as provides further insight into the interrelation between layout properties and timing. The paper shows a snapshot in our current research activity and points out areas where further research is necessary.
1 INTRODUCTION Layout synthesis of VLSI chips has reached a very high standard in regard to chip area utilization. This is due to the quality of placement and routing algorithms for sea-of-gates and standard cell design styles. Non-hierarchical and hierarchical methods are used. Top down chip planning has been made possible by reliable area estimation. With decreasing feature sizes the influence of net lengths on overall path delays increases and can account for more than 50%. Therefore, timing issues have gained greater attention in layout synthesis research. The original assumption that a small chip area guarantees short wirelengths and therefore a short critical path length, has failed in many cases, as had to
be expected for statistical reasons. Therefore, layout synthesis systems have been extended by either putting higher weights on nets on possibly critical paths or by trying to maintain upper delay limits of these paths. Both methods have shown good results in non-hierarchical methods. Both methods require a prediction of possible critical paths. This, in turn, requires netlengths estimations to be realistic in submicron technologies. A by-product of predicting the critical path length is the prediction of performance. This is very important in view of increasing clock rate requirements. Performance predictions should therefore be available as early in the design process as possible to reduce the number -of expensive design iterations. In hierarchical layout styles with chip planning, nets or logic paths can traverse several cell blocks at several levels of the hierarchy. It is therefore necessary to plan the distribution of net delays or the slack between blocks in such a way that optimal overall timing properties can be achieved. Normally, in synchronous automatons, this optimum means the highest possible clock rate, which, besides good clocking schemes and clock distribution, depends on the delay of the longest path between storage elements. Such planning of the distribution is only possible if we have delay estimates of the unfinished parts of the layout, either unplanned or planned but not laid out. Regardless of the discussion - do we need hierarchical layout methods or not - they will be used at the upper limit of complexity of designs and in mixed cell type layouts. It is therefore desirable to achieve estimates with all the knowledge we have at each phase of a design and with as little effort as possible. Finishing the layout in a prototype fashion to get estimates is one method. The achieved results may be reliable, especially, if the prototype also becomes the final layout. But this method does provide no insights into the interrelation between layout properties and timing characteristics as our approach does. Our approach seeks to estimate the lengths of logic paths, starting at the moment when the structure of the chip is finalized (all schematics or netlists at all levels of the hierarchy are known), and to improve the estimates along with design decisions as they are made. Such decisions are made when the physical cell hierarchy is established (repartitioning), during chip planning phases, cell layout and chip assembly.
118
In this paper we concentrate on the first phase, before or after a cell hierarchy has been established. Even for this phase we are in the middle of research and can only show results for standard cell blocks. Therefore, this paper is meant to trigger a discussion instead of showing final results. The problem is academically and practically very difficult and we would like to see more research done in this area.
Fig. 1. Synchronous automaton with critical path.
A
n2
n3
t
2 PREVIOUS WORK Wire length prediction has a relatively long history, although more with the goal of predicting wiring space and routability and not many contributions. A good overview is given in /Han88/ and we will only mention a few papers here. Donath /Don79/ derived upper bounds for average wire lengths bases on Rent's rule /Lan7l/ and also considered wire lengths distributions on the same basis /Don81/. These models have been improved by Feuer IFeu82I and Sastry and Parker. In /SaP86/ it was shown that the theoretical model predicts a Weibull distribution for gate arrays which fits very well measured wire lengths distributions. Statistical models have also been used by Kurdahi and Parker to predict channel widths in standard cell blocks, using an average wiring length factor /KuP86/. Pedram and Preas could show that this factor is not necessary /PeP89/. All these methods used the wire length to estimate area. They make little use of the knowledge of the circuit structure and only use the number of nets. Keller describes hierarchical models for logic paths in a hierarchical design environment /Kel89/. He tries to abstract from the large number of nets in a block by characterizing the paths between its pins. But the problem of the high complexity of timing properties analysis and description remains. This paper is based on Hebgen's work /Heb95/ and adds stochastic models.
Fig. 2. Logic path example. have experimental results for this case. The presented model is not restricted to this case and does not make use of this assumption. It is clear that a block will contain complete logic paths as well as fragments. Thus we have to extend the notion of end points of logic paths to 1/0 pins of blocks also. Therefore, all nets are included in the estimation process. In Fig. 2 a logic path between the end points A and B is depicted. Nets nl ...n5 contribute to its delay. Here we assume that a net only contains one wire. In the implementation nets can be vectors of wires if they do not have to be distinguished in length. The individual contributions of nets to the path delay are assumed to be independent of each other. Nets with np > 2 pins can be split into np - I
net segments. Independent of the used timing
model the geometric length of these segments is the best we can estimate before layout and that is our goal. The only meaningful distinction we can make is to split this length in its horizontal and vertical component. In principle these segments can be used in RC-tree timing models. Currently we doubt that this is meaningful, taking the variance of the results into account. Further research is necessary for this purpose.
3 THE NETLENGTH ESTIMATION MODEL
3.1 The Slicing Model In order to estimate the length of nets we have to predict the result of layout synthesis. This seem to be impossible because of the many different algorithms and because of indeterministic results of some of the algorithms. Also, in hierarchical design environments, neither the shape of a block nor the position of its pins are known before chip planning. Fortunately, the layout results of different placement algorithms are at least similar in regard to achieved area utilization, although the layouts may look totally different. This result has been established in many benchmark experiments. We have made use of this property in our shape function estimation method IZim88I. We have chosen partitioning based placement as a representative for all other
Let us assume that the digital system is a synchronous automaton as in Fig. 1 and that the maximal clock rate is determined by the total delay on the critical path through the network between outputs and inputs of the storage elements. Since we do not know beforehand which path is critical, essentially all logic paths between storage elements have to be considered. In a hierarchical design environment, the system is partitioned into subsystems that can be assigned to printed circuit boards, MCMs, chips or blocks on a chip. We will only consider a hierarchy of blocks on a chip and further assume for this paper that the blocks are composed of standard cells, because this is easy to imagine and currently we only
119
A
B
Y2
C
hV
h-
D E
F
h-
G
I
x
(b) (a) Fig. 3. Oriented slicing tree (a) and a corresponding geometry (b).
Fig. 4. Example of a shape function with orientations and cell shape example.
methods, even if it may not deliver the best results today. This could be accounted for by parameter settings. Bipartitioning the circuit of a block, if applied recursively, results in a binary tree. We distinguish between two types of vertices in the tree: The leaves represent the primitives. If we assume the circuit of a block with standard cells as primitives, the leaves are the standard cells. The leaves can also be sea-of-gates cells, macro cells, or, in a hierarchical design environment, blocks at a lower level. We simply call the leaves cells. All other vertices are called nodes with the root node representing the block. The tree can be interpreted as a slicing topology or slicing tree. With orientation, ordering, and sizing the slicing tree can be transformed into a slicing geometry. Orientation decides on the direction of the "slicing line" that separates two sibling vertices in the tree. It can be horizontal (h) or vertical (v) and can be assigned to the parent node of the siblings. Ordering decides on the direction of the siblings relative to the slicing line and can be either top/ left (tl) or bottom/right (br), depending on the orientation. Ordering can be assigned to the edges of the slicing tree. Sizing assigns dimensions to the nodes such that its siblings plus wiring space fit into a node rectangle and the rectangles partition the rectangular block area. Sizing is the process of first calculating the shape functions for all tree nodes bottom-up and then selecting the proper shapes topdown. Fig. 3 shows an example of a slicing tree (a) and a corresponding geometry (b). One node has been enhanced to show that it represents the horizontal slicing line between (A, B) and (E, F) as well as the rectangle containing all four cells. On purpose the slicing tree in Fig. 3a is not ordered. The reason is that, from the netlist, we can derive optimal orientations based on the knowledge of shape functions of all leaf cells and the expected shape of the block. If the latter is not known, we can even find the orientations for all possible shapes of the block during the shape function generation process /Zim881. Fig. 4 shows an example of an estimated shape function of a node. All shapes on or above the solid and dotted line are possible. The lower left-hand comers are the shapes with minimal area. Orientations are
assigned to the corners. But we cannot decide on the ordering without further knowledge about the layout, especially the positions of pins on the block's perimeter. Thus, without ordering, the geometry in Fig. 3b is only one of many possible geometries of the slicing tree. For the shape function estimation, results are independent of ordering. The questions to be answered for timing prediction are: Is a slicing topology also representative for the length of individual wires? Since even different executions of the same partitioning algorithms may result in obviously different partitions: What are properties of the partitions that are the same for all different partitions of the same circuit and also for different layouts? How important is ordering? How reliable are wire length estimates? Before we try to answer these questions, we further extent on the estimation model. Let us assume that a good partitioning is representative for a good layout in the respect that strongly connected cells will be at short distance in the slicing tree as well as in the layout. The distance in the tree can be measured by the number of nodes on the shortest path between the cells, the distance in the layout by the Manhattan distance of the centers of the cells. Since the Manhattan distance is a good measure for the length of net segments connecting the cells, we have to relate the distance in the tree to the length accordingly. For this purpose we will define a new distance metric between leaf cells. Let V be the set of vertices of the slicing tree of block Bl with subset C being the set of cells c(i) and subset NO being the set of nodes no(i) of the tree with b representing the node of the area of the block. Let bio be the I/O pin frame of Bl. Then bio and b compose Bl as shown in Fig. 5. Let P be the set of all pins with subset P. the set of all internal pins pi(c(i), j) and subset Pio the set of I/O pins pio(j) of Bl. j is the index of a net n(j) and P = Pi u Pio Let N be the set of nets n(j) of Bl. A net is defined as the set of pins it connects: n (j) = {pi (c (i), j), pio (j) Ipi, pio e P} If n(j) contains no 1/0 pins we call it an internal net. If n(j) connects only two pins and one is a pio, we call it an I/0 net. If n(j) connects at least two internal and one 1/0 pin, we call it a mixed net.
120
S(
Fig. 5. Assignment of nodes to net segments and possible routes in the geometry. Let np(j) be the cardinality of n(j), that is the number of pins it connects. If np(j)>2 a net is split into np(j)-l segments s(ij) connecting two points of the net. Points can be pins or Steiner points. This process is made unique using the slicing tree. Each segment is assigned to a vertex i of the tree which fully contains the segment. This means that the two points either emerge from the two subtrees of a node or belong to the same cell. Fig. 5 shows an example. A point in the tree is either a cell or another segment of the net. This other segment is represented by its node. Because of the slicing tree the segments of a net build a segment tree that is a subtree of the slicing tree. We distinguish two types of segments: Primary segments connect two cells, secondary segments connect to one or two nodes. If we assume that a net or segment is wired within the bounding box of its pins, then a node or rectangle in the slicing geometry is the smallest node that geometrically contains a segment with all its subsegments. From Fig. 5 it is also clear that, because all 1/0 pins belong to bio, all 1/0 nets are assigned to node BI and in mixed nets all segments to 1/0 pins are also assigned to BI. Since we proceed bottom-up from the leaves to the root, the I/O segments are handled last. In this paper we only handle internal segments. Now we will try to answer the question: Is it possible to estimate netlengths with all the uncertainties of layout? For this purpose we conducted an experiment. We took the circuit "alu", a 32 bit ALU with 1015 standard cells and 1059 nets, and did the layout with a simulated annealing tool 50 times, with different start solutions, different 1/0 pin positions, and different aspect ratios. Then we extracted the lengths of individual nets for all cases and looked at the frequency distribution. Fig. 6 shows two results. Net_123 seems to support our assumption perfectly. Its length distribution is very narrow, which means, that its pins have about the same distance in all layouts. Net-42 does support the assumption not as well, but still good enough, if we consider that the half perimeter length of the "alu" is 1000 grid units. We looked at many nets from this design and the samples are typical. These experiments show the limits of netlength estimation. A predicted netlength cannot be more precise than the inherent variance in the layout method.
Fig. 6. Measured netlength frequencies for different layouts of the "alu". The abscissa is divided in grid units. Half perimeter of the block is 1000 grid units.
v2
C1
c2b
x 'x
Fig. 7. Section length definition for different orientations 3.2 Primary Segment Length Model With these definitions we now come back to the length of segments which is our primary goal. Netlengths and path lengths can be derived from the segment lengths. Let a vertex i have the horizontal and vertical dimension x(i) and y(i) in its geometrical representation. Let each segment s(i, j) be composed of two orthogonal sections with the lengths lx(i, j) and ly(i, j). Since we may not know x and y, we also introduce relative lengths lxr(i, j)=lx(i, j)lx(i) and lyr respectively. Our first goal is the estimation of all relative section lengths. The second goal is the estimation of node dimensions and with these two we can calculate the absolute section and segment lengths. The relative length of a section depends on the position of its node in the slicing tree, in the segment tree and its orientation. Let us start with primary segments. Fig. 7 shows a simple example of a segment connecting cells cl and c2. It is not important what the exact routing is as long as it takes the shortest Manhattan path. There are obviously different rules for sections orthogonal (o) and parallel (p) to the slicing line. Let us therefore rather determine lo, lor Ip, and Ipr accordingly, as long as the orientation is not known. We also cannot know where in nodes v2 and v3 the pins of cells cI and c2 are located, as long as the ordering is not known. We can only assume that they will, on the average, be closer to the slicing line than to the opposite sides. Experiments suggest that this tendency is increasing with the increasing number of cells in the vertex to which the segment is assigned. We do not have sufficient experimental evidence to prove a relation. We therefore assume a lin-
121
x xI
I I I
I x'1 -
-1I
a10x'2
lo
fi
f
2
Fig. 9. Definition of a 2x8 standard cells window and distribution of lo. Average length of 8 cells is 160 grid units.
f.
'I
lo
x'1
x'2 -Yt
fi
f2
p
f "I< x1
Fig. 10. Parallel section length probability distribution
x'2 art
x'1
--- ly
9
'
net is, we use the averages of the distributions as relative lengths lor and 1pr. If the pins are equally distributed in the two sibling areas, loreq =0.5 and lpreq =0.33. Because of routing "detours" the factors can be larger. With increasing numbers of cells in the corresponding nodes, the factors decrease. First experiments indicate the following relation. If nco is the average number of cells orthogonal to the slicing line, we found:
lIo 10
x'2
Fig. 8. Different pin position probability functions and resulting orthogonal section length probability distributions ear probability distribution (by distribution we always mean densities) of pin positions perpendicular to the slicing line. Fig. 8 shows examples with different slopes. Because the pin positions in both sides are assumed not to be correlated and
r=
the length distribution is the convolution of the pin position distributions: f (lo) = conv (fl (x1
x'l),f2
(x'2))
b ) a+ aor nco
(EQ 3)
with a=0.5 and b=2. For 1pr we have no relation yet. Thus we only define with the average number of cells parallel to the slicing line (ncp):
(EQ 1)
lo = (xl -xl) +x'2
eq
ncp) lpr = g (lpr ,eq
(EQ 4)
If x and y are the horizontal and vertical dimensions of a node, we can calculate the primary section lengths for this node:
(EQ 2)
The results are depicted in Fig. 8. Fig. 9 shows some experimental results. They have been achieved by measuring the length of 2-point nets parallel to the rows in a standard cell layout that was placed with simulated annealing. In order to simulate a certain node in a slicing tree, only nets within a window of m rows and 2n cells in a row have been considered that cross a vertical slicing line in the center of the window (n cells in a row on either side). The window was moved across part of the layout to gather statistics. The result seems to fit to the bottom row of Fig. 8. Similar rules apply for the sections parallel to the slicing line. Fig. 10 shows the length distribution in the case that the location of the pins parallel to the slicing line are independent of each other and that the locations are equally distributed. This is a worst case assumption. From these distributions we can gain two results. First, since we cannot know where in the distribution a certain
Ix = lor x;
ly = lpr . y for orientation v
lx = lpr x;
ly = lor- y for orientation h
(EQ 5)
The second conclusion we can draw from the distribution is its width. It is a measure for the variance of lor and lpr and thus for the variance of the segment length. But it is only one component of the variance because uncertainties of the partitioning process have to be added. This is the subject of further research. 3.3 Secondary Segment Netlength Model Secondary segments connect to subnets that belong to the subtree of the corresponding node. This will reduce the length because the secondary segment connects to the nearest point of the subnet. We can either account for this by
122
80
70-
60
so 40 -
Fig. 11. Secondary segment length reduction by bounding boxes and reduced pin position space. another reduction factor or try to model it more precisely. Let us explore the latter possibility. What we need is a geometric representation of the subnet. A bounding box would be a good abstraction. But we did not find a means to calculate it during the estimation process because of the unknown orientations. The bounding box dimensions are related to the sum of lx and ly of the segments of the subnet. The relation will depend on the number of segments in the subnet. We do not know how yet. Instead we use the maximum of the dimensions as dimensions bx and by of the bounding box: bx = max(lx(i)); by = max(ly(i)); is the index of the subnet segments
lys = lpr (y - byI - by 2 ) Ixs = Ipr (x - bx 1 - bx 2) lys = lor (y-byl-by2 )
} for orientation v
}
-0
10
20
30
40
50
60
100
200
300
400
500
600
AO 700
Fig. 12. Netlength frequency distribution of the "alu". Abscissa in grid units.
(EQ6)
It is not known where the bounding box is located in the subnode area. This is the same situation as in the case of the primary segments. The difference is the extension of the "pin". This results in a virtual reduction of the node sizes by the same amount, as Fig. 11 tries to illustrate this effect with a segment that connects to two subnets. The white area in Fig. lib is the worst case area in which the ends of the segment can be located, if we assume that it can connect to any point on the bounding box of the subnets. There are two possibilities to take this reduction into account. In the relative length world we can calculate relative bxr and byr by using the quotient of the square roots of the sum of the cell areas of the corresponding nodes as divisor. The better possibility is to apply the reduction during the bottom-up calculation of absolute section lengths. We use this method because it is more precise. This has the following result on the secondary section lengths lxs and lys: Ixs = Ior (x-bx1 -bx 2 )
10
for orientation h
bxj, by, are the dimensions of one subnet, bx2, by 2 of the other. If only one subnet exists, the dimensions of the other are set to zero. 3.4 Netlength Distribution Test Proving the model correct is impossible. We have to
Fig. 13. Floorplan grid for experiment. make as many tests as possible to convince ourselves that the model is meaningful. One such test is a comparison of a measured netlength distribution with a distribution calculated with the model. Fig. 12 shows the distribution for the "alu" and a 1:1 aspect ratio. The layout was conducted with our own simulated annealing placement tool and fairly good global and detailed routers. In order to calculate the distributions of all net segments, we need a slicing tree and the number of net segments assigned to each node of the tree. This is a typical result of a bipartitioning tool. We therefore asked a colleague to bipartition the alu with his tool which gives excellent results /Mal96/, down to the standard cells. This procedure guarantees that the compared results are really independent. Next we needed cell node dimensions to calculate absolute lengths. For this experiment we used a simplified assumption: All cells have the same size and all vertices have a 1/ F2 aspect ratio and orientations alternate. This results in a very regular floorplan as shown in Fig. 13. As a further assumption we assumed equal distributions of the pins in all vertices and no correction factors. Fig. 13 highlights one node with two subnodes and a net segment. The dimension of each node is proportional to the square root of the number of cells in the node. Since the length I of the segment is I = lo + lp , the probability distribution of I is the convolution of the distributions of lo and ip. The aspect ratio has to be taken into account when defining the two distributions, which are shown in the top rows of Fig. 8. The orientation does not matter because the
123
Step 2. Partition the circuit of the block recursively until only two cells are left in each partition. Create a node no(i) for each partition and build the slicing tree during the recursion. Enter the name of the nets that are cut in each node's segment list. Enter the number of cells nc(i) represented by the node.
Fig. 14. Relative segment length probability distribution under the assumptions made in the text.
Step 3. Generate the shape functions for all nodes (in post order) with the algorithm in /Zim88I. Fig. 4 shows an example. The shape function of each node contains routing space for all net segments of the node. Transparency has been subtracted. Save the added routing space values. Calculate the average number of cells parallel ncp(i, k) and orthogonal nco(i, k) to the slicing line for every corner k of the shape functions. Step 4.
Fig. 15. Theoretical segment length frequency distribution for the alu. aspect ratio does not change if we rotate a node. The relative distribution of ir is shown in Fig. 14. The sum of all these distributions, stretched according to the dimensions of the nodes, for all segments of the alu is the total segment length frequency distribution shown in Fig. 15. It is scaled so that the root node has the same dimensions as the layout. It cannot be directly compared to the measured netlength distribution because nearly 50% of the nets of the "alu" have more than two pins. But the experiment shows that in principle the model shows the right kind of distribution. It has to be pointed out though that this distribution is not based on Rent's rule, but on a realistic slicing tree of the circuit and the number of cuts in each node.
4 LENGTH ESTIMATION METHOD From the above we now arrive at a relative simple segment lengths estimation method. We will describe the individual steps in prose. There exists a little different implementation which we used to develop the stochastic models in chapter 3. Here we explain how we would do it today. Step 1. Enter parameters loreq, lpreq, a, and b for EQ 3 and EQ4.
Distribute the routing space of all nodes to its siblings' shape functions, starting at the root (in pre order). This is necessary to estimate the dimensions of all nodes with all wires ending in or passing through the node as precisely as possible, in respect to the final layout. This step is under development.
Step 5. Traverse the slicing tree in post order to calculate section lengths lx(i, k), lxs(i, k), ly(i, k), and lys(i, k) for all corners k of the shape functions for all nodes, using EQ 3 to EQ 7. Step 6. Calculate individual segment lengths and netlengths, separately for horizontal and vertical components, if necessary, as input for a timing analysis.
5 EXPERIMENTAL RESULTS We experimented with the prototype implementation of the estimator which is built into our toolbox PLAYOUT and used our standard cell place and route and our timing analysis tool. We did estimations for the circuit "alu" for 11 different aspect ratios, ranging from 0.23 to 8.5 and did layouts for these shapes. We compared the estimated netlengths, which are the sum of the corresponding segments, with the extracted netlength individually. We got many results that show that the prototype method and the partitioning had to be improved. Since we have no other published estimations to compare with, it is difficult to say, how good the results are, when do we reach the stochastic limits, and what is a confidence measure. Despite all this we will show here at least one result in Fig. 16, that should be compared with Fig. 12. Although the average netlength is about 100 grid units, the average error is about
124
5 units. We purposely show absolute errors because the path lengths depend on absolute values.
/Feu82/ M. Feuer, "Connectivity of random logic," IEEE Trans. on Computers, Vol. C-31, No. 1, 1982, pp. 29-33. /Han88/ D. Hanson, "Interconnection Analysis," in: Physical Design Automation of VLSI Systems, Bryan T. Preas and Michael J. Lorenzetti (eds.), The Benjamin/Cummings Publishing Company, Inc., CA, 1988, pp. 31-64.
10 !O-
'10
1025
Report 4610), 1979, pp. 272-277.
-20
ln.rnrrlrrn nfllrnHllflEMf -15
-10
-5
0
5
10
15
20
Fig. 16. Distribution of absolute netlength estimation errors for the "alu". Abscissa in grid units.
But there are also some large errors in the shown distribution and we have to keep in mind that the longest path, not the average, decides on the circuit performance. Our goal therefore has to be to try to limit the maximum errors and be able to predict the probability of these.
6 CONCLUSIONS We have shown that the length range of individual nets in many different layouts is relatively small. It should therefore be possible to estimate netlengths, based on the knowledge of the circuit structure. We have shown, that with partitioning important structure information can be extracted and an estimation model can be built with some stochastic assumptions. So, the answer to the questions raised in chapter 3.1 with our current knowledge is: The slicing topology is representative for the estimation of individual netlengths, even without ordering information. This seems true for internal nets. For I/O nets we cannot answer this question currently. To answer the reliability question we need more experiments. The models could only be justified with a few experiments. A prototype implementation of the estimator has been implemented and already shows encouraging results. We are confident that the implementation of the improved models as shown in this paper will also improve the estimation quality. We need benchmarks in the submicron range with the necessary timing parameters to prove our results and to be able to compare with other estimation methods, for example prototype layouts. References /Don79/ W. Donath, "Placement and average interconnection lengths of computer logic," IEEE Trans. on Circuits and Systems, Vol. CAS-26, No. 4 (IBM
125
/Heb95/ W. Hebgen, "Netzlaengenbasierte Abschaetzung des Zeitverhaltens in einem top-down VLSIEntwurfsystem," Ph.D. thesis, University of Kaiserslautern, FRG, 1995. /Kel89/ W. Keller, "Ein Modell zur entwurfsbegleitenden hierarchischen Behandlung des Zeitverhaltens beim physikalischen VLSI-Entwurf," Ph. D. thesis, University of Kaiserslautern, FRG, 1989. /KuP86/ F. Kurdahi and A. Parker, "PLEST: A Program for Area Estimation of VLSI Integrated Circuits," Proc. of the 23rd Design Automation Conference, 1986, pp. 467-473. /LaR71/ B. Landman and R. Russo, "On a pin versus block relationship for partitions of logic graphs," IEEE Trans. on Computers, Vol. C-20, No. 12, 1971, pp. 1469-1479. /Mal96/ F.-O. Malisch, private communication, 1996 /PeP89/ M. Pedram and B. Preas, "Interconnection Length Estimation for optimized Standard Cell Layouts," Trans. IEEE Inl. Conf. on Computer-Aided Design, 1989, pp. 390-393. /SaP86/ S. Sister and A. Parker, "Stochastic Models for Wireability Analysis of Gate Arrays," IEEE Trans. on Computer-Aided-Design, vol. CAD-5, no. 1, 1986, pp. 52-65. /Zim88/ G. Zimmermann, "A New Area Shape Function Estimation Technique for VLSI Layouts," Proc. 25th Design Automation Conference (DAC), Anaheim, 1988, pp. 60-65.
EXPLORING THE DESIGN SPACE FOR BUILDING-BLOCK PLACEMENTS CONSIDERING AREA, ASPECT RATIO, PATH DELAY AND ROUTING CONGESTION Henrik Esbensen Ernest S. Kuh Department of Electrical Engineering and Computer Sciences University of California, Berkeley, CA 94720, USA esbensen(3eecs .berkeley.edu
ABSTRACT A genetic algorithm for IC/MCM building-block placement is presented. Optimization criteria considered are area, aspect ratio, routing congestion and maximum path delay. Designers can choose from an output set of feasible solutions. In contrast to existing approaches such as simulated annealing, no weights or bounds are needed. Experimental results illustrates the special features of the approach.
rithm for both ICs and MCMs is presented, which supports explicit design space exploration in the sense that 1) a set of alternative solutions rather than a single solution is generated by a single program execution, and 2) solutions are characterized explicitly by a cost value for each criterion instead of a single, aggregated cost value. The algorithm simultaneously minimizes layout area, routing congestion, maximum path delay and the deviation from a target aspect ratio. It searches for a set of alternative, good solutions where "good" is defined by the user in a simple manner. From the output solution set, the designer chooses a specific solution representing the preferred tradeoff. The approach avoids the use of both the weights and the bounds of (1) and consequently eliminates the above mentioned problems concerning weight and bound specification. The approach has three additional significant characteristics:
1. INTRODUCTION During placement of an integrated circuit (IC) or a multichip module (MCM) the objective is to find a solution which is satisfactory with respect to a number of competing criteria. Most often specific constraints has to be met for some criteria, while for others, a good tradeoff is wanted. However, at this point in the design process, the available information as to which values are obtainable for each criteria is based on relatively rough estimates only. Consequently, the designers notion of the overall design objective is rarely clearly definable. Virtually all existing placement tools minimizes a weighted sum of some criteria subject to constraints on others. I.e., if k criteria are considered, the objective is to minimize the single valued cost function
e
* Despite the fact that delay is inherently path oriented, most existing timing-driven placement approaches are net-based. While simple, these approaches usually over-constrains the problem, thereby potentially excluding good solutions from being found. The few existing path-based approaches includes [13, 15, 17], all of which, however, relies on very simple net models (stars and bounding boxes). The approach presented here obtains a more accurate path delay estimate by approximating each net by an Elmore-optimized Steiner tree.
i
C=
wici
s. t.
V
i
+ 1,...,k: ci < Ci
The maximum routing congestion is minimized, thereby improving the likelihood that the placement is routable without further modification. Consequently, the traditional need for multiple iterations of the placement and global routing phases is significantly reduced.
(1)
for some j, 1 < j < k. Here ci measures the cost of the solution with respect to the i'th criterion and the wi's and Chi's are user-defined weights and bounds, respectively. However, in practice it may be very difficult for the designer to specify a set of bounds and weights which makes the placement tool find a satisfactory solution. If the bounds are too loose, perhaps a better solution could have been found, while if they are too tight, a solution may not be found at all. It is also far from clear how to derive a suitable set of weight values from the vaguely defined design objectives, and constant weights may not be sufficient to keep the terms of the cost function properly balanced throughout the optimization process. Furthermore, the minimum of a weighted sum can never correspond to a non-convex point of the cost tradeoff surface, regardless of the weights [11]. In other words, if the designers notion of the best solution corresponds to a non-convex point, it can never be found by minimizing c in (1), even though the solution is nondominated. Our work is motivated by the need to overcome these fundamental problems. A building-block placement algo-
* The approach is based on the genetic algorithm (GA), since it is particularly well suited for design space exploration [12]. We are only aware of three previous GA approaches to building-block placement [4, 5, 10], none of which considers delay or routing congestion or performs explicit design space exploration. Previous work on design space exploration in CAD is still very limited. However, approaches for scheduling and channel routing are presented in [7] and in [6] an approach for FPGA technology mapping is described. Very recently, a combined wire sizing and buffer insertion method, also supporting design space exploration, was presented in [16]. The work presented here is based on significant extensions and improvements of our earlier placement approach described in [8].
126
2. PROBLEM DEFINITION The placement model described in Section 2.1. is relevant for both MCMs and for IC technologies with at least two metal layers available for routing. Section 2.2. characterizes the solution set searched for by the algorithm.
m(s(pi+,)), i = 0,1_ . ., I -2. s(po) or pi-, may be an IO pin. Each path in an MCM will have length I = 1 assuming that all signals are latched at the inputs of the components. m(pi) =
* Technology information: Number of metal layers available for routing on top of blocks and between blocks, denoted by lblock and ,P.,,. respectively. The routing wire resistance r and capacitance c per unit wire
2.1. Placement Model A placement problem is specified by the following input
length, and the wire pitch
* A set of rectangular building-blocks of arbitrary sizes and aspect ratios with a set of pins located anywhere within each block. * A set of IO pins/pads. Constraints on relative IO pin positions are expressed using a two-dimensional array A~xt as illustrated in Fig. 1. Each 10 pin can be assigned to an entry of A and the physical location corresponding to entry (i, j) will be (ix/(s - 1), jy/(t - 1)), where x and y are the horizontal and vertical dimensions of the layout, respectively'. An 10 pin assigned to A by the user is called a fixed IO pin, while the remaining IO pins are flexible. Each flexible IO pin will automatically be assigned to a vacant entry of A not specified as illegal. Since any subset of the entries of A can be specified as illegal, pins can be restricted to placement along the periphery of the layout, they can be uniformly distributed over the entire layout, etc.
Wpit~h.
For simplicity, these
values are all assumed to be constants. Each output solution is a specification of * An absolute position of each block so that no pair of blocks or a block and an 10-pin are closer than a specified minimum distance A > 0. This parameter allow physical constraints (design rules) to be met and is not intended for routing area allocation. Since multi-layer designs are considered, it is assumed that a significant part of the routing is performed on top of the blocks. * An orientation and reflection of each block. Throughout this paper, the term orientation of a block refers to a possible 90 degree rotation, while reflection of a block refers to the possibility of mirroring the block around a horizontal and/or a vertical axis. Changing the orientation of a block generally alters its contour, while reflecting it does Tot. In an IC, each block can be oriented and/or reflected in a total of eight distinct ways. For MCMs, only two distinct reflections exist, since the direction of its pins is fixed, giving a total of four distinct orientations/reflections. * An absolute position of each 10 pin, satisfying the specified constraints on their relative positions.
layout area
IO pin array
2.2.
Figure 1. Specification of constraints on placement of IO pins. Here A has dimensions 8 x 10 and 11 fixed JO pins (white circles) are assigned to specific entries of A while 14 entries (black circles) are illegal. The remaining entries are available for flexible JO pins. A will be oriented and/or reflected and subsequently scaled so that it exactly covers the layout area of the placement. * A specification of all nets, including for each net 1) the capacitance of each sink pin, and 2) a designated source pin p, its driver resistance and an associated internal delay i(p) in the block m(p) to which p belongs. t(p) is the time it takes a signal to travel through m(p) to p. 2 * A specification of a set of paths P. A path connects either two registers of distinct blocks or an IO pin and a register, i.e., it is an alternating sequence of wires passing through blocks and net segments. For a sink pin p, denote by s(p) the source pin of the net to which p belongs. Each path P e P is then uniquely specified by an ordered set of sink pins P = {po ,p ... ,pj- } of distinct nets, such that 'Relative to the building-blocks, the entire set of 10 pins can be oriented and/or reflected in eight distinct ways, while still satisfying the constraints on relative positions specified by A. The given absolute position of entry (i, j) assumes that the IO pin set is positioned on top of the blocks without changing neither the orientation nor the reflection relative to the blocks. 2If p is an 10 pin, m(p) is p itself and if it is also a source, t(p) = 0, i.e., input 10 pins have no internal delay.
What is a "Good" Tradeoff ?
Let II be the set of all placements and R+ = [0, oo[. The cost of a solution is defined by the vector-valued function c : HI _ R4 which will be described in Section 3.2.. This Section describes how to specify what a "good" cost tradeoff is, and how to compare the cost of two solutions without resorting to a single-valued cost measure. The user specifies a goal vector g = (gi, 2,g3,g4) and a feasibility vector f = (f 1, f2, f3, f4) such that g, f E (R+ U{oo}) 4 and 0 < gi < •f• < o for i = 1, 2,3,4. For the i'th criterion, gi is the maximum value wanted, if obtainable, while fi specifies a limit beyond which the solution is unconditionally of no interest. For example, if the i'th criterion is layout area, gi = 20 and fi = 100 states that an area of 20 or less is wanted if it can be obtained, while an area larger than 100 is unacceptable. Areas between 20 and 100 are acceptable, although not as good as hoped for. The vectors g and f defines a set of satisfactory solutions S9 = {x C II I Vi : xi < gy} and a set of acceptable solutions Af = {x E III Vi : xi < fi}, where xi is the cost of x wrt. the i'th dimension, i.e., c(x) = (Xz,X 2 ,X 3 ,X 4 ). The values specified by g and f are merely used to guide the search process and in contrast to traditional, user-specified bounds, need not be obtainable. Therefore, they are significantly easier to specify than traditional bounds. In order for the algorithm to compare solutions, a notion of relative solution quality is needed, which takes the goal and feasibility vectors into account. Let x, y e HI. The relation x dominates y, written X < d y, is defined by X < d Y
127
-
(V i : xi < yi) A (3 i : xi < yi)
(2)
3.
(0,0)
criterion I
g,
The concept of genetic algorithms is based on natural evolution. In nature, the individuals constituting a population adapt to the environment in which they live. The fittest individuals have the highest probability of survival and tend to increase in numbers, while the less fit individuals tend to die out. This survival-of-the-fittest Darwinian principle is the basic idea behind the GA. The algorithm maintains a population of individuals, each of which corresponds to a specific solution to the optimization problem considered. Based on a given cost function, a measure of fitness defines the relative quality of individuals. An evolution process is simulated, starting from a set of random individuals. The main components of this process are crossover, which mimics propagation, and mutation, which mimics the random changes occurring in nature. After a number of generations, highly fit individuals will emerge corresponding to good solutions to the optimization problem. Rather than altering given solutions directly, the crossover and mutation operators process internal representations of solutions. The solution corresponding to a given representation is computed by a function known as the decoder. Section 3.1. outlines our specific GA, Section 3.2. presents the placement representation and its interpretation, and Section 3.3. briefly discuss the selection strategy and the genetic operators.
fl
Figure 2. The sets of satisfactory and acceptable solutions, illustrated in two dimensions. Using <'d, the relation x is preferable to y, written x -< y, is then defined as follows, depending on how c(z) compares to g and f: If z satisfy all goals, i.e., x E S,, then x -< y
X
(3)
(X
If x satisfies none of the goals, i.e., V i: xi > gi then 2' -< y
t*
(X
(4)
Finally, x may satisfy some but not all goals, that is, 3k { 2,3,4): (Vi < k: xi < gi)A(Vi > k : zi > gi), assuming a convenient ordering of the optimization criteria. Then z -. y
X*
[(V i > k : xi < yi) A (3 i > k : xi < yi)]
3.1. Overview Fig. 3 outlines our GA. Let D = {9o0, 1, ON-I} denote the current population. The rank r(o) of o E 4 is the number of currently existing individuals which are preferable to X, i.e., r(6!) = I{ E <-1 ' -< b}. Furthermore, let ,o = {A E 4)I r(6) = 0} C ., i.e., 4o is the current best solutions. Initially, ' is constructed by routine generate (line 1) from random individuals. One iteration of the repeat loop (lines 2-12) corresponds to the simulation of one generation. Throughout the optimization process N = 1' is kept constant.
(5)
V
[(x E Af) A (y g
Af)]
(6)
V [(V i > k: xi = yi) A
{((V i < k: xi < yi) A (3 i < k
(7) xi < yi)) (8)
V
(3 i < k: yi > gi)}]
DESCRIPTION OF THE ALGORITHM
(9) 01 02 03 04 05 06 07 08 09 10 11 12 13
Due to (3), (4) and (6) an acceptable solution is always preferable to an unacceptable solution. The right hand side of (5) states that x dominates y wrt. the dimensions for which x does not satisfy the goals. (7), (8) and (9) states that in the special case when x equals y wrt. the non-satisfied dimensions, then x is still preferable to y if it either dominates y wrt. the satisfactory dimensions or if y does not satisfy a goal satisfied by x. Notice from (5) that when two solutions satisfy the same subset of goals, they are considered equal with respect to these goals, regardless of their specific values in these dimensions. Hence, when goals are satisfied, they are "factored out", focusing the search on the remaining, unsatisfactory dimensions. The algorithm outputs a set of distinct solutions which are the best found in the sense defined by -<. As a special case, if g = (0, 0, 0, 0) the algorithm searches for (a sample of) the P'areto-optimal set, i.e., the set of solutions, in which no solution can be improved in any dimension without being deteriorated in another. The above definition of -- is an extension of the definition introduced in [12], adding the feasibility vector f. This extension prevents the algorithm from wasting time investigating solutions which are non-dominated but of no practical interest.
generate(¢); repeat: select (PI, 62 4'1; deft 2 := crossover(0i, 02, b1, fb2 ); mutate(vi); insert(4, gV"); if deft2 : mutate(0b2); insert(4', 0 2 ); if converged(): optimize(4bo); until goals() or converged() or cpuLimit(; output 4';
Figure 3. Outline of the algorithm. In each generation, two parent individuals 01 and 62 are selected (line 3) and crossover performed (line 4), generating offspring ha and possibly V/2. deft! 2 is true if and only if +b2 was also generated. Routine mutate subjects the generated offspring to random changes (lines 5, 8) and the resulting individuals are inserted in 4Z by routine insert (lines 6, 9). An inserted individual ?b replaces a maximum rank solution
128
3. The layout is compacted, first vertically and then
to which it is preferable or, if ' is not preferable to any solution, it replaces a maximum rank solution, which is not preferable to 7b. Routine converged (line 10) detects if no improvement has occurred in S consecutive generations, that is, if 4o has not changed in this period. In that case routine optimize (line 11) attempts to optimize all rank zero individuals by simple hillclimbing. On each individual opE (Do a sequence of H mutations is tried. Each mutation yielding <' from 0 is only executed if O' -< o. The algorithm terminates (line 12) when either a) 4o contains a solution satisfying all goals (detected by routine goalso), b) the process has converged, or c) a CPU-time limit T has been reached (detected by cpuLimito). (o is then the output set of solutions (line 13). Routines insert and optimize assures that a solution o' can never replace o if X -< e'. Hence, the number of satisfactory solutions IS91 and acceptable solutions [AIl are non-decreasing functions of time and so is (O, in the sense inferred by -<, while 14ol is not.
horizontally,
using a simplified version of the one-
dimensional channel compaction algorithm presented in [22]. Fig. 4 illustrates the first three steps of decoding.
Given 10 blocks and the Polish expression Figure 4. 1 2 + 6 * 9 0 + + 3 4 + + 5 * 7 8 + *, the placement on the left is the result of step 2 of the decoding. Subtrees are recursively centered and oriented optimally. Since the height of the layout is determined by the blocks 1,2,9,0,3,4, no blocks are moved when attempting vertical compaction. Subsequent horizontal compaction moves blocks 8,7,5,9 and 0 towards the left, so that blocks 2.6,7 now determines the width of the layout. The placement to the right is the result of compaction (step 3), i.e., the final placement.
3.2. Solution Representation and Decoder The representation of a placement consist of five components a) through e): a) An inverse Polish expression of length 2b - 1 over the alphabet {0,1, .. ., b-1, +, *}, where b is the number of blocks. The operands 0,1,... ., b-1 denotes block identities and +, * are operators. The expression uniquely specifies a slicing-tree for the placement, as first introduced in [21], with + and * denoting a horizontal and a vertical slice, respectively. .
4. Given the orientation/reflection of the JO array A specified by component c) each flexible JO-pin is assigned to an unused entry of A. The nio nets having flexible IO-pins are treated one at a time, in the order defined by component d). For each net, each flexible pin is assigned to the unused entry of A, which is closest to the center of gravity of the remaining pins of the net. Then the area and aspect ratio of the layout can be computed. C.,,. is the area of the smallest rectangle enclosing all blocks and IO-pins and catio= - rt,,getl, where rTctual is the actual aspect ratio of the layout (height divided by width) and rt,,,et is a user-defined target ratio. 5. A global routing graph G = (V, E) is constructed which forms a two-dimensional, uniformly spaced lattice, exactly covering the entire layout. The pitch of the lattice is determined by the user-defined parameter 9pitch Each pin is then assigned to the closest vertex in V. 6. The topology of each net is approximated by a Steiner tree embedded in G. Each Steiner tree is computed independently by the SERT-C algorithm ("Steiner Elmore Routing Tree with identified Critical sink") introduced in [3]. SERT-C explicitly minimizes the Elmore delay from the source to a designated critical sink. For nets with more than one sink, the critical sink is specified by component e) of the representation. 7. The delay D(P) of each path P = {po,pu.pii-l} is estimated as
b) A bitstring of length 2b for ICs and b for MCMs, representing the reflection of each block. For ICs, the reflection of the i'th block is specified by bits 2i and 2i + 1 and for MCMs, it is specified by bit i. c) An integer in the interval [0; 7] selecting one of the eight possible orientations/reflections of the JO-pin array A relative to the placed blocks, cf. Fig. 1. d) A string of njo integers, where nio is the number of nets h