Algorithms for two bottleneck optimization problems
Journal of Algorithms
On the Maximum Scatter Traveling Salesperson Problem
SIAM Journal on Computing
Well-Spaced Labelings of Points in Rectangular Grids
SIAM Journal on Discrete Mathematics
MARS-a multilevel full-chip gridless routing system
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Dealing with IC manufacturability in extreme scaling
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
Electron beam lithography (EBL) has shown great promise for photomask fabrication; however, its successive heating process centralizing in a small region may cause a severe problem of critical dimension (CD) distortion. Consequently, subfield scheduling which reorders the sequence of the writing process is needed to avoid successive writing of neighboring subfields. In addition, the writing process of a subfield raises the temperature of neighboring regions and may block other subfields for writing. This paper presents the first work to solve the subfield scheduling problem while taking into account blocked regions by formulating the problem into a constrained maximum scatter travelling salesman problem (constrained MSTSP). To tackle the constrained MSTSP which can be shown to be NP-complete in general, we identify a special case thereof with points on two parallel lines and solve it optimally in linear time. We then decompose the constrained MSTSP into subproblems conforming to the special case, solve each subproblem optimally and efficiently by a graph-based algorithm, and then merge the sub-solutions into a complete scheduling solution. Experimental results show that our algorithm is effective and efficient in finding good subfield scheduling solutions that can alleviate the successive heating problem (and thus reduce CD distortion) for e-beam photomask fabrication.