On Optimal Interconnections for VLSI: 301 (The Springer International Series in Engineering and Computer Science, 301) - Hardcover
Synopsis
On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for high-performance, high-density interconnections during the global and detailed routing phases of circuit layout. First, the book addresses area minimization, with a focus on near-optimal approximation algorithms for minimum-cost Steiner routing. In addition to practical implementations of recent methods, the implications of recent results on spanning tree degree bounds and the method of Zelikovsky are discussed. Second, the book addresses delay minimization, starting with a discussion of accurate, yet algorithmically tractable, delay models. Recent minimum-delay constructions are highlighted, including provably good cost-radius tradeoffs, critical-sink routing algorithms, Elmore delay-optimal routing, graph Steiner arborescences, non-tree routing, and wiresizing. Third, the book addresses skew minimization for clock routing and prescribed-delay routing formulations. The discussion starts with early matching-based constructions and goes on to treat zero-skew routing with provably minimum wirelength, as well as planar clock routing. Finally, the book concludes with a discussion of multiple (competing) objectives, i.e., how to optimize area, delay, skew, and other objectives simultaneously. These techniques are useful when the routing instance has heterogeneous resources or is highly congested, as in FPGA routing, multi-chip packaging, and very dense layouts.
Throughout the book, the emphasis is on practical algorithms and a complete self-contained development. On Optimal Interconnections for VLSI will be of use to both circuit designers (CAD tool users) as well as researchers and developers in the area of performance-driven physical design.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for On Optimal Interconnections for VLSI: 301 (The Springer...
Stock Image
On Optimal Interconnections for VLSI (The Springer International Series in Engineering and Computer Science, 301)
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_373561475
Seller Image
On Optimal Interconnections for VLSI (The Springer International Series in Engineering and Computer Science, 301)
Seller: Goodwill of Silicon Valley, SAN JOSE, CA, U.S.A.
Seller rating 4 out of 5 stars
Condition: very_good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in very good condition! The cover and any other included accessories are also in very good condition showing some minor use. The spine is straight, there are no rips tears or creases on the cover or the pages. Seller Inventory # GWSVV.0792394836.VG
Stock Image
On Optimal Interconnections for VLSI
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 3022328/3
Stock Image
On Optimal Interconnections for VLSI (The Springer International Series in Engineering and Computer Science, 301)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2416190185946
Stock Image
On Optimal Interconnections for VLSI (The Springer International Series in Engineering and Computer Science, 301)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780792394839_new
Buy New
£ 134.13
Shipping:
£ 11.98
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
On Optimal Interconnections for VLSI
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 308. Seller Inventory # 26300683
Stock Image
On Optimal Interconnections for VLSI
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 308 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Seller Inventory # 7547220
Seller Image
On Optimal Interconnections for VLSI
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Gebunden. Condition: New. On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for high-performance, high-density interconnections during the global and detailed routing phases of circuit layout. First, the book addresses area minimiza. Seller Inventory # 458443661
Stock Image
On Optimal Interconnections for VLSI
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 308. Seller Inventory # 18300673
Seller Image
On Optimal Interconnections for VLSI
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware - On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for high-performance, high-density interconnections during the global and detailed routing phases of circuit layout. First, the book addresses area minimization, with a focus on near-optimal approximation algorithms for minimum-cost Steiner routing. In addition to practical implementations of recent methods, the implications of recent results on spanning tree degree bounds and the method of Zelikovsky are discussed. Second, the book addresses delay minimization, starting with a discussion of accurate, yet algorithmically tractable, delay models. Recent minimum-delay constructions are highlighted, including provably good cost-radius tradeoffs, critical-sink routing algorithms, Elmore delay-optimal routing, graph Steiner arborescences, non-tree routing, and wiresizing. Third, the book addresses skew minimization for clock routing and prescribed-delay routing formulations. The discussion starts with early matching-based constructions and goes on to treat zero-skew routing with provably minimum wirelength, as well as planar clock routing. Finally, the book concludes with a discussion of multiple (competing) objectives, i.e., how to optimize area, delay, skew, and other objectives simultaneously. These techniques are useful when the routing instance has heterogeneous resources or is highly congested, as in FPGA routing, multi-chip packaging, and very dense layouts. Throughout the book, the emphasis is on practical algorithms and a complete self-contained development. On Optimal Interconnections for VLSI will be of use to both circuit designers (CAD tool users) as well as researchers and developers in the area of performance-driven physical design. Seller Inventory # 9780792394839