会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明授权
    • Removal of asynchronous events in complex application performance analysis
    • 在复杂的应用程序性能分析中删除异步事件
    • US08266595B2
    • 2012-09-11
    • US10777909
    • 2004-02-12
    • William Preston Alexander, IIIRobert Tod DimpseyFrank Eliot LevineRobert John Urquhart
    • William Preston Alexander, IIIRobert Tod DimpseyFrank Eliot LevineRobert John Urquhart
    • G06F9/44
    • 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.
    • 提供了一种用于从多个呼叫树数据结构中识别最小呼叫树数据结构的方法和装置。 利用该装置和方法,生成用于构建计算机程序的两个或多个执行的调用树数据结构。 该装置和方法执行“树最小化”操作,其中在计算机程序运行期间生成的两个或更多个调用树被移动,并且仅存在于每个树数据结构中的那些节点保持在最小化的树数据中 结构体。 此外,这些公共节点的最小值保持在最小化的树数据结构中。 以这种方式,从最小树数据结构中去除异步事件,并且分析可以集中在计算机程序的运行之间一致的计算机程序的那些区域。
    • 17. 发明授权
    • Method for automatic detection of build regressions
    • 自动检测构造回归的方法
    • US08196115B2
    • 2012-06-05
    • US12172791
    • 2008-07-14
    • Robert Tod DimpseyFrank Eliot LevineRobert John Urquhart
    • Robert Tod DimpseyFrank Eliot LevineRobert John Urquhart
    • G06F9/44
    • 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.
    • 提供了一种用于自动执行跟踪数据的回归处理的方法和装置。 利用该设备和方法,生成两个或更多个计算机程序构建的两个或多个执行的调用树数据结构。 该装置和方法对每个构建的每一组呼叫树数据结构执行“树最小化”操作,以便为计算机程序的每个构建生成最小化的调用树数据结构。 然后将最小化的呼叫树数据结构从彼此中减去以产生减去最小化的呼叫树数据结构。 从该减去的最小化调用树数据结构中,可以识别与构建构建不同的计算机程序的部分,并且可以明确地和一致地影响计算机程序从构建到构建的执行的差异。 因此,分析师的注意力是针对计算机程序代码的这些区域,其可以被优化以便获得更好的计算机程序的执行。