Optimal Interconnection Trees In The Plane
Download Optimal Interconnection Trees In The Plane PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Optimal Interconnection Trees In The Plane book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Optimal Interconnection Trees in the Plane
This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood across a wide range of metrics and cost functions. The book makes use of this mathematical theory to develop efficient algorithms for constructing such networks, with an emphasis on exact solutions. Marcus Brazil and Martin Zachariasen focus principally on the geometric structure of optimal interconnection networks, also known as Steiner trees, in the plane. They show readers how an understanding of this structure can lead to practical exact algorithms for constructing such trees. The book also details numerous breakthroughs in this area over the past 20 years, features clearly written proofs, and is supported by 135 colour and 15 black and white figures. It will help graduate students, working mathematicians, engineers and computer scientists to understand the principles required for designing interconnection networks in the plane that are as cost efficient as possible.
On Optimal Interconnections for VLSI
Author: Andrew B. Kahng
language: en
Publisher: Springer Science & Business Media
Release Date: 2013-04-17
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.
Discrete Geometry and Mathematical Morphology
This book constitutes the refereed proceedings of the Third International Joint Conference on Discrete Geometry and Mathematical Morphology, DGMM 2024, held in Florence, Italy during April 15–18, 2024. The 34 full papers included in this book were carefully reviewed and selected from 51 submissions. They were organized in topical sections as follows: Digital Geometry - Models, Transforms, and Visualization; Computational Aspects of Discrete Structures and Tilings; Learning Based Morphology; Hierarchical and Graph-Based Models, Analysis and Segmentation; Discrete and Combinatorial Topology; and Mathematical Morphology and Digital Geometry for Applications.