知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

69 records (took 0.043 seconds)

    ASSIGNING SHARED CATALOGS TO CACHE STRUCTURES IN A CLUSTER COMPUTING SYSTEM
    31.
    发明申请
    ASSIGNING SHARED CATALOGS TO CACHE STRUCTURES IN A CLUSTER COMPUTING SYSTEM 有权
    将共享目录标记为集群计算系统中的缓存结构

    公开(公告)号：US20150288778A1

    公开(公告)日：2015-10-08

    申请号：US14747117

    申请日：2015-06-23

    Applicant: International Business Machines Corporation

    Inventor： Eric J. Harris ,  Franklin E. McCune ,  David C. Reed ,  Max D. Smith

    IPC: H04L29/08 ,  H04L29/06 ,  H04L12/24

    CPC classification number: H04L67/2842 ,  G06F9/00 ,  G06F9/544 ,  G06F17/30 ,  H04L41/0893 ,  H04L65/4015 ,  H04L67/10

    Abstract: 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.

    Abstract translation: 一种用于将高速缓存结构分配给目录的装置，系统和方法。 该装置包括识别模块，该识别模块被配置为识别与耦合设备相关联的目录。 耦合设备包括用于集群计算系统的目录的多个高速缓存结构。 耦合设施被配置为便于群集计算系统的多个主机系统之间的数据共享。 该装置包括：选择模块，被配置为根据分配策略，基于一个或多个使用状态指示符来选择目录的多个高速缓存结构的高速缓存结构。 该装置包括：存储模块，被配置为响应于选择模块选择高速缓存结构，将目录的目录信息存储在高速缓存结构中。

    USING AN ALIAS VOLUME NAME FOR A VOLUME TO ALLOCATE SPACE TO A DATA SET
    32.
    发明申请
    USING AN ALIAS VOLUME NAME FOR A VOLUME TO ALLOCATE SPACE TO A DATA SET 有权
    使用一个大小的名称来将空间分配给数据集

    公开(公告)号：US20150081997A1

    公开(公告)日：2015-03-19

    申请号：US14550674

    申请日：2014-11-21

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Herman Aranguren ,  Franklin E. McCune ,  David C. Reed ,  Max D. Smith

    IPC: G06F12/02

    CPC classification number: G06F12/023 ,  G06F3/0605 ,  G06F3/0608 ,  G06F3/0631 ,  G06F3/0683 ,  G06F3/0689

    Abstract: 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.

    Abstract translation: 提供了一种用于使用卷的别名卷名称将空间分配给数据集的计算机程序产品，系统和方法。 维持将多个卷分配给数据集，其中，卷被配置在存储系统中。 收到请求以扩展数据集。 将别名卷名称分配给先前分配给数据的卷的数据集，以响应于之前分配的一个卷之一来扩展数据集，以扩展数据集。 基本卷名称被分配给未分配给数据集的卷的数据集，以响应于之前分配的一个卷到没有可用空间的数据集来扩展数据集。

    AVOIDING RECALL OPERATIONS IN A TIERED DATA STORAGE SYSTEM
    34.
    发明申请
    AVOIDING RECALL OPERATIONS IN A TIERED DATA STORAGE SYSTEM 有权
    避免数据存储系统中的回调操作

    公开(公告)号：US20140068185A1

    公开(公告)日：2014-03-06

    申请号：US14074621

    申请日：2013-11-07

    Applicant: International Business Machines Corporation

    Inventor： Douglas L. Lehr ,  Franklin E. McCune ,  David C. Reed ,  Max D. Smith

    IPC: G06F12/08

    CPC classification number: G06F12/08 ,  G06F3/061 ,  G06F3/0649 ,  G06F3/067 ,  G06F3/0685 ,  G06F17/30221

    Abstract: According to one embodiment, a system for recalling a data set, includes logic integrated with and/or executable by a hardware processor, the logic being configured to receive a request to open a data set, determine whether the requested data set is stored to a lower tier of a tiered data storage system in multiple associated portions or to a higher tier of the tiered data storage system, move each associated portion of the requested data set from the lower tier to the higher tier of the tiered data storage system when at least one portion of the requested data set is stored to the lower tier of the tiered data storage system, and assemble the associated portions of the requested data set into a single data set to form the requested data set on the higher tier of the tiered data storage system.

    Abstract translation: 根据一个实施例，一种用于调用数据集的系统包括与硬件处理器集成和/或可执行的逻辑，所述逻辑被配置为接收打开数据集的请求，确定所请求的数据集是否被存储到 在分层数据存储系统的多个关联部分或较高层中的分层数据存储系统的较低层，当至少在分层数据存储系统的较低层到较高层时将请求的数据集的每个相关部分移动到分层数据存储系统的较高层 所请求的数据集的一部分被存储到分层数据存储系统的较低层，并且将所请求的数据集的相关部分组合成单个数据集，以便在分层数据存储器的较高层上形成所请求的数据集 系统。

    Dynamic switching of catalog sharing protocols
    35.
    发明授权
    Dynamic switching of catalog sharing protocols 有权

    公开(公告)号：US11841830B2

    公开(公告)日：2023-12-12

    申请号：US14929356

    申请日：2015-11-01

    Applicant: International Business Machines Corporation

    Inventor： Neal E. Bohling ,  Franklin E. McCune ,  David C Reed ,  Max D. Smith

    IPC: G06F16/176 ,  G06F16/188

    CPC classification number: G06F16/176 ,  G06F16/188

    Abstract: A method to dynamically switch between catalog sharing protocols includes monitoring, over a period of time, access to a catalog used to index data sets. Using information gathered during this monitoring period, the method divides the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide the best performance during the respective interval. The method schedules the sharing protocols to operate during their respective intervals going forward, and switches between the sharing protocols in accordance with the schedule. In certain embodiments, switching between the sharing protocols includes temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. When using this hybrid mode, the switch may occur when one sharing protocol begins to perform better than the other. A corresponding system and computer program product are also disclosed.

    Data set management
    38.
    发明授权
    Data set management 有权

    公开(公告)号：US10101948B2

    公开(公告)日：2018-10-16

    申请号：US15628607

    申请日：2017-06-20

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Derek L. Erdmann ,  Franklin E. McCune ,  Miguel A. Perez

    IPC: G06F3/06

    Abstract: Provided are a computer program product, system, and method for an application to provide for, in one embodiment, using hierarchical storage management to respond to a request to delete a data set by migrating the data set to another storage tier in a storage system before deleting the data set from its current location. As a result, the data set is stored on another tier to provide an opportunity to reverse the decision to delete the data set. In one embodiment, a temporary interval of time is provided to reverse the deletion decision and restore the data set from the migrated data set, before the data set is permanently deleted.

    CONTROL BLOCK VALIDATOR
    39.
    发明申请
    CONTROL BLOCK VALIDATOR 审中-公开

    公开(公告)号：US20180067791A1

    公开(公告)日：2018-03-08

    申请号：US15257347

    申请日：2016-09-06

    Applicant: International Business Machines Corporation

    Inventor： Philip R. Chauvet ,  Franklin E. McCune ,  David C. Reed ,  Esteban Rios

    IPC: G06F11/07 ,  G06F3/06

    CPC classification number: G06F11/079 ,  G06F3/0619 ,  G06F3/0653 ,  G06F3/0683 ,  G06F11/0727 ,  G06F11/0751 ,  G06F11/0772

    Abstract: A method for validating control blocks in memory includes monitoring for operations configured to obtain storage space in memory. The method examines the storage space that has been obtained to identify control blocks stored in the storage space. These control blocks are then analyzed to determine whether the control blocks are valid. In certain embodiments, this may be accomplished by comparing the content of the control blocks to information in a validation table that indicates possible values and ranges of values for fields in the control blocks. If a control block is valid, the method records a date and time when the control block was validated. If a control block is not valid, the method generates a message indicating that the control block is not valid. A corresponding system and computer program product are also disclosed.

Patent Agency Ranking