18 March 2015 Comparison of OPC job prioritization schemes to generate data for mask manufacturing
Author Affiliations +
Abstract
Delivering mask ready OPC corrected data to the mask shop on-time is critical for a foundry to meet the cycle time commitment for a new product. With current OPC compute resource sharing technology, different job scheduling algorithms are possible, such as, priority based resource allocation and fair share resource allocation. In order to maximize computer cluster efficiency, minimize the cost of the data processing and deliver data on schedule, the trade-offs of each scheduling algorithm need to be understood. Using actual production jobs, each of the scheduling algorithms will be tested in a production tape-out environment. Each scheduling algorithm will be judged on its ability to deliver data on schedule and the trade-offs associated with each method will be analyzed. It is now possible to introduce advance scheduling algorithms to the OPC data processing environment to meet the goals of on-time delivery of mask ready OPC data while maximizing efficiency and reducing cost.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Travis Lewis, Travis Lewis, Vijay Veeraraghavan, Vijay Veeraraghavan, Kenneth Jantzen, Kenneth Jantzen, Stephen Kim, Stephen Kim, Minyoung Park, Minyoung Park, Gordon Russell, Gordon Russell, Mark Simmons, Mark Simmons, } "Comparison of OPC job prioritization schemes to generate data for mask manufacturing", Proc. SPIE 9427, Design-Process-Technology Co-optimization for Manufacturability IX, 942711 (18 March 2015); doi: 10.1117/12.2086927; https://doi.org/10.1117/12.2086927
PROCEEDINGS
9 PAGES


SHARE
Back to Top