会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Instruction profiling using multiple metrics
    • 使用多个指标进行指令分析
    • US07640539B2
    • 2009-12-29
    • US11104257
    • 2005-04-12
    • William Preston Alexander, IIIScott Thomas JonesFrank Eliot LevineRobert John Urquhart
    • William Preston Alexander, IIIScott Thomas JonesFrank Eliot LevineRobert John Urquhart
    • G06F9/44G06F11/00
    • G06F11/3616
    • A system and method for collecting a plurality of metrics during a single run of a computer program. The mechanism of the present invention initializes a plurality of counters to count events associated with metrics of interest. The mechanism of the present invention then counts the occurrence of events associated with metrics of interest during a single execution of a computer program. Responsive to a determination that a counter in a plurality of counters has generated an interrupt, the interrupt is rerouted to an interrupt handler, wherein the interrupt handler generates trace records comprising trace information corresponding to the interrupt. The mechanism of the present invention then generates profiles for the trace records, wherein the profiles differentiate the trace records based on the metric type associated with each trace record.
    • 一种用于在计算机程序的单次运行期间收集多个度量的系统和方法。 本发明的机制初始化多个计数器以对与感兴趣度量相关联的事件进行计数。 然后,本发明的机制在计算机程序的单次执行期间对与感兴趣的度量相关联的事件的发生进行计数。 响应于确定多个计数器中的计数器已经产生中断,中断被重新路由到中断处理程序,其中中断处理程序产生包括对应于该中断的跟踪信息的跟踪记录。 然后,本发明的机制生成跟踪记录的简档,其中简档基于与每个跟踪记录相关联的度量类型区分跟踪记录。
    • 4. 发明授权
    • Method, apparatus and computer program product for efficient, large counts of per thread performance events
    • 方法,设备和计算机程序产品,用于高效,大量的每线程性能事件
    • US06931354B2
    • 2005-08-16
    • US10713742
    • 2003-11-13
    • Scott Thomas JonesFrank Eliot LevineRobert John Urquhart
    • Scott Thomas JonesFrank Eliot LevineRobert John Urquhart
    • G06F11/30G06F15/00G21C17/00
    • G06F11/3466G06F2201/86G06F2201/88
    • Performance events are counted for a computing system. This includes designating a first processor counter as a low-order counter for counting a certain performance event encountered by the processor and associating with the first counter a second counter as a high-order counter. The first counter is incremented responsive to detecting the performance event for a first processing thread. Responsive to a second thread, an accumulator in system memory for the first thread and first and second counters is updated. Responsive to the first thread becoming active, values of the first and second counters are loaded from the accumulator. Responsive to a user call to read and return a combined value, a first instance of the second counter is read, then the first counter is read and a second instance of the second counter is read before returning the combined value.
    • 计算系统计算出性能事件。 这包括将第一处理器计数器指定为低阶计数器,用于对处理器遇到的某个性能事件进行计数,并将第一计数器与第二计数器相关联,作为高阶计数器。 响应于检测第一处理线程的性能事件,第一计数器递增。 响应于第二线程,更新用于第一线程和第一和第二计数器的系统存储器中的累加器。 响应于第一线程变为活动状态,第一和第二计数器的值从累加器加载。 响应于用户调用读取和返回组合值,读取第二计数器的第一实例,然后读取第一计数器,并且在返回组合值之前读取第二计数器的第二实例。
    • 6. 发明授权
    • 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.
    • 提供了一种用于从多个呼叫树数据结构中识别最小呼叫树数据结构的方法和装置。 利用该装置和方法,生成用于构建计算机程序的两个或多个执行的调用树数据结构。 该装置和方法执行“树最小化”操作,其中在计算机程序运行期间生成的两个或更多个调用树被移动,并且仅存在于每个树数据结构中的那些节点保持在最小化的树数据中 结构体。 此外,这些公共节点的最小值保持在最小化的树数据结构中。 以这种方式,从最小树数据结构中去除异步事件,并且分析可以集中在计算机程序的运行之间一致的计算机程序的那些区域。