Fast evaluation of bounded slice-line grid

Authors:
Song Chen;Xian-Long Hong;She-Qin Dong;Yu-Chun Ma;Chung-Kuan Cheng;Jun Gu
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China;Department of Computer Science and Engineering, University of California, San Diego;Department of Computer Science, Hong Kong University of Science and Technology, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 11
Cited 0

Algorithmic graph theory

Algorithmic graph theory
The multi-BSG: stochastic approach to an optimum packing of convex-rectilinear blocks

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
B*-Trees: a new representation for non-slicing floorplans

Proceedings of the 37th Annual Design Automation Conference
FAST-SP: a fast algorithm for block placement based on sequence pair

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
TCG: a transitive closure graph-based representation for non-slicing floorplans

Proceedings of the 38th annual Design Automation Conference
Introduction to Algorithms

Introduction to Algorithms
Corner block list: an effective and efficient topological representation of non-slicing floorplan

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
An optimum placement search algorithm based on extended corner block list

Journal of Computer Science and Technology
VLSI module placement based on rectangle-packing by the sequence-pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Module packing based on the BSG-structure and IC layout applications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bounded Slice-line Grid (BSG) is an elegant representation of block placement, because it is very intuitionistic and has the advantage of handling various placement constraints. However, BSG has attracted little attention because its evaluation is very time-consuming. This paper proposes a simple algorithm independent of the BSG size to evaluate the BSG representation in O(n log log n) time, where n is the number of blocks. In the algorithm, the BSG-rooms are assigned with integral coordinates firstly, and then a linear sorting algorithm is applied on the BSG-rooms where blocks are assigned to compute two block sequences, from which the block placement can be obtained in O(n log log n) time. As a consequence, the evaluation of the BSG is completed in O(n log log n) time, where n is the number of blocks. The proposed algorithm is much faster than the previous graph-based O(n2) algorithm. The experimental results demonstrate the efficiency of the algorithm.