scispace - formally typeset
Proceedings ArticleDOI

TCG: a transitive closure graph-based representation for non-slicing floorplans

TLDR
The geometric relation among modules is transparent not only to the TCG representation but also to its operations, facilitating the convergence to a desired solution, and makes TCG an effective and flexible representation for handling the general floorplan/placement design problems with various constraints.
Abstract
In this paper, we propose a transitive closure graph-based representation for general floorplans, called TCG, and show its superior properties. TCG combines the advantages of popular representations such as sequence pair, BSG, and B*-tree. Like sequence pair and BSG, but unlike O-tree, B*-tree, and CBL, TCG is P-admissible. Like B*-tree, but unlike sequence pair, BSG, O-tree, and CBL, TCG does not need to construct additional constraint graphs for the cost evaluation during packing, implying faster runtime. Further, TCG supports incremental update during operations and keeps the information of boundary modules as well as the shapes and the relative positions of modules in the representation. More importantly, the geometric relation among modules is transparent not only to the TCG representation but also to its operations, facilitating the convergence to a desired solution. All these properties make TCG an effective and flexible representation for handling the general floorplan/placement design problems with various constraints. Experimental results show the promise of TCG.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

A thermal-driven floorplanning algorithm for 3D ICs

TL;DR: A thermal-driven 3D floorplanning algorithm with CBA representation that can reduce the wirelength by 29% and reduce the maximum on-chip temperature by 56% is proposed.
Journal ArticleDOI

Fixed-outline floorplanning: enabling hierarchical design

TL;DR: This paper studies the fixed-outline floorplan formulation that is more relevant to hierarchical design style and is justified for very large ASICs and SoCs and proposes new objective functions to drive simulated annealing and new types of moves that better guide local search in the new context.
Book

Three-Dimensional Integrated Circuit Design

TL;DR: In this article, the first book on 3D integrated circuit design, covering all of the technological and design aspects of this emerging design paradigm, while proposing effective solutions to specific challenging problems concerning the design of three-dimensional integrated circuits.
Book

Electronic Design Automation: Synthesis, Verification, and Test

TL;DR: EDA/VLSI practitioners and researchers in need of fluency in an "adjacent" field will find this an invaluable reference to the basic EDA concepts, principles, data structures, algorithms, and architectures for the design, verification, and test of VLSI circuits.
Journal ArticleDOI

Global optimization of cerebral cortex layout

TL;DR: Functional areas of mammalian cerebral cortex seem positioned to minimize costs of their interconnections, down to a best-in-a-billion optimality level, which may indicate cortex optimizing mechanisms involve more global processes.
References
More filters
Journal ArticleDOI

Optimization by Simulated Annealing

TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Proceedings ArticleDOI

A New Algorithm for Floorplan Design

TL;DR: A new algorithm for floorplan design using the method of simulated annealing to carry out the neighborhood search effectively and achieves a simultaneous minimization of area and total interconnection length in the final solution.
Proceedings ArticleDOI

B*-Trees: a new representation for non-slicing floorplans

TL;DR: An efficient, flexible, and effective data structure, B-trees for non-slicing floorplans, based on ordered binary trees and the admissible placement presented in [1], and a B-tree based simulated annealing scheme for floorplan design.
Proceedings ArticleDOI

Rectangle-packing-based module placement

TL;DR: A P-admissible solution space where each packing is represented by a pair of module name sequences is proposed, and hundreds of modules could be successfully packed as demonstrated.
Related Papers (5)