公开(公告)号：US07926059B2

公开(公告)日：2011-04-12

申请号：US12465179

申请日：2009-05-13

Applicant: Srinivasan Viswanathan ,  James Leong ,  Rajesh Sundaram ,  Douglas P. Doucette ,  Scott Schoenthal ,  Stephen H. Strange

Inventor： Srinivasan Viswanathan ,  James Leong ,  Rajesh Sundaram ,  Douglas P. Doucette ,  Scott Schoenthal ,  Stephen H. Strange

IPC: G06F9/46 ,  G06F13/00

CPC classification number: G06F3/0601 ,  G06F3/061 ,  G06F3/0611 ,  G06F3/0655 ,  G06F3/0659 ,  G06F3/0689 ,  G06F9/4881 ,  G06F11/2087

Abstract: A data access request to a file system is decomposed into a plurality of lower-level I/O tasks. A logical combination of physical storage components is represented as a hierarchical set of objects. A parent I/O task is generated from a first object in response to the data access request. A child I/O task is generated from a second object to implement a portion of the parent I/O task. The parent I/O task is suspended until the child I/O task completes. The child I/O task is executed in response to an occurrence of an event that a resource required by the child I/O task is available. The parent I/O task is resumed upon an event indicating completion of the child I/O task. Scheduling of any child I/O task is not conditional on execution of the parent I/O task, and a state diagram regulates the child I/O tasks.

Abstract translation: 对文件系统的数据访问请求被分解成多个较低级的I / O任务。 物理存储组件的逻辑组合被表示为一组分层对象。 响应于数据访问请求，从第一对象生成父I / O任务。 从第二个对象生成子I / O任务，以实现父I / O任务的一部分。 父I / O任务被暂停，直到子I / O任务完成。 响应于发生子I / O任务所需的资源可用的事件，执行子I / O任务。 在指示完成子I / O任务的事件后，将恢复父I / O任务。 任何子I / O任务的调度不是执行父I / O任务的条件，而状态图则规定了子I / O任务。

公开(公告)号：US20090222829A1

公开(公告)日：2009-09-03

申请号：US12465179

申请日：2009-05-13

Applicant: James Leong ,  Rajesh Sundaram ,  Douglas P. Doucette ,  Scott Schoenthal ,  Stephen H. Strange ,  Srinivasan Viswanathan

Inventor： James Leong ,  Rajesh Sundaram ,  Douglas P. Doucette ,  Scott Schoenthal ,  Stephen H. Strange ,  Srinivasan Viswanathan

IPC: G06F9/46 ,  G06F12/08

CPC classification number: G06F3/0601 ,  G06F3/061 ,  G06F3/0611 ,  G06F3/0655 ,  G06F3/0659 ,  G06F3/0689 ,  G06F9/4881 ,  G06F11/2087

Abstract: A data access request to a file system is decomposed into a plurality of lower-level I/O tasks. A logical combination of physical storage components is represented as a hierarchical set of objects. A parent I/O task is generated from a first object in response to the data access request. A child I/O task is generated from a second object to implement a portion of the parent I/O task. The parent I/O task is suspended until the child I/O task completes. The child I/O task is executed in response to an occurrence of an event that a resource required by the child I/O task is available. The parent I/O task is resumed upon an event indicating completion of the child I/O task. Scheduling of any child I/O task is not conditional on execution of the parent I/O task, and a state diagram regulates the child I/O tasks.

Abstract translation: 对文件系统的数据访问请求被分解成多个较低级的I / O任务。 物理存储组件的逻辑组合被表示为一组分层对象。 响应于数据访问请求，从第一对象生成父I / O任务。 从第二个对象生成子I / O任务，以实现父I / O任务的一部分。 父I / O任务被暂停，直到子I / O任务完成。 响应于发生子I / O任务所需的资源可用的事件，执行子I / O任务。 在指示完成子I / O任务的事件后，将恢复父I / O任务。 任何子I / O任务的调度不是执行父I / O任务的条件，而状态图则规定了子I / O任务。

公开(公告)号：US07539991B2

公开(公告)日：2009-05-26

申请号：US10105078

申请日：2002-03-21

Applicant: James Leong ,  Rajesh Sundaram ,  Douglas P. Doucette ,  Scott Schoenthal ,  Stephen H. Strange ,  Srinivasan Viswanathan

Inventor： James Leong ,  Rajesh Sundaram ,  Douglas P. Doucette ,  Scott Schoenthal ,  Stephen H. Strange ,  Srinivasan Viswanathan

IPC: G06F9/46 ,  G06F3/00 ,  G06F9/44 ,  G06F13/00 ,  G06F13/28 ,  G06F11/00

CPC classification number: G06F3/0601 ,  G06F3/061 ,  G06F3/0611 ,  G06F3/0655 ,  G06F3/0659 ,  G06F3/0689 ,  G06F9/4881 ,  G06F11/2087

Abstract: The present invention implements an I/O task architecture in which an I/O task requested by the storage manager, for example a stripe write, is decomposed into a number of lower-level asynchronous I/O tasks that can be scheduled independently. Resources needed by these lower-level I/O tasks are dynamically assigned, on an as-needed basis, to balance the load and use resources efficiently, achieving higher scalability. A hierarchical order is assigned to the I/O tasks to ensure that there is a forward progression of the higher-level I/O task and to ensure that resources do not become deadlocked.

Abstract translation: 本发明实现了I / O任务架构，其中由存储管理器请求的I / O任务（例如条带写入）被分解成可以独立调度的多个较低级别的异步I / O任务。 这些较低级I / O任务所需的资源根据需要动态分配，以有效平衡负载和使用资源，实现更高的可扩展性。 分层次序分配给I / O任务，以确保上级I / O任务有前进的进程，并确保资源不会成为死锁。

公开(公告)号：US07386762B1

公开(公告)日：2008-06-10

申请号：US11241767

申请日：2005-09-30

Applicant: Scott Schoenthal ,  Srinivasan Viswanathan

Inventor： Scott Schoenthal ,  Srinivasan Viswanathan

IPC: G06F11/00

CPC classification number: G06F11/3672

Abstract: The invention provides a method and system for persistent context-based behavior injection in a computing system, such as in a redundant storage system or another system having a layered or modular architecture. Behaviors that are injected can be specified to have triggering conditions, such that the behavior is not injected unless the conditions are true. Triggering conditions may include a selected ordering of conditions and a selected context for each behavior. In a system having a layered architecture, behavior injection might be used to evaluate correct responses in the face of cascaded errors in a specific context or thread, other errors that are related by context, concurrent errors, or multiple errors. Behavior injection uses non-volatile memory to preserve persistence of filter context information across possible system errors, for reporting of the results of behavior injection, and to preserve information across recovery from system errors. Multiple behavior injection threads are also provided. Behavior injection can also be performed in a logically distributed system or from a logically remote system.

Abstract translation: 本发明提供了一种在诸如冗余存储系统或具有分层或模块化架构的另一系统的计算系统中用于持久上下文的行为注入的方法和系统。 注入的行为可以被指定为具有触发条件，使得行为不被注入，除非条件为真。 触发条件可以包括所选择的条件排序和针对每个行为的选择的上下文。 在具有分层架构的系统中，可以使用行为注入来评估在特定上下文或线程中的级联错误的正确响应，与上下文，并发错误或多个错误相关的其他错误。 行为注入使用非易失性存储器来保留跨可能的系统错误的过滤器上下文信息的持久性，用于报告行为注入的结果，并在跨系统错误的恢复中保留信息。 还提供了多行为注入线程。 行为注入也可以在逻辑分布式系统中或从逻辑上远程系统执行。

公开(公告)号：US07200715B2

公开(公告)日：2007-04-03

申请号：US10105034

申请日：2002-03-21

Applicant: Steven R. Kleiman ,  Rajesh Sundaram ,  Douglas P. Doucette ,  Stephen H. Strange ,  Srinivasan Viswanathan

Inventor： Steven R. Kleiman ,  Rajesh Sundaram ,  Douglas P. Doucette ,  Stephen H. Strange ,  Srinivasan Viswanathan

IPC: G06F13/28

CPC classification number: G06F3/0613 ,  G06F3/0643 ,  G06F3/0655 ,  G06F3/0689 ,  G06F11/1076

Abstract: The invention features a method for controlling storage of data in a plurality of storage devices each including storage blocks, for example, in a RAID array. The method includes receiving a plurality of write requests associated with data, and buffering the write requests. A file system defines a group of storage blocks, responsive to disk topology information. The group includes a plurality of storage blocks in each of the plurality of storage devices. Each data block of the data to be written is associated with a respective one of the storage blocks, for transmitting the association to the plurality of storage devices.

Abstract translation: 本发明的特征在于一种用于控制多个存储设备中的数据存储的方法，每个存储设备包括例如RAID阵列中的存储块。 该方法包括接收与数据相关联的多个写入请求，并缓冲写入请求。 文件系统根据磁盘拓扑信息定义一组存储块。 该组包括多个存储装置中的每一个中的多个存储块。 要写入的数据的每个数据块与相应的一个存储块相关联，用于将关联发送到多个存储设备。

公开(公告)号：US20060230236A1

公开(公告)日：2006-10-12

申请号：US11102339

申请日：2005-04-08

Applicant: Sheldon Finkelstein ,  Srinivasan Viswanathan ,  Robert Zak

Inventor： Sheldon Finkelstein ,  Srinivasan Viswanathan ,  Robert Zak

IPC: G06F12/00

CPC classification number: G06F12/0862 ,  G06F2212/6028

Abstract: A method for precognitive fetching, involving receiving an original request, performing pre-fetching analysis using the original request to obtain a pre-fetch request, forwarding the pre-fetch request to a storage subsystem, and receiving a response to the pre-fetch request from the storage subsystem.

Abstract translation: 一种用于预认证的方法，包括接收原始请求，使用原始请求执行预取分析以获得预取请求，将预取请求转发到存储子系统，以及接收对预取请求的响应 从存储子系统。

公开(公告)号：US07111147B1

公开(公告)日：2006-09-19

申请号：US10394890

申请日：2003-03-21

Applicant: Stephen H. Strange ,  Scott Schoenthal ,  Douglas P. Doucette ,  Srinivasan Viswanathan

Inventor： Stephen H. Strange ,  Scott Schoenthal ,  Douglas P. Doucette ,  Srinivasan Viswanathan

IPC: G06F11/07 ,  G06F12/16 ,  G06F12/08

CPC classification number: G06F3/0607 ,  G06F3/0643 ,  G06F3/0647 ,  G06F3/0665 ,  G06F3/0689 ,  G06F11/1092 ,  G06F11/2056 ,  G06F2211/1023 ,  H04L67/1097

Abstract: A technique maps the capacity of storage devices, such as disks, into any RAID group of a volume of a storage system regardless of the location of the RAID group within a volume block number (VBN) space of the volume. The technique separates disks and mapped VBN ranges, allowing for flexibility in the description and extension of RAID group capacities, while providing disk addition policies that support location-independent disk insertion into RAID groups. The technique also provides a disk label structure that supports the provision of multiple VBN ranges within a RAID group and within individual disks. Moreover, the technique provides file system support for allocation and topology management of the multiple mapped VBN ranges within disks and RAID groups, as well as noncontiguous VBN ranges across the RAID groups in the volume.

Abstract translation: 一种技术将诸如磁盘的存储设备的容量映射到存储系统的卷的任何RAID组中，而不管该卷的卷块号（VBN）空间内的RAID组的位置如何。 该技术分离磁盘和映射的VBN范围，允许在RAID组容量的描述和扩展方面具有灵活性，同时提供支持位置无关磁盘插入RAID组的磁盘添加策略。 该技术还提供了一种磁盘标签结构，它支持在RAID组内和各个磁盘内提供多个VBN范围。 此外，该技术为磁盘和RAID组中的多个映射VBN范围以及卷中的RAID组之间的不连续的VBN范围提供文件系统支持。

公开(公告)号：US06836820B1

公开(公告)日：2004-12-28

申请号：US10084405

申请日：2002-02-25

Applicant: Srinivasan Viswanathan ,  Douglas P. Doucette

Inventor： Srinivasan Viswanathan ,  Douglas P. Doucette

IPC: G06F1200

CPC classification number: G06F11/1084 ,  G06F3/0605 ,  G06F3/0634 ,  G06F3/0689 ,  G06F11/2094 ,  G06F2211/103 ,  G06F2211/1061

Abstract: The invention provides flexible disabling of disk sets. One or more disks in a RAID subsystem may be identified as temporarily inactive. The disk or disks are then marked as inactive by setting one of a set of bits associated with each disk in the RAID subsystem. If an inactivated disk is a data disk, marking it as inactive also marks it as read only. If an inactivated disk is a parity disk, the RAID group to which it supplies parity is also inactivated and a file system must look to a mirror of the inactivated RAID subsystem for its data. When a data disk is reactivated it is marked as read/write by clearing its associated bit. When a parity disk is reactivated it is also marked as read/write by clearing its bit, however, it is not available for use until it has synchronized its operation with its mirror.

Abstract translation: 本发明提供了灵活的磁盘组禁用。 RAID子系统中的一个或多个磁盘可能被标识为暂时无效。 然后通过设置与RAID子系统中的每个磁盘相关联的一组位中的一个来将磁盘或磁盘标记为无效。 如果未激活的磁盘是数据磁盘，将其标记为不活动也将其标记为只读。 如果未激活的磁盘是奇偶校验磁盘，则其提供奇偶校验的RAID组也将被禁用，并且文件系统必须查看其数据的未激活RAID子系统的镜像。 当数据磁盘重新启动时，通过清除其相关位来将其标记为读/写。 当重新激活奇偶校验磁盘时，它也会通过清除它的位来标记为读/写，但是它不可用，直到它与其镜像同步其操作。

公开(公告)号：US6163806A

公开(公告)日：2000-12-19

申请号：US885024

申请日：1997-06-30

Applicant: Srinivasan Viswanathan ,  Siamak Nazari ,  Anil Swaroop ,  Yousef Khalidi

Inventor： Srinivasan Viswanathan ,  Siamak Nazari ,  Anil Swaroop ,  Yousef Khalidi

IPC: G06F13/14 ,  G06F9/445 ,  G06F13/10

CPC classification number: G06F9/4411

Abstract: A system and method are disclosed that provides transparent, global access to devices on a computer cluster. The present system generates unique device type (dev.sub.-- t) values for all devices and corresponding links between a global file system and the dev.sub.-- t values. The file system is modified to take advantage of this framework so that, when a user requests that a particular device, identified by its logical name, be opened, an operating system kernel queries the file system to determine that device's dev.sub.-- t value and then queries the a device configuration system (DCS) for the location (node) and identification (local address) of a device with that dev.sub.-- t value. Once it has received the device's location and identification, the kernel issues an open request to the host node for the device identified by the DCS. File system components executing on the host node, which include a special file system (SpecFS), handle the open request by returning to the kernel a handle to a special file object that is associated with the desired device. The kernel then returns to the requesting user a file descriptor that is mapped to the handle, through which the user can access the device.

Abstract translation: 公开了提供对计算机集群上的设备的透明的全局访问的系统和方法。 本系统为所有设备和全局文件系统与dev-t值之间的对应链路生成唯一的设备类型（dev-t）值。 修改文件系统以利用此框架，以便当用户请求通过其逻辑名称标识的特定设备被打开时，操作系统内核将查询文件系统以确定该设备的dev-t值，然后 用设备配置系统（DCS）查询具有该设备值的设备的位置（节点）和标识（本地地址）。 一旦接收到设备的位置和标识，内核向主机节点发出由DCS标识的设备的开放请求。 在主机节点（包括特殊文件系统（SpecFS））上执行的文件系统组件通过向内核返回与所需设备相关联的特殊文件对象的句柄来处理打开的请求。 内核然后向请求用户返回映射到句柄的文件描述符，用户可以通过该文件描述符访问设备。