PALACE: A parallel and hierarchical layout analyzer and circuit extractor

Layout verification of VLSI circuits can be speeded up significantly by parallel execution. The approach described in this paper combines parallel and hierarchical verification of cells and cell areas using geometrical partitioning. In contrast to earlier approaches, design rule check and netlist extraction are performed in parallel without any functional restriction. This is accomplished by a new concept called multiple execution switching. Thus, industrial leading edge VLSI circuits can be handled. High speedups are obtained for large real-world layouts. A productive use is possible and will reduce time-to-market considerably.

[1]  Prithviraj Banerjee Parallel algorithms for VLSI computer-aided design , 1994 .

[2]  Rob A. Rutenbar,et al.  Design and performance evaluation of new massively parallel VLSI mask verification algorithms in JIGSAW , 1991, DAC '90.

[3]  W. Meier Hierarchical layout verification for submicron designs , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[4]  Prithviraj Banerjee,et al.  A parallel algorithm for hierarchical circuit extraction , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[5]  Andrew R. Pleszkun,et al.  An Algorithm for Design Rule Checking on a Multiprocessor , 1985, DAC 1985.

[6]  Joshua David Marantz Exploiting Parallelism in VLSI CAD , 1986 .

[7]  B.A. Tonkin Circuit extraction on a message-based multiprocessor , 1990, 27th ACM/IEEE Design Automation Conference.