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

1. 发明授权

US07548989B2 Method and system for maintaining consistency during multi-threaded processing of LDIF data 失效
标题翻译：在LDIF数据的多线程处理过程中保持一致性的方法和系统
公开(公告)号：US07548989B2
公开(公告)日：2009-06-16
申请号：US10611144
申请日：2003-07-01
申请人： William Preston Alexander, III , Kean G Kuiper , Christopher Michael Richardson
发明人： William Preston Alexander, III , Kean G Kuiper , Christopher Michael Richardson
IPC分类号： G06F12/00
CPC分类号： H04L61/1523 , G06F9/546 , G06F2209/548 , Y10S707/99952 , Y10S707/99953
摘要： A method, a system, an apparatus, and a computer program product are presented for loading LDIF ((Lightweight Directory Access Protocol (LDAP) Data Interchange Format) data into a directory. A single reader thread reads entries from an LDIF file; each entry is associated with a priority value, e.g., the priority value for an entry may be based on the number of delimiters in the distinguished name within the entry. Multiple loading threads concurrently add the entries into an LDAP directory in accordance with their associated priority values. The entries are added to the LDAP directory in an order of highest indicated priority to lowest indicated priority; entries that are associated with priority values that indicate equal priority are considered to be equivalent for the purposes of ordering the entries, so entries that have equal priority may be added to the LDAP directory in any order.
摘要翻译：提出了一种方法，系统，装置和计算机程序产品，用于将LDIF（（轻量级目录访问协议（LDAP）数据交换格式）数据加载到目录中。单个阅读器线程从LDIF文件读取条目;每个条目与优先级值相关联，例如，条目的优先级值可以基于条目中的可分辨名称中的分隔符数量。多个加载线程根据其相关联的优先级值将条目同时添加到LDAP目录中。这些条目按照最高指示优先级到最低指定优先级的顺序添加到LDAP目录;为了排序条目，与优先级值相关联的表示相同优先级的条目被认为是等效的，因此具有相同优先级的条目可以以任何顺序添加到LDAP目录。

2. 发明授权

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.
摘要翻译：一种用于识别计算机程序运行中由于计算机程序的代码变化而导致的差异的方法和装置。使用该设备和方法，可以为计算机程序的两个或多个构建生成调用树。该装置和方法执行“减法”操作，其中在计算机程序的两个或多个不同构建的运行期间产生的两个或更多个调用树从彼此中减去以识别构建以构建计算机的执行中的差异程序。从结果树中，计算机程序的资源利用率未改变的计算机程序的不同构建的运行的部分容易识别。此外，计算机程序的资源利用的改进或回归的计算机程序的不同构建的运行的部分可以容易地识别。

3. 发明授权

US07657875B2 System and method for collecting a plurality of metrics in a single profiling run of computer code 失效
标题翻译：用于在单个计算机代码的分析运行中收集多个度量的系统和方法
公开(公告)号：US07657875B2
公开(公告)日：2010-02-02
申请号：US11104323
申请日：2005-04-12
申请人： William Preston Alexander, III , Scott Thomas Jones , Frank Eliot Levine , Robert John Urquhart
发明人： William Preston Alexander, III , Scott Thomas Jones , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F9/44
CPC分类号： 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. When a branch has been taken, a trace record is generated for the branch taken, wherein the generated trace record contains a count of events associated with the metrics of interest for the branch taken.
摘要翻译：一种用于在计算机程序的单次运行期间收集多个度量的系统和方法。本发明的机制初始化多个计数器以对与感兴趣度量相关联的事件进行计数。然后，本发明的机制在计算机程序的单次执行期间对与感兴趣的度量相关联的事件的发生进行计数。当采取分支时，为所采取的分支生成跟踪记录，其中生成的跟踪记录包含与所采取的分支的感兴趣度量相关联的事件计数。

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. 发明授权

US6118940A Method and apparatus for benchmarking byte code sequences 失效
标题翻译：用于基准字节码序列的方法和装置
公开(公告)号：US6118940A
公开(公告)日：2000-09-12
申请号：US978513
申请日：1997-11-25
申请人： William Preston Alexander, III , Robert Francis Berry , Riaz Hussain , Paul Jerome Kilpatrick , Robert John Urquhart
发明人： William Preston Alexander, III , Robert Francis Berry , Riaz Hussain , Paul Jerome Kilpatrick , Robert John Urquhart
IPC分类号： G06F11/34 , G06F9/45
CPC分类号： G06F11/3428 , G06F11/3476
摘要： Method and apparatus for creating benchmark programs for the analysis of java virtual machine implementations are implemented. Java applications and applets are compiled into an intermediate code referred to as byte code. The Java byte code forms the machine code for the Java Virtual Machine. The Java Virtual Machine running on top of a hardware platform translates the byte code into native machine code for execution on the hardware platform on which the Java Virtual Machine is running. The performance of a Java Virtual Machine is improved by the use of a so-called "just in time" (JIT) compiler that translates commonly occurring sequences of bytes codes in the native instruction sequences which are then stored for later execution. Critical to the performance of the JIT is the ability of the JIT to optimally compile for the most commonly occurring sequences of byte codes. The method and apparatus for creating benchmark programs provides a means for performance measurements with respect to such sequences.
摘要翻译：实现用于创建用于分析java虚拟机实现的基准程序的方法和装置。 Java应用程序和小程序被编译成称为字节码的中间代码。 Java字节代码形成Java虚拟机的机器代码。运行在硬件平台上的Java虚拟机将字节码转换为本地机器代码，以便在运行Java虚拟机的硬件平台上执行。通过使用所谓的“即时”（JIT）编译器来改进Java虚拟机的性能，该编译器将本地指令序列中常见的字节码序列翻译成随后的存储以备以后执行。对JIT的性能至关重要的是JIT对最常发生的字节码序列进行最佳编译的能力。用于创建基准程序的方法和装置提供了相对于这种序列的性能测量的手段。

6. 发明授权

US08266595B2 Removal of asynchronous events in complex application performance analysis 失效
标题翻译：在复杂的应用程序性能分析中删除异步事件
公开(公告)号：US08266595B2
公开(公告)日：2012-09-11
申请号：US10777909
申请日：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
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.
摘要翻译：提供了一种用于从多个呼叫树数据结构中识别最小呼叫树数据结构的方法和装置。利用该装置和方法，生成用于构建计算机程序的两个或多个执行的调用树数据结构。该装置和方法执行“树最小化”操作，其中在计算机程序运行期间生成的两个或更多个调用树被移动，并且仅存在于每个树数据结构中的那些节点保持在最小化的树数据中结构体。此外，这些公共节点的最小值保持在最小化的树数据结构中。以这种方式，从最小树数据结构中去除异步事件，并且分析可以集中在计算机程序的运行之间一致的计算机程序的那些区域。

7. 发明授权

US06922828B1 Method and system for detecting common bytecode sequences 失效
标题翻译：用于检测常用字节码序列的方法和系统
公开(公告)号：US06922828B1
公开(公告)日：2005-07-26
申请号：US09393082
申请日：1999-09-09
申请人： William Preston Alexander, III , Frank Eliot Levine , Robert J. Urquhart
发明人： William Preston Alexander, III , Frank Eliot Levine , Robert J. Urquhart
IPC分类号： G06F11/34 , G06F9/45
CPC分类号： G06F11/348 , G06F11/3466
摘要： A method and system for detecting and counting bytecode sequences in a data processing system is provided. A bytecode tree data structure is used to represent sequences of bytecodes. A bytecode sequence is a subset of consecutive bytecodes within the set of bytecodes. The bytecode tree data structure contains a set of nodes in which each node represents a bytecode in a bytecode sequence or subsequence and in which a path through the bytecode tree data structure represents a bytecode sequence or subsequence. Each node of the bytecode tree data structure records one or more bytecode occurrence statistics for its corresponding bytecode in a set of bytecode sequences or subsequences. In order to determine the frequency of occurrence of common bytecode sequences and subsequences, a bytecode sequence tree data structure is generated from a set of bytecode sequences. The bytecode sequence tree data structure is then convolved into a bytecode subsequence occurrence tree data structure, which is a union of all subtrees of the bytecode sequence tree data structure.
摘要翻译：提供了一种用于在数据处理系统中检测和计数字节码序列的方法和系统。字节码树数据结构用于表示字节码序列。字节码序列是字节码组内的连续字节码的子集。字节码树数据结构包含一组节点，其中每个节点在字节码序列或子序列中表示字节码，其中通过字节码树数据结构的路径表示字节码序列或子序列。字节码树数据结构的每个节点在一组字节码序列或子序列中记录其对应的字节码的一个或多个字节码出现统计信息。为了确定公共字节码序列和子序列的出现频率，从一组字节码序列生成字节码序列树数据结构。字节码序列树数据结构然后卷积成字节码子序列发生树数据结构，它是字节码序列树数据结构的所有子树的并集。

8. 发明授权

US06658652B1 Method and system for shadow heap memory leak detection and other heap analysis in an object-oriented environment during real-time trace processing 有权
标题翻译：实时跟踪处理中面向对象环境中影子堆内存泄漏检测和其他堆分析的方法和系统
公开(公告)号：US06658652B1
公开(公告)日：2003-12-02
申请号：US09589798
申请日：2000-06-08
申请人： William Preston Alexander, III , Frank Eliot Levine , William Robert Reynolds , Robert J. Urquhart
发明人： William Preston Alexander, III , Frank Eliot Levine , William Robert Reynolds , Robert J. Urquhart
IPC分类号： G06F944
CPC分类号： G06F12/0253 , G06F9/5016 , G06F11/3466 , G06F11/3636 , G06F11/366 , Y10S707/99953 , Y10S707/99957
摘要： A method and system for detecting memory leaks in an object-oriented environment during real-time trace processing is provided. During the profiling of a program executing in a data processing system, a profiler processes events caused by the execution of the program, and the profiler maintains a profile data structure containing execution-related metrics for the program. The execution-related metrics may include object allocation and deallocation metrics that are associated with object processing initiated on behalf of an executing method. An object allocator allocates objects during the execution of the program and modifies object allocation metrics in the profile data structure. Object metrics are stored in a particular location and a pointer to that location is stored in a hash table associated with the object's ID. In another embodiment the pointer to the location is stored in a shadow heap in the same relative position as the position of the object in the heap. The object allocation metrics and the object deallocation metrics may be compared to identify memory leaks.
摘要翻译：提供了一种用于在实时跟踪处理期间检测面向对象环境中的内存泄漏的方法和系统。在对在数据处理系统中执行的程序进行分析时，分析器处理由程序执行引起的事件，并且分析器维护包含程序的执行相关度量的简档数据结构。执行相关度量可以包括与代表执行方法发起的对象处理相关联的对象分配和重新分配度量。对象分配器在执行程序期间分配对象，并在配置文件数据结构中修改对象分配度量。对象度量存储在特定位置，并且指向该位置的指针存储在与对象的ID相关联的散列表中。在另一个实施例中，指向该位置的指针存储在与堆中对象的位置相同的相对位置的阴影堆中。可以比较对象分配度量和对象分配度量以识别内存泄漏。

9. 发明授权

US06338159B1 System and method for providing trace information 有权
标题翻译：提供跟踪信息的系统和方法
公开(公告)号：US06338159B1
公开(公告)日：2002-01-08
申请号：US09343424
申请日：1999-06-30
申请人： William Preston Alexander, III , Robert Francis Berry , Riaz Y. Hussain , Chester Charles John, Jr. , Frank Eliot Levine , Robert John Urquhart
发明人： William Preston Alexander, III , Robert Francis Berry , Riaz Y. Hussain , Chester Charles John, Jr. , Frank Eliot Levine , Robert John Urquhart
IPC分类号： G06F944
CPC分类号： G06F11/348 , G06F11/3466 , Y10S707/99953 , Y10S707/99957
摘要： The present invention is a system, method, and computer readable medium for representing program event trace information in a way which is very compact and efficient, and yet supports a wide variety of queries regarding system performance. The tracing and reduction of the present invention may be dynamic, in which case information is obtained and added to the trace representation in real-time. Alternately, the tracing and reduction may be static, in which case a trace text file or binary file is obtained from a trace buffer, and the reduction takes place using the trace file as input. The trace information, whether obtained statically or dynamically, is represented as a tree of events. The present invention may be used to present many types of trace information in a compact manner which supports performance queries. For example, the tree structure of the present invention may reflect the call stacks observed during a program's execution, and statistics regarding the memory allocated/deallocated in the various routines and call stacks may be stored at each node of the tree. The tree structure may be used to store performance information regarding Java bytecodes executed, memory allocated, or other types of performance information. The trace information is presented in a manner which is compact and efficient, and may be used to quickly and easily answer a variety of performance queries. Further, a system may be traced for long periods of time without losing useful performance information due to a limited buffer space.
摘要翻译：本发明是用于以非常紧凑和有效的方式表示节目事件跟踪信息的系统，方法和计算机可读介质，并且还支持关于系统性能的各种查询。本发明的追踪和缩减可以是动态的，在这种情况下，实时获得信息并添加到跟踪表示中。或者，跟踪和缩减可以是静态的，在这种情况下，从跟踪缓冲区获取跟踪文本文件或二进制文件，并且使用跟踪文件作为输入进行缩小。跟踪信息（无论是静态获取还是动态获取）都表示为事件树。本发明可以用于呈现支持性能查询的紧凑方式的许多类型的跟踪信息。例如，本发明的树结构可以反映在程序执行期间观察到的调用堆栈，并且关于在各种例程和调用堆栈中分配/释放的存储器的统计信息可以存储在树的每个节点处。树结构可以用于存储关于执行的Java字节码，分配的存储器或其他类型的性能信息的性能信息。跟踪信息以紧凑和高效的方式呈现，并且可以用于快速和容易地回答各种性能查询。此外，系统可以被追踪长时间，而不会由于有限的缓冲区空间而丢失有用的性能信息。

10. 发明申请

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.
摘要翻译：提供了一种用于从多个呼叫树数据结构中识别最小呼叫树数据结构的方法和装置。利用该装置和方法，生成用于构建计算机程序的两个或多个执行的调用树数据结构。该装置和方法执行树最小化操作，其中在计算机程序的运行期间生成的两个或更多个调用树被行走，并且仅存在于每个树数据结构中的那些节点被保持在最小化的树数据结构中。此外，这些公共节点的最小值保持在最小化的树数据结构中。以这种方式，从最小树数据结构中去除异步事件，并且分析可以集中在计算机程序的运行之间一致的计算机程序的那些区域。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式