Patents by Inventor Scott Schoenthal
Scott Schoenthal has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7328144Abstract: A system and method for simulating a software protocol stack over an emulated network using an emulated protocol. A storage operating system simulator, executing on a host computer, includes an interconnect communication stack that utilizes an emulated protocol over an emulated network to communicate with another storage operating system simulator configured in a cluster configuration.Type: GrantFiled: April 28, 2004Date of Patent: February 5, 2008Assignee: Network Appliance, Inc.Inventors: James R. Grier, Scott Schoenthal
-
Patent number: 7328364Abstract: A technique coherently suspends input/output (I/O) operations in a RAID subsystem of a storage system. A configuration tree of the RAID subsystem has a plurality of objects representing a logical configuration of storage devices coupled to the system. According to the technique, a “freeze” condition may be imposed on an object of the configuration tree to suspend I/O operations directed to that object. In order to freeze, I/O operations underway (“in flight”) in the RAID subsystem and directed to the object need to complete sufficiently so as to reach a recoverable state in the event the subsystem subsequently fails prior to an I/O restart procedure. Once a freeze condition has been imposed, new I/O requests directed to the object are inserted onto a freeze list of pending requests at the RAID subsystem and are blocked from processing until the object is “unfrozen” (i.e., the freeze condition is lifted).Type: GrantFiled: March 21, 2003Date of Patent: February 5, 2008Assignee: Network Appliance, Inc.Inventors: James Leong, Scott Schoenthal, Srinivasan Viswanathan, Rajesh Sundaram
-
Patent number: 7254813Abstract: 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.Type: GrantFiled: March 21, 2002Date of Patent: August 7, 2007Assignee: Network Appliance, Inc.Inventors: James Leong, Rajesh Sundaram, Douglas P. Doucette, Scott Schoenthal, Stephen H. Strange, Srinivasan Viswanathan
-
Publication number: 20060271734Abstract: A storage operating system is configured to assign volume block numbers (VBNs) to a volume. The system has a plurality of disks, and each disk of the plurality of disks is assigned disk block numbers (DBNs). A raidmap is configured to map the VBNs to the DBNs of the plurality of physical disks, the mapping for a particular disk stored in a disk label for the particular disk. The disk label for the particular disk is then written to the particular disk.Type: ApplicationFiled: August 2, 2006Publication date: November 30, 2006Inventors: Stephen Strange, Scott Schoenthal, Douglas Doucette, Srinivasan Viswanathan
-
Patent number: 7143235Abstract: A technique forecasts the behavior of a RAID subsystem when processing a proposed configuration management request that modifies a topology or attribute configuration, e.g., RAID groups and volume layout, of a storage array managed by the subsystem. In response to the proposed request, the RAID subsystem returns a set of projected result data instead of committing the request to the storage array configuration. An operator issues the proposed request in accordance with a novel view-only mode of a configuration management command. The view-only mode is manifested as an “-n” option that instructs a configuration thread of the RAID subsystem to return pre-committed results without actually committing the modification.Type: GrantFiled: March 21, 2003Date of Patent: November 28, 2006Assignee: Network Appliance, Inc.Inventors: Steven S. Watanabe, Stephen H. Strange, Scott Schoenthal
-
Patent number: 7111147Abstract: 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.Type: GrantFiled: March 21, 2003Date of Patent: September 19, 2006Assignee: Network Appliance, Inc.Inventors: Stephen H. Strange, Scott Schoenthal, Douglas P. Doucette, Srinivasan Viswanathan
-
Patent number: 7111194Abstract: A technique includes a set of procedures utilized during the transfer of service of a failed storage system to a surviving storage system of a cluster failover (CFO) configuration during a system outage, such as a disaster scenario. The procedures are executed by a RAID subsystem of the surviving storage system during disaster takeover, storage healing and node restart operations. The procedures prevent the possibility that clients accessing the storage system will see out-of-date versions of the data either during transfer of service of the system during the disaster scenario or subsequently after the storage system is healed and service on the failed system has been restored.Type: GrantFiled: March 21, 2003Date of Patent: September 19, 2006Assignee: Network Appliance, Inc.Inventors: Scott Schoenthal, Steven H. Rodrigues, Alan L. Rowe, Joydeep sen Sarma, Susan M. Coatney
-
Patent number: 6976189Abstract: 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.Type: GrantFiled: March 22, 2002Date of Patent: December 13, 2005Assignee: Network Appliance, Inc.Inventors: Scott Schoenthal, Srinivasan Viswanathan
-
Patent number: 6920580Abstract: The invention is a method for operating a file server system in a cluster mode that provides for relatively rapid and reliable takeover of a failed file server in the cluster by a partner file server when the failed file server has detected a fault that will cause it to shut down. This is done by the failed file server requesting the one file server to take over its file services after detecting the fault in its operations, the one file server letting the failed file server complete existing file service requests from clients, refusing further file service requests addressed to the failed file server, and the one file server taking over by transferring file service requests to the one file server. As part of this takeover the one file server takes on the identity of the failed filer and activates network interfaces and network addresses that replicate the failed server's network addresses.Type: GrantFiled: August 20, 2001Date of Patent: July 19, 2005Assignee: Network Appliance, Inc.Inventors: Samuel M. Cramer, Scott Schoenthal
-
Patent number: 6910154Abstract: The invention provides a method and system for persistent and reliable delivery of event messages. Those parts of the system responsible for delivering event messages are able to persistently maintain those event messages until the intended recipient of the event message confirms delivery of those event messages. Those parts of the system responsible for recovering from system crashes and other system errors are able to persistently maintain those event messages until delivery, even after recovery from system crashes or other system errors. The system includes a set of event message producers, and maintains an event-indication queue of those event messages provided by the event producers using a set of pre-allocated resources. An event-distribution engine distributes event messages to intended recipients and, after having received confirmation that the event messages were received, removes them from the event-indication queue.Type: GrantFiled: August 18, 2000Date of Patent: June 21, 2005Assignee: Network Appliance, Inc.Inventor: Scott Schoenthal
-
Publication number: 20050114593Abstract: A query-based spares management technique enables a storage operating system of a storage system to select disks to be added to one or more RAID groups of a volume. The spares management technique includes an attributes-based disk selection procedure that is performed by the storage operating system in response to an operator-initiated request to add disks to the volume or in response to a demand-driven request resulting from a requirement imposed by the system to add disks to the volume. The disks that are added to the RAID groups of the volume are retrieved from one or more spare pools of disks maintained by the storage system.Type: ApplicationFiled: March 21, 2003Publication date: May 26, 2005Inventors: Loellyn Cassell, Sunitha Sankar, Scott Schoenthal
-
Patent number: 6829720Abstract: The invention provides a storage system, and a method for operating a storage system, that provides for relatively rapid and reliable takeover among a plurality of independent file servers. Each file server maintains a reliable communication path to the others. Each file server maintains its own state in reliable memory. Each file server regularly confirms the state of the other file servers. Each file server labels messages on the redundant communication paths, so as to allow other file servers to combine the redundant communication paths into a single ordered stream of messages. Each file server maintains its own state in its persistent memory and compares that state with the ordered stream of messages, so as to determine whether other file servers have progressed beyond the file server's own last known state.Type: GrantFiled: December 16, 2002Date of Patent: December 7, 2004Assignee: Network Appliance, Inc.Inventors: Scott Schoenthal, Alan Rowe, Steven R. Kleiman
-
Patent number: 6728897Abstract: The invention provides a method and system in which a node in a 2-node high availability cluster can declare itself impaired. In doing so, an impaired node can self diagnose or request another node in the cluster assist in diagnosing the problem. An impaired node can then request another node takeover the impaired node's tasks whereby the impaired node is able to shut down gracefully.Type: GrantFiled: July 25, 2000Date of Patent: April 27, 2004Assignee: Network Appliance, Inc.Inventors: Samuel M. Cramer, Scott Schoenthal
-
Publication number: 20030182349Abstract: 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.Type: ApplicationFiled: March 21, 2002Publication date: September 25, 2003Inventors: James Leong, Rajesh Sundaram, Douglas P. Doucette, Scott Schoenthal, Stephen H. Strange, Srinivasan Viswanathan
-
Publication number: 20030182503Abstract: 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.Type: ApplicationFiled: March 21, 2002Publication date: September 25, 2003Inventors: James Leong, Douglas P. Doucette, Scott Schoenthal, Stephen H. Strange, Rajesh Sundaram, Srinivasan Viswanathan
-
Publication number: 20030149812Abstract: The invention provides a storage system, and a method for operating a storage system, that provides for relatively rapid and reliable takeover among a plurality of independent file servers. Each file server maintains a reliable communication path to the others. Each file server maintains its own state in reliable memory. Each file server regularly confirms the state of the other file servers. Each file server labels messages on the redundant communication paths, so as to allow other file servers to combine the redundant communication paths into a single ordered stream of messages. Each file server maintains its own state in its persistent memory and compares that state with the ordered stream of messages, so as to determine whether other file servers have progressed beyond the file server's own last known state.Type: ApplicationFiled: December 16, 2002Publication date: August 7, 2003Applicant: Network Appliance, Inc.Inventors: Scott Schoenthal, Alan Rowe, Steven R. Kleiman
-
Patent number: 6496942Abstract: The invention provides a storage system, and a method for operating a storage system, that provides for relatively rapid and reliable takeover among a plurality of independent file servers. Each file server maintains a reliable communication path to the others. Each file server maintains its own state in reliable memory. Each file server regularly confirms the state of the other file servers. Each file server labels messages on the redundant communication paths, so as to allow other file servers to combine the redundant communication paths into a single ordered stream of messages. Each file server maintains its own state in its persistent memory and compares that state with the ordered stream of messages, so as to determine whether other file servers have progressed beyond the file server's own last known state.Type: GrantFiled: September 8, 2000Date of Patent: December 17, 2002Assignee: Network Appliance, Inc.Inventors: Scott Schoenthal, Alan Rowe, Steven R. Kleiman
-
Patent number: 6119244Abstract: The invention provides a storage system, and a method for operating a storage system, that provides for relatively rapid and reliable takeover among a plurality of independent file servers. Each file server maintains a reliable communication path to the others. Each file server maintains its own state in reliable memory. Each file server regularly confirms the state of the other file servers. Each file server labels messages on the redundant communication paths, so as to allow other file servers to combine the redundant communication paths into a single ordered stream of messages. Each file server maintains its own state in its persistent memory and compares that state with the ordered stream of messages, so as to determine whether other file servers have progressed beyond the file server's own last known state.Type: GrantFiled: August 25, 1998Date of Patent: September 12, 2000Assignee: Network Appliance, Inc.Inventors: Scott Schoenthal, Alan Rowe, Steven R. Kleiman