会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Anamorphic codes
    • 变形码
    • US08386891B2
    • 2013-02-26
    • US12358593
    • 2009-01-23
    • Steven Robert HetzlerDaniel Felix Smith
    • Steven Robert HetzlerDaniel Felix Smith
    • H03M13/00
    • G06F11/1084G06F11/008G06F2211/1004G06F2211/1028
    • 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.
    • 通过使用称为闪避的技术来增加m个存储单元阵列的误差容限。 多个k个条纹被存储在存储单元阵列中,其中每个条带具有对应于具有最小汉明距离d = r + 1的对称码的n + r个元素。 条带的每个相应元件被存储在不同的存储单元上。 当供体条纹的最小距离与接收者条纹的最小距离之间的差异大于或等于2时,选择元素。所选择的元素也存储在不具有接收者条带的元素的存储单元上。 然后在所选元素上重建接收者条带的丢失元素。
    • 2. 发明申请
    • Anamorphic Codes
    • 变形码
    • US20090132890A1
    • 2009-05-21
    • US12358593
    • 2009-01-23
    • Steven Robert HetzlerDaniel Felix Smith
    • Steven Robert HetzlerDaniel Felix Smith
    • H03M13/05G06F11/10
    • G06F11/1084G06F11/008G06F2211/1004G06F2211/1028
    • 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.
    • 通过使用称为“闪避”的技术来增加m个存储单元阵列的误差容限。 多个k个条纹被存储在存储单元阵列中,其中每个条带具有对应于具有最小汉明距离d = r + 1的对称码的n + r个元素。 条带的每个相应元件被存储在不同的存储单元上。 当供体条纹的最小距离与接收者条纹的最小距离之间的差异大于或等于2时,选择元素。所选择的元素也存储在不具有接收者条带的元素的存储单元上。 然后在所选元素上重建接收者条带的丢失元素。
    • 7. 发明授权
    • Autonomic parity exchange
    • 自主平价交换
    • US07788569B2
    • 2010-08-31
    • US11778644
    • 2007-07-16
    • Steven Robert HetzlerDaniel Felix Smith
    • Steven Robert HetzlerDaniel Felix Smith
    • H03M13/00
    • G06F11/1076G06F2211/1057G06F2211/1059G06F2211/1064
    • Error tolerance is increased for a storage system having a plurality of arrays 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 and recipient information is then rebuilt from the recipient array on the selected 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 array is d≧2 before the donor array is selected from the plurality of arrays.
    • 通过使整个存储系统中的所选阵列中的本地冗余全局可用,具有多个阵列的存储系统的容错增加。 为了实现增加的误差容限,当供体阵列的最小距离和接收器阵列的最小距离之间的差异大于或等于2时,从多个阵列中选择供体阵列。供体存储单元被选择为 然后从所选择的存储单元上的接收者阵列重建供体阵列和接收者信息。 所选择的存储单元被指示为捐赠者阵列已经在丢失的信息被重建在所选择的存储单元之前被捐赠。 优选地,在从多个阵列中选择施主阵列之前,接收器阵列的最小汉明距离为d≥2。
    • 8. 发明授权
    • Anamorphic codes
    • 变形码
    • US07533325B2
    • 2009-05-12
    • US10619641
    • 2003-07-14
    • Steven Robert HetzlerDaniel Felix Smith
    • Steven Robert HetzlerDaniel Felix Smith
    • H03M13/00
    • G06F11/1084G06F11/008G06F2211/1004G06F2211/1028
    • 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.
    • 通过使用称为“闪避”的技术来增加m个存储单元阵列的误差容限。 多个k个条纹被存储在存储单元阵列中,其中每个条带具有对应于具有最小汉明距离d = r + 1的对称码的n + r个元素。 条带的每个相应元件被存储在不同的存储单元上。 当供体条纹的最小距离与接收者条纹的最小距离之间的差异大于或等于2时,选择元素。所选择的元素也存储在不具有接收者条带的元素的存储单元上。 然后在所选元素上重建接收者条带的丢失元素。
    • 9. 发明授权
    • Storage system cache with flash memory in a raid configuration that commits writes as full stripes
    • 存储系统高速缓存,带闪存的RAID配置,将写入作为完整条带
    • US08484408B2
    • 2013-07-09
    • US12981288
    • 2010-12-29
    • Steven Robert HetzlerDaniel Felix Smith
    • Steven Robert HetzlerDaniel Felix Smith
    • G06F12/00G06F13/00
    • G06F12/0868G06F11/1076G06F2211/1009G06F2212/2022
    • Embodiments of the invention relate to a storage system cache with flash memory units organized in a RAID configuration. An aspect of the invention includes a storage system with a storage cache that includes flash memory units organized in an array configuration. The storage system further includes an array controller that manages data access and data operations for the flash memory units and organizes data as full array stripes. The storage system also includes a storage cache controller, that includes a block line manager that buffers write data to be cached for a write operation until the storage cache controller has accumulated an array band, and commits write data to the array controller as full array stripes. The storage cache controller determines whether to store write data for a write in the storage cache and/or in the primary storage device and whether to access read data from the storage cache or from the primary storage device.
    • 本发明的实施例涉及具有以RAID配置组织的闪存单元的存储系统高速缓存。 本发明的一个方面包括具有包括以阵列配置组织的闪存单元的存储高速缓存的存储系统。 存储系统还包括阵列控制器,其管理闪存单元的数据访问和数据操作,并将数据组织为完整阵列条纹。 存储系统还包括存储高速缓存控制器,其包括块线路管理器,其缓冲用于写入操作的缓存写入数据,直到存储高速缓存控制器已经累积阵列频带,并且将数据写入数组控制器作为完整阵列条带 。 存储高速缓存控制器确定是否将存储写入数据存储在存储高速缓存和/或主存储设备中以及是否从存储高速缓存或从主存储设备访问读取数据。
    • 10. 发明授权
    • RAID 3+3
    • RAID 3 + 3
    • US08108750B2
    • 2012-01-31
    • US11747887
    • 2007-05-11
    • Steven Robert HetzlerDaniel Felix SmithShmuel Winograd
    • Steven Robert HetzlerDaniel Felix SmithShmuel Winograd
    • H03M13/00
    • G06F11/1076G06F2211/1057G06F2211/1059G06F2211/1064
    • 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 a 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 erasures of the data storage units and the check storage units can be corrected by the 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.
    • 包含三个数据存储单元,三个检查存储单元和耦合到三个数据的阵列控制器和三个检查存储单元的数据存储子系统可以容忍任何三个数据的故障,并且检查存储单元可能在存储在 数据存储子系统丢失。 信息作为对称的最大距离分离码存储在数据存储子系统上,例如Winograd码,里德所罗门码,EVENODD码或EVENODD码的导数。 阵列控制器确定检查存储单元的内容,使得数据存储单元和检查存储单元的任何三个擦除可以由阵列控制器校正。 阵列控制器仅使用六个IO操作来更新包含在任何一个数据存储单元和检查存储单元中的数据块。