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

21. 发明授权

US06604210B1 Method and system for detecting and recovering from in trace data 有权
标题翻译：跟踪数据错误检测和恢复的方法和系统
公开(公告)号：US06604210B1
公开(公告)日：2003-08-05
申请号：US09393083
申请日：1999-09-09
申请人： William Preston Alexander, III , Frank Eliot Levine , Robert J. Urquhart
发明人： William Preston Alexander, III , Frank Eliot Levine , Robert J. Urquhart
IPC分类号： G06F1100
CPC分类号： G06F11/3636
摘要： A method and system for detecting and recovering from errors in trace data is provided. The trace data records selected events for executing routines, and the routines corresponding to the events are represented as one or more nodes in a tree structure. The events may be entries and exits to executing methods. A trace record identifying a routine is read, and an error condition is detected in which the identified routine does not match a routine corresponding to a current node in the tree structure. The tree structure is searched for a node that corresponds to the identified routine. Performance statistics, such as execution time, are attributed to nodes in the tree structure. In response to a determination that the current node is a root node of the tree structure, then a new node for the identified routine is added to the tree structure as a child node of the root node and spliced into the tree at the root node.
摘要翻译：提供了一种用于检测和追踪跟踪数据错误的方法和系统。跟踪数据记录用于执行例程的所选事件，并且与事件相对应的例程被表示为树结构中的一个或多个节点。事件可能是执行方法的条目和出口。读取识别例程的跟踪记录，并且检测到识别的例程与树结构中的当前节点相对应的例程不匹配的错误条件。搜索树结构对应于所识别的例程的节点。性能统计信息（如执行时间）归因于树结构中的节点。响应于当前节点是树结构的根节点的确定，则将用于所识别的例程的新节点作为根节点的子节点添加到树结构中，并将其剪接到根节点处的树中。

22. 发明授权

US06560773B1 Method and system for memory leak detection in an object-oriented environment during real-time trace processing 失效
标题翻译：在实时跟踪处理中面向对象环境中的内存泄漏检测方法和系统
公开(公告)号：US06560773B1
公开(公告)日：2003-05-06
申请号：US09414331
申请日：1999-10-07
申请人： William Preston Alexander, III , John Day Howard , Frank Eliot Levine , William Robert Reynolds , Robert J. Urquhart
发明人： William Preston Alexander, III , John Day Howard , Frank Eliot Levine , William Robert Reynolds , Robert J. Urquhart
IPC分类号： G06F1730
CPC分类号： G06F11/3466 , G06F11/3476 , G06F2201/86 , G06F2201/865 , 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. An object deallocator, such as a garbage collector, deallocates objects during the execution of the program and modifies object deallocation metrics in the profile data structure. The object allocation metrics and the object deallocation metrics may be compared to identify memory leaks.
摘要翻译：提供了一种用于在实时跟踪处理期间检测面向对象环境中的内存泄漏的方法和系统。在对在数据处理系统中执行的程序进行分析时，分析器处理由程序执行引起的事件，并且分析器维护包含程序的执行相关度量的简档数据结构。执行相关度量可以包括与代表执行方法发起的对象处理相关联的对象分配和重新分配度量。对象分配器在执行程序期间分配对象，并在配置文件数据结构中修改对象分配度量。诸如垃圾收集器的对象分配器在执行程序期间释放对象，并修改配置文件数据结构中的对象分配度量。可以比较对象分配度量和对象分配度量以识别内存泄漏。

23. 发明授权

US6055492A System and method for providing trace information data reduction 失效
标题翻译：提供跟踪信息数据缩减的系统和方法
公开(公告)号：US6055492A
公开(公告)日：2000-04-25
申请号：US989725
申请日：1997-12-12
申请人： William Preston Alexander, III , Robert Francis Berry , Robert John Urguhart
发明人： William Preston Alexander, III , Robert Francis Berry , Robert John Urguhart
IPC分类号： G06F11/34 , G06F11/00
CPC分类号： G06F11/348 , G06F11/3466
摘要： 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 time spent 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字节码，分配的存储器或其他类型的性能信息的性能信息。跟踪信息以紧凑和高效的方式呈现，并且可以用于快速和容易地回答各种性能查询。此外，系统可以被追踪长时间，而不会由于有限的缓冲区空间而丢失有用的性能信息。

24. 发明授权

US06507946B2 Process and system for Java virtual method invocation 有权
标题翻译： Java虚拟方法调用的进程和系统
公开(公告)号：US06507946B2
公开(公告)日：2003-01-14
申请号：US09330634
申请日：1999-06-11
申请人： William Preston Alexander, III , Weiming Gu
发明人： William Preston Alexander, III , Weiming Gu
IPC分类号： G06F945
CPC分类号： G06F9/449
摘要： A process and system for optimizing an invocation of a method is provided. A determination is made to compile a calling method, and a call to a callee method is detected within the first method. The callee method may be a non-final, virtual method, and a determination may be made that the callee method has not been previously overridden. The callee method is then inlined within the first method. In addition, no conditional statements are inserted into the calling method along with the inlined method. The determination to compile and optimize these methods may be made by a just-in-time compiler, and if the methods are Java methods, then a Java just-in-time compiler performs the optimization process. If a determination is made to load a class that contains a method that overrides the callee method, then the calling method is recompiled or patched.
摘要翻译：提供了一种用于优化方法调用的过程和系统。确定编译调用方法，并在第一种方法中检测到被叫方法的调用。被叫方法可以是非最终的虚拟方法，并且可以确定被叫方法尚未被预先覆盖。然后在第一种方法中对被叫方法进行内联。另外，没有条件语句与内联方法一起插入到调用方法中。编译和优化这些方法的决心可能由一个即时编译器来完成，如果这些方法是Java方法，那么一个Java即时编译器就可以执行优化过程。如果确定加载包含覆盖被调用方法的方法的类，则重新编译或修补调用方法。

25. 发明授权

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目录。

26. 发明授权

US5794243A Method and apparatus for executing a binary search in a data cache 失效
标题翻译：用于在数据高速缓存中执行二进制搜索的方法和装置
公开(公告)号：US5794243A
公开(公告)日：1998-08-11
申请号：US570041
申请日：1995-12-11
申请人： William Preston Alexander, III , Geoffrey Owen Blandy , Robert J. Urquhart
发明人： William Preston Alexander, III , Geoffrey Owen Blandy , Robert J. Urquhart
IPC分类号： G06F12/08 , G06F17/30
CPC分类号： G06F12/0864 , Y10S707/99953
摘要： Minimizing data cache misses when performing binary searches. Values in an array to be searched are stored as subsets, clustered to minimize the number of cache misses. A first set of auxiliary values is created consisting of a subset of the first-searched values that fit on one cache line. Subsequent sets of values are then created consisting of one cache line full of values for each value in the first set within one cache line. A binary search is conducted by first searching SET ONE, for the largest array value that is less-than or equal to the search key, or alternatively the smallest array value greater than or equal to the search key. The search of SET ONE, is followed by a search of any subsequent sets of values, with the binary search concluding by testing values within one cache line in the subsequent sets of values until the desired value is found.
摘要翻译：执行二进制搜索时，最大限度地减少数据高速缓存未命中。要搜索的数组中的值作为子集存储，聚类以最小化高速缓存未命中的数量。创建第一组辅助值，其由适合于一个高速缓存行上的第一搜索值的子集组成。然后创建随后的值集合，由一个高速缓存行组成，该高速缓存行中包含一个高速缓存行中第一个集合中每个值的值。通过首先搜索SET ONE，对于小于或等于搜索关键字的最大数组值，或者大于或等于搜索关键字的最小数组值，进行二进制搜索。搜索SET ONE之后，随后搜索任何后续的值集合，二进制搜索通过在随后的一组值中的一个高速缓存行内测试值直到找到所需的值来结束。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式