-
1.发明授权Task dispatching based on composite queue size and upper and lower compare values 有权基于复合队列大小和上下比较值的任务调度公开(公告)号：US08990821B2
公开(公告)日：2015-03-24
申请号：US12569524
申请日：2009-09-29
CPC分类号： G06F9/505
摘要： A method and system is disclosed for dispatching tasks to multiple processors that all share a shared memory. A composite queue size for multiple work queues each having an associated processor is determined. A queue availability flag is stored in shared memory for each processor work queue and is set based upon the composite queue size and the size of the work queue for that processor. Each queue availability flag indicates availability or unavailability of the work queue to accept new tasks. A task is placed in a selected work queue based on that work queue having an associated queue availability flag indicating availability to accept new tasks. The data associated with task dispatching is maintained so as to increase the likelihood that valid copies of the data remain present in each processor's local cache without requiring updating do to their being changed by other processors.
摘要翻译： 公开了一种方法和系统，用于将任务分派给共享共享存储器的多个处理器。 确定每个具有关联处理器的多个工作队列的复合队列大小。 队列可用性标志存储在每个处理器工作队列的共享存储器中，并且基于该处理器的复合队列大小和工作队列的大小来设置。 每个队列可用性标志指示接收新任务的工作队列的可用性或不可用性。 基于具有指示可接受新任务的可用性的相关联的队列可用性标志的工作队列将任务放置在所选择的工作队列中。 维护与任务调度相关联的数据，以便增加数据的有效副本在每个处理器的本地高速缓存中保持的可能性，而不需要对其被其它处理器改变的更新。
-
2.发明授权Methods, systems, and computer program products for file version control management 失效用于文件版本控制管理的方法，系统和计算机程序产品公开(公告)号：US07886270B2
公开(公告)日：2011-02-08
申请号：US11563720
申请日：2006-11-28
CPC分类号： G06F8/71 , G06F9/54 , G06F17/3023 , Y10S707/99954
摘要： Methods, systems, and computer program products for file version control management are provided. Methods include receiving a loadset of at least one data file and activating the loadset. For each data file in the loadset, the data file is written to a target system and identified by a base name and a generation number. A symbolic link with an activation number is created in a version control file index (VCFX) to the data file written to the target system. An application view to the symbolic link is provided as the base name of the data file, and the application view to the symbolic link is limited based on an activation number of the application corresponding to the activation number of the symbolic link.
摘要翻译： 提供了文件版本控制管理的方法，系统和计算机程序产品。 方法包括接收至少一个数据文件的加载集并激活加载集。 对于加载集中的每个数据文件，将数据文件写入目标系统，并通过基本名称和生成号码进行标识。 在与目标系统写入的数据文件的版本控制文件索引（VCFX）中创建与激活号码的符号链接。 提供到符号链接的应用视图作为数据文件的基本名称，并且基于与符号链接的激活号相对应的应用的激活号码限制对符号链接的应用视图。
-
公开(公告)号：US07552305B2
公开(公告)日：2009-06-23
申请号：US11258302
申请日：2005-10-25
CPC分类号： G06F12/023 , G06F11/073 , G06F11/0751 , G06F12/145
摘要： Dynamically allocated memory is managed in real-time. This real-time management capability enables an invalid access of the dynamically allocated memory to be detected at the time the invalid access occurs, rather than at some later point in time. This real-time management capability can be dynamically activated/deactivated on a per process basis.
摘要翻译： 动态分配的内存被实时管理。 这种实时管理能力使得在无效访问发生时，而不是在稍后的时间点上动态分配的存储器被无效访问。 可以在每个进程的基础上动态激活/停用该实时管理功能。
-
公开(公告)号：US06748401B2
公开(公告)日：2004-06-08
申请号：US09974977
申请日：2001-10-11
IPC分类号： G06F700
CPC分类号： G06F17/30949 , Y10S707/99945 , Y10S707/99948
摘要： An exemplary embodiment of the present invention is a method for dynamically managing a hash pool data structure. A request to insert a new key value into a hash pool data structure that includes at least one index level is received. An insertion location is calculated for the new key value in response to the new key value and to existing key values in the hash pool data structure. The insertion location includes an index level. A new index level is added at the insertion location if the index level is not the maximum number of index levels in the hash pool data structure; if the insertion location contains a chain of existing key values with a length equal to the maximum chain length; and if the new index record locations of the new key value and the existing key values are dispersed. The insertion location is updated in response to adding a new index record and the new key value is inserted into the insertion location. An additional embodiment includes a system and storage medium for dynamically managing a hash pool data structure.
摘要翻译： 本发明的示例性实施例是用于动态管理散列池数据结构的方法。 接收到将包含至少一个索引级别的新密钥值插入散列池数据结构的请求。 针对新密钥值计算新密钥值的插入位置以及散列池数据结构中的现有密钥值。 插入位置包括索引级别。 如果索引级别不是哈希池数据结构中的索引级别的最大数目，则在插入位置添加新的索引级别; 如果插入位置包含长度等于最大链长度的现有密钥值链; 并且如果新键值的新索引记录位置和现有键值分散。 响应于添加新的索引记录而更新插入位置，并且将新的键值插入插入位置。 另外的实施例包括用于动态管理散列池数据结构的系统和存储介质。
-
5.发明授权Method, system and program products for selectively debugging program versions executing with in a computing environment 有权用于选择性地调试在计算环境中执行的程序版本的方法，系统和程序产品公开(公告)号：US06598180B1
公开(公告)日：2003-07-22
申请号：US09475887
申请日：1999-12-30
IPC分类号： G06F1504
CPC分类号： G06F11/3664
摘要： A program having a plurality of concurrently executing versions is debugged. A version of the program to be debugged is selected from the plurality of versions of the program, and that selected version is debugged. As one example, the selection is responsive to the receipt of at least one task of the computing environment that is associated with the version to be debugged. The debugging of the selected version does not affect other versions of the program, other programs executing within the computing environment or other tasks using that version.
摘要翻译： 调试具有多个并发执行版本的程序。 从程序的多个版本中选择要调试的程序的版本，并且调试所选择的版本。 作为一个示例，选择响应于与要调试的版本相关联的计算环境的至少一个任务的接收。 所选版本的调试不影响程序的其他版本，计算环境中执行的其他程序或使用该版本的其他任务。
-
公开(公告)号：US20120303908A1
公开(公告)日：2012-11-29
申请号：US13570847
申请日：2012-08-09
IPC分类号： G06F12/08
CPC分类号： G06F12/084 , G06F12/0842
摘要： Various embodiments of the present invention allow concurrent accesses to a cache. A request to update an object stored in a cache is received. A first data structure comprising a new value for the object is created in response to receiving the request. A cache pointer is atomically modified to point to the first data structure. A second data structure comprising an old value for the cached object is maintained until a process, which holds a pointer to the old value of the cached object, at least one of one of ends and indicates that the old value is no longer needed.
摘要翻译： 本发明的各种实施例允许对高速缓存的并发访问。 接收到更新存储在高速缓存中的对象的请求。 响应于接收到请求而创建包括对象的新值的第一数据结构。 缓存指针被原子地修改为指向第一个数据结构。 包括用于缓存对象的旧值的第二数据结构被维护，直到持有指向缓存对象的旧值的指针的过程中的至少一个结束，并且指示不再需要旧值。
-
公开(公告)号：US20120079213A1
公开(公告)日：2012-03-29
申请号：US13032361
申请日：2011-02-22
IPC分类号： G06F12/14
CPC分类号： G06F12/084 , G06F12/0842
摘要： Various embodiments of the present invention manage concurrent accesses to a resource in a parallel computing environment. A plurality of locks is assigned to manage concurrent access to a plurality of parts of a resource. A usage of at least one of the plurality of parts of the resource is monitored. The assignment of the plurality of locks to the plurality of parts of the resource is modified based on the usage that has been monitored.
摘要翻译： 本发明的各种实施例在并行计算环境中管理对资源的并发访问。 分配多个锁以管理对资源的多个部分的并发访问。 监视资源的多个部分中的至少一个的使用。 基于已经被监视的使用，修改多个锁到资源的多个部分的分配。
-
8.发明申请Method and System For Preserving Critical Storage Contents Across A System Restart 审中-公开保持系统重要存储内容的方法和系统重新启动公开(公告)号：US20080120480A1
公开(公告)日：2008-05-22
申请号：US11562452
申请日：2006-11-22
CPC分类号： G06F11/1441 , G06F12/1009
摘要： Disclosed are a method and system for a computer operating system to allocate “recoverable” memory for a table. The invention involves updating storage allocation APIs to specify a request for “recoverable” storage and for the operating system's saving of virtual and real storage address information about the “recoverable” storage allocation. On a subsequent system restart, when the recoverable storage allocation is again requested, the operating system will use the saved information to rebuild the required virtual address space mappings (virtual addresses to backing real storage) to reallocate the same virtual and real storage. The operating system must also track requests for memory, which is not deemed “recoverable”, and avoid allocating virtual and real storage addresses, which are being used for “recoverable” storage requests.
摘要翻译： 公开了一种用于为表分配“可恢复”存储器的计算机操作系统的方法和系统。 本发明涉及更新存储分配API以指定“可恢复”存储的请求，以及操作系统保存关于“可恢复”存储分配的虚拟和真实存储地址信息。 在随后的系统重新启动时，当再次请求可恢复的存储分配时，操作系统将使用保存的信息重建所需的虚拟地址空间映射（虚拟地址以支持实际存储），以重新分配相同的虚拟和真实存储。 操作系统还必须跟踪不被认为是“可恢复”的内存请求，并避免分配用于“可恢复”存储请求的虚拟和实际存储地址。
-
公开(公告)号：US07089564B2
公开(公告)日：2006-08-08
申请号：US09790853
申请日：2001-02-22
申请人： Shawfu Chen , Robert O. Dryfoos , Allan Feldman , David Y. Hu , Jason A. Keenaghan , Peter G. Sutton , Mei-Hui Wang
发明人： Shawfu Chen , Robert O. Dryfoos , Allan Feldman , David Y. Hu , Jason A. Keenaghan , Peter G. Sutton , Mei-Hui Wang
IPC分类号： G06F9/46
CPC分类号： G06F9/526
摘要： A highly available, high-performance memory queue. Locking of the queue is minimized in order to provide a highly available queue and to improve performance of the queue. Multiple updates of the queue can occur under a single lock. Further, messages of the queue are persistent. A time-initiated checkpointing process, as well as the storing of message information on a recovery log, ensures the persistence of the queue messages.
-
10.发明授权
公开(公告)号：US5423044A
公开(公告)日：1995-06-06
申请号：US899664
申请日：1992-06-16
CPC分类号： G06F9/52 , G06F13/36 , G11C29/88 , G06F2201/825
摘要： Apparatus and process for managing shared, distributed locks in a multiprocessing complex. The manager operates using a partitionable lock space with logical processor connection. Logically connected processors are subject to validation and disconnection due to failure. The locks synchronize data access to identifiable subunits of DASD. Denied lock requests are queued for servicing when the lock becomes available. Lock partitions are used to speed DASD to DASD copying without halting processing on the first DASD. A special partition is assigned to the copy task and the processors writing to the DASD can determine copy status with a single read or test. Operations requiring multilateral agreement of processors, such as rebuilding locks or moving locks, are protected by fencing any nonresponsive processor. A special queue partition is designated for master/slave control point designation. All processors contend for the master lock and losing contenders are queue. Queuing provides automatic fallback in case of a failing processor.
摘要翻译： 用于在多处理复合体中管理共享的分布式锁的装置和过程。 管理员使用具有逻辑处理器连接的可分区锁定空间。 由于故障，逻辑连接的处理器将进行验证和断开连接。 锁将数据访问同步到DASD的可识别子单元。 当锁可用时，被拒绝的锁请求排队等待进行维修。 锁定分区用于将DASD加速至DASD复制，而不停止第一个DASD处理。 分配给复制任务的特殊分区，写入DASD的处理器可以通过单次读取或测试来确定复制状态。 需要处理器多边协议的操作，例如重建锁或移动锁，都可以通过防护任何无响应的处理器进行保护。 指定主/从控制点指定的特殊队列分区。 所有处理器都会争取主锁，而失败的竞争者则是队列。 排队在出现故障的处理器的情况下提供自动回退。
-
-
-
-
-
-
-
-
-
搜索结果
33 条记录 (耗时 0.017 秒)
