Parallel maze routing on hypercube computers

Mall, R and Patnaik, LM (1991) Parallel maze routing on hypercube computers. In: Computer-Aided Design, 23 (6). pp. 454-459.

PDF Parallel_Maze1991.pdf Restricted to Registered users only Download (474kB) | Request a copy

Abstract

The routing problem of VLSI layout design is computationally very expensive because of the inherent complexity of the task. Consequently, with the trend to increasing complexity of VLSI circuits, the routing phase threatens to become a major bottleneck in the design process. Resorting to parallel processing to remedy this situation is a viable alternative. The paper proposes a parallel maze routing algorithm that is targeted to run on loosely coupled multiprocessor systems such as hypercubes.

Item Type:	Journal Article
Publication:	Computer-Aided Design
Publisher:	Elsevier
Additional Information:	Copyright of this article belongs to Elsevier.
Keywords:	Maze routing;Hypercube architecture;Parallel algorithms
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	06 Sep 2006
Last Modified:	19 Sep 2010 04:31
URI:	http://eprints.iisc.ac.in/id/eprint/8485

Actions (login required)

View Item