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

1. 发明授权

US08443153B1 Dynamic balancing of performance with block sharing in a storage system 有权
标题翻译：在存储系统中动态平衡性能与块共享
公开(公告)号：US08443153B1
公开(公告)日：2013-05-14
申请号：US12683385
申请日：2010-01-06
申请人： John K. Edwards , Keith A. Smith , Jiri Schindler , Steven R. Kleiman
发明人： John K. Edwards , Keith A. Smith , Jiri Schindler , Steven R. Kleiman
IPC分类号： G06F12/00
CPC分类号： G06F17/30091 , G06F3/0611 , G06F3/064 , G06F3/067 , G06F11/1076
摘要： A storage system provides highly flexible data layouts that can be tailored to various different applications and use cases. The system dynamically balances performance with block sharing, based on service level objectives (SLOs). The system defines several types of data containers, including “regions”, “logical extents” and “slabs”. Each region includes one or more logical extents. Allocated to each logical extent is at least part of one or more slabs allocated to the region that includes the extent. Each slab is a set of blocks of storage from one or more physical storage devices. The slabs can be defined from a heterogeneous pool of physical storage. The system also maintains multiple “volumes” above the region layer. Each volume includes one or more logical extents from one or more regions. Layouts of the extents within the regions are not visible to any of the volumes.
摘要翻译：存储系统提供高度灵活的数据布局，可以针对各种不同的应用程序和用例进行定制。系统根据服务水平目标（SLO）将性能与块共享动态平衡。系统定义了几种类型的数据容器，包括“区域”，“逻辑盘区”和“板”。每个区域包括一个或多个逻辑盘区。分配到每个逻辑范围的至少一部分是分配给包含该范围的区域的一个或多个slab。每个平板是来自一个或多个物理存储设备的一组存储块。板可以从物理存储的异构池定义。该系统还在区域层之上维护多个“体积”。每个卷包括来自一个或多个区域的一个或多个逻辑盘区。区域内的区域的布局对于任何卷都不可见。

2. 发明授权

US07003714B1 Dynamic data space 失效
标题翻译：动态数据空间
公开(公告)号：US07003714B1
公开(公告)日：2006-02-21
申请号：US10832100
申请日：2004-04-26
申请人： Rajesh Sundaram , Srinivvasan Viswanathan , Alan Rowe , Steven R. Kleiman , John K. Edwards
发明人： Rajesh Sundaram , Srinivvasan Viswanathan , Alan Rowe , Steven R. Kleiman , John K. Edwards
IPC分类号： G11C29/00
CPC分类号： G06F11/1076
摘要： A data storage system, such as RAID, upgraded dynamically including multiple stages, providing error checking data without taking the system off-line. Checksums are computed from the data and placed in block 63 of the same disk. The combination of parity bits across the parity disk, the remaining uncorrupted data in the data disks, and checksums within each disk includes sufficient information to enable restoration of corrupt data. The system is upgraded by reserving permanent checksum blocks, writing the checksums to a volume block number, and placing the checksums in permanently reserved checksum block locations after first moving data already there to unreserved blocks.
摘要翻译：诸如RAID的数据存储系统，动态地升级包括多级，提供错误检查数据而不使系统离线。校验和是根据数据计算的，并放在同一个磁盘的块63中。奇偶校验磁盘上的奇偶校验位的组合，数据磁盘中的其余未被破坏的数据以及每个磁盘内的校验和包括足够的信息以使恢复损坏的数据。通过保留永久校验和块，将校验和写入卷块号，并在首先将数据移动到未保留的块之后将校验和放置在永久保留的校验和块位置，升级系统。

3. 发明授权

US06728922B1 Dynamic data space 有权
标题翻译：动态数据空间
公开(公告)号：US06728922B1
公开(公告)日：2004-04-27
申请号：US09642062
申请日：2000-08-18
申请人： Rajesh Sundaram , Srinivvasan Viswanathan , Alan Rowe , Steven R. Kleiman , John K. Edwards
发明人： Rajesh Sundaram , Srinivvasan Viswanathan , Alan Rowe , Steven R. Kleiman , John K. Edwards
IPC分类号： G11C2900
CPC分类号： G06F11/1076
摘要： A data storage system, such as RAID, upgraded dynamically including multiple stages, providing error checking data without taking the system off-line. Checksums are computed from the data and placed in block 63 of the same disk. The combination of parity bits across the parity disk, the remaining uncorrupted data in the data disks, and checksums within each disk includes sufficient information to enable restoration of corrupt data. The system is upgraded by reserving permanent checksum blocks, writing the checksums to a volume block number, and placing the checksums in permanently reserved checksum block locations after first moving data already there to unreserved blocks.
摘要翻译：诸如RAID的数据存储系统，动态地升级包括多级，提供错误检查数据而不使系统离线。校验和是根据数据计算的，并放在同一个磁盘的块63中。奇偶校验磁盘上的奇偶校验位的组合，数据磁盘中的其余未被破坏的数据以及每个磁盘内的校验和包括足够的信息以使恢复损坏的数据。通过保留永久校验和块，将校验和写入卷块号，并在首先将数据移动到未保留的块之后将校验和放置在永久保留的校验和块位置，升级系统。

4. 发明授权

US08555022B1 Assimilation of foreign LUNS into a network storage system 有权
标题翻译：将外国LUNS同化到网络存储系统中
公开(公告)号：US08555022B1
公开(公告)日：2013-10-08
申请号：US12683390
申请日：2010-01-06
申请人： John K. Edwards , Steven R. Kleiman
发明人： John K. Edwards , Steven R. Kleiman
IPC分类号： G06F12/00
CPC分类号： G06F3/0689 , G06F3/0607 , G06F3/0614 , G06F3/0632 , G06F3/0646 , G06F3/067 , G06F3/0685 , G06F2212/205
摘要： A storage system provides highly flexible data layouts that can be tailored to various different applications and use cases. The system defines several types of data containers, including “regions”, “logical extents” and “slabs”. Each region includes one or more logical extents. Allocated to each logical extent is at least part of one or more slabs allocated to the region that includes the extent. Each slab is a set of blocks of storage from one or more physical storage devices. The slabs can be defined from a heterogeneous pool of physical storage. The system also maintains multiple “volumes” above the region layer. Each volume includes one or more logical extents from one or more regions. A foreign LUN can be assimilated into the system by defining slabs as separate portions of the foreign LUN. Layouts of the extents within the regions are not visible to any of the volumes.
摘要翻译：存储系统提供高度灵活的数据布局，可以针对各种不同的应用程序和用例进行定制。系统定义了几种类型的数据容器，包括“区域”，“逻辑盘区”和“板”。每个区域包括一个或多个逻辑盘区。分配到每个逻辑范围的至少一部分是分配给包含该范围的区域的一个或多个slab。每个平板是来自一个或多个物理存储设备的一组存储块。板可以从物理存储的异构池定义。该系统还在区域层之上维护多个“体积”。每个卷包括来自一个或多个区域的一个或多个逻辑盘区。外部LUN可以通过将slab定义为外部LUN的单独部分而被同化到系统中。区域内的区域的布局对于任何卷都不可见。

5. 发明申请

US20080243992A1 SYSTEM AND METHOD FOR BANDWIDTH OPTIMIZATION IN A NETWORK STORAGE ENVIRONMENT 有权
标题翻译：网络存储环境中的带宽优化的系统和方法
公开(公告)号：US20080243992A1
公开(公告)日：2008-10-02
申请号：US11694356
申请日：2007-03-30
申请人： Paul Jardetzky , Steven R. Kleiman , Roger Stager , Don Trimmer , Ling Zheng , Yuval Frandzel
发明人： Paul Jardetzky , Steven R. Kleiman , Roger Stager , Don Trimmer , Ling Zheng , Yuval Frandzel
IPC分类号： G06F15/16
CPC分类号： G06F17/30067
摘要： According to one or more embodiments of the present invention, a network cache intercepts data requested by a client from a remote server interconnected with the cache through one or more wide area network (WAN) links (e.g., for Wide Area File Services, or “WAFS”). The network cache stores the data and sends the data to the client. The cache may then intercept a first write request for the data from the client to the remote server, and determine one or more portions of the data in the write request that changed from the data stored at the cache (e.g., according to one or more hashes created based on the data). The network cache then sends a second write request for only the changed portions of the data to the remote server.
摘要翻译：根据本发明的一个或多个实施例，网络高速缓冲存储器通过一个或多个广域网（WAN）链路（例如，对于广域文件服务或“ WAFS“）。网络缓存存储数据并将数据发送给客户端。高速缓存然后可以拦截从客户端到远程服务器的数据的第一写入请求，并且确定写入请求中从存储在高速缓存中的数据改变的数据的一个或多个部分（例如，根据一个或多个基于数据创建哈希）。然后，网络缓存器将仅针对数据的改变的部分的第二写入请求发送到远程服务器。

6. 发明授权

US07257676B2 Semi-static distribution technique 有权
公开(公告)号：US07257676B2
公开(公告)日：2007-08-14
申请号：US11633900
申请日：2006-12-05
申请人： Peter F. Corbett , Steven R. Kleiman , Robert M. English
发明人： Peter F. Corbett , Steven R. Kleiman , Robert M. English
IPC分类号： G06F12/00 , G06F11/00
CPC分类号： G06F11/1096
摘要： A semi-static distribution technique distributes parity across disks of an array. According to the technique, parity is distributed (assigned) across the disks of the array in a manner that maintains a fixed pattern of parity blocks among the stripes of the disks. When one or more disks are added to the array, the semi-static technique redistributes parity in a way that does not require recalculation of parity or moving of any data blocks. Notably, the parity information is not actually moved; the technique merely involves a change in the assignment (or reservation) for some of the parity blocks of each pre-existing disk to the newly added disk.

7. 发明授权

US07096379B2 Recovery of file system data in file servers mirrored file system volumes 有权
公开(公告)号：US07096379B2
公开(公告)日：2006-08-22
申请号：US10719699
申请日：2003-11-21
申请人： Srinivasan Viswanathan , Steven R. Kleiman
发明人： Srinivasan Viswanathan , Steven R. Kleiman
IPC分类号： G06F11/00
CPC分类号： G06F11/2082 , G06F11/1471 , G06F11/2064 , Y10S707/99953 , Y10S707/99955
摘要： The invention provides a method and system for recovery of file system data in file servers having mirrored file system volumes. The invention makes use of a “snapshot” feature of a robust file system (the “WAFL File System”) disclosed in the Incorporated Disclosures, to rapidly determined which of two or more mirrored volumes is most up-to-date, and which file blocks of the most recent mirrored volume have been changed from each one of the mirrored file systems. In a preferred embodiment, among a plurality of mirrored volumes, the invention rapidly determines which is the most up-to-date by examining a consistency point number maintained by the WAFL File System at each mirrored volume. The invention rapidly pairwise determines what blocks are shared between that most up-to-date mirrored volume and each other mirrored volume, in response to a snapshot of the file system maintained at each mirrored volume and are stored in common pairwise between each mirrored volume and the most up-to-date mirrored volume. The invention re synchronizes only those blocks that have been changed between the common snapshot and the most up-to-date snapshot.

8. 发明授权

US07080278B1 Technique for correcting multiple storage device failures in a storage array 有权
标题翻译：用于校正存储阵列中多个存储设备故障的技术
公开(公告)号：US07080278B1
公开(公告)日：2006-07-18
申请号：US10094086
申请日：2002-03-08
申请人： Steven R. Kleiman , Robert M. English , Peter F. Corbett
发明人： Steven R. Kleiman , Robert M. English , Peter F. Corbett
IPC分类号： G06F11/00
CPC分类号： G06F11/1076
摘要： A technique efficiently corrects multiple storage device failures in a storage array. The storage array comprises a plurality of concatenated sub-arrays, wherein each sub-array includes a set of data storage devices and a local parity storage device that stores values used to correct a failure of a single device within a row of blocks, e.g., a row parity set, in the sub-array. Each sub-array is assigned diagonal parity sets identically, as if it were the only one present using a double failure protection encoding method. The array further includes a single, global parity storage device holding diagonal parity computed by logically adding together equivalent diagonal parity sets in each of the sub-arrays.
摘要翻译：一种技术有效地纠正了存储阵列中的多个存储设备故障。存储阵列包括多个级联子阵列，其中每个子阵列包括一组数据存储设备和本地奇偶校验存储设备，其存储用于校正一行块内的单个设备的故障的值，例如，一行奇偶校验集，在子数组中。每个子阵列被相同地分配对角奇偶校验集，好像它是使用双故障保护编码方法存在的唯一一个。阵列还包括保持对角奇偶校验的单个全局奇偶校验存储设备，其通过逻辑地将每个子阵列中的等效对角奇偶校验集合在一起而计算。

9. 发明授权

US06993701B2 Row-diagonal parity technique for enabling efficient recovery from double failures in a storage array 有权
公开(公告)号：US06993701B2
公开(公告)日：2006-01-31
申请号：US10035607
申请日：2001-12-28
申请人： Peter F. Corbett , Steven R. Kleiman , Robert M. English
发明人： Peter F. Corbett , Steven R. Kleiman , Robert M. English
IPC分类号： G11C29/00 , G06F11/00
CPC分类号： G06F11/1076
摘要： A “row-diagonal” (R-D) parity technique reduces overhead of computing diagonal parity for a storage array adapted to enable efficient recovery from the concurrent failure of two storage devices in the array. The diagonal parity is computed along diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the diagonal parity sets except one is stored on the diagonal parity disk. The R-D parity technique provides a uniform stripe depth and an optimal amount of parity information.

10. 发明授权

US5515538A Apparatus and method for interrupt handling in a multi-threaded operating system kernel 失效
标题翻译：多线程操作系统内核中的中断处理装置和方法
公开(公告)号：US5515538A
公开(公告)日：1996-05-07
申请号：US219428
申请日：1994-03-29
申请人： Steven R. Kleiman
发明人： Steven R. Kleiman
IPC分类号： G06F9/48 , G06F9/46
CPC分类号： G06F9/4812 , G06F9/52
摘要： The disclosed invention is a method and apparatus for use in handling interrupts in a data processing system where the kernel is preemptible, has real-time scheduling ability, and which supports multithreading and tightly-coupled multiprocessors. The invention more specifically provides a technique for servicing interrupts in a processor by means of kernel interrupt handler threads which service the interrupt from start to finish. For efficiency, the interrupt handler threads do not require a complete context switch unless the interrupt handler thread is blocked. The kernel makes use of preprepared interrupt handler threads for additional efficiency, and these interrupt handler threads are not subjected to inordinate delays caused by the phenomenon of interrupt priority inversion if they do become blocked.
摘要翻译：所公开的发明是用于处理数据处理系统中的中断的方法和装置，其中内核是可抢占的，具有实时调度能力，并且支持多线程和紧密耦合的多处理器。本发明更具体地提供了一种用于通过从开始到结束为中断服务的内核中断处理程序线程来维护处理器中的中断的技术。为了效率，中断处理程序线程不需要完整的上下文切换，除非中断处理程序线程被阻止。内核使用预准备的中断处理程序线程来提高额外的效率，如果这些中断处理程序线程被阻塞，这些中断处理程序线程将不会受到中断优先级倒置现象所引起的过度延迟。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式