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

11. 发明授权

US5940618A Code instrumentation system with non intrusive means and cache memory optimization for dynamic monitoring of code segments 失效
标题翻译：具有非侵入性的代码仪表系统和用于代码段动态监控的高速缓存存储器优化
公开(公告)号：US5940618A
公开(公告)日：1999-08-17
申请号：US935166
申请日：1997-09-22
申请人： Geoffrey Owen Blandy , Maher Afif Saba , Robert J. Urquhart
发明人： Geoffrey Owen Blandy , Maher Afif Saba , Robert J. Urquhart
IPC分类号： G06F11/34 , G06F9/44
CPC分类号： G06F11/3461 , G06F11/3466 , G06F11/3471
摘要： The present invention is directed to a system and method for monitoring performance in an information handling system in a minimally intrusive manner. The method of the present invention includes a collection phase, a placement phase, and an instrumentation phase. During the collection phase, a workload (i.e. code segment) is traced, and instruction and data accesses are determined. During the placement phase, the trace data is passed to a cache simulator. The cache simulator uses the trace data, along with hardware and instrumentation characteristics, to determine an optimal placement for instrumentation code and data. If the desired conflict level is not attainable, the best possible placement is found by executing the code to be monitored with a variety of instrumentation code and data placements until the least intrusive placement is found. The best possible placement is then used during the instrumentation phase to actually execute the instrumented code.
摘要翻译：本发明涉及一种用于以最小程度的侵入方式监视信息处理系统中的性能的系统和方法。本发明的方法包括收集阶段，放置阶段和仪器阶段。在收集阶段，跟踪工作负载（即代码段），并确定指令和数据访问。在放置阶段，跟踪数据被传递到高速缓存模拟器。缓存模拟器使用跟踪数据以及硬件和仪器特性来确定仪器代码和数据的最佳布局。如果不能实现所需的冲突级别，则可以通过执行使用各种仪器代码和数据放置进行监视的代码来找到最佳的布局，直到找到最小的插入位置。然后在检测阶段使用最佳的放置位置来实际执行检测的代码。

12. 发明授权

US5896538A System and method for multi-phased performance profiling of single-processor and multi-processor systems 失效
标题翻译：单处理器和多处理器系统的多阶段性能分析的系统和方法
公开(公告)号：US5896538A
公开(公告)日：1999-04-20
申请号：US753570
申请日：1996-11-26
申请人： Geoffrey Owen Blandy , Maher Afif Saba , Robert John Urquhart
发明人： Geoffrey Owen Blandy , Maher Afif Saba , Robert John Urquhart
IPC分类号： G06F11/34 , G06F9/45
CPC分类号： G06F11/3409 , G06F11/3466 , G06F2201/81 , G06F2201/865 , G06F2201/88
摘要： The present invention is directed to a system and method for monitoring system performance by using a multi-phase approach. The first phase, referred to as the burst counting phase, utilizes a set of counters to identify calls and returns which are heavily used. In the second phase, referred to as the instrumentation phase, the performance characteristics of the "hot spots" are monitored through the use of hardware counters. In a symmetrical multi-processor embodiment, the performance profiler is active on all processors at the same time. Frequently executed code paths are identified in a manner that is minimally-intrusive to the system as a whole, and uses relatively little storage. The user may specify a threshold count, after which hardware monitoring begins, and the user may specify the type of hardware performance data collected. After both phases of the performance monitor are run, the data can be presented to the user in a variety of ways.
摘要翻译：本发明涉及一种通过使用多相方法监视系统性能的系统和方法。被称为突发计数阶段的第一阶段利用一组计数器来识别大量使用的呼叫和返回。在第二阶段，称为仪器仪表阶段，通过使用硬件计数器监控“热点”的性能特征。在对称的多处理器实施例中，性能分析器在所有处理器上同时处于活动状态。经常执行的代码路径以对整个系统进行最小侵入的方式进行标识，并且使用相对较少的存储。用户可以指定阈值计数，之后硬件监视开始，用户可以指定收集的硬件性能数据的类型。在执行性能监视器的两个阶段之后，数据可以以各种方式呈现给用户。

13. 发明授权

US07461220B2 Free item distribution among multiple free lists during garbage collection for more efficient object allocation 失效
标题翻译：在垃圾收集期间，在多个空闲列表之间分配免费项目以实现更有效的对象分配
公开(公告)号：US07461220B2
公开(公告)日：2008-12-02
申请号：US12032739
申请日：2008-02-18
申请人： Geoffrey Owen Blandy
发明人： Geoffrey Owen Blandy
IPC分类号： G06F12/00
CPC分类号： G06F12/0253 , G06F12/023 , Y10S707/99953 , Y10S707/99957
摘要： A garbage collector predicts future allocation requirements and then distributes free items to multiple subpool free lists and a TLH free list during the sweep phase according to the future allocation requirements. The sizes of subpools and number of free items in subpools are predicted as the most likely to match future allocation requests. Once a subpool free list is filled with the number of free items needed according to the future allocation requirements, any additional free items designated for the subpool free list can be divided into multiple TLH sized free items and placed on the TLH free list. Allocation threads are enabled to acquire free items from the TLH free list and to replenish a current TLH without acquiring heap lock.
摘要翻译：垃圾收集器预测未来的分配要求，然后根据未来的分配要求，在扫描阶段将免费项目分配到多个子空闲列表和TLH空闲列表。 subpools的大小和子项目中的免费项目数量被预测为最有可能匹配未来分配请求。根据未来的分配要求，一旦子空闲免费列表中填写了所需的免费项目数，则可以将指定为子空闲列表的任何其他免费项目分为多个TLH大小的免费项目，并放在TLH免费列表中。分配线程可以从TLH空闲列表中获取免费项目，并且在不获取堆锁的情况下补充当前的TLH。

14. 发明申请

US20080215648A1 EFFICIENT PARALLEL BITWISE SWEEP DURING GARBAGE COLLECTION 有权
标题翻译：在收集集体时有效平行的双边旅行
公开(公告)号：US20080215648A1
公开(公告)日：2008-09-04
申请号：US12051568
申请日：2008-03-19
申请人： GEOFFREY OWEN BLANDY
发明人： GEOFFREY OWEN BLANDY
IPC分类号： G06F17/00
CPC分类号： G06F12/0269 , Y10S707/99957
摘要： A method, system, and program for efficient parallel bitwise sweeps of larger objects during garbage collection are provided. During a bitwise sweep, a helper thread scans a mark vector looking for a consecutive sequence of unmarked bits of a sufficient length following a marked bit. Once a consecutive sequence of unmarked bits of a sufficient length following a marked bit is detected, the helper thread fetches the size of a marked object corresponding to the marked bit. If the size of the marked object exceeds a size represented by the consecutive sequence of unmarked bits, the remainder of the bits representing the marked object are skipped, such that once a marked object is identified as potentially exceeding an object fetch threshold the helper thread efficiently skips the remainder of the bits represents the marked object and continues scanning for a number of consecutive zeroes indicating free space.
摘要翻译：提供了一种方法，系统和程序，用于在垃圾回收期间对较大对象进行高效的并行按位扫描。在按位扫描期间，辅助线程扫描标记向量，寻找在标记位之后具有足够长度的未标记位的连续序列。一旦检测到标记位之后足够长度的未标记位的连续序列，辅助线程将获取与标记位相对应的标记对象的大小。如果标记对象的大小超过由未标记位的连续序列表示的大小，则表示标记对象的位的其余部分被跳过，使得一旦将标记对象识别为潜在地超过对象提取阈值，则辅助线程有效跳过剩余的位表示标记对象，并继续扫描指示可用空间的多个连续零。

15. 发明授权

US07010555B2 System and method for compacting a computer system heap 有权
标题翻译：用于压缩计算机系统堆的系统和方法
公开(公告)号：US07010555B2
公开(公告)日：2006-03-07
申请号：US10273642
申请日：2002-10-17
申请人： Geoffrey Owen Blandy , Robert Tod Dimpsey , Kean G. Kuiper , Matthew Francis Peters
发明人： Geoffrey Owen Blandy , Robert Tod Dimpsey , Kean G. Kuiper , Matthew Francis Peters
IPC分类号： G06F17/30
CPC分类号： G06F12/0269 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945 , Y10S707/99953 , Y10S707/99957
摘要： A system and method for incrementally compacting a computer system heap is presented. A heap, such as a garbage-collected heap in a Java environment, is divided into logical regions. When the heap is becoming fragmented, an incremental compaction cycle is commenced. During a first time period, the first region of the heap is compacted, with subsequent regions being compacted during subsequent time periods. A time period commences when a garbage collection event occurs. In a multiprocessor environment the regions can be divided into a number of sections which are each compacted using a different processor. One or more break tables are constructed indicating how far contiguous groups of moveable objects should be moved to better group objects and eliminate interspersed free spaces. References throughout the heap that point to objects within the compacted region are then adjusted so that the references point to the new object locations.
摘要翻译：提出了一种用于逐步压缩计算机系统堆的系统和方法。诸如Java环境中垃圾收集堆的堆被分成逻辑区域。当堆成分碎片时，开始增量压缩循环。在第一时间段期间，堆的第一区域被压实，随后的区域在随后的时间段内被压实。发生垃圾回收事件时，时间段开始。在多处理器环境中，区域可以分为多个部分，每个部分使用不同的处理器进行压缩。构建一个或多个中断表，指示可移动对象的多少距离移动到更好的组对象并消除散布的空闲空间。然后对整个堆中指向压实区域内的对象的引用进行调整，以使引用指向新的对象位置。

16. 发明授权

US06779106B1 Apparatus and method for an enhanced integer divide in an IA64 architecture 失效
标题翻译：在IA64架构中增强整数除法的装置和方法
公开(公告)号：US06779106B1
公开(公告)日：2004-08-17
申请号：US09671873
申请日：2000-09-28
申请人： Geoffrey Owen Blandy
发明人： Geoffrey Owen Blandy
IPC分类号： G06F752
CPC分类号： G06F7/535 , G06F9/3001 , G06F9/30181 , G06F9/3853
摘要： An apparatus and method for performing integer divide operations in an IA64 architecture based data processing system is provided. The apparatus and method insert integer divide checks in place of NOP instructions in the instruction bundles associated with integer divide operations. The checks serve to identify typically encountered integer divide operations. Based on such identifications, the integer divide operation may be short-circuited such that the appropriate result may be returned without having to complete the integer divide operation.
摘要翻译：提供了一种用于在基于IA64架构的数据处理系统中执行整数除法运算的装置和方法。该装置和方法插入整数除法检查代替与整数除法运算相关联的指令束中的NOP指令。检查用于识别通常遇到的整数除法运算。基于这种标识，整数除法运算可能被短路，使得可以返回适当的结果而不必完成整数除法运算。

17. 发明授权

US06704926B1 Bimodal Java just-in-time complier 有权
标题翻译：双模式Java即时编译器
公开(公告)号：US06704926B1
公开(公告)日：2004-03-09
申请号：US09671769
申请日：2000-09-28
申请人： Geoffrey Owen Blandy , Andrew Johnson
发明人： Geoffrey Owen Blandy , Andrew Johnson
IPC分类号： G06F945
CPC分类号： G06F9/45516
摘要： A process in a data processing system for just-in-time compiling instructions. A set of non-specific data processing system instructions for a method are received. Addresses are placed into a set of functions. The set of non-specific data processing system instructions are processed using an intermediate code generation process to generate a set of instructions for execution using a particular mode of addressing.
摘要翻译：用于即时编译指令的数据处理系统中的过程。接收一组用于方法的非特定数据处理系统指令。地址被放置在一组函数中。使用中间代码生成处理来处理非特定数据处理系统指令的集合，以生成用于使用特定寻址方式执行的指令集。

18. 发明授权

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之后，随后搜索任何后续的值集合，二进制搜索通过在随后的一组值中的一个高速缓存行内测试值直到找到所需的值来结束。

19. 发明授权

US07814130B2 Efficient parallel bitwise sweep during garbage collection 有权
标题翻译：垃圾收集期间高效的并行按位扫描
公开(公告)号：US07814130B2
公开(公告)日：2010-10-12
申请号：US12051568
申请日：2008-03-19
申请人： Geoffrey Owen Blandy
发明人： Geoffrey Owen Blandy
IPC分类号： G06F17/30 , G06F17/00 , G06F7/00
CPC分类号： G06F12/0269 , Y10S707/99957
摘要： A method, system, and program for efficient parallel bitwise sweeps of larger objects during garbage collection are provided. During a bitwise sweep, a helper thread scans a mark vector looking for a consecutive sequence of unmarked bits of a sufficient length following a marked bit. Once a consecutive sequence of unmarked bits of a sufficient length following a marked bit is detected, the helper thread fetches the size of a marked object corresponding to the marked bit. If the size of the marked object exceeds a size represented by the consecutive sequence of unmarked bits, the remainder of the bits representing the marked object are skipped, such that once a marked object is identified as potentially exceeding an object fetch threshold the helper thread efficiently skips the remainder of the bits represents the marked object and continues scanning for a number of consecutive zeroes indicating free space.
摘要翻译：提供了一种方法，系统和程序，用于在垃圾回收期间对较大对象进行高效的并行按位扫描。在按位扫描期间，辅助线程扫描标记向量，寻找在标记位之后具有足够长度的未标记位的连续序列。一旦检测到标记位之后足够长度的未标记位的连续序列，辅助线程将获取与标记位相对应的标记对象的大小。如果标记对象的大小超过由未标记位的连续序列表示的大小，则表示标记对象的位的其余部分被跳过，使得一旦将标记对象识别为潜在地超过对象提取阈值，则辅助线程有效跳过剩余的位表示标记对象，并继续扫描指示可用空间的多个连续零。

20. 发明授权

US07376684B2 Efficient parallel bitwise sweep during garbage collection 有权
标题翻译：垃圾收集期间高效的并行按位扫描
公开(公告)号：US07376684B2
公开(公告)日：2008-05-20
申请号：US10862137
申请日：2004-06-04
申请人： Geoffrey Owen Blandy
发明人： Geoffrey Owen Blandy
IPC分类号： G06F12/00
CPC分类号： G06F12/0269 , Y10S707/99957
摘要： A method, system, and program for efficient parallel bitwise sweeps of larger objects during garbage collection are provided. During a bitwise sweep, a helper thread scans a mark vector looking for a consecutive sequence of unmarked bits of a sufficient length following a marked bit. Once a consecutive sequence of unmarked bits of a sufficient length following a marked bit is detected, the helper thread fetches the size of a marked object corresponding to the marked bit. If the size of the marked object exceeds a size represented by the consecutive sequence of unmarked bits, the remainder of the bits representing the marked object are skipped, such that once a marked object is identified as potentially exceeding an object fetch threshold the helper thread efficiently skips the remainder of the bits represents the marked object and continues scanning for a number of consecutive zeroes indicating free space.
摘要翻译：提供了一种方法，系统和程序，用于在垃圾回收期间对较大对象进行高效的并行按位扫描。在按位扫描期间，辅助线程扫描标记向量，寻找在标记位之后具有足够长度的未标记位的连续序列。一旦检测到标记位之后足够长度的未标记位的连续序列，辅助线程将获取与标记位相对应的标记对象的大小。如果标记对象的大小超过由未标记位的连续序列表示的大小，则表示标记对象的位的其余部分被跳过，使得一旦将标记对象识别为潜在地超过对象提取阈值，则辅助线程有效跳过剩余的位表示标记对象，并继续扫描指示可用空间的多个连续零。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式