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

1. 发明授权

US06314561B1 Intelligent cache management mechanism 失效
标题翻译：智能缓存管理机制
公开(公告)号：US06314561B1
公开(公告)日：2001-11-06
申请号：US08420540
申请日：1995-04-12
申请人： Mark Robert Funk , Steven Raymond Kunkel , Mikko Herman Lipasti , Bilha Mendelson , Robert Ralph Roedinger , William Jon Schmidt
发明人： Mark Robert Funk , Steven Raymond Kunkel , Mikko Herman Lipasti , Bilha Mendelson , Robert Ralph Roedinger , William Jon Schmidt
IPC分类号： G06F945
CPC分类号： G06F8/4442 , G06F12/0862
摘要： The data cache management mechanism of the present invention is created by an optimizing compiler. The optimizing compiler intelligently places non-blocking preload instructions into the instruction stream of the computer system so as to minimize both the frequency and detrimental effect of cache misses. The non-blocking preload instructions are placed into the instruction stream based on the existence of predictor constructs that foretell what information the processor will need and when it will need it. As a result, cache misses are either avoided entirely or reduced in severity.
摘要翻译：本发明的数据高速缓存管理机制由优化编译器创建。优化编译器智能地将非阻塞预加载指令放置到计算机系统的指令流中，以便最小化高速缓存未命中的频率和不利影响。基于预测器处理器将需要哪些信息以及何时需要它的预测器构造的存在，将非阻塞预加载指令放入指令流中。因此，高速缓存未命中或是完全避免或严重性降低。

2. 发明授权

US6029004A Method and apparatus for modular reordering of portions of a computer program based on profile data 失效
标题翻译：基于简档数据对计算机程序的部分进行模块化重排序的方法和装置
公开(公告)号：US6029004A
公开(公告)日：2000-02-22
申请号：US819526
申请日：1997-03-17
申请人： Vita Bortnikov , Bilha Mendelson , Mark Novick , Robert Ralph Roediger , William Jon Schmidt , Inbal Shavit-Lottem
发明人： Vita Bortnikov , Bilha Mendelson , Mark Novick , Robert Ralph Roediger , William Jon Schmidt , Inbal Shavit-Lottem
IPC分类号： G06F9/45 , G06F9/44
CPC分类号： G06F8/445
摘要： An apparatus and method reorder portions of a computer program in a way that achieves both enhanced performance and maintainability of the computer program. A global call graph is initially constructed that includes profile data. From the information in the global call graph, an intramodular call graph is generated for each module. Reordering techniques are used to reorder the procedures in each module according to the profile data in each intramodular call graph. An intermodular call graph is generated from the information in the global call graph. Reordering techniques are used to reorder the modules in the computer program. By reordering procedures within modules, then reordering the modules, enhanced performance is achieved without reordering procedures across module boundaries. Respecting module boundaries enhances the maintainability of the computer program by allowing a module to be replaced without adversely affecting the other modules while still providing many of the advantages of global procedure reordering.
摘要翻译：一种装置和方法以实现计算机程序的增强的性能和可维护性的方式重新排序计算机程序的部分。最初构建包括配置文件数据的全局调用图。从全局调用图中的信息，为每个模块生成一个集体内调用图。根据每个模块间调用图中的配置文件数据，重新排序技术用于对每个模块中的过程重新排序。从全局调用图中的信息生成一个多模式调用图。重新排序技术用于重新排序计算机程序中的模块。通过重新排序模块中的过程，然后重新排序模块，实现增强的性能，而无需跨模块边界重新排序过程。尊重模块边界通过允许更换模块而不会对其他模块产生不利影响，从而提高计算机程序的可维护性，同时仍然提供全局过程重新排序的许多优点。

3. 发明授权

US06631518B1 Generating and utilizing organized profile information 失效
标题翻译：生成和利用有组织的资料信息
公开(公告)号：US06631518B1
公开(公告)日：2003-10-07
申请号：US08820736
申请日：1997-03-19
申请人： Vita Bortnikov , David John Lambert , Bilha Mendelson , Robert Ralph Roediger , William Jon Schmidt , Inbal Shavit-Lottem
发明人： Vita Bortnikov , David John Lambert , Bilha Mendelson , Robert Ralph Roediger , William Jon Schmidt , Inbal Shavit-Lottem
IPC分类号： G06F945
CPC分类号： G06F11/3476 , G06F11/3466 , G06F2201/86 , G06F2201/865 , G06F2201/88
摘要： Disclosed is a system and method for a profiling system wherein profile data is stored in a separable hierarchical fashion such that profile data for each compiled procedure in a computer program can be readily identified and utilized. In particular, each source module has a corresponding profile data file and each procedure has a corresponding procedure profile area. The system and method also includes a mechanism for verifying the existence and validity of profile information, and a mechanism for handling invalid profile information.
摘要翻译：公开了一种用于分析系统的系统和方法，其中简档数据以可分离的分层方式存储，使得可以容易地识别和利用计算机程序中的每个编译过程的简档数据。特别地，每个源模块具有对应的简档数据文件，并且每个过程具有对应的过程简档区域。该系统和方法还包括用于验证简档信息的存在和有效性的机制，以及用于处理无效简档信息的机制。

4. 发明授权

US5950009A Method and apparatus for profile-based reordering of program portions in a computer program 失效
标题翻译：用于计算机程序中的程序部分的基于简档的重新排序的方法和装置
公开(公告)号：US5950009A
公开(公告)日：1999-09-07
申请号：US814527
申请日：1997-03-10
申请人： Vita Bortnikov , Bilha Mendelson , Mark Novick , William Jon Schmidt , Inbal Shavit-Lottem
发明人： Vita Bortnikov , Bilha Mendelson , Mark Novick , William Jon Schmidt , Inbal Shavit-Lottem
IPC分类号： G06F9/45 , G06F9/445
CPC分类号： G06F8/445
摘要： An apparatus and several methods provide for a more optimized computer program that will have a faster execution time than was possible using the prior art reordering technique that adds to a trace until it finds no more predecessors or successors to add. The apparatus and methods disclosed herein use a variety of methods to reorder the program portions in a more intelligent manner that will improve its run-time performance. Each of these methods involves constructing traces in the control flow graph of the computer program. In a first embodiment, a basic block is only added to a trace if it is not negligible within predetermined limits. This negligibility test results in traces that are not extended for infrequently executed basic blocks. In a second embodiment, a basic block is only added to a trace if it is a perfect partner with the last basic block added to the trace. The concept of a "perfect partner" helps to match basic blocks together in a trace that have the greatest affinity for each other. In a third embodiment, a basic block is only added to a trace if it satisfies "should follow" flags and predetermined negligibility criteria. The "should follow" flags and negligibility criteria provide a complex criteria for adding basic blocks to a trace, criteria that create more efficient code in some specific circumstances.
摘要翻译：一种装置和几种方法提供了一种更优化的计算机程序，该程序具有比使用现有技术重新排序技术更快的执行时间，该技术可以添加到跟踪中，直到找不到更多的前导或后继来添加。本文公开的装置和方法使用各种方法以更智能的方式重新排序程序部分，这将改善其运行时性能。这些方法中的每一个都涉及在计算机程序的控制流程图中构造跟踪。在第一实施例中，如果基本块仅在预定限度内不可忽略，则仅添加到轨迹。这种可忽略性测试导致对于不经常执行的基本块不扩展的迹线。在第二实施例中，如果基本块是与添加到跟踪的最后基本块的完美伙伴，则仅添加到跟踪。 “完美伴侣”的概念有助于将基本块在一起，彼此之间具有最大的亲和力。在第三实施例中，如果基本块满足“应遵循”标志和预定的可忽略性标准，则仅添加到跟踪。 “应遵循”标志和忽略标准为添加基本块的跟踪提供了一个复杂的标准，在某些特定情况下创建更有效的代码的标准。

5. 发明申请

US20090094590A1 DETECTING CHANGE IN PROGRAM BEHAVIOR FOR ADAPTIVE CODE OPTIMIZATION 失效
标题翻译：检测自适应代码优化程序行为的变化
公开(公告)号：US20090094590A1
公开(公告)日：2009-04-09
申请号：US11869477
申请日：2007-10-09
申请人： Bilha Mendelson , Nitzan Peleg
发明人： Bilha Mendelson , Nitzan Peleg
IPC分类号： G06F9/44
CPC分类号： G06F8/443 , G06F11/3466
摘要： A computer implemented method, apparatus, and computer program product for generating an optimization insensitive behavior profile. In one embodiment, a source identifier is assigned to each instruction in an original control flow graph representing a program code prior to optimization. The identifiers identify a basic block associated with the instruction or a group of basic blocks. A source identifier in the set of source identifiers is assigned to instructions in an optimized control flow graph representing the program code after optimizing the program code. The instructions in the optimized control flow graph are mapped to the original control flow graph using the set of source identifiers to form a mapping transformation. Behavior profile data associated with the optimized program code is moved to basic blocks in the original control flow graph using the mapping transformation to form the optimization insensitive behavior profile.
摘要翻译：一种用于生成优化不敏感行为简档的计算机实现的方法，装置和计算机程序产品。在一个实施例中，源标识符被分配给表示优化之前的程序代码的原始控制流程图中的每个指令。标识符标识与指令或一组基本块相关联的基本块。源标识符集中的源标识符被分配给优化程序代码之后的表示程序代码的优化控制流程图中的指令。优化的控制流程图中的指令使用源标识符集映射到原始控制流图，以形成映射变换。与优化的程序代码相关联的行为简档数据使用映射转换移动到原始控制流程图中的基本块，以形成优化不敏感行为配置文件。

6. 发明授权

US06925638B1 Mutability analysis in Java 失效
标题翻译： Java中的可变性分析
公开(公告)号：US06925638B1
公开(公告)日：2005-08-02
申请号：US09667430
申请日：2000-09-21
申请人： Larry Koved , Bilha Mendelson , Sara Porat , Marina Biberstein
发明人： Larry Koved , Bilha Mendelson , Sara Porat , Marina Biberstein
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F8/433 , G06F9/4488
摘要： A system and method for detecting the mutability of fields and classes in an arbitrary program component written in an object oriented programming language is disclosed. A variable is considered to be mutable if a new value is stored into it, as well as if any of its reachable variables are mutable. The system and method uses a static analysis algorithm which can be applied to any software component rather than whole programs. The analysis classifies fields and classes as either mutable or immutable. In order to facilitate open-world analysis, the algorithm identifies situations that expose variables to potential modification by code outside the component, as well as situations where variables are modified by the analyzed code. An implementation of the analysis is presented which focuses on detecting mutability of class variables, so as to avoid isolation problems. The implementation incorporates intra- and inter-procedural data-flow analyses and is shown to be highly scalable. Experimental results demonstrate the effectiveness of the algorithms.
摘要翻译：公开了一种用于检测以面向对象编程语言编写的任意程序组件中的字段和类的可变性的系统和方法。如果将一个新值存储到其中，并且其任何可访问变量是可变的，则该变量被认为是可变的。该系统和方法使用静态分析算法，可以应用于任何软件组件而不是整个程序。分析将字段和类分类为可变或不可变。为了方便开放世界的分析，该算法识别了将变量暴露给组件外的代码进行潜在修改的情况，以及通过分析代码修改变量的情况。提出了分析的实现，重点是检测类变量的可变性，以避免隔离问题。该实现包含了内部和程序间数据流分析，并被证明是高度可扩展的。实验结果证明了算法的有效性。

7. 发明授权

US6145125A Method and storage medium for building very large executable programs 有权
标题翻译：用于构建非常大的可执行程序的方法和存储介质
公开(公告)号：US6145125A
公开(公告)日：2000-11-07
申请号：US190166
申请日：1998-11-12
申请人： Jan Civlin , Gadi Haber , Bilha Mendelson , David Bernstein , Itai Nahshon
发明人： Jan Civlin , Gadi Haber , Bilha Mendelson , David Bernstein , Itai Nahshon
IPC分类号： G06F9/445 , G06F9/45 , G06F9/42
CPC分类号： G06F8/447 , G06F9/44521
摘要： A method for effecting a direct jump in an executable program module to a target address displaced from a source address by a specified distance that is greater than a maximum permitted range. During program linkage the direct jump is split into at least two component direct jumps each no greater than the maximum permitted range, thus allowing the direct jump to be achieved by jumping sequentially from the source address to the target address via each of the component direct jumps. A storage medium for storing data representative of the executable program module contains at least one trampoline for performing the component direct jumps.
摘要翻译：一种用于将可执行程序模块直接跳转到从源地址偏移大于最大允许范围的指定距离的目标地址的方法。在程序联动期间，直接跳转被分成至少两个不超过最大允许范围的分量直接跳跃，从而允许通过每个分量直接跳跃从源地址到目标地址顺序跳转来实现直接跳转。用于存储表示可执行程序模块的数据的存储介质包含至少一个用于执行部件直接跳转的蹦床。

8. 发明授权

US08214817B2 Detecting change in program behavior for adaptive code optimization 失效
标题翻译：检测自适应代码优化程序行为的变化
公开(公告)号：US08214817B2
公开(公告)日：2012-07-03
申请号：US11869477
申请日：2007-10-09
申请人： Bilha Mendelson , Nitzan Peleg
发明人： Bilha Mendelson , Nitzan Peleg
IPC分类号： G06F9/45
CPC分类号： G06F8/443 , G06F11/3466
摘要： A computer implemented method, apparatus, and computer program product for generating an optimization insensitive behavior profile. In one embodiment, a source identifier is assigned to each instruction in an original control flow graph representing a program code prior to optimization. The identifiers identify a basic block associated with the instruction or a group of basic blocks. A source identifier in the set of source identifiers is assigned to instructions in an optimized control flow graph representing the program code after optimizing the program code. The instructions in the optimized control flow graph are mapped to the original control flow graph using the set of source identifiers to form a mapping transformation. Behavior profile data associated with the optimized program code is moved to basic blocks in the original control flow graph using the mapping transformation to form the optimization insensitive behavior profile.
摘要翻译：一种用于生成优化不敏感行为简档的计算机实现的方法，装置和计算机程序产品。在一个实施例中，源标识符被分配给表示优化之前的程序代码的原始控制流程图中的每个指令。标识符标识与指令或一组基本块相关联的基本块。源标识符集中的源标识符被分配给优化程序代码之后的表示程序代码的优化控制流程图中的指令。优化的控制流程图中的指令使用源标识符集映射到原始控制流图，以形成映射变换。与优化的程序代码相关联的行为简档数据使用映射转换移动到原始控制流程图中的基本块，以形成优化不敏感行为配置文件。

9. 发明申请

US20060277456A1 Method for handling annotations 审中-公开
标题翻译：处理注释的方法
公开(公告)号：US20060277456A1
公开(公告)日：2006-12-07
申请号：US11146631
申请日：2005-06-07
申请人： Marina Biberstein , Daniel Citron , Alberto Giammaria , Bilha Mendelson , Vugranam Sreedhar
发明人： Marina Biberstein , Daniel Citron , Alberto Giammaria , Bilha Mendelson , Vugranam Sreedhar
IPC分类号： G06F17/24
CPC分类号： G06F8/41 , G06F8/73 , G06F11/3604
摘要： A taxonomy for annotations found in program code. The taxonomy includes a set of meta-annotations associated with an annotation definition and a set of values for each meta-annotation. The meta-annotations describes properties of each annotation. The values describe one quality of its associated meta-annotation. The taxonomy is used in a method for instrumenting a piece of code. The method includes reviewing meta-annotations attached to each annotation definition within the piece of code to determine how to proceed with instrumenting the piece of code.
摘要翻译：在程序代码中发现的注释分类法。分类法包括与注释定义相关联的一组元注释和每个元注释的一组值。元注释描述了每个注释的属性。值描述了其关联元注释的一个质量。分类法用于检测一段代码的方法。该方法包括查看附在代码段内的每个注释定义的元注释，以确定如何继续对该段代码进行检测。

10. 发明授权

US06742179B2 Restructuring of executable computer code and large data sets 有权
标题翻译：可重构计算机代码和大型数据集
公开(公告)号：US06742179B2
公开(公告)日：2004-05-25
申请号：US09902595
申请日：2001-07-12
申请人： Nimrod Megiddo , Bilha Mendelson
发明人： Nimrod Megiddo , Bilha Mendelson
IPC分类号： G06F944
CPC分类号： G06F8/4441
摘要： A program product and method of compiling a computer program to optimize performance of a computer program. First, after initialization, a profiling run is done on computer code which may include program code blocks and program data. Execution of each computer program step is monitored and each occurrence of each individual code unit is logged, e.g. each instruction block or block of data. Frequently occurring code units are identified periodically as hot blocks. An initial snapshot of hot blocks is logged, e.g., when identified hot blocks exceed an initial block number. Profiling continues until the profiling run is complete, updating identified hot blocks and logging a new current snapshot whenever a current set of identified hot blocks contains a selected percentage of different hot blocks. Snapshots are selected as representative to different program modes. The program is optimized according to program modes.
摘要翻译：一种编译计算机程序以优化计算机程序性能的程序产品和方法。首先，在初始化之后，对可能包括程序代码块和程序数据的计算机代码进行分析运行。监视每个计算机程序步骤的执行，并记录每个单独代码单元的每个出现。每个指令块或数据块。经常出现的代码单元被定期识别为热块。记录热块的初始快照，例如，当识别的热块超过初始块号时。性能持续到分析运行完成，更新已识别的热块，并记录新的当前快照，每当一组已识别的热块包含所选百分比的不同热块。选择快照作为不同程序模式的代表。该程序根据程序模式进行优化。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式