专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2008057996A3 PRINTABILITY VERIFICATION BY PROGRESSIVE MODELING ACCURACY 审中-公开
标题翻译：通过逐步建模准确性进行可打印性验证
公开(公告)号：WO2008057996A3
公开(公告)日：2008-07-10
申请号：PCT/US2007083441
申请日：2007-11-02
申请人： IBM , LAI KAFAI , ROSENBLUTH ALAN E , GALLATIN GREGG M , MUKHERJEE MAHARAJ
发明人： LAI KAFAI , ROSENBLUTH ALAN E , GALLATIN GREGG M , MUKHERJEE MAHARAJ
IPC分类号： G06F17/50
CPC分类号： G03F1/36
摘要： 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.
摘要翻译：提供了验证光刻掩模设计的快速方法，其中通过使用包括光学和抗蚀剂模型的逐渐更准确的图像模型（411）迭代模拟和验证掩模布局的图像来识别灾难性错误（432）。逐渐精确的光学模型包括提供连续影响较小的SOCS内核。构建对应的抗蚀剂模型，其可以仅包括对应于光学模型的SOCS内核项，或者可以包括不同影响范围的图像特征项。与过量光相关的错误，例如桥接，旁瓣或SRAF打印错误，优选地用明场模拟来识别，而与光线不足有关的错误例如颈缩或线端缩短覆盖错误优选地用暗场识别模拟。

2. 发明申请

WO2005015346A3 DYNAMICALLY CONFIGURABLE FAULT TOLERANCE IN AUTONOMIC COMPUTING WITH MULTIPLE SERVICE POINTS 审中-公开
标题翻译：具有多个服务点的自动计算中的动态配置故障容错
公开(公告)号：WO2005015346A3
公开(公告)日：2005-09-22
申请号：PCT/US2004020906
申请日：2004-06-30
申请人： IBM , MUKHERJEE MAHARAJ
发明人： MUKHERJEE MAHARAJ
IPC分类号： G06F20060101 , G06F11/00 , G06F15/173 , G06F15/177
CPC分类号： G06F9/5061 , G06F2209/505 , H04L67/1002 , H04L67/1021 , H04L67/1023 , H04L67/1034 , H04L69/40
摘要： 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.
摘要翻译：描述了一种用于配置具有多个处理器（2）的系统（1）的方法，以向系统提供至少一个处理器群集，其中每个群集具有一个服务点（10）。从系统中的每个处理器到其他处理器计算距离（302）。然后计算多个总距离（303），其中每个总距离与一个处理器相关联。从多个总距离（304）确定最小总距离。一个处理器被分配为服务点; 该处理器是具有与其相关联的最小总距离的处理器。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式