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

1. 发明申请

US20050289315A1 Method and system for obtaining memory usage information for a heap when a peak live count is updated 失效
标题翻译：当更新峰值实时计数时，获取堆的内存使用信息的方法和系统
公开(公告)号：US20050289315A1
公开(公告)日：2005-12-29
申请号：US10875931
申请日：2004-06-24
申请人： Phani Gopal Achanta , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
发明人： Phani Gopal Achanta , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F12/00 , G06F12/02
CPC分类号： G06F12/0269 , Y10S707/99953 , Y10S707/99956
摘要： A method and system for determining the memory utilization of a heap are provided. With the method and system, object allocations and optionally, possible memory freeing events are used to initiate a mark-and-count operation. The mark-and-count operation marks the live objects and maintains a running count of their memory bytes allocated to the live objects, referred to as a live count. The execution of the mark-and-count operation may be dependent upon various criteria including thresholds, functions of the live count, peak live counts, number of memory bytes allocated since a previous mark-and-count operation was performed, and the like. In addition to the live count, a peak live count may be obtained and updated as new peak live counts are identified. When the peak live count is updated, additional information may be obtained via a heap dump, arcflow tree, or the like.
摘要翻译：提供了一种用于确定堆的存储器利用率的方法和系统。使用方法和系统，可以使用对象分配和可选的可能的内存释放事件来启动标记和计数操作。标记和计数操作标记活动对象并维护分配给活动对象的内存字节的运行计数，称为活动计数。标记和计数操作的执行可以取决于包括阈值，活动计数的功能，峰值活动计数，执行先前的标记和计数操作之后分配的存储器字节的数量等各种标准。除了活数之外，可以获得并更新峰值活动计数，因为确定了新的峰值活动计数。当峰值活动计数被更新时，可以通过堆转储，弧流树等获得附加信息。

2. 发明授权

US07444484B2 Method and system for determining memory usage of a heap 失效
标题翻译：确定堆内存使用情况的方法和系统
公开(公告)号：US07444484B2
公开(公告)日：2008-10-28
申请号：US10875929
申请日：2004-06-24
申请人： Phani Gopal Achanta , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
发明人： Phani Gopal Achanta , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F13/00 , G06F12/00
CPC分类号： G06F12/0253 , G06F11/3409 , G06F11/3466 , G06F2201/81 , G06F2201/86 , G06F2201/88 , G06F2201/885
摘要： A method and system for determining the memory utilization of a heap are provided. With the method and system, object allocations and optionally, possible memory freeing events are used to initiate a mark-and-count operation. The mark-and-count operation marks the live objects and maintains a running count of their memory bytes allocated to the live objects, referred to as a live count. The execution of the mark-and-count operation may be dependent upon various criteria including thresholds, functions of the live count, peak live counts, number of memory bytes allocated since a previous mark-and-count operation was performed, and the like. In addition to the live count, a total number of bytes allocated to objects may be maintained in order to obtain information regarding the heap memory utilization.
摘要翻译：提供了一种用于确定堆的存储器利用率的方法和系统。使用方法和系统，可以使用对象分配和可选的可能的内存释放事件来启动标记和计数操作。标记和计数操作标记活动对象并维护分配给活动对象的内存字节的运行计数，称为活动计数。标记和计数操作的执行可以取决于包括阈值，活动计数的功能，峰值活动计数，执行先前的标记和计数操作之后分配的存储器字节的数量等各种标准。除了实际计数之外，可以维护分配给对象的总字节数，以便获得关于堆存储器利用的信息。

3. 发明授权

US07162605B2 Method and system for obtaining memory usage information for a heap when a peak live count is updated 失效
标题翻译：当更新峰值实时计数时，获取堆的内存使用信息的方法和系统
公开(公告)号：US07162605B2
公开(公告)日：2007-01-09
申请号：US10875931
申请日：2004-06-24
申请人： Phani Gopal Achanta , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
发明人： Phani Gopal Achanta , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F12/00
CPC分类号： G06F12/0269 , Y10S707/99953 , Y10S707/99956
摘要： A method and system for determining the memory utilization of a heap are provided. With the method and system, object allocations and optionally, possible memory freeing events are used to initiate a mark-and-count operation. The mark-and-count operation marks the live objects and maintains a running count of their memory bytes allocated to the live objects, referred to as a live count. The execution of the mark-and-count operation may be dependent upon various criteria including thresholds, functions of the live count, peak live counts, number of memory bytes allocated since a previous mark-and-count operation was performed, and the like. In addition to the live count, a peak live count may be obtained and updated as new peak live counts are identified. When the peak live count is updated, additional information may be obtained via a heap dump, arcflow tree, or the like.
摘要翻译：提供了一种用于确定堆的存储器利用率的方法和系统。使用方法和系统，可以使用对象分配和可选的可能的内存释放事件来启动标记和计数操作。标记和计数操作标记活动对象并维护分配给活动对象的内存字节的运行计数，称为活动计数。标记和计数操作的执行可以取决于包括阈值，活动计数的功能，峰值活动计数，执行先前的标记和计数操作之后分配的存储器字节的数量等各种标准。除了活数之外，可以获得并更新峰值活动计数，因为确定了新的峰值活动计数。当峰值活动计数被更新时，可以通过堆转储，弧流树等获得附加信息。

4. 发明授权

US07519961B2 Method and apparatus for averaging out variations in run-to-run path data of a computer program 失效
标题翻译：用于平均计算机程序的运行路径数据的变化的方法和装置
公开(公告)号：US07519961B2
公开(公告)日：2009-04-14
申请号：US10777742
申请日：2004-02-12
申请人： William Preston Alexander, III , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
发明人： William Preston Alexander, III , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F9/44 , G06F11/30 , G06F11/36
CPC分类号： G06F11/3447 , G06F11/3466 , G06F2201/835 , G06F2201/865
摘要： A method and apparatus for averaging out variations from run to run of a computer program are provided. With the apparatus and method, call trees are generated for two or more executions of a build of a computer program. The apparatus and method perform a “tree-addition” operation in which the two or more call trees generated during runs of the computer program are added to one another to thereby accumulate statistics for each call in the call trees. These statistics may then be divided by the number of runs whose tree data structures are being accumulated. In this way, an average of the tree data structures is generated. In addition, any portions of the tree data structure that are due to asynchronous events are averaged out so that their relative affect in the resulting tree data structure is minimized.
摘要翻译：提供了一种从计算机程序的运行到运行的平均化的方法和装置。利用设备和方法，生成用于构建计算机程序的两次或多次执行的调用树。该装置和方法执行“树添加”操作，其中在计算机程序运行期间生成的两个或多个呼叫树彼此相加，从而累积对呼叫树中的每个呼叫的统计。然后可以将这些统计信息除以树数据结构正在被累积的运行次数。以这种方式，生成树数据结构的平均值。此外，由于异步事件导致的树数据结构的任何部分被平均化，使得它们在所得到的树数据结构中的相对影响被最小化。

5. 发明授权

US07506330B2 Method and apparatus for identifying differences in runs of a computer program due to code changes 失效
标题翻译：用于识别由于代码变化导致的计算机程序的运行差异的方法和装置
公开(公告)号：US07506330B2
公开(公告)日：2009-03-17
申请号：US10777872
申请日：2004-02-12
申请人： William Preston Alexander, III , Robert Tod Dimpsey , Kean G. Kuiper , Frank Eliot Levine , Robert John Urquhart
发明人： William Preston Alexander, III , Robert Tod Dimpsey , Kean G. Kuiper , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F9/45
CPC分类号： G06F11/3447 , G06F11/3466 , G06F11/3604 , G06F2201/865
摘要： A method and apparatus for identifying differences in runs of a computer program that are due to changes in the code of the computer program. With the apparatus and method, call trees are generated for two or more builds of a computer program. The apparatus and method perform a “tree-subtract” operation in which the two or more call trees generated during runs of two or more different builds of a computer program are subtracted from one another to identify build to build differences in the execution of the computer program. From the resulting tree, portions of the runs of the different builds of the computer program where the resource utilization of the computer program has not changed are easily identifiable. Moreover, portions of the runs of the different builds of the computer program where there are improvements or regressions in resource utilization of the computer program may be easily identifiable.
摘要翻译：一种用于识别计算机程序运行中由于计算机程序的代码变化而导致的差异的方法和装置。使用该设备和方法，可以为计算机程序的两个或多个构建生成调用树。该装置和方法执行“减法”操作，其中在计算机程序的两个或多个不同构建的运行期间产生的两个或更多个调用树从彼此中减去以识别构建以构建计算机的执行中的差异程序。从结果树中，计算机程序的资源利用率未改变的计算机程序的不同构建的运行的部分容易识别。此外，计算机程序的资源利用的改进或回归的计算机程序的不同构建的运行的部分可以容易地识别。

6. 发明授权

US07496900B2 Method for automatic detection of build regressions 失效
标题翻译：自动检测构造回归的方法
公开(公告)号：US07496900B2
公开(公告)日：2009-02-24
申请号：US10777743
申请日：2004-02-12
申请人： Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
发明人： Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F9/44
CPC分类号： G06F11/36
摘要： A method and apparatus for automatically performing regression processing on trace data are provided. With the apparatus and method, call tree data structures are generated for two or more executions of two or more builds of a computer program. The apparatus and method perform a “tree-minimization” operation on each set of call tree data structures for each of the builds to generate minimized call tree data structures for each build of the computer program. The minimized call tree data structures are then subtracted from one another to generate a subtracted minimized call tree data structure. From this subtracted minimized call tree data structure, the portions of the computer program that are different from build to build and which appreciably and consistently affect the difference in execution of the computer program from build to build may be identified. Thus, the analyst's attention is directed to these areas of the computer program code which may be optimized in order to obtain better execution of the computer program.
摘要翻译：提供了一种用于自动执行跟踪数据的回归处理的方法和装置。利用该设备和方法，生成两个或更多个计算机程序构建的两个或多个执行的调用树数据结构。该装置和方法对每个构建的每一组呼叫树数据结构执行“树最小化”操作，以便为计算机程序的每个构建生成最小化的调用树数据结构。然后将最小化的呼叫树数据结构从彼此中减去以产生减去最小化的呼叫树数据结构。从该减去的最小化调用树数据结构中，可以识别与构建构建不同的计算机程序的部分，并且可以明确地和一致地影响计算机程序从构建到构建的执行的差异。因此，分析师的注意力是针对计算机程序代码的这些区域，其可以被优化以便获得更好的计算机程序的执行。

7. 发明授权

US07299319B2 Method and apparatus for providing hardware assistance for code coverage 有权
标题翻译：为代码覆盖提供硬件辅助的方法和装置
公开(公告)号：US07299319B2
公开(公告)日：2007-11-20
申请号：US10807094
申请日：2004-03-22
申请人： Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
发明人： Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F12/00
CPC分类号： G06F11/3466 , G06F11/3676 , G06F2201/865 , G06F2201/88
摘要： A method, apparatus, and computer instructions for generating coverage data during execution of code in the data processing system. During execution of the code, a determination is made as to whether an access indicator is associated with an instruction in response to executing the instruction in the code by a processor in the data processing system. If the access indicator is associated with the instruction, a state of the access indicator is changed, by the processor, when the instruction is executed. In this manner, coverage data for executed instructions is generated by the processor during execution of the code.
摘要翻译：一种用于在数据处理系统中的代码执行期间生成覆盖数据的方法，装置和计算机指令。在代码执行期间，响应于数据处理系统中的处理器执行代码中的指令，确定访问指示符是否与指令相关联。如果访问指示符与指令相关联，则当指令被执行时，处理器改变访问指示符的状态。以这种方式，执行代码期间由处理器产生执行指令的覆盖数据。

8. 发明申请

US20120311543A1 REMOVAL OF ASYNCHRONOUS EVENTS IN COMPLEX APPLICATION PERFORMANCE ANALYSIS 有权
标题翻译：在复杂应用性能分析中去除异常事件
公开(公告)号：US20120311543A1
公开(公告)日：2012-12-06
申请号：US13585320
申请日：2012-08-14
申请人： William Preston Alexander, III , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
发明人： William Preston Alexander, III , Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F9/44
CPC分类号： G06F8/443
摘要： A method and apparatus for identifying a minimum call tree data structure from a plurality of call tree data structures are provided. With the apparatus and method, call tree data structures are generated for two or more executions of a build of a computer program. The apparatus and method perform a “tree-minimization” operation in which the two or more call trees generated during runs of the computer program are walked and only those nodes that are present in each of the tree data structures are maintained in a minimized tree data structure. In addition, the minimum values for these common nodes are maintained in the minimized tree data structure. In this way, asynchronous events are removed from the minimum tree data structure and analysis may focus on those areas of the computer program that are consistent between runs of the computer program.
摘要翻译：提供了一种用于从多个呼叫树数据结构中识别最小呼叫树数据结构的方法和装置。利用该装置和方法，生成用于构建计算机程序的两个或多个执行的调用树数据结构。该装置和方法执行树最小化操作，其中在计算机程序的运行期间生成的两个或更多个调用树被行走，并且仅存在于每个树数据结构中的那些节点被保持在最小化的树数据结构中。此外，这些公共节点的最小值保持在最小化的树数据结构中。以这种方式，从最小树数据结构中去除异步事件，并且分析可以集中在计算机程序的运行之间一致的计算机程序的那些区域。

9. 发明授权

US07823129B2 Apparatus and method for dynamic instrumenting of code to minimize system perturbation 失效
标题翻译：用于动态测量代码以最小化系统扰动的装置和方法
公开(公告)号：US07823129B2
公开(公告)日：2010-10-26
申请号：US11488425
申请日：2006-07-18
申请人： Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
发明人： Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F9/44
CPC分类号： G06F11/3636 , G06F11/3409 , G06F11/3466 , G06F11/3644 , G06F2201/81 , G06F2201/815 , G06F2201/86 , G06F2201/865 , G06F2201/88
摘要： An apparatus and method are provided for the dynamic instrumentation of code to minimize system perturbation during tracing of the execution of the code. With the apparatus and method, “hot spots” in the execution of the code are dynamically determined during tracing of the execution of the code. These “hot spots” are dynamically instrumented, i.e. an event hook is inserted, to cause control to be passed to a handler that determines a caller of the “hot spot” method. The method that called the “hot spot” method, or “caller” method, is identified from a call stack and is dynamically instrumented for an appropriate metric so that the next time the calling method is executed, the dynamically inserted hooks are executed. The execution of the hooks in the caller method is continued for a predetermined period, e.g., number of invocations, to get an understanding of the caller method's characteristics. A list of callers of instrumented methods is maintained and used to determine one or more calling methods of the instrumented caller method. One or more of these calling methods may be instrumented and the hooks inserted in the instrumented caller method (called by the one or more calling methods), are removed. In this way, the call graph of the hot spots of a program execution is “walked up” and characterized over time.
摘要翻译：提供了一种用于在代码执行跟踪期间对代码进行动态检测以最小化系统扰动的装置和方法。利用该装置和方法，在代码执行的跟踪期间动态地确定代码执行中的“热点”。这些“热点”被动态地装配，即插入事件钩子，以使得控制被传递给确定呼叫者“热点”方法的处理程序。称为“热点”方法或“呼叫者”方法的方法是从调用堆栈中识别的，并为适当的度量进行动态检测，以便下次执行调用方法时，会执行动态插入的钩子。调用方法中的挂钩的执行持续一段预定时间，例如调用次数，以便了解呼叫者方法的特征。维护检测方法的呼叫者列表，并用于确定被调用呼叫者方法的一个或多个呼叫方法。可以对这些调用方法中的一个或多个进行检测，并且删除插入到被调用的调用方法中的钩子（由一个或多个调用方法调用）。以这种方式，程序执行的热点的调用图被“走过”并且随着时间的推移而被表征。

10. 发明申请

US20080320448A1 Method and Apparatus for Autonomic Test Case Feedback Using Hardware Assistance for Data Coverage 有权
标题翻译：使用硬件帮助数据覆盖的自动测试用例反馈的方法和装置
公开(公告)号：US20080320448A1
公开(公告)日：2008-12-25
申请号：US12185254
申请日：2008-08-04
申请人： Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
发明人： Robert Tod Dimpsey , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F9/44
CPC分类号： G06F11/3476 , G06F11/348 , G06F11/3676
摘要： A method, apparatus, and computer instructions for presenting coverage data relating to data access occurring during execution of code. The coverage data containing data access indicators associated with memory locations is obtained. The data access indicators that have been set by a processor in the data processing system in response to access of the memory locations during execution of the code by the processor are identified to form set data access indicators. Each set instruction access indicator is associated with a portion of the memory locations allocated for the code. A presentation for coverage data is generated, wherein the set data access indicators are identified in the presentation.
摘要翻译：一种用于呈现与代码执行期间发生的数据访问有关的覆盖数据的方法，装置和计算机指令。获得包含与存储器位置相关联的数据访问指示符的覆盖数据。由数据处理系统中的处理器响应于处理器执行代码期间的存储器位置的访问而设置的数据访问指示符被识别以形成设置数据访问指示符。每个设置的指令访问指示符与为代码分配的存储器位置的一部分相关联。生成用于覆盖数据的呈现，其中在呈现中识别所设置的数据访问指示符。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式