Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 5 (1996), Issue 1, Pages 1-10
http://dx.doi.org/10.1155/1996/96136

An Efficient and Fast Algorithm for Routing Over the Cells

Department of Information and Computer Education, National Taiwan Normal University, Taiwan, Taipei, China

Received 7 August 1992; Accepted 20 August 1994

Copyright © 1996 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

A linear time algorithm for routing over the cells is presented. The algorithm tries to reduce maximum channel density by routing some connections over the cells. The algorithm first defines a new scheme for channel representation and formulates the problem based on an intersection graph derived from the new scheme. Then, a feasible independent set of the intersection graph is found for routing some subnets over the cells. The algorithm is implemented and evaluated with several well known benchmarks. In comparison with previous research, our results are satisfactory, and the algorithm takes substantially less CPU time than those of previous works. For Deutsch's difficult example, the previous algorithms take about 29.25 seconds on an average but our new algorithm needs only 5.6 seconds.