By Topic

A parallel algorithm for channel routing problems [VLSI]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

A parallel algorithm for channel routing problems is presented. The problem is to route the given interconnections between two rows of terminals on a multilayer channel where the channel area must be minimized. The current advancement of VLSI chip technology allows one to use four layers composed of two metal layers and two polysilicon layers for routing in a chip. The goal of the proposed parallel algorithm is to find the near-optimum routing solution for the given interconnections in a short time. The algorithm is applied to four-layer channel routing problems requiring n×m×2 processing elements for the n-net-m-track problem. The algorithm has three advantages over the conventional algorithms: (1) it can be easily modified for accommodating more than four-layer problems; (2) it runs both on a sequential machine and on a parallel machine with maximally n×m×2 processors; and (3) the program size is very small. The algorithm is verified by solving seven bench-mark problems

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:11 ,  Issue: 4 )