Title :
Parallel algorithm for wiring two-terminal nets in the knock-knee mode
Author_Institution :
Dept. of Math. & Comput. Sci., Tennessee Univ., Martin, TN, USA
fDate :
31 Mar-2 Apr 1996
Abstract :
In this paper, the problem of stretching a layout in the knock-knee mode is represented while considering its wirability. The previous O(n×m) time serial algorithm for this problem which is bared on two layers needs (2m-1)×n layout area in the worst case, where m=number of rows and n number of columns. However, O(n log n) time serial algorithm that is able to wire all the two-terminal nets within (m×3n/2) layout area is given in the paper. This serial algorithm is applied to generate a parallel CREW PRAM algorithm that can wire all the nets in O(log n) time by using O(n) number of processors
Keywords :
VLSI; circuit layout CAD; computational complexity; parallel algorithms; (m×3n/2) layout area; O(n log n) time serial algorithm; knock-knee mode; parallel CREW PRAM algorithm; two-terminal nets; wirability; Algorithm design and analysis; Computer science; Knee; Parallel algorithms; Phase change random access memory; Propagation delay; Routing; Very large scale integration; Wire; Wiring;
Conference_Titel :
System Theory, 1996., Proceedings of the Twenty-Eighth Southeastern Symposium on
Conference_Location :
Baton Rouge, LA
Print_ISBN :
0-8186-7352-4
DOI :
10.1109/SSST.1996.493538
