公开(公告)号：DE112021003270B4

公开(公告)日：2024-11-28

申请号：DE112021003270

申请日：2021-07-06

Applicant: IBM

Inventor： HETZLER STEVEN ROBERT ,  HINEMAN WAYNE ,  BEST JOHN STEWART

IPC: G06F16/174 ,  G06F21/62 ,  H04L9/28 ,  H04L67/1097

Abstract: Durch einen Computer ausgeführtes Verfahren, das umfasst:Senden (1102) von Schlüsselgruppeninformationen an ein Speichersystem (338), wobei die Schlüsselgruppeninformationen keylD-Informationen für Clientdatenschlüssel (306, 308, 310) in der Schlüsselgruppe umfassen, wobei die Clientdatenschlüssel (306, 308, 310) eine Deduplizierung von Datenblöcken ermöglichen, die in beliebigen der Clientdatenschlüssel (306, 308, 310) in der Schlüsselgruppe verschlüsselt sind;Erzeugen (1104) von Deduplizierungsinformationen, wobei die Deduplizierungsinformationen Fingerabdrücke umfassen, die Blöcken von Clientdaten zugeordnet sind;Verschlüsseln (1106) der Datenblöcke mit einem der Clientdatenschlüssel (306, 308, 310), wobei dem Speichersystem (338) kein entsprechender Entschlüsselungsschlüssel für die verschlüsselten Datenblöcke zur Verfügung steht;Senden (1108) der Deduplizierungsinformationen an das Speichersystem (338) zur Verwendung in einem Deduplizierungsprozess durch das Speichersystem (338); undSenden (1110) der verschlüsselten Datenblöcke an das Speichersystem (338).

公开(公告)号：DE112020003357T5

公开(公告)日：2022-03-31

申请号：DE112020003357

申请日：2020-08-10

Applicant: IBM

Inventor： HETZLER STEVEN ROBERT

IPC: G06F16/174 ,  G06F21/62

Abstract: Ein durch einen Computer umgesetztes Verfahren umfasst ein Empfangen von Deduplizierungsinformationen an einem Speichersystem. Die Deduplizierungsinformationen sind für das Speichersystem zugänglich, um darauf Operationen auszuführen. Die Deduplizierungsinformationen umfassen Signaturen, die Abschnitten von Client-Daten zugehörig sind. Das Verfahren umfasst auch ein Empfangen der mit einem Client-Geheimschlüssel verschlüsselten Client-Daten. Der Client-Geheimschlüssel ist für das Speichersystem nicht verfügbar. Das Verfahren umfasst ein Deduplizieren von Datenblöcken, die in dem Speichersystem gespeichert sind, in Bezug auf Blöcke der Client-Daten, wobei die Blöcke der Client-Daten durch Verwenden der Deduplizierungsinformationen aus den Client-Daten ausgewählt werden.

公开(公告)号：GB2491004B

公开(公告)日：2013-04-24

申请号：GB201207613

申请日：2012-05-02

Applicant: IBM

Inventor： SHMUELI EDI ,  GILL BINNY SHER ,  ASSAF NITZAN ,  LOTEM EYAL ,  BELLUOMINI WENDY ANN ,  HAFNER JAMES LEE ,  SMITH DANIEL FELIX ,  HETZLER STEVEN ROBERT ,  NAYAR GOPAL

IPC: G06F12/08 ,  G06F3/06

公开(公告)号：DE102012103869A1

公开(公告)日：2012-11-22

申请号：DE102012103869

申请日：2012-05-03

Applicant: IBM

Inventor： SHMUELI EDI ,  ASSAF NITZAN ,  BELLUOMINI WENDY ANN ,  SMITH DANIEL FELIX ,  NAYAR VENU GOPAL ,  GILL BINNY SHER ,  LOTEM EYAL ,  HAFNER JAMES LEE ,  HETZLER STEVEN ROBERT

IPC: G06F12/08 ,  G06F13/00

Abstract: Ausführungsformen der Erfindung beziehen sich auf die Drosselung von Zugriffen auf eine Flash-Speichervorrichtung. Die Flash-Speichervorrichtung ist Teil eines Speichersystems, das die Flash-Speichervorrichtung und eine zweite Speichervorrichtung umfasst, Die Drosselung wird durch die Logik außerhalb der Flash-Speichervorrichtung durchgeführt und umfasst das Berechnen eines Drosselungs-Faktors reagierend auf eine geschätzte verbleibende Lebensdauer der Flash-Speichervorrichtung. Es wird bestimmt, ob der Drosselungs-Faktor einen Schwellenwert überschreitet. Daten werden, als Reaktion auf die Bestimmung, dass der Drosselungs-Faktor den Schwellenwert nicht überschreitet, auf die Flash-Speichervorrichtung geschrieben. Daten werden, als Reaktion auf die Bestimmung, dass der Drosselungs-Faktor den Schwellenwert überschreitet, auf die zweite Speichervorrichtung geschrieben.

公开(公告)号：CA2817945A1

公开(公告)日：2012-09-07

申请号：CA2817945

申请日：2012-02-10

Applicant: IBM

Inventor： HETZLER STEVEN ROBERT ,  BLAUM MARIO ,  HAFNER JAMES LEE

IPC: G06F11/10

Abstract: In a method for storing data in a storage array, write data is arranged into "r" rows and "n" columns of pages, with each page including a plurality of sectors. The write data is encoded using a plurality of horizontal and vertical erasure correcting codes on the pages. The encoding allows recovery from up to tr erasures in any one of the r rows, up to tr-1 erasures in any one of the remaining r-1 rows, up to tr-2 erasures in any one of the remaining r-2 rows, and so on, such that the encoding allows recovery from up to t1 erasures in the last remaining row. Encoded write data is output from the encoding. The encoded write data is written as a write stripe across n storage devices in a storage array.

公开(公告)号：CA2532997C

公开(公告)日：2012-07-24

申请号：CA2532997

申请日：2004-07-07

Applicant: IBM

Inventor： HETZLER STEVEN ROBERT ,  SMITH DANIEL FELIX

IPC: G06F17/30 ,  G06F11/00 ,  G06F11/10

Abstract: The error tolerance of an array of m storage units is increased by using a technique referred to as "dodging." A plurality of k stripes are stored across the array of storage units in which each stripe has n + r elements that correspond to a symmetric code having a minimum Hamming distance d = r + 1. Each respective element of a stripe is stored on a different storage unit. An element is selected when a difference between a minimum distance of the donor stripe and a minimum distance of a recipient stripe is greater or equal to 2. The selected element is also stored on a storage unit having no elements of the recipient stripe. A lost element of the recipient stripe is then rebuilt on the selected element.

公开(公告)号：SG145728A1

公开(公告)日：2008-09-29

申请号：SG2008059032

申请日：2004-07-07

Applicant: IBM

Inventor： HETZLER STEVEN ROBERT ,  SMITH DANIEL FELIX

IPC: G06F11/00 ,  G06F11/10 ,  G06F17/30

Abstract: DATA STORAGE ARRAY The error tolerance of an array (300) of m storage units is increased by using a technique referred to a "dodging". A plurality of k stripes are stored across the array (300) of storage units (D1 - D9) in which each stripe has n+r elements that correspond to a symmetric code having a minimum Hamming distance d = r + 1. Each respective element of a stripe is stored on a different storage unit (Dl - D9). An element is selected when a difference between a minimum distance of the donor stripe and a minimum distance of a recipient stripe is greater or equal to 2. The selected element is also stored on a storage unit (D 1 - D9) having no elements of the recipient stripe. A lost element of the recipient stripe is then rebuilt on the selected element.

公开(公告)号：CA2532766A1

公开(公告)日：2005-01-20

申请号：CA2532766

申请日：2004-07-07

Applicant: IBM

Inventor： SMITH DANIEL FELIX ,  HETZLER STEVEN ROBERT ,  WINOGRAD SHMUEL

IPC: G06F3/06 ,  G06F11/10 ,  G11C29/00

Abstract: A data storage subsystem that includes three data storage units, three check storage units, and an array controller coupled to the three data and three check storage units can tolerate failure of any three data and check storage units failures can be occur before data stored on the data storage subsystem is lost. Information is stored on the data storage subsystem as a symmetric Maximum Distance Separation code, such as Winograd code, a Reed Solomon code , an EVENODD code or a derivative of an EVENODD code. The array controller determines the contents of the check storage units so that any three erasure s of the data storage units and the check storage units can be corrected by th e array controller. The array controller updates a block of data contained in any one of the data storage units and the check storage units using only six IO operations.

公开(公告)号：DE69131329D1

公开(公告)日：1999-07-15

申请号：DE69131329

申请日：1991-01-17

Applicant: IBM

Inventor： HETZLER STEVEN ROBERT

IPC: G11B20/10 ,  G11B20/12 ,  G11B20/14 ,  G11B21/10 ,  G11B27/30 ,  G11B19/02 ,  G11B5/596

Abstract: A method and means is described wherein servo sectors written on a disk (or servo sections written on a tape) are equally spaced on a given track and read during seek, settle and track following operations. An algorithm is used to determine the allowable time separation between servo sectors (or sections) on a track and lengths of associated data sections, such as data sectors or variable length records, that may be accommodated on the disk or tape in such manner that each of the servo sectors (or sections) equally spaced on a given track is located within a data field of a data sector or within an identification region or immediately after an address indicating mark (such as address marker index mark). The rate at which the servo sector (or section) is sampled is constant and independent of the number and lengths of the data sections. As a result of this independent relationship, this technique is suitable for CLD recording, to banded disks using sectored servo as in conventional FBA, and also even to non-sectored architectures, such as count-key-data (CKD), wherein the data is written in records of variable length, and to tape drives formatted in FBA or CKD.

公开(公告)号：DE69505524T2

公开(公告)日：1999-06-02

申请号：DE69505524

申请日：1995-05-18

Applicant: IBM

Inventor： BEST JOHN STEWART ,  CHIANG WEN-WEI ,  HETZLER STEVEN ROBERT ,  HORNE DONALD EDWARD ,  LEE CHIH-KUNG ,  MARRELLO VINCENT

IPC: G01B11/26 ,  G01D5/38 ,  G01B11/00 ,  G11B5/55 ,  G11B21/08 ,  G11B21/10

Abstract: A non-invasive servo-write system for use in a data recording disk drive. The system measures actuator position and generates a reference clock using semiconductor lasers. Internal position references are provided by reflective diffraction gratings affixed to the actuator arm and the spindle hub. Wavefront reconstruction optics correct for aberrations in the gratings. Optical sensors detect differential changes in the diffraction patterns created by the gratings, eliminating sensitivity to frequency drift. Decode electronics convert optical sensor data into an actuator position measurement. Control electronics drive the voice coil motor within the disk drive, which positions the write transducer to record servo information provided in a servo pattern generator. Transparent windows in the head-disk-assembly cover allow the servo-writer to write drives which are completely assembled and sealed.