-
公开(公告)号：US07275180B2
公开(公告)日：2007-09-25
申请号：US10418598
申请日：2003-04-17
CPC分类号： G06F11/203 , G06F11/2028 , G06F11/2041 , G06F11/2046
摘要： Methods, systems, and articles of manufacture for replacement of a failing processor of a multi-processor system running at least one operating system are provided. In contrast to the prior art, the replacement may be performed by system firmware without intervention by the operating system (i.e., the replacement may be transparent to the operating system). For some embodiments, the multi-processor system may be logically partitioned and the methods may be utilized to replace one or more shared or dedicated processors assigned to a logical partition, transparent to an operating system running on the partition.
摘要翻译： 提供了用于替代运行至少一个操作系统的多处理器系统故障处理器的方法，系统和制品。 与现有技术相反，替换可以由系统固件执行，而不需要操作系统的干预（即，替换可能对操作系统是透明的）。 对于一些实施例，多处理器系统可以被逻辑地分区，并且该方法可以用于替换分配给逻辑分区的一个或多个共享或专用处理器，对于在分区上运行的操作系统是透明的。
-
2.发明申请Partition Transparent Memory Error Handling in a Logically Partitioned Computer System With Mirrored Memory 有权在具有镜像内存的逻辑分区计算机系统中分区透明内存错误处理公开(公告)号：US20090282300A1
公开(公告)日：2009-11-12
申请号：US12115625
申请日：2008-05-06
IPC分类号： G06F11/07
CPC分类号： G06F11/2082 , G06F11/2094
摘要： A method and apparatus for transparently handling recurring correctable errors and uncorrectable errors in a mirrored memory system prevents costly system shutdowns for correctable memory errors or system failures from uncorrectable memory errors. When a high number of correctable errors are detected for a given memory location, a memory relocation mechanism in the hypervisor moves the data associated with the memory location to an alternate physical memory location transparently to the partition such that the partition has no knowledge that the physical memory actualizing the memory location has been changed. When a correctable error occurs, the memory relocation mechanism uses data from a partner mirrored memory block as a data source for the memory block with the uncorrectable error and then relocates the data to a newly allocated memory block to replace the memory block with the uncorrectable error.
摘要翻译： 用于透明地处理镜像存储器系统中的可重复校正错误和不可校正错误的方法和装置防止由于不可校正的存储器错误而导致的可校正存储器错误或系统故障的昂贵的系统关闭。 当对于给定的存储器位置检测到大量的可校正错误时，管理程序中的存储器重定位机制将与存储器位置相关联的数据透明地移动到备用物理存储器位置到分区，使得分区不知道物理 内存实现内存位置已更改。 当发生可纠正错误时，内存重定位机制使用来自伙伴镜像内存块的数据作为具有不可校正错误的存储器块的数据源，然后将数据重新定位到新分配的存储器块以用不可校正的错误来替换存储器块 。
-
3.发明申请Partition Transparent Correctable Error Handling in a Logically Partitioned Computer System 失效在逻辑分区计算机系统中的分区透明可纠正错误处理公开(公告)号：US20090282210A1
公开(公告)日：2009-11-12
申请号：US12115613
申请日：2008-05-06
IPC分类号： G06F12/00
CPC分类号： G06F13/28
摘要： A method and apparatus for transparently handling recurring correctable errors to prevent costly system shutdowns for correctable memory errors or system failures from uncorrectable memory errors. When a high number of correctable errors are detected for a given memory location, the hypervisor moves the data associated with the memory location to an alternate physical memory location transparently to the partition such that the partition has no knowledge that the physical memory actualizing the memory location has been changed. Similarly, the hypervisor can move direct memory access (DMA) memory locations using an I/O translation table.
摘要翻译： 一种用于透明地处理重复的可纠正错误以防止由于不可校正的存储器错误而导致的可校正的存储器错误或系统故障的昂贵的系统关闭的方法和装置。 当对于给定的存储器位置检测到大量可校正错误时，管理程序将与存储器位置相关联的数据透明地移动到备用物理存储器位置到分区，使得分区不知道物理存储器实现存储器位置 已经变了。 类似地，管理程序可以使用I / O转换表移动直接存储器访问（DMA）存储器位置。
-
4.发明授权Partition transparent memory error handling in a logically partitioned computer system with mirrored memory 有权在具有镜像内存的逻辑分区计算机系统中分区透明内存错误处理公开(公告)号：US08407515B2
公开(公告)日：2013-03-26
申请号：US12115625
申请日：2008-05-06
IPC分类号： G06F11/00
CPC分类号： G06F11/2082 , G06F11/2094
摘要： A method and apparatus for transparently handling recurring correctable errors and uncorrectable errors in a mirrored memory system prevents costly system shutdowns for correctable memory errors or system failures from uncorrectable memory errors. When a high number of correctable errors are detected for a given memory location, a memory relocation mechanism in the hypervisor moves the data associated with the memory location to an alternate physical memory location transparently to the partition such that the partition has no knowledge that the physical memory actualizing the memory location has been changed. When a correctable error occurs, the memory relocation mechanism uses data from a partner mirrored memory block as a data source for the memory block with the uncorrectable error and then relocates the data to a newly allocated memory block to replace the memory block with the uncorrectable error.
摘要翻译： 用于透明地处理镜像存储器系统中的可重复校正错误和不可校正错误的方法和装置防止由于不可校正的存储器错误而导致的可校正存储器错误或系统故障的昂贵的系统关闭。 当对于给定的存储器位置检测到大量的可校正错误时，管理程序中的存储器重定位机制将与存储器位置相关联的数据透明地移动到备用物理存储器位置到分区，使得分区不知道物理 内存实现内存位置已更改。 当发生可纠正错误时，内存重定位机制使用来自伙伴镜像内存块的数据作为具有不可校正错误的存储器块的数据源，然后将数据重新定位到新分配的存储器块以用不可校正的错误来替换存储器块 。
-
5.发明授权Partition transparent correctable error handling in a logically partitioned computer system 失效逻辑分区计算机系统中的分区透明可校正错误处理公开(公告)号：US08255639B2
公开(公告)日：2012-08-28
申请号：US12115613
申请日：2008-05-06
CPC分类号： G06F13/28
摘要： A method and apparatus for transparently handling recurring correctable errors to prevent costly system shutdowns for correctable memory errors or system failures from uncorrectable memory errors. When a high number of correctable errors are detected for a given memory location, the hypervisor moves the data associated with the memory location to an alternate physical memory location transparently to the partition such that the partition has no knowledge that the physical memory actualizing the memory location has been changed. Similarly, the hypervisor can move direct memory access (DMA) memory locations using an I/O translation table.
摘要翻译： 一种用于透明地处理重复的可纠正错误以防止由于不可校正的存储器错误而导致的可校正的存储器错误或系统故障的昂贵的系统关闭的方法和装置。 当对于给定的存储器位置检测到大量可校正错误时，管理程序将与存储器位置相关联的数据透明地移动到备用物理存储器位置到分区，使得分区不知道物理存储器实现存储器位置 已经变了。 类似地，管理程序可以使用I / O转换表移动直接存储器访问（DMA）存储器位置。
-
6.发明授权公开(公告)号：US07487065B2
公开(公告)日：2009-02-03
申请号：US11008791
申请日：2004-12-09
IPC分类号： G06F3/01
CPC分类号： G06F9/485 , G06F9/4881
摘要： 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.
摘要翻译： 描述了用于在整个处理周期内执行总体数据处理的示例性方法，系统和产品，其包括通过一系列迭代重复地执行可以在设定的处理周期内完成的整个数据处理量的一部分， 其中每次迭代包括设置处理周期和可变延迟周期，并且根据设定的处理周期计算迭代的可变延迟周期，在迭代的设置处理周期期间执行的总数量处理的一部分， 总体数据处理量和总体处理时间。
-
公开(公告)号：US06990560B2
公开(公告)日：2006-01-24
申请号：US10346010
申请日：2003-01-16
申请人： William Joseph Armstrong , Michael Joseph Corrigan , Gary Ross Ricard , Timothy Joseph Torzewski
发明人： William Joseph Armstrong , Michael Joseph Corrigan , Gary Ross Ricard , Timothy Joseph Torzewski
IPC分类号： G06F12/02
摘要： A task synchronization mechanism operates on a global lock that is shared between processors an on local locks that are not shared between processors. The local locks are processor-specific locks. Each processor-specific lock is dedicated to a particular processor in the system. When shared access to a resource is required, a processor updates its processor-specific lock to indicate the processor is sharing the resource. Because each processor-specific lock is dedicated to a particular processor, this eliminates a significant portion of the memory bus traffic associated with all processors reading and updating the same lock. When exclusive access to a resource is required, the requesting processor waits until the count of all processor-specific locks indicate that none of these processors have a lock on the resource. Once no processor has a lock on the resource, exclusive access to the resource may be granted.
摘要翻译： 任务同步机制对在处理器之间共享的全局锁进行操作，本地锁在处理器之间未共享。 本地锁是处理器特定的锁。 每个处理器特定的锁专用于系统中的特定处理器。 当需要对资源的共享访问时，处理器更新其处理器特定的锁，以指示处理器正在共享资源。 因为每个特定于处理器的锁专用于特定的处理器，所以这消除了与所有处理器相关联的存储器总线流量的相当大部分读取和更新相同的锁。 当需要对资源的独占访问时，请求处理器等待直到所有特定于处理器的锁的计数指示这些处理器中没有一个对资源有锁定。 一旦没有处理器对资源进行锁定，就可以授予资源的独占访问权限。
-
8.发明授权Database journal mechanism and method that supports multiple simultaneous deposits 失效数据库日志机制和方法，支持多个同时存款公开(公告)号：US06298345B1
公开(公告)日：2001-10-02
申请号：US09113641
申请日：1998-07-10
IPC分类号： G06F1730
CPC分类号： G06F11/1471 , G06F2201/80 , G06F2201/82 , Y10S707/99938 , Y10S707/99952 , Y10S707/99953
摘要： A journal mechanism for a database allows simultaneous deposits on multiple journal arms. According to a first embodiment, a journaling system maintains the time-order of interdependent deposits on the journal, but does not necessarily maintain the time-order of deposits that are independent of each other, thereby providing multiple simultaneous deposit points on the journal. The first embodiment provides excellent scaling of journal functions as processors are added to a database computer system. According to a second embodiment, a journaling system maintains the time-order of deposits on the journal, but allows a group of deposits known as a “bundle” to span multiple journal arms, thereby providing multiple simultaneous deposit points on the journal. The second embodiment provides good scaling while providing compatibility with known database systems. The present invention thus relieves contention for the journal that exists as the number of processors increases in a database system.
摘要翻译： 一个数据库的期刊机制允许同时存放在多个日记本武器上。 根据第一实施例，日志系统将相互依赖的存款的时间顺序保持在期刊上，但不一定保持彼此独立的存款的时间顺序，从而在期刊上提供多个同时存款点。 当处理器被添加到数据库计算机系统时，第一实施例提供了日记功能的优异缩放。 根据第二实施例，日志系统保持期刊上的存款的时间顺序，但允许称为“捆”的一组存款跨越多个日记手臂，从而在期刊上提供多个同时存款点。 第二实施例提供良好的缩放，同时提供与已知数据库系统的兼容性。 因此，本发明减轻了在数据库系统中随着处理器数量的增加而存在的日志的争用。
-
9.发明申请公开(公告)号：US20090037377A1
公开(公告)日：2009-02-05
申请号：US11830463
申请日：2007-07-30
IPC分类号： G06F17/30
CPC分类号： G06F17/30445
摘要： An apparatus and method retrieves a database record from an in-memory database of a parallel computer system using a non-unique key. The parallel computer system performs a simultaneous search on each node of the computer system using the non-unique key and then utilizes a global combining network to combine the local results from the searches of each node to efficiently and quickly search the entire database.
摘要翻译： 装置和方法使用非唯一的密钥从并行计算机系统的存储器内数据库检索数据库记录。 并行计算机系统使用非唯一密钥对计算机系统的每个节点进行同时搜索，然后利用全局组合网络将来自每个节点的搜索的本地结果组合以有效且快速地搜索整个数据库。
-
10.发明申请Method and Apparatus for Reducing Contention for Computer System Resources Using Soft Locks 失效使用软锁减少计算机系统资源争用的方法和装置公开(公告)号：US20080172670A1
公开(公告)日：2008-07-17
申请号：US11622021
申请日：2007-01-11
IPC分类号： G06F9/46
CPC分类号： G06F9/526
摘要： A soft lock mechanism controls access by multiple processes to a shared resource to make simultaneous access an unlikely event, while not necessarily preventing simultaneous access. Preferably, the soft lock contains a next_free_time field, specifying when the soft lock will next be available, and a lock_duration, specifying a sufficiently long interval for most accesses to the resource to complete. The lock is obtained by comparing the current time to next_free_time. If the current time is later than next_free_time, then the lock is obtained immediately, and next_free_time is updated to the current time plus lock_duration. If the current time is before next_free_time, then next_free_time is incremented by lock_duration, and the requesting process waits until the old next_free_time to obtain the lock. No action is required to release the lock.
摘要翻译： 软锁定机制控制多个进程对共享资源的访问，以同时访问不太可能的事件，而不一定阻止同时访问。 优选地，软锁包含next_free_time字段，指定软锁将何时可用，以及lock_duration，指定大部分访问资源以完成的足够长的间隔。 通过将当前时间与next_free_time进行比较来获得锁定。 如果当前时间晚于next_free_time，则立即获取锁定，并将next_free_time更新为当前时间加上lock_duration。 如果当前时间在next_free_time之前，则next_free_time将被加上lock_duration，并且请求进程等待到旧的next_free_time来获取锁。 不需要采取任何行动来释放锁。
-
-
-
-
-
-
-
-
-
搜索结果
35 条记录 (耗时 0.022 秒)
