PARALLEL MAZE ROUTING ON HYPERCUBE COMPUTERS

被引：0

作者：

MALL, R

PATNAIK, LM

机构：

[1] INDIAN INST SCI,CTR SUPERCOMP EDUC & RES,BANGALORE 560012,KARNATAKA,INDIA

[2] INDIAN INST SCI,MICROPROC APPLICAT LAB,BANGALORE 560012,KARNATAKA,INDIA

来源：

COMPUTER-AIDED DESIGN | 1991年 / 23卷 / 06期

关键词：

MAZE ROUTING; HYPERCUBE ARCHITECTURE; PARALLEL ALGORITHMS;

D O I：

10.1016/0010-4485(91)90013-M

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：454 / 459

页数：6

共 8 条

[1] Bach MJ, 1986, DESIGN UNIX OPERATIN
[2] HAYES JP, 1986, 1986 P INT C PAR PRO, P653
[3] LEE CY, 1961, IRE T ELECT COMPUTER, V10, P345
[4] MALL R, 1989, THESIS INDIAN I SCI
[5] OLUKTON OA, 1987, 24TH P DES AUT C
[6] SAAD Y, 1985, YALEUDCSRR389 YAL U
[7] Watanabe T., 1986, 23rd ACM/IEEE Design Automation Conference. Proceedings 1986 (Cat. No.86CH2288-9), P574, DOI 10.1145/318013.318105
[8] Won Y., 1987, Proceedings of the 1987 International Conference on Parallel Processing, P630

← 1 →