Title
On Optimal Interconnections for VLSI (The Springer International Series in Engineering and Computer Science, 301),Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for highperformance, highdensity interconnections during the global and detailed routing phases of circuit layout. First, the book addresses area minimization, with a focus on nearoptimal approximation algorithms for minimumcost 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 minimumdelay constructions are highlighted, including provably good costradius tradeoffs, criticalsink routing algorithms, Elmore delayoptimal routing, graph Steiner arborescences, nontree routing, and wiresizing. Third, the book addresses skew minimization for clock routing and prescribeddelay routing formulations. The discussion starts with early matchingbased constructions and goes on to treat zeroskew 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, multichip packaging, and very dense layouts.Throughout the book, the emphasis is on practical algorithms and a complete selfcontained 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 performancedriven physical design.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.