By Topic

Exploiting parallelism in routing for a hierarchical VLSI design environment

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 $31
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)
Sagar, V.K. ; Essex Univ., Colchester, UK ; Massara, R.E.

This paper presents research into a novel technique for exploiting parallelism in the automatic routing process for hierarchical VLSI circuit design. A new parallel model which may be used to exploit the parallelism at each stage of the routing process is described. The model has been set up to be as flexible as possible so that the hardware on which it is based can be used to not only speed up the routing process, but also the other phases of the VLSI design cycle. It is often the case when designing hardware accelerators for VLSI design that the need to accelerate other phases of the VLSI design cycle, is ignored. This has often resulted in a very expensive, dedicated piece of hardware which cannot used to speed up other phases of the design process. For the case of routing, the dedicated hardware has been designed to accelerate specifically the maze routing algorithm which is more useful for routing PCBs rather than VLSI designs. The aim of this research is to investigate the possibility of a routing accelerator for VLSI routing based on general purpose processors and a general architecture

Published in:

Circuit Theory and Design, 1989., European Conference on

Date of Conference:

5-8 Sep 1989