专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

21. 发明授权

US08918701B2 Nested multiple erasure correcting codes for storage arrays 有权
标题翻译：存储阵列的嵌套多重擦除校正码
公开(公告)号：US08918701B2
公开(公告)日：2014-12-23
申请号：US13563123
申请日：2012-07-31
申请人： Mario Blaum , James L. Hafner , Steven R. Hetzler
发明人： Mario Blaum , James L. Hafner , Steven R. Hetzler
IPC分类号： G11C29/00 , G06F11/10
CPC分类号： G06F11/108 , G06F2211/1045 , G06F2211/1057 , G06F2211/1059
摘要： Embodiments of the invention relate to storing data in a storage array. An aspect of the invention includes receiving write data. The 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.
摘要翻译：本发明的实施例涉及将数据存储在存储阵列中。本发明的一个方面包括接收写入数据。写入数据被布置成“r”行和“n”列的页面，每个页面包括多个扇区。使用页面上的多个水平和垂直擦除校正码对写入数据进行编码。该编码允许在r行中的任何一行中从最多到三次的恢复进行恢复，直到剩余的r-1行中的任何一行中的tr-1次擦除，直到剩下的r-2行中的任一个中的tr-2擦除，等等，使得编码允许在最后剩余的行中从高达t1个删除恢复。从编码输出编码的写入数据。编码的写入数据被写入存储阵列中的n个存储设备上的写入条带。

22. 发明授权

US08656088B2 Optimized flash based cache memory 失效
标题翻译：优化基于闪存的高速缓存
公开(公告)号：US08656088B2
公开(公告)日：2014-02-18
申请号：US13112894
申请日：2011-05-20
申请人： Wendy A. Belluomini , Binny S. Gill , James L. Hafner , Steven R. Hetzler , Eyal Lotem , Venu G. Nayar , Assaf Nitzan , Edi Shmueli , Daniel F. Smith
发明人： Wendy A. Belluomini , Binny S. Gill , James L. Hafner , Steven R. Hetzler , Eyal Lotem , Venu G. Nayar , Assaf Nitzan , Edi Shmueli , Daniel F. Smith
IPC分类号： G06F12/00
CPC分类号： G06F12/0888 , G06F12/0246 , G06F12/0866 , G06F12/0897 , G06F2212/1036 , G06F2212/222
摘要： Embodiments of the invention relate to throttling accesses to a flash memory device. The flash memory device is part of a storage system that includes the flash memory device and a second memory device. The throttling is performed by logic that is external to the flash memory device and includes calculating a throttling factor responsive to an estimated remaining lifespan of the flash memory device. It is determined whether the throttling factor exceeds a threshold. Data is written to the flash memory device in response to determining that the throttling factor does not exceed the threshold. Data is written to the second memory device in response to determining that the throttling factor exceeds the threshold.
摘要翻译：本发明的实施例涉及对闪存设备的限制访问。闪存设备是包括闪存设备和第二存储设备的存储系统的一部分。节流由闪存设备外部的逻辑执行，并且包括响应于闪存设备的估计剩余寿命来计算节流因子。确定节流因子是否超过阈值。响应于确定节流因子不超过阈值，将数据写入闪存设备。响应于确定节流因子超过阈值，将数据写入第二存储器件。

23. 发明申请

US20120297127A1 OPTIMIZED FLASH BASED CACHE MEMORY 失效
公开(公告)号：US20120297127A1
公开(公告)日：2012-11-22
申请号：US13553194
申请日：2012-07-19
申请人： Wendy A. Belluomini , Binny S. Gill , James L. Hafner , Steven R. Hetzler , Assaf Nitzan , Eyal Lotem , Venu G. Nayar , Edi Shmueli , Daniel F. Smith
发明人： Wendy A. Belluomini , Binny S. Gill , James L. Hafner , Steven R. Hetzler , Assaf Nitzan , Eyal Lotem , Venu G. Nayar , Edi Shmueli , Daniel F. Smith
IPC分类号： G06F12/02
CPC分类号： G06F12/0888 , G06F12/0246 , G06F12/0866 , G06F12/0897 , G06F2212/1036 , G06F2212/222
摘要： Embodiments of the invention relate to throttling accesses to a flash memory device. The flash memory device is part of a storage system that includes the flash memory device and a second memory device. The throttling is performed by logic that is external to the flash memory device and includes calculating a throttling factor responsive to an estimated remaining lifespan of the flash memory device. It is determined whether the throttling factor exceeds a threshold. Data is written to the flash memory device in response to determining that the throttling factor does not exceed the threshold. Data is written to the second memory device in response to determining that the throttling factor exceeds the threshold.

24. 发明申请

US20120297113A1 OPTIMIZED FLASH BASED CACHE MEMORY 失效
标题翻译：优化的基于闪存的高速缓存存储器
公开(公告)号：US20120297113A1
公开(公告)日：2012-11-22
申请号：US13112894
申请日：2011-05-20
申请人： Wendy A. Belluomini , Binny S. Gill , James L. Hafner , Steven R. Hetzler , Assaf Nitzan , Eyal Lotem , Venu G. Nayar , Edi Shmueli , Daniel F. Smith
发明人： Wendy A. Belluomini , Binny S. Gill , James L. Hafner , Steven R. Hetzler , Assaf Nitzan , Eyal Lotem , Venu G. Nayar , Edi Shmueli , Daniel F. Smith
IPC分类号： G06F12/02
CPC分类号： G06F12/0888 , G06F12/0246 , G06F12/0866 , G06F12/0897 , G06F2212/1036 , G06F2212/222
摘要： Embodiments of the invention relate to throttling accesses to a flash memory device. The flash memory device is part of a storage system that includes the flash memory device and a second memory device. The throttling is performed by logic that is external to the flash memory device and includes calculating a throttling factor responsive to an estimated remaining lifespan of the flash memory device. It is determined whether the throttling factor exceeds a threshold. Data is written to the flash memory device in response to determining that the throttling factor does not exceed the threshold. Data is written to the second memory device in response to determining that the throttling factor exceeds the threshold.
摘要翻译：本发明的实施例涉及对闪存设备的限制访问。闪存设备是包括闪存设备和第二存储设备的存储系统的一部分。节流由闪存设备外部的逻辑执行，并且包括响应于闪存设备的估计剩余寿命来计算节流因子。确定节流因子是否超过阈值。响应于确定节流因子不超过阈值，将数据写入闪存设备。响应于确定节流因子超过阈值，将数据写入第二存储器件。

25. 发明申请

US20120221926A1 Nested Multiple Erasure Correcting Codes for Storage Arrays 有权
标题翻译：存储阵列的嵌套多重擦除校正码
公开(公告)号：US20120221926A1
公开(公告)日：2012-08-30
申请号：US13036845
申请日：2011-02-28
申请人： Mario Blaum , James L. Hafner , Steven R. Hetzler
发明人： Mario Blaum , James L. Hafner , Steven R. Hetzler
IPC分类号： H03M13/05 , G06F11/10
CPC分类号： G06F11/108 , G06F2211/1045 , G06F2211/1057 , G06F2211/1059
摘要： Embodiments of the invention relate to storing data in a storage array. An aspect of the invention includes receiving write data. The 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.
摘要翻译：本发明的实施例涉及将数据存储在存储阵列中。本发明的一个方面包括接收写入数据。写入数据被布置成“r”行和“n”列的页面，每个页面包括多个扇区。使用页面上的多个水平和垂直擦除校正码对写入数据进行编码。该编码允许在r行中的任何一行中从最多到三次的恢复进行恢复，直到剩余的r-1行中的任何一行中的tr-1次擦除，直到剩下的r-2行中的任一个中的tr-2擦除，等等，使得编码允许在最后剩余的行中从高达t1个删除恢复。从编码输出编码的写入数据。编码的写入数据被写入存储阵列中的n个存储设备上的写入条带。

26. 发明授权

US07134066B2 Generalized parity stripe data storage array 失效
标题翻译：广义奇偶条纹数据存储阵列
公开(公告)号：US07134066B2
公开(公告)日：2006-11-07
申请号：US10689814
申请日：2003-10-20
申请人： Martin Aureliano Hassner , Steven R. Hetzler , Tetsuya Tamura , Barry Marshall Trager , Shmuel Winograd
发明人： Martin Aureliano Hassner , Steven R. Hetzler , Tetsuya Tamura , Barry Marshall Trager , Shmuel Winograd
IPC分类号： G11C29/52 , G11C29/42
CPC分类号： H03M13/2909 , G06F11/1076 , H03M13/134 , H03M13/2906
摘要： The Hamming distance of an array of storage devices is increased by generating a parity check matrix based on column equations that are formed using an orthogonal parity code and includes a higher-order multiplier that changes each column. The higher order multiplier is selected to generate a finite basic field of a predetermined number of elements. The array has M rows and N columns, such that M is greater than or equal to three and N is greater than or equal to three. Row 1 through row M−2 of the array each have n–p data storage devices and p parity storage devices. Row M−1 of the array has n−(p+1) data storage devices and (p+1) parity storage devices. Lastly, row M of the array has N parity storage devices.
摘要翻译：存储装置阵列的汉明距离通过基于使用正交奇偶校验码形成的列方程生成奇偶校验矩阵而增加，并且包括改变每列的高阶乘法器。选择较高阶乘数以产生预定数量的元素的有限基本场。阵列具有M行和N列，使得M大于或等于3，N大于或等于3。阵列的行1至行M-2各自具有n-p个数据存储设备和p个奇偶校验存储设备。该阵列的行M-1具有n（p + 1）数据存储设备和（p + 1）奇偶校验存储设备。最后，数组的行M具有N个奇偶校验存储设备。

27. 发明授权

US06288861B1 Disk drive with sector numbers encoded by sequences of sector types 失效
标题翻译：扇区编号由扇区类型序列编码的磁盘驱动器
公开(公告)号：US06288861B1
公开(公告)日：2001-09-11
申请号：US09153591
申请日：1998-09-15
申请人： Mario Blaum , Steven R. Hetzler , William John Kabelac
发明人： Mario Blaum , Steven R. Hetzler , William John Kabelac
IPC分类号： G11B509
CPC分类号： H03M13/47 , G11B5/553 , G11B5/59655 , G11B20/18 , G11B27/3027 , G11B2220/20
摘要： A magnetic recording disk drive has head positioning servo sectors with servo sector numbers (SSNs) that are not recorded on the disk. The SSNs are encoded through the use of multiple servo sector types that are arranged in a specific sequence around the data tracks. The different servo sector types are identified by unique types of servo timing marks (STMs), which are used to locate the servo sectors. The SSNs that are used to identify the servo sectors on the track form a set or code of m fixed n-bit patterns. A SSN is determined when the STM types read from n sequential servo sectors match one of the fixed SSN pattems. A set or code of m servo sectors, where each servo sector is identified by a unique SSN pattern having length n, is denoted as an (m,n,d) code, where d is referred to as the minimum Hamming distance of the code. The Hamming distance between two patterns refers to the number of locations that are different between the two pattems.
摘要翻译：磁记录盘驱动器具有磁头定位伺服扇区，伺服扇区号（SSN）不记录在磁盘上。通过使用以数据轨道周围的特定序列排列的多个伺服扇区类型对SSN进行编码。不同的伺服扇区类型由用于定位伺服扇区的唯一类型的伺服定时标记（STM）来识别。用于识别轨道上的伺服扇区的SSN形成m个固定n位模式的集合或代码。当从n个顺序伺服扇区读取的STM类型与固定SSN模式之一匹配时，确定SSN。通过具有长度为n的唯一SSN模式识别每个伺服扇区的m个伺服扇区的集合或码被表示为（m，n，d）码，其中d被称为码的最小汉明距离。两种模式之间的汉明距离是指两种模式之间不同的位置数。

28. 发明授权

US5526211A Banded magnetic recording disk with equally-angularly-spaced servo sector 失效
标题翻译：带有等角度间隔的伺服扇区的带状磁记录盘
公开(公告)号：US5526211A
公开(公告)日：1996-06-11
申请号：US472598
申请日：1995-06-07
申请人： Steven R. Hetzler
发明人： Steven R. Hetzler
IPC分类号： G11B20/10 , G11B20/12 , G11B20/14 , G11B21/10 , G11B27/30 , G11B5/82 , G11B5/09 , G11B5/596
CPC分类号： G11B20/10 , G11B20/1201 , G11B20/1258 , G11B27/3027 , G11B5/59655 , G11B2020/1087 , G11B2020/10879 , G11B2020/10916 , G11B2020/1257 , G11B2020/1282 , G11B2220/20 , G11B2220/90
摘要： 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 mark or 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.
摘要翻译：描述了一种方法和装置，其中写在磁盘上的伺服扇区（或写在磁带上的伺服部分）在给定磁道上等间隔，并在寻道，定位和跟踪跟随操作期间读取。使用算法来确定轨道上的伺服扇区（或部分）和可以容纳在磁盘或磁带上的相关联的数据段（例如数据扇区或可变长度记录）的长度之间的允许时间间隔，使得每个在给定磁道上等距间隔的伺服扇区（或部分）位于数据扇区的数据区域内或位于识别区域内，或位于地址指示标记（例如地址标记或索引标记）之后。伺服扇区（或部分）采样的速率是恒定的，与数据段的数量和长度无关。作为这种独立关系的结果，该技术适用于CLD记录，使用传统FBA中的分区伺服的带状磁盘，甚至适用于诸如计数密钥数据（CKD）的非分段架构，其中数据以可变长度记录，以及以FBA或CKD格式化的磁带驱动器。

29. 发明授权

US08989507B2 Bitmap compression for fast searches and updates 有权
标题翻译：用于快速搜索和更新的位图压缩
公开(公告)号：US08989507B2
公开(公告)日：2015-03-24
申请号：US12830374
申请日：2010-07-05
申请人： Mario Blum , Alberto Nunez Covarrubias , Steven R. Hetzler
发明人： Mario Blum , Alberto Nunez Covarrubias , Steven R. Hetzler
IPC分类号： G06K9/36 , H03M7/30 , G06F17/30
CPC分类号： G06F17/30153 , G06F17/30324 , H03M7/30
摘要： Bitmap compression for fast searches and updates is provided. Compressing a bitmap includes receiving a bitmap to compress, and reading the bitmap to determine a value of a bit location for all bits in the bitmap. In one embodiment, a compressed bitmap is created by encoding a variable number of bytes to represent a distance between adjacent 1s in the uncompressed bitmap. In another embodiment, a compressed bitmap is created by representing a distance between adjacent 1s in the uncompressed bitmap using a plurality of bits, and encoding a marker word to indicate the number of bits used to represent the distance.
摘要翻译：提供了快速搜索和更新的位图压缩。压缩位图包括接收位图以进行压缩，并读取位图以确定位图中所有位的位位置值。在一个实施例中，通过对可变数量的字节进行编码以形成未压缩位图中相邻1之间的距离来创建压缩位图。在另一个实施例中，通过使用多个比特表示未压缩位图中的相邻1之间的距离来创建压缩位图，并且对标记词进行编码以指示用于表示距离的比特数。

30. 发明授权

US08874995B2 Partial-maximum distance separable (PMDS) erasure correcting codes for storage arrays 有权
标题翻译：用于存储阵列的部分最大距离可分离（PMDS）擦除校正码
公开(公告)号：US08874995B2
公开(公告)日：2014-10-28
申请号：US13364390
申请日：2012-02-02
申请人： Mario Blaum , James L. Hafner , Steven R. Hetzler
发明人： Mario Blaum , James L. Hafner , Steven R. Hetzler
IPC分类号： G11C29/00 , G06F11/10
CPC分类号： G06F11/1076 , G06F11/108 , G06F11/1092 , G06F2211/1057 , G06F2211/1059 , H03M13/033
摘要： Embodiments of the invention relate to storing data in a storage array. An aspect of the invention includes receiving and arranging read data in array that includes m rows and n columns of entries, with each entry including at least one sector. In the array, mr+s locations are assigned to parity entries, such that each row has at least r parity entries. The parity entries correspond to a partial-maximum distance separable (PMDS) code that allows recovery from up to r erasures in each of the m rows as well as s additional erasures in any locations in the data array, where s is an integer greater than zero. The write data and the associated parity entries are written to the set of storage devices.
摘要翻译：本发明的实施例涉及将数据存储在存储阵列中。本发明的一个方面包括接收和排列包括m行和n列条目的阵列中的读取数据，其中每个条目包括至少一个扇区。在阵列中，mr + s位置被分配给奇偶校验项，使得每行至少具有r个奇偶校验项。奇偶校验条目对应于部分最大距离可分离（PMDS）码，其允许从m行中的每个m行中恢复到最多的擦除以及在数据阵列中的任何位置的附加擦除，其中s是大于零。将写入数据和相关联的奇偶校验条目写入存储设备集合。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式