会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and system for dynamically managing hash pool data structures
    • 动态管理哈希池数据结构的方法和系统
    • US06748401B2
    • 2004-06-08
    • US09974977
    • 2001-10-11
    • Robert A. BlackburnRobert O. DryfoosGary A. Fisher, Sr.Glenn W. Sears, Jr.
    • Robert A. BlackburnRobert O. DryfoosGary A. Fisher, Sr.Glenn W. Sears, Jr.
    • G06F700
    • G06F17/30949Y10S707/99945Y10S707/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.
    • 本发明的示例性实施例是用于动态管理散列池数据结构的方法。 接收到将包含至少一个索引级别的新密钥值插入散列池数据结构的请求。 针对新密钥值计算新密钥值的插入位置以及散列池数据结构中的现有密钥值。 插入位置包括索引级别。 如果索引级别不是哈希池数据结构中的索引级别的最大数目,则在插入位置添加新的索引级别; 如果插入位置包含长度等于最大链长度的现有密钥值链; 并且如果新键值的新索引记录位置和现有键值分散。 响应于添加新的索引记录而更新插入位置,并且将新的键值插入插入位置。 另外的实施例包括用于动态管理散列池数据结构的系统和存储介质。
    • 3. 发明授权
    • Shared, distributed lock manager for loosely coupled processing systems
    • 用于松散耦合处理系统的共享分布式锁管理器
    • US5423044A
    • 1995-06-06
    • US899664
    • 1992-06-16
    • Peter G. SuttonIan J. KupferGlenn W. Sears, Jr.Theodore GoetzRobert O. Dryfoos
    • Peter G. SuttonIan J. KupferGlenn W. Sears, Jr.Theodore GoetzRobert O. Dryfoos
    • G06F12/00G06F9/46G06F13/36G11C29/00G06F13/16G06F12/16G06F13/364
    • G06F9/52G06F13/36G11C29/88G06F2201/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的处理器可以通过单次读取或测试来确定复制状态。 需要处理器多边协议的操作,例如重建锁或移动锁,都可以通过防护任何无响应的处理器进行保护。 指定主/从控制点指定的特殊队列分区。 所有处理器都会争取主锁,而失败的竞争者则是队列。 排队在出现故障的处理器的情况下提供自动回退。