公开(公告)号：WO2004021162A2

公开(公告)日：2004-03-11

申请号：PCT/GB0303559

申请日：2003-08-14

Applicant: IBM ,  IBM UK

Inventor： CARLSON WAYNE CHARLES ,  GIBBLE KEVIN LEE ,  KISHI GREGORY TAD ,  NORMAN MARK ALLAN ,  PEAKE JONATHAN WAYNE

IPC: G06F3/06 ,  G06F12/00 ,  G06F12/08

CPC classification number: G06F3/0631 ,  G06F3/0613 ,  G06F3/0686 ,  G06F12/0866 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: A plurality of physical volumes are allocated to a first storage pool. A determination is made whether the first storage pool has less than a threshold number of empty physical volumes. If the first storage pool has less than the threshold number of empty physical volumes, then at least one empty physical volume is borrowed to the first storage pool from a second storage pool.

Abstract translation: 多个物理卷被分配给第一存储池。 确定第一个存储池是否具有小于阈值数量的空物理卷。 如果第一个存储池的空物理卷的阈值数小于阈值，则至少一个空的物理卷从第二个存储池借给第一个存储池。

公开(公告)号：JP2003067248A

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

申请号：JP2002157281

申请日：2002-05-30

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーション

Inventor： KISHI GREGORY TAD ,  NORMAN MARK ALLAN ,  PEAKE JONATHAN WAYNE ,  TELAVIS WILLIAM H

IPC: G06F12/12 ,  G06F3/06 ,  G06F11/14 ,  G06F12/00

CPC classification number: G06F11/1458 ,  G06F11/1451 ,  Y10S707/99953 ,  Y10S707/99955

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规则从存储设备中删除数据时，未复制的数据集的时间标记通过添加一些时间段来进行修改以优先考虑 未复制的数据集。 在复制数据集时，通过减少在向数据集提供标志而添加的相同的时间段来恢复到普通的时间戳以指示复制的必要性。

公开(公告)号：JP2008269611A

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

申请号：JP2008107863

申请日：2008-04-17

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： SANSONE CHRISTOPHER MICHAEL ,  KISHI GREGORY TAD ,  NORMAN MARK ALLAN ,  LAURA JEAN OSTASIEWSKI

IPC: G06F3/06 ,  G06F21/24 ,  G11B27/00

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

公开(公告)号：JP2006190274A

公开(公告)日：2006-07-20

申请号：JP2005365454

申请日：2005-12-19

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： BELLO KEITH A ,  FRIAUF CHERYL M ,  KISHI GREGORY TAD ,  NORMAN MARK ALLAN

IPC: G06F3/06 ,  G06F12/00

CPC classification number: G06F3/0659 ,  G06F3/0611 ,  G06F3/0686 ,  G06F12/0866

Abstract: PROBLEM TO BE SOLVED: To provide an apparatus, system and method for recalling a logical volume from a mountable media for use in a virtual tape server.
SOLUTION: The apparatus includes a receiving module, a queuing module and an optimizer module. The receiving module receives recall requests for logical volumes stored in the mountable media such as a tape cartridge. The queueing module places the requests in a queue to be processed in turn. The optimizer module reorders the queue based on one or more optimization rules in order to process the recall requests more efficiently.
COPYRIGHT: (C)2006,JPO&NCIPI

Abstract translation: 要解决的问题：提供一种用于从用于虚拟磁带服务器的可安装介质调用逻辑卷的装置，系统和方法。 解决方案：该装置包括接收模块，排队模块和优化器模块。 接收模块接收存储在诸如磁带盒的可安装介质中的逻辑卷的调用请求。 排队模块将请求放入队列中依次进行处理。 优化器模块基于一个或多个优化规则重新排序队列，以便更有效地处理调用请求。 版权所有（C）2006，JPO＆NCIPI

公开(公告)号：AU2003251068A1

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

申请号：AU2003251068

申请日：2003-08-14

Applicant: IBM

Inventor： PEAKE JONATHAN WAYNE ,  CARLSON WAYNE CHARLES ,  GIBBLE KEVIN LEE ,  KISHI GREGORY TAD ,  NORMAN MARK ALLAN

IPC: G06F3/06 ,  G06F12/00 ,  G06F12/08

Abstract: Provided are methods for borrow processing in storage pools. A plurality of physical volumes are allocated to a first storage pool. A determination is made whether the first storage pool has less than a threshold number of empty physical volumes. If the first storage pool has less than the threshold number of empty physical volumes, then at least one empty physical volume is borrowed to the first storage pool from a second storage pool.