专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

81. 发明申请

US20160004630A1 OPPORTUNISTIC ERROR INJECTION 审中-公开
标题翻译：机能错误注射
公开(公告)号：US20160004630A1
公开(公告)日：2016-01-07
申请号：US14321358
申请日：2014-07-01
申请人： International Business Machines Corporation
发明人： Joel L. Masser , David C. Reed , Max D. Smith
IPC分类号： G06F11/36
CPC分类号： G06F11/3672
摘要： A method for testing a software product is disclosed. In one embodiment, such a method enables a user to specify a type of standard interface between software components, as well as enable a user to specify a type of error to inject into a software product in response to interaction between the software components through the interface. Once these parameters are established, the method monitors, at runtime, execution of the software components for interaction through the interface. In response to detecting such interaction, the method injects the specified error into the software product. The claimed method has the ability to perform such error injection without needing to modify the software components. In certain embodiments, the method enables a user to specify the type of standard interface and/or error to inject at runtime of the software product. A corresponding system and computer program product are also disclosed.
摘要翻译：公开了一种用于测试软件产品的方法。在一个实施例中，这种方法使得用户能够指定软件组件之间的标准接口的类型，并且使用户能够响应于通过接口的软件组件之间的交互来指定要注入到软件产品中的错误类型。一旦建立了这些参数，该方法将在运行时监视软件组件的执行，以便通过接口进行交互。响应于检测到这种交互，该方法将指定的错误注入到软件产品中。所要求的方法具有执行这种错误注入的能力，而不需要修改软件组件。在某些实施例中，该方法使得用户能够指定在软件产品的运行时注入的标准接口和/或错误的类型。还公开了相应的系统和计算机程序产品。

82. 发明申请

US20150288778A1 ASSIGNING SHARED CATALOGS TO CACHE STRUCTURES IN A CLUSTER COMPUTING SYSTEM 有权
标题翻译：将共享目录标记为集群计算系统中的缓存结构
公开(公告)号：US20150288778A1
公开(公告)日：2015-10-08
申请号：US14747117
申请日：2015-06-23
申请人： International Business Machines Corporation
发明人： Eric J. Harris , Franklin E. McCune , David C. Reed , Max D. Smith
IPC分类号： H04L29/08 , H04L29/06 , H04L12/24
CPC分类号： H04L67/2842 , G06F9/00 , G06F9/544 , G06F17/30 , H04L41/0893 , H04L65/4015 , H04L67/10
摘要： An apparatus, system, and method for assigning a cache structure to a catalog. The apparatus includes an identification module configured to identify a catalog for sharing in association with a coupling facility. The coupling facility includes a plurality of cache structures for catalogs of a cluster computing system. The coupling facility is configured to facilitate data sharing among a plurality of host systems of the cluster computing system. The apparatus includes a selection module configured to select a cache structure of the plurality of cache structures for the catalog based on one or more usage status indicators according to an assignment policy. The apparatus includes a storage module configured to store catalog information of the catalog in the cache structure in response to the selection module selecting the cache structure.
摘要翻译：一种用于将高速缓存结构分配给目录的装置，系统和方法。该装置包括识别模块，该识别模块被配置为识别与耦合设备相关联的目录。耦合设备包括用于集群计算系统的目录的多个高速缓存结构。耦合设施被配置为便于群集计算系统的多个主机系统之间的数据共享。该装置包括：选择模块，被配置为根据分配策略，基于一个或多个使用状态指示符来选择目录的多个高速缓存结构的高速缓存结构。该装置包括：存储模块，被配置为响应于选择模块选择高速缓存结构，将目录的目录信息存储在高速缓存结构中。

83. 发明申请

US20150193345A1 PDSE Dynamic Directory Optimization For Caching 有权
标题翻译： PDSE动态目录优化用于缓存
公开(公告)号：US20150193345A1
公开(公告)日：2015-07-09
申请号：US14151261
申请日：2014-01-09
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Dustin A. Helak , David C. Reed , Thomas C. Reed , Max D. Smith
IPC分类号： G06F12/08 , G06F12/10
CPC分类号： G06F12/0824 , G06F11/00 , G06F11/1435 , G06F12/0848 , G06F12/0864 , G06F12/1018 , G06F17/30097 , G06F17/30132 , G06F2212/282 , G06F2212/284 , G06F2212/622
摘要： A method, system and computer-usable medium are disclosed for optimizing a Partitioned Data Set Extended (PDSE) directory. In various embodiments, b-tree directory structure entries associated with members of the PDSE are reordered to place members with the highest access counts within the same leaf nodes. This allows these members to share a directory path, which in turn increases the chance that the most frequently accessed member's directory path is in cache while minimizing storage footprint.
摘要翻译：公开了一种用于优化分区数据集扩展（PDSE）目录的方法，系统和计算机可用介质。在各种实施例中，与PDSE的成员相关联的b树目录结构条目被重新排序以将具有最高访问次数的成员放置在同一叶节点内。这允许这些成员共享目录路径，这又增加了最频繁访问的成员的目录路径在缓存中的机会，同时最小化存储空间。

84. 发明申请

US20150186070A1 MIGRATING HIGH ACTIVITY VOLUMES IN A MIRROR COPY RELATIONSHIP TO LOWER ACTIVITY VOLUME GROUPS 有权
标题翻译：在镜子中迁移高活性体积与下降活动量组的关系
公开(公告)号：US20150186070A1
公开(公告)日：2015-07-02
申请号：US14146653
申请日：2014-01-02
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Dash D. Miller , David C. Reed , Max D. Smith , Herbert Yee
IPC分类号： G06F3/06
CPC分类号： G06F11/2074 , G06F3/065 , G06F11/2058 , G06F11/2069
摘要： Provided are a computer program product, system, and method for migrating high activity volumes in a mirror copy relationship to lower activity volume groups. A determination is made of usage rates of multiple volume groups, wherein each volume group is comprised of source volumes at a primary site whose data is copied to volumes at a secondary site. A first selected volume group and a second selected volume group are selected based on the determined usage rates of the volume groups. A first volume in the first selected volume group is migrated to a second volume in the second selected volume group. Updates to the first volume, received while migrating the first volume to the second volume, are copied to a mirror first volume mirroring the first volume at the secondary site.
摘要翻译：提供了一种用于将镜像副本关系中的高活动卷迁移到较低活动卷组的计算机程序产品，系统和方法。确定多个卷组的使用率，其中每个卷组由其数据被复制到次要站点的卷的主站点的源卷组成。基于所确定的卷组的使用率来选择第一所选卷组和第二选定卷组。第一个选定卷组中的第一个卷将迁移到第二个所选卷组中的第二个卷。将第一个卷迁移到第二个卷时收到的第一个卷的更新将复制到镜像第一个卷，镜像辅助站点上的第一个卷。

85. 发明申请

US20150134925A1 GRANTING AND REVOKING SUPPLEMENTAL MEMORY ALLOCATION REQUESTS 有权
标题翻译：授予和撤销补充存储器分配请求
公开(公告)号：US20150134925A1
公开(公告)日：2015-05-14
申请号：US14559811
申请日：2014-12-03
申请人： International Business Machines Corporation
发明人： Derek L. Erdmann , David C. Reed , Thomas C. Reed , Max D. Smith
IPC分类号： G06F12/02 , G06F12/14
CPC分类号： G06F12/023 , G06F9/5016 , G06F12/0284 , G06F12/14 , G06F2212/1044 , G06F2212/1052
摘要： Provided are a computer program product, system, and method for granting and revoking supplemental memory allocation requests. Supplemental memory allocations of memory resources are granted to applications following initial memory allocations of the memory resources to the applications. In response to determining that available memory resources have fallen below an availability threshold, determining a weighting factor for each supplemental memory allocation based on at least one of an amount of the memory resources allocated to the supplemental memory allocation and a measured duration during which the memory resources have been allocated. At least one of the supplemental memory allocations is selected to revoke based on the determined weighting factors of the supplemental memory allocations.
摘要翻译：提供了用于授予和撤销补充存储器分配请求的计算机程序产品，系统和方法。在对应用程序的内存资源的初始内存分配之后，向应用程序授予对内存资源的补充内存分配。响应于确定可用存储器资源已经低于可用性阈值，基于分配给补充存储器分配的存储器资源的量和测量的持续时间中的至少一个来确定每个补充存储器分配的加权因子，资源已分配。选择补充存储器分配中的至少一个，以基于所确定的补充存储器分配的加权因子来撤销。

86. 发明申请

US20150081997A1 USING AN ALIAS VOLUME NAME FOR A VOLUME TO ALLOCATE SPACE TO A DATA SET 有权
标题翻译：使用一个大小的名称来将空间分配给数据集
公开(公告)号：US20150081997A1
公开(公告)日：2015-03-19
申请号：US14550674
申请日：2014-11-21
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Herman Aranguren , Franklin E. McCune , David C. Reed , Max D. Smith
IPC分类号： G06F12/02
CPC分类号： G06F12/023 , G06F3/0605 , G06F3/0608 , G06F3/0631 , G06F3/0683 , G06F3/0689
摘要： Provided are a computer program product, system, and method for using an alias volume name for a volume to allocate space to a data set. An assignment of a plurality of volumes to a data set is maintained, wherein the volumes are configured in a storage system. A request is received to extend the data set. An alias volume name is assigned to the data set for a previously assigned volume to the data to extend the data set in response to one of the previously assigned volumes having available space to extend the data set. A base volume name is assigned to the data set for a volume not assigned to the data set in response to one of the previously assigned volumes to the data set not having available space to extend the data set.
摘要翻译：提供了一种用于使用卷的别名卷名称将空间分配给数据集的计算机程序产品，系统和方法。维持将多个卷分配给数据集，其中，卷被配置在存储系统中。收到请求以扩展数据集。将别名卷名称分配给先前分配给数据的卷的数据集，以响应于之前分配的一个卷之一来扩展数据集，以扩展数据集。基本卷名称被分配给未分配给数据集的卷的数据集，以响应于之前分配的一个卷到没有可用空间的数据集来扩展数据集。

87. 发明申请

US20150039575A1 MANAGING MULTIPLE LOCKS FOR DATA SET MEMBERS IN A DATA SET INDEX 有权
标题翻译：在数据集索引中管理数据集成员的多个锁
公开(公告)号：US20150039575A1
公开(公告)日：2015-02-05
申请号：US13959658
申请日：2013-08-05
申请人： International Business Machines Corporation
发明人： Dustin A. Helak , David C. Reed , Thomas C. Reed , Max D. Smith
IPC分类号： G06F17/30
CPC分类号： G06F17/30371 , G06F17/30289 , G06F17/30362
摘要： Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.
摘要翻译：提供了一种用于管理数据集索引中的数据集成员的多个锁的计算机程序产品，系统和方法。数据集索引具有叶节点和内部节点。响应于确定当前锁定被设置在阻止对所请求的锁定的授权的锁定节点处，确定在树数据的相同级别是否存在来自锁定节点的不同的第一和第二后代节点结构分别链接到所请求的数据集成员和锁定的数据集成员。如果是，请求的数据集成员的锁定被设置在第一个后代节点，当前的锁移动到被锁定的数据集成员的第二个后代节点，并且所请求的锁被授予。

88. 发明申请

US20150026422A1 MANAGING DATA SETS OF A STORAGE SYSTEM 有权
标题翻译：管理存储系统的数据集
公开(公告)号：US20150026422A1
公开(公告)日：2015-01-22
申请号：US13943875
申请日：2013-07-17
申请人： International Business Machines Corporation
发明人： Kyle B. Dudgeon , David C. Reed , Esteban Rios , Max D. Smith
IPC分类号： G06F3/06
CPC分类号： G06F3/0619 , G06F3/0646 , G06F3/0647 , G06F3/065 , G06F3/067 , G06F11/1443 , G06F11/2005 , G06F11/2007 , G06F11/201 , G06F11/203 , G06F11/2056 , G06F11/2058 , G06F12/02
摘要： A method of and system for managing data sets of a storage facility is disclosed. The method and system may include copying a first data set of a first unit of storage space. A second data set in a second unit of storage space may be created from copying the first data set. The method and system may include copying the second data set of the second unit of storage space. A third data set in a third unit of storage space may be created from copying the second data set. The second data set may be verified. Verification may be performed by comparing the third data set with the first data set. It may be determined whether the third data set matches the first data set. The first and third data sets may be deleted in response to the third data set matching the first data set.
摘要翻译：公开了一种用于管理存储设备的数据集的方法和系统。该方法和系统可以包括复制第一单元存储空间的第一数据集。可以通过复制第一数据集来创建第二存储空间单元中的第二数据集。该方法和系统可以包括复制第二存储空间单元的第二数据集。可以通过复制第二数据集来创建第三存储空间单元中的第三数据集。可以验证第二数据集。可以通过将第三数据集与第一数据集进行比较来执行验证。可以确定第三数据集是否与第一数据集匹配。响应于与第一数据集匹配的第三数据集可以删除第一和第三数据集。

89. 发明申请

US20150026137A1 RECOVERING FROM A PENDING UNCOMPLETED REORGANIZATION OF A DATA SET 有权
标题翻译：从数据集的未完成的重组恢复
公开(公告)号：US20150026137A1
公开(公告)日：2015-01-22
申请号：US13944804
申请日：2013-07-17
申请人： International Business Machines Corporation
发明人： Philip R. Chauvet , Charles J. House , David C. Reed , Max D. Smith
IPC分类号： G06F17/30
CPC分类号： G06F17/30171 , G06F3/061 , G06F3/0619 , G06F3/0643 , G06F3/065 , G06F3/0683 , G06F3/0689 , G06F17/30303 , G06F17/30345
摘要： Provided are a computer program product, system, and method for recovering from a pending uncompleted reorganization of a data set managing data sets in a storage. In response an initiation of an operation to access a data set, an operation is initiated to complete a pending uncompleted reorganization of the data set in response to the data set being in a pending uncompleted reorganization state and no other process currently accessing the data set.
摘要翻译：提供了一种用于从管理存储器中的数据集的数据集的待决未完成重组中恢复的计算机程序产品，系统和方法。响应于开始访问数据集的操作，响应于数据集处于未完成的重组状态并且没有当前访问数据集的其他进程，启动操作以完成数据集的待决未完成重组。

90. 发明申请

US20140304483A1 VOLUME EXTENT ALLOCATION 有权
标题翻译：大量分配
公开(公告)号：US20140304483A1
公开(公告)日：2014-10-09
申请号：US13857456
申请日：2013-04-05
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Kyle B. Dudgeon , David C. Reed , Esteban Rios , Max D. Smith
IPC分类号： G06F12/02
CPC分类号： G06F3/0607 , G06F3/06 , G06F3/0608 , G06F3/0631 , G06F3/0644 , G06F3/0653 , G06F3/067 , G06F3/0683 , G06F3/0689
摘要： A method of and system for processing an extend request for a data set in a storage facility is disclosed. The method and system may include receiving the extend request. The extend request may include a new extent allocation amount for the data set. The data set may be associated with a number of volumes in the storage facility. The method and system may include apportioning the new extent allocation amount among fractional amounts. The method and system may include allocating the fractional amounts.
摘要翻译：公开了一种用于处理存储设施中的数据集的扩展请求的方法和系统。该方法和系统可以包括接收扩展请求。扩展请求可以包括用于数据集的新的扩展分配量。数据集可以与存储设施中的多个卷相关联。方法和系统可以包括以分数量分配新的范围分配量。该方法和系统可以包括分配数量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式