公开(公告)号：EP2805241A4

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

申请号：EP12865676

申请日：2012-12-10

Applicant: IBM

Inventor： GUPTA LOKESH MOHAN ,  KALOS MATTHEW JOSEPH ,  BENHASE MICHAEL THOMAS ,  NIELSEN KARL ALLEN ,  ASH KEVIN JOHN

IPC: G06F12/08 ,  G06F12/12

CPC classification number: G06F12/0868 ,  G06F12/0804 ,  G06F12/0897 ,  G06F12/128 ,  G06F2212/262 ,  G06F2212/312 ,  G06F2212/462

Abstract: Provided are a computer program product, system, and method for managing data in a cache system comprising a first cache, a second cache, and a storage system. A determination is made of tracks stored in the storage system to demote from the first cache. A first stride is formed including the determined tracks to demote. A determination is made of a second stride in the second cache in which to include the tracks in the first stride. The tracks from the first stride are added to the second stride in the second cache. A determination is made of tracks in strides in the second cache to demote from the second cache. The determined tracks to demote from the second cache are demoted.

Abstract translation: 本发明提供一种计算机程序产品，系统，以及用于在高速缓存系统，包括：第一高速缓存，第二高速缓存和存储系统中管理数据的方法。进行确定存储在所述存储系统从所述第一高速缓存降级轨道。 第一步幅形成在包括确定性开采轨道降级。 进行确定在其中所述第二高速缓存的第二步幅以包括在所述第一跨距的曲目。 从第一步幅轨道被添加到在所述第二高速缓存中的第二步幅。 的确定在步幅由轨道的所述第二高速缓存从第二高速缓存降级。 确定性开采轨道从第二高速缓存降级被降级。

公开(公告)号：WO2007057396A3

公开(公告)日：2007-08-09

申请号：PCT/EP2006068458

申请日：2006-11-14

Applicant: IBM ,  IBM UK ,  BENHASE MICHAEL THOMAS ,  CHEN JAMES CHIEN-CHIUNG ,  HUYNH MINH-NGOC LE ,  KLEIN STEVEN EDWARD

Inventor： BENHASE MICHAEL THOMAS ,  CHEN JAMES CHIEN-CHIUNG ,  HUYNH MINH-NGOC LE ,  KLEIN STEVEN EDWARD

IPC: G06F3/06 ,  G06F11/20 ,  H04L29/08

CPC classification number: H04L67/1097 ,  G06F11/201 ,  G06F11/2071 ,  G06F11/2089

Abstract: Provided are a method, system and program for selecting a path comprising ports on primary and secondary clusters to use to transmit data at a primary volume to a secondary volume. A request is received to copy data from a primary storage location to a secondary storage location. A determination is made from a plurality of primary clusters of an owner primary cluster for the primary storage location, wherein the primary clusters are configured to access the primary storage location. A determination is made as to whether there is at least one port on the owner primary cluster providing an available path to the secondary storage location. One port on the owner primary cluster is selected to use to copy the data to the secondary storage location in response to determining that there is at least one port on the owner primary cluster available to transmit to the secondary storage location.

Abstract translation: 提供了用于选择包括主要和次要群集上的端口以用于在主要卷上将数据传输到次要卷的路径的方法，系统和程序。 接收到将数据从主存储位置复制到辅助存储位置的请求。 根据主存储位置的所有者主集群的多个主集群进行确定，其中主集群被配置为访问主存储位置。 确定在所有者主群集上是否存在至少一个端口提供到辅助存储位置的可用路径。 响应于确定所有者主集群上存在至少一个可用于传输到辅助存储位置的端口，选择所有者主集群上的一个端口用于将数据复制到辅助存储位置。

公开(公告)号：WO2006024583A3

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

申请号：PCT/EP2005053657

申请日：2005-07-27

Applicant: IBM ,  IBM UK ,  BENHASE MICHAEL THOMAS ,  PALMER MICHAEL JOHN ,  VERDOORN JR WILLIAM GARRETT ,  WALLS ANDREW DALE

Inventor： BENHASE MICHAEL THOMAS ,  PALMER MICHAEL JOHN ,  VERDOORN JR WILLIAM GARRETT ,  WALLS ANDREW DALE

IPC: G06F11/10

CPC classification number: G06F11/1076 ,  G06F2211/1007 ,  G06F2211/109

Abstract: An apparatus, system, and method are disclosed for data error checking and recovery in a data storage device. A redundancy check module creates a redundancy check for data on a data storage device in a SCSI End-to-End Checking Standard environment and a redundancy check storage module stores the redundancy check in a guard associated with the data.

Abstract translation: 公开了用于数据存储设备中的数据错误检查和恢复的装置，系统和方法。 冗余校验模块为SCSI端对端检查标准环境中的数据存储设备上的数据创建冗余校验，并且冗余校验存储模块将冗余校验存储在与数据相关联的保护中。

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

公开(公告)号：WO2005055041A3

公开(公告)日：2005-11-17

申请号：PCT/EP2004052979

申请日：2004-11-16

Applicant: IBM ,  IBM UK ,  BENHASE MICHAEL THOMAS ,  CHEN JAMES CHIEN-CHIUNG ,  LU PATRICIA CHING ,  CARBERRY FREDERICK JAMES II

Inventor： BENHASE MICHAEL THOMAS ,  CHEN JAMES CHIEN-CHIUNG ,  LU PATRICIA CHING ,  CARBERRY FREDERICK JAMES II

IPC: G06F3/06 ,  G06F17/21 ,  H04L29/06 ,  H04L29/08

CPC classification number: H04L67/1097 ,  G06F3/0619 ,  G06F3/0659 ,  G06F3/067

Abstract: Provided are a method, system and article of manufacture, wherein in certain embodiments an I/O command from a host is received at a first storage unit. An identifier is generated that identifies a destination to which the I/O command is to be transmitted from the first storage unit. The I/O command is augmented with the generated identifier at the first storage unit. The augmented I/O command is transmitted. In certain other embodiments, an I/O command is received at a storage unit, wherein the storage unit is associated with a storage unit identifier. A determination is made at the storage unit, whether the I/O command is associated with an identifier that identifies a destination for which the I/O command is intended. A further determination is made, at the storage unit, whether the identifier is the same as the storage unit identifier, in response to determining that the identifier associated with the I/O command identifies the destination for which the I/O command is intended.

Abstract translation: 提供了一种方法，系统和制造品，其中在某些实施例中，来自主机的I / O命令在第一存储单元处被接收。 生成识别从第一存储单元发送I / O命令的目的地的标识符。 I / O命令在第一个存储单元处增加了生成的标识符。 增加的I / O命令被传输。 在某些其他实施例中，在存储单元处接收I / O命令，其中存储单元与存储单元标识符相关联。 在存储单元中确定I / O命令是否与识别I / O命令所针对的目的地的标识符相关联。 响应于确定与I / O命令相关联的标识符识别I / O命令的目的地，在存储单元处进一步确定标识符是否与存储单元标识符相同。

公开(公告)号：JP2006127524A

公开(公告)日：2006-05-18

申请号：JP2005313466

申请日：2005-10-27

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

Inventor： ARMSTRONG WILLIAM JOSEPH ,  ARNDT RICHARD LOUIS ,  BENHASE MICHAEL THOMAS ,  BLOUNT LAWRENCE CARTER ,  HSU YU-CHENG ,  NAYAR NARESH

IPC: G06F9/50 ,  G06F9/46

CPC classification number: G06F9/5077 ,  G06F9/4881 ,  G06F2209/5014

Abstract: PROBLEM TO BE SOLVED: To provide an improved method for managing access to a resource included in a data processing environment logically partitioned by a partition.
SOLUTION: This device, this program and this method assure a temporal period in which use of a resource by the partition is not forcibly excluded by a hypervisor. Inquiry communication transmitted by the partition urges the hypervisor to determine whether work for the hypervisor in a pending state or not. If not, the hypervisor transmits an assurance response for assuring the period of uninterrupted use of the resource by the partition.
COPYRIGHT: (C)2006,JPO&NCIPI

Abstract translation: 要解决的问题：提供一种用于管理对由分区进行逻辑分区的数据处理环境中包括的资源的访问的改进方法。 解决方案：该设备，该程序和该方法确保了一个时间段，在该时间段内，分区的资源使用不被管理程序强制排除。 由分区发送的查询通信会敦促管理程序确定管理程序是否处于待处理状态。 如果没有，则管理程序发送保证响应，以确保分区不间断地使用资源的时间段。 版权所有（C）2006，JPO＆NCIPI

公开(公告)号：JP2002358168A

公开(公告)日：2002-12-13

申请号：JP2002075928

申请日：2002-03-19

Applicant: IBM

Inventor： BENHASE MICHAEL THOMAS ,  BURTON DAVID ALAN ,  MORTON ROBERT LOUIS

IPC: G06F3/00 ,  G06F3/06 ,  G06F12/00 ,  G06F13/00 ,  G06F13/10

Abstract: PROBLEM TO BE SOLVED: To provide a method, system, and program for setting a connected storage device through a storage adapter. SOLUTION: The storage adapter is provided with an initialization routine for generating initialization data to write to a storage device when adding a storage space to the storage device so that the storage space can be used by this system. At receiving a request, the storage space is added to the system. A command is transmitted to the storage adapter capable of inhibiting the storage adapter from pertaining the initialization routine. Then, the initialization data for the storage space are generated, and transmitted to the storage adapter to write to the storage space to initialize the storage space.

公开(公告)号：JP2001222501A

公开(公告)日：2001-08-17

申请号：JP2000397075

申请日：2000-12-27

Applicant: IBM

Inventor： BENHASE MICHAEL THOMAS ,  CHEN JAMES CHIENCHIUNG

IPC: G06F13/10 ,  G06F9/48 ,  G06F13/00 ,  H04L12/56 ,  H04L29/06

Abstract: PROBLEM TO BE SOLVED: To provide a method, a system, a program and a data structure for queuing requests. SOLUTION: Each of requests is related with one of plural priority levels. A queue containing plural entries is generated. The respective entries correspond to the plural levels and the plural requests can be queued in one entry. At the time of receiving a new request having a related priority for enqueuing in the queue, a decision on the entry pointed by a pointer is performed. The priority concerning the new request is controlled just for a certain value so that the priority can be related with an entry different from the entry pointed by the pointer. The new request is queued in one entry related with the controlled priority.

公开(公告)号：DE112013001284B4

公开(公告)日：2022-07-07

申请号：DE112013001284

申请日：2013-02-18

Applicant: IBM

Inventor： BLINICK STEPHEN ,  GUPTA LOKESH MOHAN ,  ELEFTHERIOU EVANGELOS STAVROS ,  KOLTSIDAS IOANNIS ,  HU XIAO-YU ,  PLETKA ROMAN ,  HAAS ROBERT ,  BENHASE MICHAEL THOMAS

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

Abstract: Verfahren zum Verwalten von Daten in einem ersten Cache-Speicher (14) und in einem zweiten Cache-Speicher (18), aufweisend:Verwalten, unter Verwendung eines Prozessors eines Computers, einer Referenzanzahl für eine Seite in dem zweiten Cache-Speicher (18), wenn die Seite in dem zweiten Cache-Speicher (18) gespeichert ist;Feststellen, dass die Seite aus dem zweiten Cache-Speicher (18) in den ersten Cache-Speicher (14) umgestuft werden soll;als Reaktion auf die Feststellung, dass die Referenzanzahl größer Null ist, Anfügen der Seite an ein Least-Recently-Used-(LRU-)Ende einer LRU-Liste (54) in dem ersten Cache-Speicher (14); undals Reaktion auf die Feststellung, dass die Referenzanzahl kleiner oder gleich Null ist, Anfügen der Seite an ein Most-Recently-Used-(MRU-)Ende der LRU-Liste (54) in dem ersten Cache-Speicher (14).

公开(公告)号：DE112011104314B4

公开(公告)日：2022-02-24

申请号：DE112011104314

申请日：2011-11-29

Applicant: IBM

Inventor： BENHASE MICHAEL THOMAS ,  BEARDSLEY BRENT CAMERON ,  WILLIAMS SONNY EARL ,  GUPTA LOKESH MOHAN

IPC: G06F12/08

Abstract: System (100) zum Verwalten von Cachespeicher-Auslagerungsüberprüfungszeiten, das aufweist:einen Cachespeicher (120) undeinen Prozessor (130), der mit dem Cachespeicher verbunden (140) ist, wobei der Prozessor konfiguriert ist zum:Verwenden eines ersten Thread (200) zum fortlaufenden Ermitteln einer gewünschten Überprüfungszeit für ein Überprüfen der Mehrzahl von Speicherspuren in dem Cachespeicher undVerwenden eines zweiten Thread (300), zum fortlaufenden Steuern einer tatsächlichen Überprüfungszeit der Mehrzahl von Speicherspuren in dem Cachespeicher auf Grundlage der fortlaufend ermittelten gewünschten Überprüfungszeit,wobei der Prozessor (130) beim fortlaufenden Ermitteln (200) der gewünschten Überprüfungszeit konfiguriert ist zum:Überwachen (205) des Cachespeichers (120) auf Auslagerungskonflikte (210) auf eine im Wesentlichen fortlaufende Weise undVerlängern (215) der gewünschten Überprüfungszeit um eine vorgegebene Zeitspanne, wenn der Cachespeicher von Auslagerungskonflikten betroffen ist;Überwachen (205) des Cachespeichers auf Schwingungen (220) auf eine im Wesentlichen fortlaufende Weise undVerkürzen (225) der gewünschten Überprüfungszeit um einen vorgegebenen Prozentanteil, wenn der Cachespeicher von Schwingungen betroffen ist.