Fast and scalable parallel layout decomposition in double patterning lithography

  • Authors:
  • Wei Zhao;Hailong Yao;Yici Cai;Subarna Sinha;Charles Chiang

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • Integration, the VLSI Journal
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

For 32/22nm technology nodes and below, double patterning (DP) lithography has become the most promising interim solutions due to the delay in the deployment of next generation lithography (e.g., EUV). DP requires the partitioning of the layout patterns into two different masks, a procedure called layout decomposition. Layout decomposition is a key computational step that is necessary for double patterning technology. Existing works on layout decomposition are all single-threaded, which is not scalable in runtime and/or memory for large industrial layouts. This paper presents the first window-based parallel layout decomposition methods for improving both runtime and memory consumption. Experimental results are promising and show the presented parallel layout decomposition methods obtain upto 21x speedup in runtime and upto 7.5xreduction in peak memory consumption with acceptable solution quality.