DocumentCode :
3164223
Title :
A new conflict resolving switchbox router
Author :
Cho, Tae Won ; Pyo, S.S. ; Heath, J. Robert
Author_Institution :
Dept. of Electr. Eng., Kentucky Univ., Lexington, KY, USA
fYear :
1992
fDate :
28-29 Feb 1992
Firstpage :
95
Lastpage :
102
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
Keywords :
circuit layout CAD; parallel algorithms; PARALLEX; conflict resolving switchbox router; parallel algorithm; parallel processing environment; Communication switching; Communications technology; Data structures; Heat engines; Iterative algorithms; Iterative methods; Parallel algorithms; Parallel processing; Resistance heating; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI, 1992., Proceedings of the Second Great Lakes Symposium on
Conference_Location :
Kalamazoo, MI
Print_ISBN :
0-8186-2610-0
Type :
conf
DOI :
10.1109/GLSV.1992.218359
Filename :
218359
Link To Document :
بازگشت