MAINTAINING INFORMATION IN ONE OR MORE VIRTUAL VOLUME AGGREGATES COMPRISING A PLURALITY OF VIRTUAL VOLUMES
    1.
    发明申请
    MAINTAINING INFORMATION IN ONE OR MORE VIRTUAL VOLUME AGGREGATES COMPRISING A PLURALITY OF VIRTUAL VOLUMES 审中-公开
    维护一个或多个虚构体积的信息,包含大量虚拟体积

    公开(公告)号:WO2004021161A3

    公开(公告)日:2004-09-30

    申请号:PCT/GB0303557

    申请日:2003-08-13

    Applicant: IBM IBM UK

    CPC classification number: G06F3/0605 G06F3/0649 G06F3/0686

    Abstract: Information is maintained in one or more virtual volume aggregates comprising a plurality of virtual volumes. A plurality of virtual volumes is maintained in a first information storage medium, and forms one or more virtual volume aggregates, where each of the of virtual volumes is assigned to one of the virtual volume aggregates. The method further provides a plurality of second information storage media. The method then identifies the least recently used virtual volume, and writes the virtual volume aggregate comprising that least recently used virtual volume to one or more second information storage media. Thereafter, the method determines if space is required on said first information storage medium. If space is required on said first information storage medium, the method selects the virtual volume aggregate comprising the least recently used virtual volume and removes from said first information storage medium each virtual volume in that selected virtual volume aggregate that has been written to one or more second information storage media.

    Abstract translation: 在包括多个虚拟卷的一个或多个虚拟卷聚合中维护信息。 多个虚拟卷被维护在第一信息存储介质中,并且形成一个或多个虚拟卷聚合,其中每个虚拟卷被分配给虚拟卷聚合之一。 该方法还提供多个第二信息存储介质。 然后,该方法识别最近最少使用的虚拟卷,并将包括最近最少使用的虚拟卷的虚拟卷聚合写入一个或多个第二信息存储介质。 此后,该方法确定在所述第一信息存储介质上是否需要空间。 如果在所述第一信息存储介质上需要空间,则该方法选择包含最近最少使用的虚拟卷的虚拟卷聚合,并且从所述第一信息存储介质中删除已被写入一个或多个的所选择的虚拟卷聚合中的每个虚拟卷 第二信息存储媒体。

    DYNAMIC LOADING OF VIRTUAL VOLUME DATA IN A VIRTUAL TAPE SERVER
    3.
    发明申请
    DYNAMIC LOADING OF VIRTUAL VOLUME DATA IN A VIRTUAL TAPE SERVER 审中-公开
    虚拟磁带服务器中虚拟体积数据的动态加载

    公开(公告)号:WO2005114371A3

    公开(公告)日:2006-05-11

    申请号:PCT/EP2005052191

    申请日:2005-05-12

    CPC classification number: G06F3/0664 G06F3/0607 G06F3/0632 G06F3/0682

    Abstract: Disclosed are a system, a method, and article of manufacture to provide for obtaining data storage device specific information from a data storage device using standard read/write commands. This method uses a host application to write a unique sequence of records to a logical volume of the data storage device. The data storage device detects the unique sequence of records for the logical volume and writes device specific information to the logical volume allowing the host application the ability to read the data storage device specific information using a read command for the logical volume.

    Abstract translation: 公开了一种用于使用标准读/写命令从数据存储设备获得数据存储设备特定信息的系统,方法和制品。 该方法使用主机应用程序将唯一的记录序列写入数据存储设备的逻辑卷。 数据存储设备检测逻辑卷的唯一的记录序列,并将设备特定信息写入逻辑卷,允许主机应用程序使用逻辑卷的读取命令读取数据存储设备的特定信息。

    MOVING DATA AMONG STORAGE UNITS
    4.
    发明申请
    MOVING DATA AMONG STORAGE UNITS 审中-公开
    在存储单元中移动数据

    公开(公告)号:WO2004021190A3

    公开(公告)日:2004-09-23

    申请号:PCT/GB0303551

    申请日:2003-08-13

    Applicant: IBM IBM UK

    CPC classification number: G06F3/0647 G06F3/0608 G06F3/0686 G11B15/026

    Abstract: Storage pool information indicates an assignment of a plurality of storage units to a plurality of storage pools, wherein each pool is assigned zero or more storage units, wherein data associated with one storage pool is stored in a storage unit assigned to the storage pool, wherein the storage pool information for each pool indicates a threshold and target storage pool, and wherein the target storage pool is capable of being different from the storage pool. One storage unit associated with a source storage pool is selected and a determination is made of the threshold from the storage pool information for the source storage pool. A determination is made of whether the selected storage unit satisfies the determined threshold and if the selected storage unit satisfies the determined threshold, then a target storage unit in the target storage pool is selected if the storage pool information for the source storage pool indicates a target storage pool different from the source storage pool. Data from the selected storage unit is copied to the selected target storage unit.

    Abstract translation: 存储池信息指示将多个存储单元分配给多个存储池,其中每个池被分配零个或多个存储单元,其中与一个存储池相关联的数据被存储在分配给该存储池的存储单元中,其中 每个池的存储池信息指示阈值和目标存储池,并且其中目标存储池能够与存储池不同。 选择与源存储池相关联的一个存储单元,并根据源存储池的存储池信息确定阈值。 确定所选择的存储单元是否满足确定的阈值,并且如果所选存储单元满足所确定的阈值,则如果源存储池的存储池信息指示目标,则选择目标存储池中的目标存储单元 存储池不同于源存储池。 来自所选存储单元的数据被复制到所选择的目标存储单元。

    Authentication for virtual avatar
    5.
    发明专利
    Authentication for virtual avatar 有权
    虚拟AVATAR认证

    公开(公告)号:JP2013161478A

    公开(公告)日:2013-08-19

    申请号:JP2013008496

    申请日:2013-01-21

    CPC classification number: H04L63/08 G06F21/445 H04L63/102

    Abstract: PROBLEM TO BE SOLVED: To determine the control entity of a first avatar in a virtual world.SOLUTION: A method for determining the control entity of a first avatar in a virtual world includes the steps of: receiving the access request of a resource via a first avatar; presenting a challenge to the first avatar in response to the reception of the request; receiving a challenge response via the first avatar in response to the presentation of the challenge; determining identity reliability on the basis of the challenge response; making identity determination about the control entity of the first avatar on the basis of the identity reliability; and approving or disapproving the access of the resource on the basis of the identity determination.

    Abstract translation: 要解决的问题:确定虚拟世界中的第一化身的控制实体。解决方案:一种用于确定虚拟世界中的第一化身的控制实体的方法,包括以下步骤:通过以下步骤接收资源的访问请求: 第一个头像 对接收到请求的第一个化身提出挑战; 响应于挑战的呈现,通过第一头像接收挑战响应; 在挑战响应的基础上确定身份可靠性; 基于身份可靠性对第一化身的控制实体进行身份确定; 并根据身份确定批准或不批准资源的访问。

    Method and system of caching memory devices
    6.
    发明专利
    Method and system of caching memory devices 有权
    缓存存储器件的方法和系统

    公开(公告)号:JP2003067248A

    公开(公告)日:2003-03-07

    申请号:JP2002157281

    申请日:2002-05-30

    Abstract: PROBLEM TO BE SOLVED: To provide a method to copy data from a virtual tape server to another virtual tape server in a peer-to-peer environment. SOLUTION: Every time when a data set is modified or created, a flag is used for indicating whether the data set necessitates to be copied from a memory device to another. In one of the preferred implementation, when data is removed from a memory device based on LRU rule according to the time stamp of each data set, the time stamps of the data sets not copied are modified by adding some period of time to give priority to the not-copied data sets. Upon copying a data set, the time stamp is recovered to an ordinary one by reducing the same period of time that was added when a flag was given to the data set to indicate the necessity of a copy.

    Abstract translation: 要解决的问题:提供一种将数据从虚拟磁带服务器复制到对等环境中的另一个虚拟磁带服务器的方法。 解决方案:每当数据集被修改或创建时,都会使用一个标志来指示数据集是否需要从存储设备复制到另一个。 在优选实现之一中,当根据每个数据集的时间戳根据LRU规则从存储设备中删除数据时,未复制的数据集的时间标记通过添加一些时间段来进行修改以优先考虑 未复制的数据集。 在复制数据集时,通过减少在向数据集提供标志而添加的相同的时间段来恢复到普通的时间戳以指示复制的必要性。

    Maintenance of information in one or more virtual volume aggregates comprising a plurality of virtual volumes
    7.
    发明专利
    Maintenance of information in one or more virtual volume aggregates comprising a plurality of virtual volumes 有权
    在一个或多个虚拟体积中维护信息,包含大量虚拟体积

    公开(公告)号:JP2008305422A

    公开(公告)日:2008-12-18

    申请号:JP2008190432

    申请日:2008-07-24

    CPC classification number: G06F3/0605 G06F3/0649 G06F3/0686

    Abstract: PROBLEM TO BE SOLVED: To maintain information in one or more virtual volume aggregates comprising a plurality of virtual volumes.
    SOLUTION: A plurality of virtual volumes are maintained in a first information storage medium, and form one or more virtual volume aggregates. Each of the virtual volumes is assigned to one of the virtual volume aggregates. Furthermore, a plurality of second information storage media are provided. Then, the least recently used virtual volume is identified, and the virtual volume aggregate comprising that least recently used virtual volume is written to one or more second information storage media. Thereafter, it is determined if space is required on the first information storage medium. If space is required on the first information storage medium, the virtual volume aggregate comprising the least recently used virtual volume is selected, and each virtual volume in that selected virtual volume aggregate written to one or more second information storage media is removed from the first information storage medium.
    COPYRIGHT: (C)2009,JPO&INPIT

    Abstract translation: 要解决的问题:将包含多个虚拟卷的一个或多个虚拟卷集合中的信息进行维护。 解决方案:在第一信息存储介质中维护多个虚拟卷,并形成一个或多个虚拟卷聚合。 每个虚拟卷被分配给一个虚拟卷聚合。 此外,提供多个第二信息存储介质。 然后,识别最近最少使用的虚拟卷,并且将包含最近最少使用的虚拟卷的虚拟卷聚合写入一个或多个第二信息存储介质。 此后,确定在第一信息存储介质上是否需要空间。 如果在第一信息存储介质上需要空间,则选择包括最近最少使用的虚拟卷的虚拟卷聚合,并且从该第一信息中删除写入一个或多个第二信息存储介质的所选择的虚拟卷聚合中的每个虚拟卷 存储介质。 版权所有(C)2009,JPO&INPIT

    METHOD AND SYSTEM UTILIZING DATA FRAGMENT FOR EFFICIENTLY IMPORTING/EXPORTING REMOVABLE STORAGE VOLUME

    公开(公告)号:JP2002182952A

    公开(公告)日:2002-06-28

    申请号:JP2001323408

    申请日:2001-10-22

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To provide a improved virtual storage system. SOLUTION: The method included writing data fragments to the end of the removable storage volume in a first virtual storage system. In an advantageous embodiment, the data fragments are written to the end of the removable storage volume when the removable storage volume is closed. The data fragments contain information, such as data file headers, that uniquely identifies data files residing in the removable storage volume. Then, the removable storage volume is transferred to a second virtual storage system. Upon receipt of the removable storage volume, the second virtual storage system updates a tape volume cache in the second virtual storage system utilizing the information contained in the data fragments without having to read each of the data files.

    Method, computer program and system for determining assignment of tape drive for safe data erasing process
    9.
    发明专利
    Method, computer program and system for determining assignment of tape drive for safe data erasing process 有权
    方法,用于确定安全数据擦除过程的磁带驱动器分配的计算机程序和系统

    公开(公告)号:JP2008269611A

    公开(公告)日:2008-11-06

    申请号:JP2008107863

    申请日:2008-04-17

    Abstract: PROBLEM TO BE SOLVED: To provide a method and a computer program for determining assignment of a tape drive for a safe data erasing process.
    SOLUTION: The assignment of the additional tape drive is determined to improve performance in the safe data erasing, through evaluation of a physical volume amount to erase a data safely, the maximum threshold value, an average time up to a erasing dead line, and the minimum expiration date threshold value, and the data erasing is thereby secured safely and timely. The additional tape drive is allocated for a safe data erasing process, when the assignment of the additional tap drive is determined to improve performance in the safe data erasing.
    COPYRIGHT: (C)2009,JPO&INPIT

    Abstract translation: 要解决的问题:提供一种用于确定用于安全数据擦除处理的磁带驱动器的分配的方法和计算机程序。

    解决方案:确定附加磁带驱动器的分配,以通过评估物理卷量以安全地擦除数据来提高安全数据擦除中的性能,最大阈值,直到擦除死线的平均时间 和最小到期日期阈值,从而安全且及时地确保数据擦除。 当附加分接驱动器的分配被确定以提高安全数据擦除中的性能时,额外的磁带驱动器被分配用于安全数据擦除处理。 版权所有(C)2009,JPO&INPIT

Patent Agency Ranking