中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

20 records (took 0.022 seconds)

    DATA TRAFFIC MONITORING TOOL
    11.
    发明申请
    DATA TRAFFIC MONITORING TOOL 审中-公开

    公开(公告)号：US20170093668A1

    公开(公告)日：2017-03-30

    申请号：US14865601

    申请日：2015-09-25

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Jonathan AMIT ,  Lior CHEN ,  Vladislav DROUKER ,  Osnat SHASHA

    IPC: H04L12/26

    Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include detecting, on a communications network in a computing facility including a first computer coupled to a second computer via the communications network, an input/output (I/O) request conveyed from the first computer to the second computer. Subsequent to detecting the I/O request, data traffic resulting from the second computer processing the I/O request is identified on the communications network, and network statistics are collected based on the I/O request and the data traffic. Upon detecting a performance degradation of the computing facility, the performance degradation greater than a predetermined amount, heuristics can be applied to the collected network statistics, to identify a cause of the performance degradation and to identify a remedy to the detected performance degradation. In some embodiments, the identified cause and the identified remedy can be presented to a user on a display.

    EFFICIENT FLASHCOPY BACKUP AND MOUNT, CLONE, OR RESTORE COLLISION AVOIDANCE USING DYNAMIC VOLUME ALLOCATION WITH REUSE AND FROM A SHARED RESOURCE POOL
    13.
    发明申请
    EFFICIENT FLASHCOPY BACKUP AND MOUNT, CLONE, OR RESTORE COLLISION AVOIDANCE USING DYNAMIC VOLUME ALLOCATION WITH REUSE AND FROM A SHARED RESOURCE POOL 有权
    有效的闪光备份和安装，克隆或恢复冲突避免使用动态体积分配与重用和从共享资源池

    公开(公告)号：US20150286431A1

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

    申请号：US14243397

    申请日：2014-04-02

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Joseph W. DAIN ,  Gregory T. KISHI ,  Osnat SHASHA ,  Christopher ZAREMBA

    IPC: G06F3/06

    CPC classification number: G06F11/14 ,  G06F11/1446 ,  G06F11/1448 ,  G06F11/1451 ,  G06F11/1458 ,  G06F11/1469 ,  G06F2201/82 ,  G06F2201/84

    Abstract: For efficient Flashcopy backup and a mount, clone, instant restore, and/or file level restore task collision avoidance using dynamic volume allocation with reuse and from a shared resource pool, performing at least one attempt to reuse an existing FlashCopy target volume in a Flashcopy chain of target volumes that is not currently being used for at least one of the mount task, the clone task, instant restore task, and/or file level restore task at the same time for a FlashCopy backup. If the at least one attempt to reuse the existing FlashCopy target volume fails, dynamically allocate a new Flashcopy target volume for the Flashcopy backup from a global pool of Flashcopy backup target volumes shared by a plurality of device classes.

    Abstract translation: 对于高效的Flashcopy备份以及使用动态卷分配（通过重用和从共享资源池）进行挂载，克隆，即时恢复和/或文件级还原任务冲突避免，至少尝试重新使用Flashcopy中的现有FlashCopy目标卷 FlashCopy备份同时不用于至少一个装载任务，克隆任务，即时还原任务和/或文件级还原任务的目标卷链。 如果至少一次尝试重新使用现有的FlashCopy目标卷失败，则会从多个设备类共享的Flashcopy备份目标卷的全局池中为Flashcopy备份动态分配新的Flashcopy目标卷。

    INTERCONNECT CHANNEL MANAGEMENT
    15.
    发明申请
    INTERCONNECT CHANNEL MANAGEMENT 有权
    互通渠道管理

    公开(公告)号：US20160267040A1

    公开(公告)日：2016-09-15

    申请号：US14641889

    申请日：2015-03-09

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Zah BARZIK ,  Lior CHEN ,  Dan COHEN ,  Osnat SHASHA

    IPC: G06F13/42 ,  G06F3/06

    CPC classification number: G06F13/4221 ,  G06F3/0611 ,  G06F3/0613 ,  G06F3/0635 ,  G06F3/067 ,  G06F2206/1012

    Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include configuring distributed storage system resources for a distributed storage system. Examples of the storage system resources include a plurality of network segments, one or more network devices coupled to the network, and multiple nodes coupled to the network, the nodes including both frontend and backend nodes. Upon receiving, by a given frontend node in the distributed storage system, an input/output (I/O) request, one or more of the distributed storage system resources required to process the I/O request are identified, and a respective load that the I/O request will generate on each of the identified distributed storage system resources is calculated. The distributed storage system processes the I/O request upon detecting that the respective loads are less than respective available capacities of the identified distributed storage system resources.

    Abstract translation: 方法，计算系统和计算机程序产品实现本发明的实施例，其包括为分布式存储系统配置分布式存储系统资源。 存储系统资源的示例包括多个网段，耦合到网络的一个或多个网络设备，以及耦合到网络的多个节点，节点包括前端节点和后端节点。 在由分布式存储系统中的给定前端节点接收到输入/输出（I / O）请求时，识别处理I / O请求所需的分布式存储系统资源中的一个或多个，以及相应的负载 计算每个识别的分布式存储系统资源上的I / O请求。 分布式存储系统在检测到相应负载小于所识别的分布式存储系统资源的相应可用容量时处理该I / O请求。

    HASH-BASED MULTI-TENANCY IN A DEDUPLICATION SYSTEM
    16.
    发明申请
    HASH-BASED MULTI-TENANCY IN A DEDUPLICATION SYSTEM 审中-公开
    基于HASH的多元化在系统中的应用

    公开(公告)号：US20160004716A1

    公开(公告)日：2016-01-07

    申请号：US14322079

    申请日：2014-07-02

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Shay H. AKIRAV ,  Yariv BACHAR ,  Joseph W. DAIN ,  Gregory T. KISHI ,  Osnat SHASHA

    IPC: G06F17/30

    Abstract: In a hash-based multi-tenancy in a deduplication system, incorporating, as if part of input data, a tenant identification (ID) into a hash value calculation using a single hash based index table for separating data segments in a multi-tenant deduplication system.

    Abstract translation: 在重复数据删除系统中的基于哈希的多租户中，将使用单个基于散列的索引表的哈希值计算中的租户识别（ID）合并为输入数据的一部分，以便在多租户重复数据删除中分离数据段 系统。

    EFFICIENT FLASHCOPY BACKUP TARGET VOLUME ALLOCATION WITH REUSE AND A SHARED RESOURCE POOL
    17.
    发明申请
    EFFICIENT FLASHCOPY BACKUP TARGET VOLUME ALLOCATION WITH REUSE AND A SHARED RESOURCE POOL 有权
    有效的闪存备份目标大小与重用和共享资源池的分配

    公开(公告)号：US20150286542A1

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

    申请号：US14243482

    申请日：2014-04-02

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Joseph W. DAIN ,  Gregory T. KISHI ,  Osnat SHASHA ,  Christopher ZAREMBA

    IPC: G06F11/14 ,  G06F11/20

    CPC classification number: G06F11/1469 ,  G06F11/1435 ,  G06F11/1448 ,  G06F11/1458 ,  G06F2201/82 ,  G06F2201/84

    Abstract: A new target volume for a new FlashCopy backup is dynamically allocated by performing at least one attempt to reuse an existing FlashCopy target volume containing older FlashCopy backups that have been previously ingested into a repository and are not currently being used as a source for at least one of a mount task, a clone task, and a restore task. If the at least one attempt to reuse the existing FlashCopy target volume fails, the new target volume is dynamically allocated from a global pool of FlashCopy backup target volumes.

    Abstract translation: 新的FlashCopy备份的新目标卷通过执行至少一次尝试重新使用包含先前已被摄入到存储库中的较早版本的FlashCopy备份的现有FlashCopy目标卷来动态分配，目前尚未被用作至少一个源 的装载任务，克隆任务和还原任务。 如果至少一次尝试重新使用现有的FlashCopy目标卷失败，则会从FlashCopy备份目标卷的全局池中动态分配新的目标卷。

Patent Agency Ranking