The Community for Technology Leaders
Proceedings of the Second Great Lakes Symposium on VLSI (1992)
Kalamazoo, MI, USA
Feb. 28, 1992 to Feb. 29, 1992
ISBN: 0-8186-2610-0
pp: 95-102
Tae Won Cho , Dept. of Electr. Eng., Kentucky Univ., Lexington, KY, USA
S.S. Pyo , Dept. of Electr. Eng., Kentucky Univ., Lexington, KY, USA
J.R. Heath , Dept. of Electr. Eng., Kentucky Univ., Lexington, KY, USA
ABSTRACT
A parallel algorithm, called PARALLEX, which uses a conflict resolving method, has been developed for the switchbox routing problem in the parallel processing environment. PARALLEX can achieve a very high degree of parallelism by generating as many processes as nets. Each process is assigned to route a net, which bears the same identification number as the process. If any conflict is found for the current route of a net, then each process classifies the conflict segments with groups by their relations. Each process finds partial solutions, and merges them with the partial solutions from other processes to make a conflict-free switchbox. The speed-ups for 7-nets and 19-nets problem were 4.7 and 10 respectively.<>
INDEX TERMS
circuit layout CAD, parallel algorithms
CITATION

Tae Won Cho, S. Pyo and J. Heath, "A new conflict resolving switchbox router," Proceedings of the Second Great Lakes Symposium on VLSI(GLSV), Kalamazoo, MI, USA, , pp. 95-102.
doi:10.1109/GLSV.1992.218359
94 ms
(Ver 3.3 (11022016))