Mall, R and Patnaik, LM (1991) Parallel maze routing on hypercube computers. In: Computer-Aided Design, 23 (6). pp. 454-459.
Restricted to Registered users only
Download (462Kb) | Request a copy
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|
|Additional Information:||Copyright of this article belongs to Elsevier.|
|Keywords:||Maze routing;Hypercube architecture;Parallel algorithms|
|Department/Centre:||Division of Information Sciences > Supercomputer Education & Research Centre
Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
|Date Deposited:||06 Sep 2006|
|Last Modified:||19 Sep 2010 04:31|
Actions (login required)