公开(公告)号：US5884313A

公开(公告)日：1999-03-16

申请号：US885058

申请日：1997-06-30

Applicant: Madhusudhan Talluri ,  Marshall C. Pease ,  Srinivasan Viswanathan

Inventor： Madhusudhan Talluri ,  Marshall C. Pease ,  Srinivasan Viswanathan

IPC: G06F15/17 ,  G06F9/46 ,  G06F12/02 ,  G06F13/28 ,  H04L12/56 ,  H04L29/06 ,  G06F17/30

CPC classification number: H04L49/9063 ,  G06F12/0284 ,  G06F12/0292 ,  G06F13/28 ,  H04L29/06 ,  H04L49/90 ,  H04L49/9057 ,  H04L49/9073 ,  H04L67/42 ,  Y10S707/922 ,  Y10S707/966 ,  Y10S707/99945 ,  Y10S707/99952 ,  Y10S707/99953

Abstract: When a client computer requests data from a disk or similar device at a server computer, the client exports the memory associated with an allocated read buffer by generating and storing one or more incoming MMU (IMMU) entries that map the read buffer to an assigned global address range. The remote data read request, along with the assigned global address range is communicated to the server node. At the server, the request is serviced by performing a memory import operation, in which one or more outgoing MMU (OMMU) entries are generated and stored for mapping the global address range specified in the read request to a corresponding range of local physical addresses. The mapped local physical addresses in the server are not locations in the server's memory. The server then performs a DMA operation for directly transferring the data specified in the request message from the disk to the mapped local physical addresses. The DMA operation transmits the specified data to the server's network interface, at which the mapped local physical addresses to which the data is transferred are converted into the corresponding global addresses. The specified data with the corresponding global addresses are then transmitted to the client node. The client converts the global addresses in the received specified data into the local physical addresses corresponding to the allocated receive buffer, and stores the received specified data in the allocated receive buffer.

公开(公告)号：US09432485B2

公开(公告)日：2016-08-30

申请号：US14214611

申请日：2014-03-14

Applicant: Srinivasan Viswanathan

Inventor： Srinivasan Viswanathan

IPC: H04L29/06 ,  G06F17/30

CPC classification number: H04L67/42 ,  G06F17/30091

Abstract: In one exemplary embodiment, a method includes the step of instantiating, with at least one processor, a storage object. The storage object includes a unique identifier, a data element and a virtual storage object. The virtual storage object is formed in the storage object. The virtual storage object includes a virtual data element. A set of kernel functions of a client-side computing system utilizing the application-orientedmiddleware layer are invoked. The set of kernel functions implement formation of an application data object. The application data object maps files and directories to the virtual storage object and integrates into a filesystem interface of an operating system of the client-side computing system. The application data object is formed. A data routing service of the application data object is initiated.

Abstract translation: 在一个示例性实施例中，一种方法包括用至少一个处理器实例化存储对象的步骤。 存储对象包括唯一标识符，数据元素和虚拟存储对象。 虚拟存储对象形成在存储对象中。 虚拟存储对象包括虚拟数据元素。 调用利用面向应用的中间件层的客户端计算系统的一组内核函数。 内核函数集实现应用程序数据对象的形成。 应用程序数据对象将文件和目录映射到虚拟存储对象，并将其集成到客户端计算系统的操作系统的文件系统接口中。 形成应用程序数据对象。 启动应用程序数据对象的数据路由服务。

公开(公告)号：US07979633B2

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

申请号：US10817212

申请日：2004-04-02

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: G06F12/16

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阵列中的存储块。 该方法包括接收与数据相关联的多个写入请求，并缓冲写入请求。 文件系统根据磁盘拓扑信息定义一组存储块。 该组包括多个存储装置中的每一个中的多个存储块。 要写入的数据的每个数据块与相应的一个存储块相关联，用于将关联发送到多个存储设备。

公开(公告)号：US07831864B1

公开(公告)日：2010-11-09

申请号：US12123385

申请日：2008-05-19

Applicant: Scott Schoenthal ,  Srinivasan Viswanathan

Inventor： Scott Schoenthal ,  Srinivasan Viswanathan

IPC: G06F11/00 ,  G06F11/36

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

公开(公告)号：US07685462B1

公开(公告)日：2010-03-23

申请号：US11970784

申请日：2008-01-08

Applicant: James Leong ,  Scott Schoenthal ,  Srinivasan Viswanathan ,  Rajesh Sundaram

Inventor： James Leong ,  Scott Schoenthal ,  Srinivasan Viswanathan ,  Rajesh Sundaram

IPC: G06F11/00

CPC classification number: G06F11/2087

Abstract: A method for operating a data storage system is described. The method first constructs an I/O tree representing a logical configuration of storage devices coupled to the storage system, the I/O tree representing a flow of I/O operations to the storage devices. Elements of the I/O tree are represented by objects. A freeze condition is imposed on a selected object of the I/O tree in order to disable a portion of the storage devices serviced by the selected object. Configuration management operations are performed on the portion of the storage devices serviced by the selected object. The freeze condition is removed from the selected object in response to completion of the configuration management, in order to resume I/O operations to the portion of the storage devices serviced by the selected object.

Abstract translation: 描述了一种用于操作数据存储系统的方法。 该方法首先构建表示耦合到存储系统的存储设备的逻辑配置的I / O树，该I / O树表示到存储设备的I / O操作流。 I / O树的元素由对象表示。 对I / O树的所选对象施加冻结条件，以便禁用所选对象所服务的存储设备的一部分。 对所选对象所服务的存储设备的部分执行配置管理操作。 响应于配置管理的完成，从所选对象中删除冻结条件，以便恢复对所选对象所服务的存储设备的部分的I / O操作。

公开(公告)号：US07328306B1

公开(公告)日：2008-02-05

申请号：US11018940

申请日：2004-12-20

Applicant: Srinivasan Viswanathan ,  Douglas P. Doucette

Inventor： Srinivasan Viswanathan ,  Douglas P. Doucette

IPC: G06F12/00

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 sub-system 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 sub-system 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子系统的镜像。 当数据磁盘重新启动时，通过清除其相关位来将其标记为读/写。 当重新激活奇偶校验磁盘时，它也会通过清除它的位来标记为读/写，但是它不可用，直到它与其镜像同步其操作。

公开(公告)号：US07254813B2

公开(公告)日：2007-08-07

申请号：US10105079

申请日：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 ,  G06F12/00 ,  G06F11/00 ,  G06F3/00

CPC classification number: G06F3/0601 ,  G06F2003/0697

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任务有前进的进程，并确保资源不会成为死锁。

公开(公告)号：US07143249B2

公开(公告)日：2006-11-28

申请号：US10225453

申请日：2002-08-19

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

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

IPC: G06F12/16 ,  G06F11/07

CPC classification number: G06F11/2082 ,  G06F11/1471

Abstract: In one embodiment, a first storage device and a second storage device form a mirror. When the first storage device loses synchronization with the second storage device, data present in the second storage device but not in the first storage device are identified. The identified data are then copied to the first storage device. In one embodiment, a method of rebuilding data in a storage device includes the act of replacing a failed storage device with a replacement storage device. Up-to-date data for the failed storage device, which may be stored in a corresponding mirror, may then be copied to the replacement storage device. Thereafter, the replacement storage device and any other storage devices that have lost synchronization with their mirror are resynchronized.

公开(公告)号：US07072916B1

公开(公告)日：2006-07-04

申请号：US09642061

申请日：2000-08-18

Applicant: Blake Lewis ,  John K. Edwards ,  Srinivasan Viswanathan

Inventor： Blake Lewis ,  John K. Edwards ,  Srinivasan Viswanathan

IPC: G06F12/00

CPC classification number: G06F11/14 ,  G06F11/1435 ,  G06F2201/84 ,  Y10S707/99931 ,  Y10S707/99956

Abstract: An improved method and apparatus for creating a snapshot of a file system. A record of which blocks are being used by a snapshot is included in the snapshot itself, allowing effectively instantaneous snapshot creation and deletion. The state of the active file system is described by a set of metafiles; in particular, a bitmap (henceforth the “active map”) describes which blocks are free and which are in use. The inode file describes which blocks are used by each file, including the metafiles. The inode file itself is described by a special root inode, also known as the “fsinfo block”. The system begins creating a new snapshot by making a copy of the root inode. This copy of the root inode becomes the root of the snapshot.

Abstract translation: 用于创建文件系统的快照的改进的方法和装置。 快照中包含哪些块正在使用的记录，可以有效地创建和删除快照。 活动文件系统的状态由一组元文件描述; 特别地，位图（以下称为“活动地图”）描述了哪些块是空闲的并且正在使用中。 inode文件描述每个文件使用哪些块，包括图元文件。 inode文件本身由一个特殊的根节点（也称为“fsinfo块”）描述。 系统通过创建根inode的副本开始创建新的快照。 根inode的这个副本成为快照的根。

公开(公告)号：US08621465B2

公开(公告)日：2013-12-31

申请号：US13048513

申请日：2011-03-15

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/50 ,  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任务。