Abstract:
A method is described for configuring a system (1) having a plurality of processors (2) to provide the system with at least one cluster of processors, where each cluster has one service point (10). A distance is computed from each processor to other processors in the system (302). A plurality of total distances is then computed (303), where each total distance is associated with one processor. A minimum total distance is determined from the plurality of total distances (304). One processor is assigned to be the service point; this processor is the processor having the minimum total distance associated therewith.
Abstract:
PROBLEM TO BE SOLVED: To provide a method for calculating intermediate-range and long-range image contributions from mask polygons. SOLUTION: An algorithm is introduced having application to optical proximity correction in optical lithography. A finite integral for each sector of a polygon replaces an infinite integral. A finite integral is achieved by integrating over two triangles instead of integrating on full sectors. An analytical approach is presented for a power law kernel to reduce the numerical integration of a sector to an analytical expression evaluation. The mask polygon is divided into a plurality of regions to calculate effects of interaction such as intermediate-range and long-range effects, by truncating the mask instead of truncating the kernel function. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method for controlling a computer system having a processor including a plurality of cores. SOLUTION: Controlling a computer system having at least one processor including a plurality of cores includes establishing a core max value that sets the maximum number of the plurality of cores operating at a predetermined time period based on an operating condition, determining a core run value that is associated with the number of the plurality of cores of the at least one processor operating at the predetermined time period, and stopping at least one of the plurality of cores in the event the core run value exceeds the core max value at the predetermined time period. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a method and a program storage device in which model base optical proximity collection is performed, by providing a region of interest (ROI) having interaction distance and tracing at least one polygon in the ROI. SOLUTION: A cut line or a plurality of cut lines of sample points showing a set of apexes are formed within the ROI so as to be traversed at least one side edge of polygon. By determining an angular position, and a first part and a second part of the cut line in opposing side surfaces which intersect between the cut line and the side edge of the polygon, and then, based on the angular position and the first part and the second part of the cut line extending the original ROI over the interaction distance, new ROI is formed. By this form, various new ROI is formed in various different directions. Finally, optical proximity can be corrected. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method for performing model-based photolithography correction by partitioning a cell array layout having a plurality of polygons into a plurality of cells covering the layout, and to provide a program storage device. SOLUTION: The layout is representative of a desired design data hierarchy. A density map is generated corresponding to interactions between the polygons and the plurality of cells, and then the densities within each cell are convolved. An interaction map is formed by using the convolved densities, followed by truncating the interaction map to form a map of truncated cells. Substantially identical groupings of the truncated cells are segregated respectively into differing ones of a plurality of buckets. Each bucket contains a single set of identical groupings of truncated cells. A hierarchal arrangement is generated using the buckets, and the desired design data hierarchy is performed by using the hierarchal arrangement to ultimately correct for photolithography. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
A method is described for configuring a system (1) having a plurality of processors (2) to provide the system with at least one cluster of processors, where each cluster has one service point (10). A distance is computed from each processor to other processors in the system (302). A plurality of total distances is then computed (303), where each total distance is associated with one processor. A minimum total distance is determined from the plurality of total distances (304). One processor is assigned to be the service point; this processor is the processor having the minimum total distance associated therewith.
Abstract:
A fast method of verifying a lithographic mask design is provided wherein catastrophic errors (432) are identified by iteratively simulating and verifying images for the mask layout using progressively more accurate image models (411), including optical and resist models. Progressively accurate optical models include SOCS kernels that provide successively less influence. Corresponding resist models are constructed that may include only SOCS kernel terms corresponding to the optical model, or may include image trait terms of varying influence ranges. Errors associated with excessive light, such as bridging, side- lobe or SRAF printing errors, are preferably identified with bright field simulations, while errors associated with insufficient light, such as necking or line-end shortening overlay errors, are preferably identified with dark field simulations.
Abstract:
PROBLEM TO BE SOLVED: To provide a method for carrying out model-based optical proximity correction by disposing a mask matrix having a region of interest (ROI) and locating a plurality of points of interest within the mask matrix, and to provide a program storage device for executing the above method. SOLUTION: A first polygon 200 having a plurality of vertices representative of the located points of interest is computed, followed by determining a spatial relationship between the vertices and the ROI 100. The vertices of the first polygon are pinned to boundaries of and within the ROI to form a second polygon 300 on the ROI. This processing is repeated for all vertices of the first polygon to collapse the second polygon on the ROI. The collapsed second polygon is used to correct for optical proximity. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method for computing a phase map within an optical proximity correction simulation kernel. SOLUTION: A first method utilizes simulated wavefront information from randomly generated data. A second method uses measured data from optical tools. A phase map is created by analytically embedding a randomly generated two-dimensional array comprising complex numbers of wavefront information, and performing an inverse Fourier transform on the resultant array. A filtering function requires the amplitude of each element of the array to be multiplied by a Gaussian function. A power law is then applied to the array. The elements of the array are shuffled, and converted from a phasor form to a real/imaginary form. A two-dimensional fast Fourier transform is applied. The array is then unshuffled and converted back to the phasor form. COPYRIGHT: (C)2005,JPO&NCIPI