中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

21 records (took 0.034 seconds)

    USING PRIORITY TO DETERMINE WHETHER TO QUEUE AN INPUT/OUTPUT (I/O) REQUEST DIRECTED TO STORAGE
    12.
    发明申请
    USING PRIORITY TO DETERMINE WHETHER TO QUEUE AN INPUT/OUTPUT (I/O) REQUEST DIRECTED TO STORAGE 审中-公开
    使用优先权来决定是否根据存储排队输入/输出（I / O）请求

    公开(公告)号：WO2009121797A1

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

    申请号：PCT/EP2009/053611

    申请日：2009-03-26

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION ,  IBM UNITED KINGDOM LIMITED ,  KALOS, Matthew, Joseph ,  MCNUTT, Bruce

    Inventor： KALOS, Matthew, Joseph ,  MCNUTT, Bruce

    IPC: G06F3/06 ,  G06F13/16

    CPC classification number: G06F3/0659 ,  G06F3/061 ,  G06F3/0656 ,  G06F3/067 ,  G06F3/0671

    Abstract: Provided are a method, system, article of manufacture, and a computer program for using priority to determine whether to queue an Input/Output (I/O) request directed to storage. A maximum number of concurrent requests directed to a storage is measured. The measured maximum number of concurrent requests is used to determine a threshold for a specified priority. Subsequent requests of the specified priority directed to the storage are allowed to proceed in response to determining that a current number of concurrent requests for the specified priority does not exceed the determined threshold for the specified priority. Subsequent requests directed to the storage having a priority greater than the specified priority are allowed to proceed. Subsequent requests directed to the storage having the specified priority are queued in a queue in response to determining that the current number of concurrent requests for the specified priority exceeds the overall threshold.

    Abstract translation: 提供了一种方法，系统，制品和计算机程序，用于使用优先级来确定是否对指向存储的输入/输出（I / O）请求进行排队。 测量针对存储的并发请求的最大数量。 测量的最大并发请求数用于确定指定优先级的阈值。 响应于确定当前指定优先级的并发请求数量不超过所确定的优先级的阈值，允许针对存储器的指定优先级的后续请求进行。 允许针对具有大于指定优先级的优先级的存储的后续请求继续进行。 响应于确定当前指定优先级的并发请求数超过总阈值，针对具有指定优先级的存储器的后续请求被排队在队列中。

    USAGE OF PERSISTENT INFORMATION UNIT PACING PROTOCOL IN FIBRE CHANNEL COMMUNICATIONS
    13.
    发明申请
    USAGE OF PERSISTENT INFORMATION UNIT PACING PROTOCOL IN FIBRE CHANNEL COMMUNICATIONS 审中-公开
    持续信息单元启动协议在光纤通道通信中的应用

    公开(公告)号：WO2009069907A3

    公开(公告)日：2009-07-16

    申请号：PCT/KR2008006709

    申请日：2008-11-14

    Applicant: IBM ,  IBM KOREA INC ,  HATHORN ROGER GREGORY ,  HOLLEY BRET WAYNE ,  KALOS MATTHEW JOSEPH

    Inventor： HATHORN ROGER GREGORY ,  HOLLEY BRET WAYNE ,  KALOS MATTHEW JOSEPH

    IPC: H04L12/28

    CPC classification number: G06F13/387

    Abstract: Provided are a method, system, and article of manufacture, wherein a primary storage control unit receives an information unit from a remote host over a fibre channel connection, wherein persistent information unit pacing is implemented over the fibre channel connection. Information is maintained on how many large writes have been received at the primary storage control unit over at least one logical path established over the fibre channel connection between the primary storage control unit and the remote host, wherein a large write is an input/output (I/O) operation for which a number of data information units that are processed exceeds a default value of an information unit pacing credit. The primary storage control unit adjusts an information unit pacing parameter included in a response sent from the primary storage control unit to the remote host, wherein the adjusting is based at least on the information maintained on how many large writes have been received at the primary storage control unit over the at least one logical path.

    Abstract translation: 提供了一种方法，系统和制品，其中主存储控制单元通过光纤信道连接从远程主机接收信息单元，其中持久信息单元调度在光纤信道连接上实现。 通过在主存储控制单元和远程主机之间的光纤信道连接上建立的至少一个逻辑路径，在主存储控制单元处已经接收到多少大写的信息被保持，其中大写是输入/输出（ I / O）操作，其中被处理的多个数据信息单元超过信息单元调整信用的默认值。 主存储控制单元调整包括在从主存储控制单元发送到远程主机的响应中的信息单元调步参数，其中调整至少基于关于在主存储器已经接收了多少大写的信息 控制单元在至少一个逻辑路径上。

    DETERMINING WHETHER TO USE A REPOSITORY TO STORE DATA UPDATED DURING A RESYNCHRONIZATION
    14.
    发明申请
    DETERMINING WHETHER TO USE A REPOSITORY TO STORE DATA UPDATED DURING A RESYNCHRONIZATION 审中-公开
    决定是否使用存储在更新过程中更新的数据的记录

    公开(公告)号：WO2009071575A1

    公开(公告)日：2009-06-11

    申请号：PCT/EP2008/066697

    申请日：2008-12-03

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION ,  IBM UNITED KINGDOM LIMITED ,  BENHASE, Michael, Thomas ,  FIENBLIT, Shachar ,  KALOS, Matthew, Joseph ,  SPEAR, Gail, Andrea ,  WILLIAMS, Sonny, Earl

    Inventor： BENHASE, Michael, Thomas ,  FIENBLIT, Shachar ,  KALOS, Matthew, Joseph ,  SPEAR, Gail, Andrea ,  WILLIAMS, Sonny, Earl

    IPC: G06F11/20

    CPC classification number: G06F11/2064 ,  G06F11/2082

    Abstract: Provided are a method, system, and a computer program product for determining whether to use a repository to store data updated during a resynchronization. Writes to a primary storage are transferred to a secondary storage. A logical copy of the secondary storage as of a point-in-time is established. Writes to the secondary storage in the logical copy received from the primary storage during a logical copy duration after the point-in-time are stored in a repository that comprises less storage space than the secondary storage in the logical copy. The transferring of writes to the secondary storage is suspended. During the suspension writes to the primary storage are indicated in an out-of-synch data structure. A determination is made as to whether available storage space in the repository is sufficient to store writes transferred from the secondary storage while transferring the writes from the out-of-synch data structure in response to ending the suspension of the transferring of writes from the primary to the secondary storages. The repository is used to store data in the secondary storage as of the point-in-time that is to be updated by writes transferred from the primary storage following the ending of the suspension in response to determining that the available storage space in the repository is sufficient to store writes transferred from the secondary storage while transferring the writes indicated in the out-of-synch data structure.

    Abstract translation: 提供了一种用于确定是否使用存储库来存储在重新同步期间更新的数据的方法，系统和计算机程序产品。 对主存储的写入将传输到辅助存储。 建立了作为时间点的辅助存储的逻辑副本。 在时间点之后的逻辑复制持续时间内，从主存储器接收到的逻辑副本中的辅助存储器的写入被存储在包含比逻辑副本中的辅助存储器少的存储空间的存储库中。 写入次要存储的传输将被暂停。 在暂停对主存储器的写入期间以不同步的数据结构指示。 确定存储库中的可用存储空间是否足以存储从辅助存储器传送的写入，同时响应于结束暂停从主要存储器的写入而从同步数据结构转移写入 到二级仓库。 存储库用于将数据存储在辅助存储器中，以便在停止结束之后从主存储器传送的写入被更新，以响应于确定存储库中的可用存储空间是 足以存储从副存储传送的写入，同时传送在同步数据结构中指示的写入。

    APPARATUS FOR CONCURRENT RAID ARRAY RELOCATION
    15.
    发明申请
    APPARATUS FOR CONCURRENT RAID ARRAY RELOCATION 审中-公开
    相关RAID阵列转移的设备

    公开(公告)号：WO2007096230A3

    公开(公告)日：2008-03-27

    申请号：PCT/EP2007050886

    申请日：2007-01-30

    Applicant: IBM ,  IBM UK ,  KALOS MATTHEW JOSEPH ,  KUBO ROBERT AKIRA ,  RIPBERGER RICHARD ANTHONY ,  SONG CHENG-CHUNG

    Inventor： KALOS MATTHEW JOSEPH ,  KUBO ROBERT AKIRA ,  RIPBERGER RICHARD ANTHONY ,  SONG CHENG-CHUNG

    IPC: G06F11/20

    CPC classification number: G06F11/2069 ,  G06F11/2082 ,  G06F11/2094

    Abstract: An apparatus, system, and method are disclosed for concurrently relocating a RAID array. The apparatus includes an identification module, a designation module, and an implementation module. The identification module identifies an availability of a physical device within a donor arrayed storage device to offload a source drive of a relocation enclosure. The designation module designates an available physical device as a target drive and thereby designate the target drive and the source drive as a linked pair. The implementation module implements a mirroring relationship between the target drive and the source drive. The apparatus, system, and method provide a dynamic relocation of the raid array, minimizing system downtime and maximizing efficient utilization of system resources.

    Abstract translation: 公开了用于同时重新定位RAID阵列的装置，系统和方法。 该装置包括识别模块，指定模块和实现模块。 识别模块识别供体排列的存储设备内的物理设备的可用性，以卸载重定位机箱的源驱动器。 指定模块将可用的物理设备指定为目标驱动器，从而将目标驱动器和源驱动器指定为链接对。 实现模块实现目标驱动器和源驱动器之间的镜像关系。 设备，系统和方法提供了RAID阵列的动态重定位，最大限度地减少系统停机时间并最大限度地提高系统资源的有效利用率。

    APPARATUS, SYSTEM, AND METHOD FOR COMMUNICATING A BINARY CODE IMAGE
    16.
    发明申请
    APPARATUS, SYSTEM, AND METHOD FOR COMMUNICATING A BINARY CODE IMAGE 审中-公开
    用于通信二进制代码图像的装置，系统和方法

    公开(公告)号：WO2005055054A1

    公开(公告)日：2005-06-16

    申请号：PCT/EP2004/052625

    申请日：2004-10-22

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION ,  IBM UNITED KINGDOM LIMITED ,  CORCORAN, Brian, Jeffrey ,  GEE, Lourdes, Magally ,  KALOS, Matthew, Joseph ,  PADILLA, Ricardo, Sedillos

    Inventor： CORCORAN, Brian, Jeffrey ,  GEE, Lourdes, Magally ,  KALOS, Matthew, Joseph ,  PADILLA, Ricardo, Sedillos

    IPC: G06F9/445

    CPC classification number: G06F9/4401 ,  Y10S707/99942

    Abstract: An apparatus, system, and method are disclosed for communicating binary data using a self-descriptive binary data structure. The binary data structure also may be referred to as a microcode reconstruct and boot (MRB) image. The binary data structure includes a plurality of data segments, a target data set, and a data structure descriptor. Each of the data segments has a data segment header and data field. The target data set is stored within the data field and may be an executable. The data structure descriptor is descriptive of the binary data structure and identifies the location of the target data set within the data field. The binary data structure is self-descriptive in that the location of an individual target data set may be identified by the data structure descriptor.

    Abstract translation: 公开了一种使用自描述二进制数据结构传送二进制数据的装置，系统和方法。 二进制数据结构也可以被称为微代码重建和引导（MRB）图像。 二进制数据结构包括多个数据段，目标数据集和数据结构描述符。 每个数据段具有数据段头和数据字段。 目标数据集存储在数据字段内，并且可以是可执行的。 数据结构描述符描述二进制数据结构，并识别数据字段中目标数据集的位置。 二进制数据结构是自描述的，因为单个目标数据集的位置可以由数据结构描述符来识别。

    METHOD OF DETERMINING WHETHER TO USE A FULL VOLUME OR REPOSITORY FOR A LOGICAL COPY BACKUP SPACE AND APPARATUS THEREFOR
    19.
    发明申请
    METHOD OF DETERMINING WHETHER TO USE A FULL VOLUME OR REPOSITORY FOR A LOGICAL COPY BACKUP SPACE AND APPARATUS THEREFOR 审中-公开
    确定无论对逻辑复制备份空间使用全部或备注的方法及其设备

    公开(公告)号：WO2009071573A1

    公开(公告)日：2009-06-11

    申请号：PCT/EP2008066695

    申请日：2008-12-03

    Applicant: IBM ,  IBM UK ,  BENHASE MICHAEL THOMAS ,  FIENBLIT SHACHAR ,  HSU YU-CHENG ,  KALOS MATTHEW JOSEPH

    Inventor： BENHASE MICHAEL THOMAS ,  FIENBLIT SHACHAR ,  HSU YU-CHENG ,  KALOS MATTHEW JOSEPH

    IPC: G06F11/14

    CPC classification number: G06F11/1456 ,  G06F11/1448 ,  G06F2201/84

    Abstract: Provided are a method, system, and computer program product for determining whether to use a full volume or repository for a logical copy backup space. A determination is made of a source volume to backup using a logical copy operation. The logical copy operation is completed upon indicating the source volume data to backup. During a logical copy duration, point-in-time data in the source volume as of a point-in-time when the logical copy was established is copied to a backup space in response to receiving an update to the point- in-time data. A history of writes to the source volume is processed to determine whether to allocate a full target volume as the backup space providing a corresponding data unit for each data unit in the source volume or allocate a repository as the backup space, wherein the repository uses less storage space than the full target volume. The logical copy operation using the determined full target volume or repository as the backup space is initiated.

    Abstract translation: 提供了一种用于确定是否对逻辑副本备份空间使用完整卷或存储库的方法，系统和计算机程序产品。 使用逻辑复制操作确定要备份的源卷。 在指定要备份的源卷数据时，完成逻辑复制操作。 在逻辑复制期间，当逻辑副本建立时，源卷中的时间点数据被复制到备份空间，以响应于接收到时间点数据的更新 。 处理对源卷的写入历史以确定是否将完整目标卷分配为备份空间，为源卷中的每个数据单元提供相应的数据单元，或者将存储库分配为备份空间，其中存储库使用较少 存储空间大于完整目标卷。 启动使用确定的完整目标卷或存储库作为备份空间的逻辑复制操作。

Patent Agency Ranking