BookDOI
Handbook of Algorithms for Physical Design Automation
Reads0
Chats0
TLDR
Handbook of Algorithms for Physical Design Automation provides a detailed overview of VLSI physical design automation, emphasizing state-of-the-art techniques, trends and improvements that have emerged during the previous decade.Abstract:
The physical design flow of any project depends upon the size of the design, the technology, the number of designers, the clock frequency, and the time to do the design. As technology advances and design-styles change, physical design flows are constantly reinvented as traditional phases are removed and new ones are added to accommodate changes in technology. Includes a personal perspective from Ralph Otten as he looks back on the major technical milestones in the history of physical design automation. Explore State-of-the-Art Techniques and TrendsHandbook of Algorithms for Physical Design Automation provides a detailed overview of VLSI physical design automation, emphasizing state-of-the-art techniques, trends and improvements that have emerged during the previous decade. After a brief introduction to the modern physical design problem, basic algorithmic techniques, and partitioning, the book discusses significant advances in floorplanning representations and describes recent formulations of the floorplanning problem. The text also addresses issues of placement, net layout and optimization, routing multiple signal nets, manufacturability, physical synthesis, special nets, and designing for specialized technologies. Highly-Focused Information for Next Generation Design Problems Although several books on this topic are currently available, most are either too broad or out of date. Alternatively, proceedings and journal articles are valuable resources for researchers in this area, but the material is widely dispersed in the literature. This handbook pulls together a broad variety of perspectives on the most challenging problems in the field, and focuses on emerging problems and research results.read more
Citations
More filters
Proceedings ArticleDOI
The Complement of Hypergraph Capacitated Min-k-Cut Problem
Wenxing Zhu,Jiarui Chen +1 more
TL;DR: This work presents a local search algorithm for hyper graph capacitated min-k-cut problem, using the idea of complement, and achieves a competitive approximation factor of 1/(1+s/2(k-1)), where s is the largest cardinality of all hyper edges.
Book ChapterDOI
Integrated Approach to the Solution of Computer-Aided Design Problems
TL;DR: An integrated approach to the placement and routing of elements of digital computing devices of large dimensions based on the joint decision of the problem of designing such devices using fuzzy control methods, multiagent systems and parallel computing is described.
Proceedings ArticleDOI
A Multithreaded Parallel Global Routing Method with Overlapped Routing Regions
TL;DR: This study proposes a multithreaded parallel routing algorithm for LSI design that reduces the wait time of the threads, and experimentally confirmed that the routing quality was not degraded compared to the sequential execution.
Proceedings ArticleDOI
A method for synchronous dataflow retiming
TL;DR: A method of retiming the spatial synchronous dataflow graph (SDF) is proposed, which is based on the SDF representation in the multidimensional space, described by VHDL language and is modeled and compiled using CAD tools.