Provably good global buffering by generalized multiterminal multicommodity flow approximation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 21, Issue 3, 2002, Pages 263-274

  Dragan, Feodor F ^a   Kahng, Andrew B ^b   Mǎndoiu, Ion I ^c   Muddu, Sudhakar ^d   Zelikovsky, Alexander ^e  

^a KENT STATE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Sanera Systems Inc   (United States)

^e GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Buffer insertion; Buffer planning; Global routing; Multicommodity flow

Indexed keywords

ALGORITHMS; APPLICATION SPECIFIC INTEGRATED CIRCUITS; APPROXIMATION THEORY; GLOBAL OPTIMIZATION; HEURISTIC METHODS; INTEGRATED CIRCUIT LAYOUT; MICROPROCESSOR CHIPS;

BUFFER BLOCK PLANNING; BUFFER INSERTION; GLOBAL BUFFERING; MULTIPLE ROUTING LAYERS; MULTITERMINAL MULTICOMMODITY FLOW APPROXIMATION;

COMPUTER AIDED LOGIC DESIGN;

EID: 0036494621     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.986421     Document Type: Article

References (22)

1. Provably good global routing by a new approximation algorithm for multicommodity flow
2. A global router using an efficient approximate multicommodity multiterminal flow algorithm
3. Approximation algorithms for directed Steiner problems
4. Performance optimization of VLSI interconnect layout
5. Buffer block planning for interconnect-driven floorplanning
6. Provably good global buffering using an available buffer block plan
7. Provably good global buffering by multiterminal multicommodity flow approximation
8. Practical approximation algorithms for separable packing linear programs
9. Approximating fractional multicommodity flow independent of the number of commodities
10. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
11. Approximation schemes for the restricted shortest path problem
12. An efficient timing-driven global routing algorithm
13. Interconnect tuning strategies for high-performance IC's
14. Optimal wire sizing and buffer insertion for low power and a generalized delay model
15. Randomized approximation algorithms in combinatorial optimization
16. Experimental results for a linear program global router
17. Buffered Steiner tree construction with wire sizing for interconnect layout optimization
18. The network inhibition problem
19. Randomized rounding
20. Multiterminal global routing: A deterministic approximation scheme
21. A global router based on a multicommodity flow model
22. Planning buffer locations by network flows