公开(公告)号：US09286232B2

公开(公告)日：2016-03-15

申请号：US12359383

申请日：2009-01-26

Applicant: Charles J. Archer ,  Gary R. Ricard

Inventor： Charles J. Archer ,  Gary R. Ricard

IPC: G06F12/00 ,  G06F12/10

CPC classification number: G06F12/1027 ,  G06F12/1072 ,  G06F12/1081

Abstract: Administering registered virtual addresses in a hybrid computing environment that includes a host computer, an accelerator, the accelerator architecture optimized, with respect to the host computer architecture, for speed of execution of a particular class of computing functions, the host computer and the accelerator adapted to one another for data communications by a system level message passing module, where administering registered virtual addresses includes maintaining a cache of ranges of currently registered virtual addresses, the cache including entries associating a range of currently registered virtual addresses, a handle representing physical addresses mapped to the range of currently registered virtual addresses, and a counter; determining whether to register ranges of virtual addresses in dependence upon the cache of ranges of currently registered virtual addresses; and determining whether to deregister ranges of virtual addresses in dependence upon the cache of ranges of currently registered virtual addresses.

Abstract translation: 在混合计算环境中管理注册的虚拟地址，该混合计算环境包括主机计算机，加速器，针对主计算机架构优化的加速器架构，用于执行特定类别的计算功能的速度，主计算机和加速器 用于由系统级消息传递模块进行数据通信，其中管理注册的虚拟地址包括维护当前注册的虚拟地址的范围的高速缓存，所述高速缓存包括关联当前注册的虚拟地址的范围的条目，表示物理地址映射的句柄 到当前注册的虚拟地址的范围，以及计数器; 根据当前注册的虚拟地址的范围的高速缓存来确定是否注册虚拟地址的范围; 以及根据当前注册的虚拟地址的范围的高速缓存来确定是否取消注册虚拟地址的范围。

公开(公告)号：US08027805B2

公开(公告)日：2011-09-27

申请号：US12349877

申请日：2009-01-07

Applicant: Troy D. Armstrong ,  Naresh Nayar ,  Gary R. Ricard

Inventor： Troy D. Armstrong ,  Naresh Nayar ,  Gary R. Ricard

IPC: G06F3/01 ,  G06F3/00 ,  G04F5/00 ,  G04F1/00

CPC classification number: G06F9/485 ,  G06F9/4881

Abstract: Exemplary methods, systems, and products are described for executing an overall quantity of data processing within an overall processing period that include executing repeatedly through a series of iterations a portion of the overall quantity of data processing that can be completed in a set processing period, wherein each iteration includes the set processing period and a variable delay period and calculating the variable delay period for an iteration in dependence upon the set processing period, a portion of the overall quantity of data processing performed during the set processing period of the iteration, the overall quantity of data processing, and the overall processing period.

Abstract translation: 描述了用于在整个处理周期内执行总体数据处理的示例性方法，系统和产品，其包括通过一系列迭代重复地执行可以在设定的处理周期内完成的整个数据处理量的一部分， 其中每次迭代包括设置处理周期和可变延迟周期，并且根据设定的处理周期计算迭代的可变延迟周期，在迭代的设置处理周期期间执行的总数量处理的一部分， 总体数据处理量和总体处理时间。

公开(公告)号：US20100191909A1

公开(公告)日：2010-07-29

申请号：US12359383

申请日：2009-01-26

Applicant: Charles J. Archer ,  Gary R. Ricard

Inventor： Charles J. Archer ,  Gary R. Ricard

IPC: G06F12/08

CPC classification number: G06F12/1027 ,  G06F12/1072 ,  G06F12/1081

Abstract: Administering registered virtual addresses in a hybrid computing environment that includes a host computer, an accelerator, the accelerator architecture optimized, with respect to the host computer architecture, for speed of execution of a particular class of computing functions, the host computer and the accelerator adapted to one another for data communications by a system level message passing module, where administering registered virtual addresses includes maintaining a cache of ranges of currently registered virtual addresses, the cache including entries associating a range of currently registered virtual addresses, a handle representing physical addresses mapped to the range of currently registered virtual addresses, and a counter; determining whether to register ranges of virtual addresses in dependence upon the cache of ranges of currently registered virtual addresses; and determining whether to deregister ranges of virtual addresses in dependence upon the cache of ranges of currently registered virtual addresses.

Abstract translation: 在混合计算环境中管理注册的虚拟地址，该混合计算环境包括主机计算机，加速器，针对主计算机架构优化的加速器架构，用于执行特定类别的计算功能的速度，主计算机和加速器 用于由系统级消息传递模块进行数据通信，其中管理注册的虚拟地址包括维护当前注册的虚拟地址的范围的高速缓存，所述高速缓存包括关联当前注册的虚拟地址的范围的条目，表示物理地址映射的句柄 到当前注册的虚拟地址的范围，以及计数器; 根据当前注册的虚拟地址的范围的高速缓存来确定是否注册虚拟地址的范围; 以及根据当前注册的虚拟地址的范围的高速缓存来确定是否取消注册虚拟地址的范围。

公开(公告)号：US20090307538A1

公开(公告)日：2009-12-10

申请号：US12478990

申请日：2009-06-05

Applicant: Carol B. Hernandez ,  David A. Larson ,  Naresh Nayar ,  John T. O'Quin, II ,  Gary R. Ricard ,  Kenneth C. Vossen

Inventor： Carol B. Hernandez ,  David A. Larson ,  Naresh Nayar ,  John T. O'Quin, II ,  Gary R. Ricard ,  Kenneth C. Vossen

IPC: G06F11/00 ,  G06F11/14 ,  G06F9/455 ,  G11C29/00 ,  G06F12/00 ,  G06F12/02

CPC classification number: G06F11/0793 ,  G06F11/0712 ,  G06F11/0724 ,  G06F11/073 ,  G06F11/0745

Abstract: In response to a hypervisor page fault for memory that is not resident in a shared memory pool, an I/O paging request is sent to an external storage paging space. In response to a paging service partition encountering an I/O paging error, a paging failure indication is sent to the hypervisor. A simulated machine check interrupt instruction is sent from the hypervisor to the shared memory partition and a machine check handler obtains control. The machine check handler performs data analysis utilizing an error log in an attempt to isolate the I/O paging error to a process or a set of processes in the shared memory partition. The process or set of processes associated with the I/O paging error, or the shared memory partition itself, may be terminated. Finally, the shared memory partition may clear or initialize the page associated with the I/O paging error.

Abstract translation: 响应于不驻留在共享存储器池中的内存的管理程序页面错误，I / O寻呼请求被发送到外部存储分页空间。 响应于遇到I / O寻呼错误的寻呼服务分区，寻呼失败指示被发送到管理程序。 仿真机器检查中断指令从管理程序发送到共享存储器分区，并且机器检查处理程序获得控制。 机器检查处理程序使用错误日志执行数据分析，以尝试将I / O分页错误隔离到共享内存分区中的进程或一组进程。 与I / O寻呼错误相关联的进程或一组进程或共享内存分区本身可能会被终止。 最后，共享内存分区可以清除或初始化与I / O寻呼错误相关联的页面。

公开(公告)号：US07478272B2

公开(公告)日：2009-01-13

申请号：US11241709

申请日：2005-09-30

Applicant: William J. Armstrong ,  Naresh Nayar ,  Gary R. Ricard

Inventor： William J. Armstrong ,  Naresh Nayar ,  Gary R. Ricard

IPC: G06F11/00

CPC classification number: G06F11/203 ,  G06F9/5066 ,  G06F11/2025 ,  G06F11/2035

Abstract: Replacing a failing physical processor in a computer supporting multiple logical partitions, where the logical partitions include dedicated partitions and shared processor partitions, the dedicated partitions are supported by virtual processors having assigned physical processors, and the shared processor partitions are supported by pools of virtual processors. The pools of virtual processors have assigned physical processors. Embodiments operate generally by assigning priorities to the dedicated partitions and to the pools of virtual processors; detecting a checkstop of a failing physical processor; retrieving the failing physical processor's state; replacing by a hypervisor the failing physical processor with a replacement physical processor assigned to a dedicated partition or pool, which dedicated partition or pool has the lowest priority among the priorities of the dedicated partitions and pools; and assigning the retrieved state of the failing physical processor as the state of the replacement physical processor.

Abstract translation: 在支持多个逻辑分区（其中逻辑分区包括专用分区和共享处理器分区）的计算机中替换故障物理处理器，专用分区由具有分配的物理处理器的虚拟处理器支持，并且共享处理器分区由虚拟处理器池支持 。 虚拟处理器池分配了物理处理器。 实施例通常通过将优先级分配给专用分区和虚拟处理器池来进行操作; 检测故障物理处理器的检查停止; 检索故障物理处理器的状态; 由管理程序替换故障物理处理器，其中分配给专用分区或池的替换物理处理器，专用分区或池在专用分区和池的优先级中具有最低优先级; 以及将所述故障物理处理器的检索状态分配为所述替换物理处理器的状态。

公开(公告)号：US20080126739A1

公开(公告)日：2008-05-29

申请号：US11531846

申请日：2006-09-14

Applicant: Charles J. Archer ,  Benjamin E. Lynam ,  Gary R. Ricard

Inventor： Charles J. Archer ,  Benjamin E. Lynam ,  Gary R. Ricard

IPC: G06F12/00

CPC classification number: G06F17/30327 ,  G06F17/30445 ,  Y10S707/99937

Abstract: Methods, apparatus, and products are disclosed for parallel execution of operations for a partitioned binary radix tree that include: receiving, in a parallel computer, an operational entry for the PBRT, the PBRT comprising a plurality of logical pages that contain a plurality of entries, each logical page included in a tier and containing one or more subentries corresponding to the tier of the logical page containing the subentry, each entry is composed of a subentry from each logical page on an entry path; processing in parallel, on the parallel computer, each logical page in each tier, including: identifying a portion of the operational entry that corresponds to the tier of the logical page, and performing an operation on the logical page in dependence upon the identified portion of the operational entry for the tier; and selecting operation results from the logical pages on the entry path for the operational entry.

Abstract translation: 公开了用于并行执行分区二进制基树的操作的方法，装置和产品，包括：在并行计算机中接收PBRT的操作条目，PBRT包括包含多个条目的多个逻辑页面 包含在层中并且包含与包含子条目的逻辑页的层相对应的一个或多个子条目的每个逻辑页面，每个条目由入口路径上每个逻辑页面的子条目组成; 在并行计算机上并行处理每层中的每个逻辑页面，包括：识别对应于逻辑页面层的操作条目的一部分，以及根据所识别的部分的逻辑页面对逻辑页面执行操作 层次的操作入口; 以及从用于操作条目的入口路径上的逻辑页面中选择操作结果。

公开(公告)号：US5625820A

公开(公告)日：1997-04-29

申请号：US674941

申请日：1996-07-03

Applicant: David L. Hermsmeier ,  Gary R. Ricard ,  John J. Vriezen ,  Larry W. Youngren

Inventor： David L. Hermsmeier ,  Gary R. Ricard ,  John J. Vriezen ,  Larry W. Youngren

IPC: G06F12/00 ,  G06F11/14 ,  G06F17/30

CPC classification number: G06F11/1471 ,  Y10S707/99931 ,  Y10S707/99953

Abstract: System control over the logging of objects in order to meet the user specified recovery requirements. Under the fixed recovery time environment, the user chooses a length of time to be spent on object recovery, and the system dynamically manages the logging of objects to meet this time. The shorter the time the user chooses, the more objects the system will log, and the more performance degradation there will be as a result of the logging at run-time. The user may partition storage into Auxiliary Storage Pools (ASPs), which are groups of non-volatile storage, and then specify the recovery time on a per ASP basis. Under the minimal impact environment, the system dynamically manages the objects to be logged such that the object logging has a minimal impact on run-time performance.

Abstract translation: 系统控制对象的日志记录，以满足用户指定的恢复要求。 在固定恢复时间环境下，用户选择花费在对象恢复上的时间长度，系统会动态管理对象的日志记录，以满足此时的需求。 用户选择的时间越短，系统记录的对象越多，运行时记录的性能下降越多。 用户可以将存储分区为非易失性存储组的辅助存储池（ASP），然后以每ASP为单位指定恢复时间。 在最小的影响环境下，系统会动态管理要记录的对象，以使对象日志记录对运行时性能的影响最小。

公开(公告)号：US5574897A

公开(公告)日：1996-11-12

申请号：US954641

申请日：1992-09-30

Applicant: David L. Hermsmeier ,  Gary R. Ricard ,  John J. Vriezen ,  Larry W. Youngren

Inventor： David L. Hermsmeier ,  Gary R. Ricard ,  John J. Vriezen ,  Larry W. Youngren

IPC: G06F12/00 ,  G06F11/14 ,  G06F7/00

CPC classification number: G06F11/1471 ,  Y10S707/99931 ,  Y10S707/99953

Abstract: System control over the logging of objects in order to meet the user specified recovery requirements. Under the fixed recovery time environment, the user chooses a length of time to be spent on object recovery, and the system dynamically manages the logging of objects to meet this time. The shorter the time the user chooses, the more objects the system will log, and the more performance degradation there will be as a result of the logging at run-time. The user may partition storage into Auxiliary Storage Pools (ASPs), which are groups of non-volatile storage, and then specify the recovery time on a per ASP basis. Under the minimal impact environment, the system dynamically manages the objects to be logged such that the object logging has a minimal impact on run-time performance.

Abstract translation: 系统控制对象的日志记录，以满足用户指定的恢复要求。 在固定恢复时间环境下，用户选择花费在对象恢复上的时间长度，系统会动态管理对象的日志记录，以满足此时的需求。 用户选择的时间越短，系统记录的对象越多，运行时记录的性能下降越多。 用户可以将存储分区为非易失性存储组的辅助存储池（ASP），然后以每ASP为单位指定恢复时间。 在最小的影响环境下，系统会动态管理要记录的对象，以使对象日志记录对运行时性能的影响最小。

公开(公告)号：US5265245A

公开(公告)日：1993-11-23

申请号：US895176

申请日：1992-06-05

Applicant: Michael L. Nordstrom ,  Gary R. Ricard ,  John J. Vriezen ,  David R. Welsh ,  Larry W. Youngren

Inventor： Michael L. Nordstrom ,  Gary R. Ricard ,  John J. Vriezen ,  David R. Welsh ,  Larry W. Youngren

IPC: G06F9/46 ,  G06F17/30 ,  G06F12/00 ,  G06F15/40

CPC classification number: G06F9/52 ,  Y10S707/99938 ,  Y10S707/99953

Abstract: An in use table manager in a computer system uses an in use table to track the use of files, or objects. The in use table is used to determine which objects may need recovery in the event of a system failure. Object addresses are hashed by the in use manager to identify a preferred slot in the table. The slots contain information identifying the object, and indicating the extent of use of the object. The in use manager assigns alternate slots, and dynamically changes the size of the in use table to reduce contention for slots. Several atomic operations on the table ensure integrity of the table, while permitting concurrent use. Portions of the table are bundled into single I/O operations to enhance system performance by minimizing I/O.

Abstract translation: 计算机系统中的使用表管理器使用在使用表来跟踪文件或对象的使用。 在使用表中用于确定哪些对象在系统发生故障时可能需要恢复。 对象地址由使用管理器进行散列以识别表中的优选时隙。 插槽包含标识对象的信息，并指示对象的使用范围。 正在使用的管理员分配备用插槽，并动态地更改使用表中的大小以减少插槽的争用。 表上的几个原子操作确保表的完整性，同时允许并发使用。 表的一部分被捆绑到单个I / O操作中，以通过最小化I / O来提高系统性能。

公开(公告)号：US5179662A

公开(公告)日：1993-01-12

申请号：US401335

申请日：1989-08-31

Applicant: Michael J. Corrigan ,  Gary R. Ricard ,  Richard M. Rocheleau ,  Larry W. Youngren

Inventor： Michael J. Corrigan ,  Gary R. Ricard ,  Richard M. Rocheleau ,  Larry W. Youngren

IPC: G06F3/06 ,  G06F5/06 ,  G06F5/16

CPC classification number: G06F5/16

Abstract: Optimization I/O buffers are used to write data into or read data from auxiliary storage using a double buffering scheme. When a user wants to send data to auxiliary storage, the first buffer is filled with data and the contents are asynchronously written to auxiliary storage. Without waiting for the asynchronous write to complete, the second buffer is filled with data. When the second buffer is filled, the contents of the second buffer are asynchronously written to auxiliary storage. If the first buffer has not completed its write operation by this point, the buffers are determined to be too small and the size of both buffers is increased. Control switches back and forth between these two buffers until all of the desired data is sent to auxiliary storage. The size of the buffers is increased until the computer system does not have to synchronously wait for one buffer to complete its write operation before it can refill that buffer with new data. Ideally, the first buffer should complete its write operation when the second buffer is filled beyond a predetermined threshold percentage, such as one half. If the first buffer completes its write operation before the second buffer is filled beyond the predetermined threshold percentage, the buffers are determined to be too large and the size of both buffers are decreased. The size of the buffers is dynamically increased and decreased as needed to achieve an optimum size based on the unique and dynamically changing computer environment.