Performance Comparison of Several Data Structures for Storing VLSI Geometry (CROSBI ID 495085)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Grgek, Marijana ; Branica, Ivan ; Divković-Pukšec, Julijana
engleski
Performance Comparison of Several Data Structures for Storing VLSI Geometry
This paper, in its first part, describes several well-known dana structures for storing VLSI geometry and presents their implementation. KD tree data structure, as one of the first used for this purpose, is described in detail. Its usage is illustrated on the problem of design rule check (DRC) verification. Corner stitching, data structure introduced by Ousterhout, is presented and its main characteristics are given. Patented bucketing dana structure is described. This data structure was independently implemented on the basis of patent description. The implementation was benchmark for other algorithms, as data structure that is used in modern CAD tools. Performance of the described algorithms was tested on several realworld layout examples in the second part of the paper. Speed of typical operations, together with memory requirements, were compared. In the conclusion main advantages and disadvantages of the implemented algorithms are discussed.
CAD geometry data structure; VLSI layout; VLSI physical design; performance comparison
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
156-159-x.
2003.
objavljeno
Podaci o matičnoj publikaciji
Proceedings of Eurocon 2003
Zajc, Baldomir ; Tkalčič, Marko
Ljubljana:
Podaci o skupu
Eurocon 2003, Computer as a Tool
predavanje
22.09.2003-24.09.2003
Ljubljana, Slovenija