A routing algorithm for harvesting multipipeline arrays with small intercell and pipeline delays

A novel approach is analyzed for reconfiguring multipipeline arrays from two-dimensional arrays. The proposed approach is fully characterized and the conditions for switching and routing are given. A polynomial time complexity algorithm is proposed for the reconfiguration of multipipeline arrays. It is proved that 100% harvesting is possible using the proposed algorithm while achieving very small intercell and pipeline delays.<<ETX>>

[1]  Mehmet A. Cirit.  Switch level random pattern testability analysis , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[2]  Carver Mead,et al.  Signal Delay in General RC Networks , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Paul J. Drongowski,et al.  A graphical hardware design language , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[4]  Takao Sugimoto,et al.  TRIP: An Automated Technology Mapping System , 1987, 24th ACM/IEEE Design Automation Conference.

[5]  Sergiu Rudeanu.  Boolean functions and equations , 1974 .

[6]  Alfred V. Aho,et al.  Principles of Compiler Design , 1977 .

[7]  Kai Hwang,et al.  Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.

[8]  Béla Bollobás,et al.  Random Graphs , 1985 .

[9]  Vishwani D. Agrawal,et al.  Unified Methods for VLSI Simulation and Test Generation , 1989 .

[10]  J.A. Huisken,et al.  GrapMG: Cost-effective module generation , 1989, ESSCIRC '89: Proceedings of the 15th European Solid-State Circuits Conference.

[11]  Ron Y. Pinter,et al.  Optimal Chaining of CMOS Transistors in a Functional Cell , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Mark Horowitz,et al.  Charge-Sharing Models for Switch-Level Simulation , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[14]  John A. Newkirk,et al.  An Algorithm to Generate Tests for MOS Circuits at the Switch Level , 1985, ITC.

[15]  Alexander Saldanha,et al.  Is redundancy necessary to reduce delay , 1990, DAC '90.

[16]  O. Wing,et al.  Suboptimal algorithm for a wire routing problem , 1972 .

[17]  Larry Soulé,et al.  Statistics for Parallelism and Abstraction Level in Digital Simulation , 1987, 24th ACM/IEEE Design Automation Conference.

[18]  J. S. Lee,et al.  Use of steiner's problem in suboptimal routing in rectilinear metric , 1976 .

[19]  Alberto L. Sangiovanni-Vincentelli,et al.  Multiple-Valued Minimization for PLA Optimization , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[20]  Leon O. Chua,et al.  Computer-Aided Analysis Of Electronic Circuits , 1975 .

[21]  John K. Ousterhout.  Switch-Level Delay Models for Digital MOS VLSI , 1984, 21st Design Automation Conference Proceedings.

[22]  Brian W. Kernighan,et al.  A proper model for the partitioning of electrical circuits , 1972, DAC '72.

[23]  J E Kivelae,et al.  The dependency notation as a graphical description language for logic design and silicon compilation , 1986 .

[24]  James J. Solberg,et al.  Operations Research: Principles and Practice. , 1977 .

[25]  Robert K. Brayton,et al.  An exact minimizer for Boolean relations , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[26]  P. Sadayappan,et al.  Circuit Simulation on Shared-Memory Multiprocessors , 1988, IEEE Trans. Computers.

[27]  Chung-Kuan Cheng,et al.  Towards efficient hierarchical designs by ratio cut partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[28]  David Marple.  A hierarchy preserving hierarchical compactor , 1991, DAC '90.

[29]  Kishore Singhal,et al.  Computer Methods for Circuit Analysis and Design , 1983 .

[30]  Omar Wing,et al.  PYRAMID-a hierarchical waveform relaxation-based circuit simulation program , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[31]  Diane C. P. Smith,et al.  Database abstractions: aggregation , 1977, CACM.

[32]  Randy H. Katz,et al.  Version modeling concepts for computer-aided design databases , 1986, SIGMOD '86.

[33]  W.S. Stornetta,et al.  Scaling theory for fault stealing algorithms in large systolic arrays , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[34]  Jacob K. White,et al.  Multirate Integration Properties of Waveform Relaxation with Applications to Circuit Simulation and Parallel Computation , 1985 .

[35]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[36]  H. Hasegawa,et al.  Analysis of interconnection delay on very high-speed LSI/VLSI chips using an MIS microstrip line model , 1984, IEEE Transactions on Electron Devices.

[37]  Mark Horowitz,et al.  Signal Delay in RC Tree Networks , 1983, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[38]  J. MacGregor Smith,et al.  STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN , 1979 .

[39]  Lawrence T. Pileggi,et al.  Asymptotic waveform evaluation for timing analysis , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[40]  Tiziano Villa,et al.  NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations , 1989, 26th ACM/IEEE Design Automation Conference.

[41]  Masahiro Fujita,et al.  Evaluation and improvement of Boolean comparison method based on binary decision diagrams , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[42]  Michel Dagenais,et al.  On the calculation of optimal clocking parameters in synchronous circuits with level-sensitive latches , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[43]  R. Brayton.  Factoring logic functions , 1987 .

[44]  A. J. Stone,et al.  Logic partitioning , 1966, DAC.

[45]  Chung-Kuan Cheng,et al.  Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[46]  Jacob K. White,et al.  Parallel simulation algorithms for grid-based analog signal processors , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[47]  Olivier Coudert,et al.  Automating the diagnosis and the rectification of design errors with PRIAM , 1989, ICCAD 1989.

[48]  Vishwani D. Agrawal,et al.  Performance estimation in a massively parallel system , 1990, Proceedings SUPERCOMPUTING '90.

[49]  James J. Cherry.  Pearl: a CMOS timing analyzer , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[50]  Hans Jürgen Prömel,et al.  Combining partitioning and global routing in sea-of-cells design , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[51]  J. Banerjee,et al.  Clustering a DAG for CAD Databases , 1988, IEEE Trans. Software Eng..

[52]  Alberto L. Sangiovanni-Vincentelli,et al.  Three-dimensional capacitance evaluation on a Connection Machine , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[53]  Utz G. Baitinger,et al.  CARLOS: an automated multilevel logic design system for CMOS semi-custom integrated circuits , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[54]  Christopher J. Terman.  Simulation tools for digital LSI design , 1983 .

[55]  Carl Sechen,et al.  A new global router for row-based layout , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[56]  Uehara,et al.  Optimal Layout of CMOS Functional Arrays , 1981 .

[57]  Robert K. Brayton,et al.  Optimal State Assignment for Finite State Machines , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[58]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[59]  P. Sonneveld.  CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems , 1989 .

[60]  John K. Ousterhout.  Crystal: a Timing Analyzer for nMOS VLSI Circuits , 1983 .

[61]  P. Chan,et al.  Parallel electronic circuit simulation on the iPSC system , 1988, Proceedings of the IEEE 1988 Custom Integrated Circuits Conference.

[62]  Alberto L. Sangiovanni-Vincentelli,et al.  MUSTANG: state assignment of finite state machines targeting multilevel logic implementations , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[63]  H. Elman.  Iterative methods for large, sparse, nonsymmetric systems of linear equations , 1982 .

[64]  Dana S. Richards,et al.  An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[65]  Yahiko Kambayashi,et al.  The Transduction Method-Design of Logic Networks Based on Permissible Functions , 1989, IEEE Trans. Computers.

[66]  Prathima Agrawal.  Concurrency and Communication in Hardware Simulators , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[67]  Bryan T. Preas,et al.  Automatic Placement A Review of Current Techniques , 1986, DAC 1986.

[68]  A. Stauffer,et al.  Optimal CMOS cell transistor placement: a relaxation approach , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[69]  Sudhakar M. Reddy,et al.  Transistor Level Test Generation for MOS Circuits , 1985, DAC 1985.

[70]  Hugo De Man,et al.  Switch-Electrical Segmented Waveform Relaxation for Digital MOS VLSI and Its Acceleration on Parallel Computers , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[71]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[72]  Magdy S. Abadir,et al.  Logic design verification via test generation , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[73]  Kartikeya Mayaram,et al.  PGS and PLUCGS-two new matrix solution techniques for general circuit simulation , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[74]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[75]  Alberto L. Sangiovanni-Vincentelli,et al.  PROTEUS : A Logic Verification System for Combinational Circuits , 1986, ITC.

[76]  Sudhakar M. Reddy,et al.  On Testable Design for CMOS Logic Circuits , 1983, International Test Conference.

[77]  Robert K. Brayton,et al.  Timing optimization of combinational logic , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[78]  Ping Yang,et al.  SIERRA: a 3-D device simulator for reliability modeling , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[79]  Frank Thomson Leighton,et al.  Wafer-Scale Integration of Systolic Arrays , 1985, IEEE Trans. Computers.

[80]  Robert K. Brayton,et al.  Multi-level logic minimization using implicit don't cares , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[81]  Jonathan Allen,et al.  A design by example regular structure generator , 1985, DAC 1985.

[82]  J. Hayes.  A unified switching theory with applications to VLSI design , 1982, Proceedings of the IEEE.

[83]  W. C. Elmore.  The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .

[84]  Der-Tsai Lee,et al.  An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem , 1980 .

[85]  Vivek Raghavan,et al.  AWEsim: a program for the efficient analysis of linear(ized) circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[86]  Mariagiovanna Sami,et al.  Fault Tolerance Through Reconfiguration in VLSI and WSI Arrays , 1989 .

[87]  Yooji Tsuchiya,et al.  Establishment of Higher Level Logic Design for Very Large Scale Computer , 1986, DAC 1986.

[88]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[89]  P. Sadayappan,et al.  Efficient sparse matrix factorization for circuit simulation on vector supercomputers , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[90]  F. Hwang,et al.  An o(nlogn) algorithm for suboptimal rectilinear steiner trees , 1979 .

[91]  Randal E. Bryant,et al.  A Switch-Level Model and Simulator for MOS Digital Systems , 1984, IEEE Transactions on Computers.

[92]  Robert K. Brayton,et al.  Algorithms for discrete function manipulation , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[93]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[94]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[95]  S. Reddy,et al.  On the design of robust multiple fault testable CMOS combinational logic circuits , 1988, ICCAD 1988.

[96]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[97]  Kurt Keutzer,et al.  On properties of algebraic transformation and the multifault testability of multilevel logic , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[98]  Michael H. Schulz,et al.  Advanced automatic test pattern generation and redundancy identification techniques , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[99]  Leendert M. Huisman,et al.  SLS-a fast switch-level simulator [for MOS] , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[100]  A. Jimenez,et al.  Algorithms for ASTAP--A network-analysis program , 1973 .

[101]  William W. Cohen,et al.  A Rule-Based System for Optimizing Combinational Logic , 1985, IEEE Design & Test of Computers.

[102]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[103]  C.E. Stroud,et al.  Behavioral model synthesis with Cones , 1988, IEEE Design & Test of Computers.

[104]  Kunle Olukotun,et al.  Analysis and design of latch-controlled synchronous digital circuits , 1990, DAC '90.

[105]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[106]  Gary D. Hachtel,et al.  BOLD: The Boulder Optimal Logic Design system , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume 1: Architecture Track.

[107]  Michel Nakhla.  Analysis of pulse propagation on high-speed VLSI chips , 1990 .

[108]  Carl Sechen,et al.  An improved objective function for mincut circuit partitioning , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[109]  E. Kuh,et al.  The state-variable approach to network analysis , 1965 .

[110]  Jean Christophe Madre,et al.  Proving circuit correctness using formal comparison between expected and extracted behaviour , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[111]  Dov Harel,et al.  A linear algorithm for finding dominators in flow graphs and related problems , 1985, STOC '85.

[112]  Gotaro Odawara,et al.  A Logic Verifier Based on Boolean Comparison , 1986, DAC 1986.

[113]  Gary D. Hachtel,et al.  Verification algorithms for VLSI synthesis , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[114]  Mark Horowitz,et al.  Timing Models for MOS Circuits , 1983 .

[115]  Tom DeMarco,et al.  Structured Analysis and System Specification , 1978 .

[116]  Lawrence T. Pileggi,et al.  AWEsim: Asymptotic Waveform Evaluation for Timing Analysis , 1989, 26th ACM/IEEE Design Automation Conference.

[117]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[118]  Randal E. Bryant,et al.  Algorithmic Aspects of Symbolic Switch Network Analysis , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[119]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[120]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[121]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[122]  Frank Thomson Leighton,et al.  Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms , 1989, 26th ACM/IEEE Design Automation Conference.

[123]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[124]  Chen-Shang Lin,et al.  VVDS: A Verification/Diagnosis System for VHDL , 1989, 26th ACM/IEEE Design Automation Conference.

[125]  Carver Mead,et al.  Analog VLSI and neural systems , 1989 .

[126]  Nany Hasan,et al.  Minimum fault coverage in reconfigurable arrays , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[127]  S. M. Reddy,et al.  On the design of path delay fault testable combinational circuits , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

[128]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[129]  Srinivas Devadas,et al.  Necessary and sufficient conditions for robust delay-fault testability of combinational logic circuits , 1990 .

[130]  Walter S. Scott,et al.  Magic: A VLSI Layout System , 1984, 21st Design Automation Conference Proceedings.

[131]  Ian Kampel.  A practical introduction to the new logic symbols , 1985 .

[132]  Robert Francis Lucas,et al.  Solving planar systems of equations on distributed-memory multiprocessors , 1988 .

[133]  Mariagiovanna Sami,et al.  Fault Tolerance Techniques for Array Structures Used in Supercomputing , 1986, Computer.

[134]  A. Yajima,et al.  Complete LU decomposition conjugate residual method and its performance for large-scale circuit simulation , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[135]  K. A. Tamura,et al.  Locating Functional Errors in Logic Circuits , 1989, 26th ACM/IEEE Design Automation Conference.

[136]  William W. Cohen,et al.  Synthesis and Optimization of Multilevel Logic under Timing Constraints , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[137]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[138]  Irving S. Reed,et al.  Path Sensitization, Partial Boolean Difference, and Automated Fault Diagnosis , 1972, IEEE Transactions on Computers.

[139]  M. Nakhla,et al.  Time-domain analysis of lossy coupled transmission lines , 1990 .

[140]  Daniel D. Gajski,et al.  Exel: A language for interactive behavioral synthesis , 1988 .

[141]  Alberto L. Sangiovanni-Vincentelli,et al.  Circuit Simulation on the Connection Machine , 1987, 24th ACM/IEEE Design Automation Conference.

[142]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.

[143]  John L. Wyatt,et al.  Nonlinear analog networks for image smoothing and segmentation , 1990 .

[144]  Donald L. Dietmeyer,et al.  Logic Design Automation of Fan-In Limited NAND Networks , 1969, IEEE Transactions on Computers.

[145]  Randal E. Bryant,et al.  COSMOS: a compiled simulator for MOS circuits , 1987, DAC '87.

[146]  Abbas El Gamal,et al.  Configuration of VLSI Arrays in the Presence of Defects , 1984, JACM.

[147]  Yukihiro Nakamura,et al.  An Integrated Logic Design Environment Based on Behavioral Description , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[148]  David William Smart.  Parallel Processing Techniques for the Simulation of MOS VLSI Circuits Using Waveform Relaxation , 1988 .

[149]  Niraj K. Jha,et al.  Testing and Reliable Design of CMOS Circuits , 1989 .

[150]  D. Gregory,et al.  SOCRATES: A System for Automatically Synthesizing and Optimizing Combinational Logic , 1986, 23rd ACM/IEEE Design Automation Conference.

[151]  Alberto L. Sangiovanni-Vincentelli,et al.  A massively parallel algorithm for three-dimensional device simulation , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[152]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[153]  M. Eslami,et al.  Introduction to System Sensitivity Theory , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[154]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[155]  Yossi Shiloach,et al.  A Polynomial Solution to the Undirected Two Paths Problem , 1980, JACM.

[156]  Robert K. Brayton,et al.  Provably correct critical paths , 1989 .

[157]  Mark A. Franklin,et al.  Performance Analysis of a Parallel Logic Simulation Machine , 1989, J. Parallel Distributed Comput..

[158]  Albert E. Ruehli,et al.  The modified nodal approach to network analysis , 1975 .

[159]  Prathima Agrawal,et al.  Circuit simulation algorithms on a distributed memory multiprocessor system , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[160]  Janusz Rajski,et al.  Testability preserving transformations in multi-level logic synthesis , 1990, Proceedings. International Test Conference 1990.

[161]  Douglas B. Armstrong,et al.  On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic Nets , 1966, IEEE Trans. Electron. Comput..

[162]  Zvi Kohavi,et al.  Detection of Multiple Faults in Combinational Logic Networks , 1972, IEEE Transactions on Computers.

[163]  Carlo H. Séquin,et al.  ATV: an abstract timing verifier , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[164]  Neil Robertson,et al.  Disjoint Paths—A Survey , 1985 .

[165]  Robert E. Tarjan,et al.  Storing a sparse table , 1979, CACM.

[166]  Hans Jürgen Prömel,et al.  VLSI-placement based on routing and timing information , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[167]  P. R. O'Brien,et al.  Modeling the driving-point characteristic of resistive interconnect for accurate delay estimation , 1989, ICCAD 1989.

[168]  Alfred V. Aho,et al.  Rectilinear steiner trees: Efficient special-case algorithms , 1977, Networks.

[169]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.