Arid
DOI10.1117/12.954019
Fast Layout Processing Methodologies for Scalable Distributed Computing Applications
Kang, Chang-woo1; Shin, Jae-pil1; Durvasula, Bhardwaj2; Seo, Sang-won1; Jung, Dae-hyun1; Lee, Jong-bae1; Park, Young-kwan1
通讯作者Kang, Chang-woo
会议名称Conference on Photomask and Next-Generation Lithography Mask Technology XIX
会议日期APR 17-19, 2012
会议地点Yokohama, JAPAN
英文摘要

As the feature size shrinks to sub-20nm, more advanced OPC technologies such as ILT and the new lithographic resolution by EUV become the key solutions for device fabrication. These technologies leads to the file size explosion of up to hundreds of gigabytes of GDSII and OASIS files mainly due to the addition of complicated scattering bars and flattening of the design to compensate for long range effects. Splitting and merging layout files have been done sequentially in typical distributed computing layout applications. This portion becomes the bottle neck, causing the scalability to become poor. According to the Amdahl's law, minimizing the portion of sequential part is the key to get the maximum speed up.


In this paper, we present scalable layout dividing and merging methodologies: Skeleton file based querying and direct OASIS file merging. These methods not only use a very minimum memory footprint but also achieve remarkable speed improvement. The skeleton file concept is very novel for a distributed application requiring geometrical processing, as it allows almost pseudo-random access into the input GDSII or OASIS file. Client machines can make use of the random access and perform fast query operations. The skeleton concept also works very well for flat input layouts, which is often the case of post-OPC data. Also, our OASIS file merging scheme is a smart approach which is equivalent of a binary file concatenation scheme. The merging method for OASIS files concatenates shape information in binary format with basic interpretation of bits with very low memory usage.


We have observed that the skeleton file concept achieved 13.5 times speed improvement and used only 3.78% of memory on the master, over the conventional concept of converting into an internal format. Also, the merging speed is very fast, 28MB/sec and it is 44.5 times faster than conventional method. On top of the fast merging speed, it is very scalable since the merging time grows in linear fashion with respect to the file size. Our experiment setup includes hundreds of gigabytes of GDSII and OASIS files. We demonstrate in the paper, that the skeleton file based querying and direct OASIS file-merging schemes are very scalable for distributed computing applications for large volume layout. Additionally, we used embedded skeleton file scheme to improve file loading speed in layout viewer system and achieved 61 time speedup. We used Nirmaan, SoftJin's post-layout EDA toolkit for skeleton file based querying, OASIS file-merging and embedded skeleton file schemes.


英文关键词Layout Skeleton file OASIS file merge distributed computing
来源出版物PHOTOMASK AND NEXT-GENERATION LITHOGRAPHY MASK TECHNOLOGY XIX
ISSN0277-786X
EISSN1996-756X
出版年2012
卷号8441
EISBN978-0-8194-9136-7
出版者SPIE-INT SOC OPTICAL ENGINEERING
类型Proceedings Paper
语种英语
国家South Korea;India
收录类别CPCI-S
WOS记录号WOS:000312199500025
WOS类目Optics ; Imaging Science & Photographic Technology
WOS研究方向Optics ; Imaging Science & Photographic Technology
资源类型会议论文
条目标识符http://119.78.100.177/qdio/handle/2XILL650/300890
作者单位1.Samsung Elect, San 16 Banwol Dong, Hwasung City 445701, Gyeonggi Do, South Korea;
2.Softjin Technol, Bangalore 560066, Karnataka, India
推荐引用方式
GB/T 7714
Kang, Chang-woo,Shin, Jae-pil,Durvasula, Bhardwaj,et al. Fast Layout Processing Methodologies for Scalable Distributed Computing Applications[C]:SPIE-INT SOC OPTICAL ENGINEERING,2012.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Kang, Chang-woo]的文章
[Shin, Jae-pil]的文章
[Durvasula, Bhardwaj]的文章
百度学术
百度学术中相似的文章
[Kang, Chang-woo]的文章
[Shin, Jae-pil]的文章
[Durvasula, Bhardwaj]的文章
必应学术
必应学术中相似的文章
[Kang, Chang-woo]的文章
[Shin, Jae-pil]的文章
[Durvasula, Bhardwaj]的文章
相关权益政策
暂无数据
收藏/分享

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。