-
公开(公告)号：DE69131142D1
公开(公告)日：1999-05-20
申请号：DE69131142
申请日：1991-01-17
Applicant: IBM
Inventor： HETZLER STEVEN ROBERT
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.
-
公开(公告)号：CA2134014C
公开(公告)日：1998-06-09
申请号：CA2134014
申请日：1994-10-21
Applicant: IBM
Inventor： HETZLER STEVEN ROBERT , KABELAC WILLIAM JOHN
IPC: G11B5/55 , G11B5/56 , G11B5/596 , G11B19/12 , G11B20/10 , G11B20/12 , G11B20/18 , G11B21/08 , G11B21/10 , G11B27/30
Abstract: A sector servo, zone bit recording disk drive includes a sector architecture in which the recording head locates and identifies data sectors without using data ID fields, but instead using information obtained from electronic storage and from servo sectors which need not be adjacent to the data sectors. The tracks contain servo information and data, but not data sector ID information. The tracks in each zone are circumferentially divided into segments. Included in each segment is a number of data regions separated from one another by servo sectors. The data regions may contain partial data sectors and complete data sectors. The format information provided to identify and locate data sectors, including ones whose region locations are not adjacent to servo sectors, includes an entry for each region in the section. Each entry includes the lengths of the first and last data sections in the region, whether the sectors represented by those sections are split between two regions, the total number of data sectors in the region, and the sector number of the first data sector in the region. The information provided in the servo sectors consists of a servo sector number or other indicia which enables the disk drive to determine the position of the recording head and begin reading or writing immediately upon settling on-track and without incurring a latency penalty.
-
公开(公告)号：HK202996A
公开(公告)日：1996-11-15
申请号：HK202996
申请日：1996-11-07
Applicant: IBM
Inventor： HETZLER STEVEN ROBERT
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.
-
公开(公告)号：BR9100034A
公开(公告)日：1991-10-22
申请号：BR9100034
申请日：1991-01-07
Applicant: IBM
Inventor： HETZLER STEVEN ROBERT
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.
-
公开(公告)号：AU2021297101A1
公开(公告)日：2022-10-27
申请号：AU2021297101
申请日：2021-06-22
Applicant: IBM
Inventor： BLAUM MARIO , HETZLER STEVEN ROBERT
IPC: G06F11/07
Abstract: A data storage system includes a plurality of data blocks. A set of data blocks are protected by an erasure correcting code and each of the data blocks in the set of data blocks includes block identification information. The data storage system includes a processor and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to verify the block identification information for each of the data blocks in the set of data blocks at a time of read (1102), and as part of reconstructing a data block, reconstruct the block identification information for the data block and verify the block identification information (1104).
-
Patent Agency Ranking
公开(公告)号：GB2502224B
公开(公告)日：2014-02-05
申请号：GB201314853
申请日：2012-02-10
Applicant: IBM
Inventor： HETZLER STEVEN ROBERT , BLAUM MARIO , HAFNER JAMES LEE
IPC: G06F11/10
-
公开(公告)号：GB2491004A
公开(公告)日：2012-11-21
申请号：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
Abstract: A storage system contains a controller 102, a flash memory 106 and another type of storage device, such as a hard disc drive 108. The flash memory has a life span based on the number of write/erase cycles for each block. The controller estimates the remaining lifespan of the flash memory. Based on the estimate, it determines which data should be written to the flash memory. A limit may be placed on the size of data transfer written to the flash memory. Data transfers over the limit are written to the other storage device without being written to the flash. A limit may be placed on the amount of data pre-fetched from the other storage device during read operations. A proportion of transfers to the system may be written directly to the other storage device and not to the flash memory.
-
公开(公告)号：ES2318323T3
公开(公告)日：2009-05-01
申请号：ES04766140
申请日：2004-07-07
Applicant: IBM
Inventor： HETZLER STEVEN ROBERT , SMITH DANIEL FELIX
Abstract: Un método para aumentar una tolerancia de error de una agrupación anamórfica de m unidades de almacenamiento, comprendiendo el método las operaciones de: almacenar k conjuntos a través de la agrupación de m unidades de almacenamiento, teniendo cada conjunto una pluralidad de elementos, formando cada conjunto un código de cancelación o de corrección de error que tiene una distancia de Hamming mínima d, teniendo cada conjunto n+r elementos en los que n es el número de elementos de datos, r es el número de elementos redundantes, de tal modo que m > n+r y estando almacenado cada elemento respectivo de un conjunto sobre una unidad de almacenamiento diferente; seleccionar un conjunto donante y un elemento en el conjunto donante cuando la diferencia entre la distancia mínima del conjunto donante y la distancia mínima de un conjunto receptor es mayor o igual a 2, siendo almacenado el elemento seleccionado en el conjunto donante sobre una unidad de almacenamiento que no tiene elementos del conjunto receptor; y reconstruir el contenido de un elemento perdido del conjunto receptor sobre el elemento seleccionado del conjunto donante.
-
公开(公告)号：CA2532998A1
公开(公告)日：2005-01-20
申请号：CA2532998
申请日：2004-07-07
Applicant: IBM
Inventor： SMITH DANIEL FELIX , HETZLER STEVEN ROBERT
Abstract: Error tolerance is increased for a storage system having a plurality of arra ys by making local redundancy in a selected array globally available throughout the storage system. To achieve the increased error tolerance, a donor array is selected from the plurality of arrays when the difference between a minimum distance of the donor array and a minimum distance of a recipient array is greater or equal to 2. A donor storage unit is selected in the donor array a nd recipient information is then rebuilt from the recipient array on the select ed storage unit. The selected storage unit is indicated to the donor array as having been donated before the lost information is rebuilt on the selected storage unit. Preferably, the minimum Hamming distance of the recipient arra y is d >= 2 before the donor array is selected from the plurality of arrays .
-
公开(公告)号：CA2532997A1
公开(公告)日：2005-01-20
申请号：CA2532997
申请日：2004-07-07
Applicant: IBM
Inventor： SMITH DANIEL FELIX , HETZLER STEVEN ROBERT
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 acro ss 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. A n element is selected when a difference between a minimum distance of the dono r 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.
-
-
-
-
-
-
-
-
-
Search Results
74
records
(took 0.017 seconds)
