-
1.发明授权Apparatus and method for writing data to mirrored storage using multiple tasks working in parallel 有权使用并行工作的多个任务向镜像存储器写入数据的装置和方法公开(公告)号：US07167969B2
公开(公告)日：2007-01-23
申请号：US10671035
申请日：2003-09-25
申请人： Kevin Curtis Griffin , Scott Dennis Helt , Glen Warren Nelson , Mark Philip Piazza , Gary Ross Ricard
发明人： Kevin Curtis Griffin , Scott Dennis Helt , Glen Warren Nelson , Mark Philip Piazza , Gary Ross Ricard
IPC分类号： G06F12/00
CPC分类号： G06F12/1441 , G06F11/2056
摘要： An apparatus and method provides the capability of mirroring storage from a primary system to a mirrored system in a way that uses parallelism in the mirrored system to maximize the efficiency of writing data to the mirrored storage for operations that do not conflict while serializing operations that do conflict. The mirroring of the present invention is “logical mirroring”, which does not require identical disk drives, and which supports mirroring between geographically remote locations to protect against catastrophic site failure. Parallelism is achieved in the mirrored system by dividing the virtual address space into multiple ranges, and by assigning a group of tasks to each range. When an operation is received on the mirrored system, the virtual address range that the operation affects is determined, and the operation is then delegated to the task group that corresponds to the affected virtual address range. By dividing the virtual address space into ranges, tasks in different ranges (i.e., in different task groups) may execute in parallel without any threat of conflict, and even tasks within the same range may execute in parallel if they operate in different portions of the range.
摘要翻译： 一种装置和方法提供将存储从主系统镜像到镜像系统的能力，其方法是使用镜像系统中的并行性来最大限度地提高将数据写入镜像存储器的效率，以用于在串行化操作时不冲突的操作 冲突。 本发明的镜像是“逻辑镜像”，其不需要相同的磁盘驱动器，并且其支持在地理上偏远的位置之间的镜像，以防止灾难性的站点故障。 通过将虚拟地址空间划分为多个范围，并通过为每个范围分配一组任务，在镜像系统中实现并行化。 当在镜像系统上接收到操作时，确定操作影响的虚拟地址范围，然后将该操作委派给与受影响的虚拟地址范围对应的任务组。 通过将虚拟地址空间划分为范围，不同范围内的任务（即，在不同的任务组中）可以并行执行，而不会产生任何冲突的威胁，如果在相同范围内的任务可以并行执行，如果它们在 范围。
-
公开(公告)号：US5826262A
公开(公告)日：1998-10-20
申请号：US621757
申请日：1996-03-22
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , Y10S707/99932 , Y10S707/99937
摘要： A method for partitioning keys onto radix tree logical pages and a parallel index page build algorithm in order to provide radix tree build speedup proportional to the number of processors on the system and controlled efficient page utilization. Also, since keys are intelligently partitioned so that a complete set of keys is inserted into a logical page, there is no page overflow during the tree construction and thus page splitting is eliminated. Since radix index trees are really groups of logical pages in which each logical page contains a small tree, the tree is built (with respect to the logical pages) from the bottom up, while within each individual logical page the tree is constructed from the top down. The space required for a logical page is pre-allocated to allow construction of limbs to begin without waiting for the build of their underlying pages to complete.
摘要翻译： 一种将键分解到基数树逻辑页面的方法和一个并行的索引页构建算法，以便提供与系统上的处理器数量成比例的基数树构建速度，并控制有效的页面利用率。 另外，由于密钥被智能地分割，使得一整套密钥被插入到逻辑页面中，所以在树构造期间没有页面溢出，因此页面拆分被消除。 由于基数索引树是真正的逻辑页面组，其中每个逻辑页面都包含一个小树，所以从底部向上构建树（相对于逻辑页面），而在每个单独的逻辑页面中，树从顶部构建 下。 逻辑页面所需的空间被预先分配，以允许构建四肢开始，而无需等待其底层页面的构建才能完成。
-
3.发明申请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.
摘要翻译： 用于透明地处理镜像存储器系统中的可重复校正错误和不可校正错误的方法和装置防止由于不可校正的存储器错误而导致的可校正存储器错误或系统故障的昂贵的系统关闭。 当对于给定的存储器位置检测到大量的可校正错误时，管理程序中的存储器重定位机制将与存储器位置相关联的数据透明地移动到备用物理存储器位置到分区，使得分区不知道物理 内存实现内存位置已更改。 当发生可纠正错误时，内存重定位机制使用来自伙伴镜像内存块的数据作为具有不可校正错误的存储器块的数据源，然后将数据重新定位到新分配的存储器块以用不可校正的错误来替换存储器块 。
-
4.发明申请公开(公告)号：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.
摘要翻译： 装置和方法使用非唯一的密钥从并行计算机系统的存储器内数据库检索数据库记录。 并行计算机系统使用非唯一密钥对计算机系统的每个节点进行同时搜索，然后利用全局组合网络将来自每个节点的搜索的本地结果组合以有效且快速地搜索整个数据库。
-
5.发明申请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来获取锁。 不需要采取任何行动来释放锁。
-
6.发明授权Method and computer program product for implementing highly concurrent record insertion in an ordinal number dependent database 失效方法和计算机程序产品，用于在序数依赖数据库中实现高度并发记录插入公开(公告)号：US06223176B1
公开(公告)日：2001-04-24
申请号：US09160817
申请日：1998-09-25
IPC分类号： G06F1730
CPC分类号： G06F17/30348 , Y10S707/99938 , Y10S707/99953
摘要： A method and computer program product are provided for implementing highly concurrent record insertion in an ordinal number dependent database. Serialized processing is provided with one concurrent task of multiple concurrent tasks allowed to execute, for allocation of ordinal numbers for record insertion. Concurrent validation processing operations of multiple concurrent tasks are enabled for record insertion in the ordinal number dependent database. A set of counter variables are maintained with the database to enable removal of serialization from the validation phase processing operations for record insertion in the ordinal number dependent database.
摘要翻译： 提供了一种方法和计算机程序产品，用于在序数依赖数据库中实现高并发记录插入。 提供序列化处理，允许执行多个并发任务的并发任务，用于分配用于记录插入的序数。 启用多个并发任务的并发验证处理操作，以便在序数依赖数据库中进行记录插入。 与数据库一起维护一组计数器变量，以便从验证阶段处理操作中删除序列化，以便在序数依赖数据库中进行记录插入。
-
7.发明授权Method and apparatus for reducing contention for computer system resources using soft locks 失效使用软锁减少计算机系统资源争用的方法和装置公开(公告)号：US08141089B2
公开(公告)日：2012-03-20
申请号：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来获取锁。 不需要采取任何行动来释放锁。
-
8.发明授权公开(公告)号：US08090704B2
公开(公告)日：2012-01-03
申请号：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.
摘要翻译： 装置和方法使用非唯一的密钥从并行计算机系统的存储器内数据库检索数据库记录。 并行计算机系统使用非唯一密钥对计算机系统的每个节点进行同时搜索，然后利用全局组合网络将来自每个节点的搜索的本地结果组合以有效且快速地搜索整个数据库。
-
公开(公告)号：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.
摘要翻译： 提供了用于替代运行至少一个操作系统的多处理器系统故障处理器的方法，系统和制品。 与现有技术相反，替换可以由系统固件执行，而不需要操作系统的干预（即，替换可能对操作系统是透明的）。 对于一些实施例，多处理器系统可以被逻辑地分区，并且该方法可以用于替换分配给逻辑分区的一个或多个共享或专用处理器，对于在分区上运行的操作系统是透明的。
-
公开(公告)号：US06731795B1
公开(公告)日：2004-05-04
申请号：US09584294
申请日：2000-05-31
申请人： Gary Ross Ricard
发明人： Gary Ross Ricard
IPC分类号： G06K940
摘要： A relatively long, narrow defect in a digital image is repaired by identifying an elongated area to be repaired, and by automatically calculating pixel color/shade values within the area to be repaired from pixel values in the vicinity of the perimeter of the elongated area. Preferably, a user identifies an elongated rectangular area to be repaired on an interactive display. The computer automatically generates the pixel coordinates of a pair of parallel lines constituting the opposite long sides of the rectangle, and a set of line segments running between the long sides. The interior pixels of the rectangle are then filled by interpolating color values along each line segment. Since this method is not guaranteed to fill all pixels, the system optionally maintains a map of pixels filled and not filled while performing this method, and after completion, performs an additional step of assigning to any unfilled pixels a value based on the average of all adjacent pixels. For long, narrow defects, particularly those introduced by creasing, the automated digital image repair method herein described generally produces images without significant visually noticeable defects, and does so without undue effort on the part of the user.
摘要翻译： 通过识别待修复的细长区域以及通过在细长区域的周边附近的像素值自动计算要修复的区域内的像素颜色/阴影值来修复数字图像中相对长的狭窄缺陷。 优选地，用户在交互式显示器上识别要修复的细长矩形区域。 计算机自动生成构成矩形的相对长边的一对平行线的像素坐标以及在长边之间运行的一组线段。 然后通过沿着每个线段内插颜色值来填充矩形的内部像素。 由于该方法不能保证填满所有像素，所以系统可选地在执行该方法时维护填充并未填充的像素的映射，并且在完成之后，执行额外的步骤，根据所有像素的平均值分配给任何未填充像素的值 相邻像素。 对于长而窄的缺陷，特别是通过压痕引入的缺陷，本文所描述的自动数字图像修复方法通常产生没有明显视觉上可察觉的缺陷的图像，并且在没有用户的不必要的努力的情况下进行。
-
-
-
-
-
-
-
-
-
搜索结果
35 条记录 (耗时 0.047 秒)
