Netapp, Inc.

Google Inc.

Network Appliance, Inc.

Randall David Smith

Stanley Luke

David A Grunwald

Arthur F Lent

Vitaly Revsin

Daniel Joseph Ellard

Hooman Vassef

Rebecca S Beaman

Don Bolinger

Salimah Addetia

Vaibhav Nivargi

A system and machine-implemented method is provided for generating an e-mail filter including receiving an indication of a selection of a simple filter representing a filter criterion and a placement of the simple filter icon within a display area displaying a visual representation of a collection of e-mail filters corresponding to the user, receiving an indication of a selection of an action icon representing an action to be performed with respect to an e-mail message and a placement of the action icon within the filter display area with respect to the simple filter icon, the placement representing a connection of the action icon with the simple filter icon, generating an e-mail filter comprising one or more filter criteria including the filter criterion in response to receiving the indication of the placement of the action icon and assigning the action to the e-mail filter.

System and method for visual display of E-mail filters

The present invention provides a system and method for creating and accessing a copy of one or more host-accessible storage entities contained in a persistent consistency point image (PCPI) of a volume served by a storage system. The storage entity may comprise a file system, logical volume, volume group, or 'file system on raw device'. The copy of the storage entity is generated using a logical unit number (lun) copying technique in conjunction with a PCPI table of contents (PTOC). The PTOC contains data describing contents of the PCPI, including luns of the storage entity. The PTOC is written to the volume of the storage system, which is configured to store the luns, i.e., in the context of an active file system, immediately prior to generation of the PCPI. After generation of the PCPI, the PTOC is deleted from the volume such that it is only stored within the PCPI and not within the active file system.

System and method for creating and accessing a host-accessible storage entity

An updateable list is provided for use in mounting a storage volume. Such list may include a plurality of block references capable of being used to access corresponding blocks required for mounting the storage volume. In use, such list may be utilized for accessing the blocks in a more efficient manner, by accessing a plurality of such blocks in parallel, as well as performing the block accessing and storage volume mounting in parallel.

System and method for mounting a storage volume utilizing a block reference list

System and method for visual display of e-mail filters

On or more techniques and/or systems are provided for rapidly resuming processing of client requests after a system failure event. Accordingly, during a boot-up process, a storage system, upon detecting a system failure event of the storage system, conditions its system memory to reflect a state of the system memory at a time of the failure by processing client requests or commands stored in a non-volatile operations log. The storage system can resume processing client requests after processing the operations in the nonvolatile operations log and prior to flushing data to storage devices.

Recovering from a system failure

An initialization process in a storage server is made more efficient by at least partially avoiding serial and/or sequential access to the data blocks that are needed for such process. To accomplish this, the blocks needed for the initialization process are identified prior to performing the initialization process. The blocks or a list of references to the blocks are stored in a non-volatile solid-state memory, such as a flash-based memory, that is separate from the main drive subsystem and has a much shorter power-up and read-access time than the main drive subsystem. The list or stored set of blocks may be used to access the blocks more efficiently when needed, by accessing two or more of such blocks in parallel, as well as performing block accessing and volume mounting in parallel.

Non-volatile solid-state memory based adaptive playlist for storage system initialization operations

A method and apparatus for delaying the process of freeing data blocks during the processing of a non-volatile transactions log are disclosed. Accordingly, after a system failure, when a storage system is replaying transactions in a non-volatile transactions log, the storage system flushes the data generated from the transactions to disk storage without freeing and data blocks which, as a result of processing the transactions log, are no longer storing data that is part of the active file system. Consequently, the replay of the transactions log takes less time, and the storage system is brought online more quickly.

Storage system and method for rapidly recovering from a system failure

An apparatus and method for rapidly resuming the processing of client requests after a system failure event are disclosed. Accordingly, a surviving storage system, upon detecting a system failure event at a partner storage system, executes a takeover routine and conditions its system memory to reflect the state of the system memory of the failed storage system by processing client requests or commands stored in an operations log mirror. Then, the storage system converts the unused portion of the log mirror for use as an operations log, and resumes processing client requests prior to flushing any data to storage devices.

Surviving storage system takeover by replaying operations in an operations log mirror

An efficient method and apparatus for storing and retrieving memory ranges is disclosed. A key range that is stored or to be stored is associated with a node in the tree hierarchy encompassing the entire memory address space. All previously stored ranges are listed or otherwise associated with each node, and all possible nodes that may contain ranges that overlap the key range, regardless of starting or ending locations or range length, are found. Partitions are developed in the tree structure of the available address space and the width of the key range (w), the widths of the partitions (d), and the range of offsets in the starting location of the key range with respect to a partition (o) are used to develop a formula that finds a partition suitable for storing the key range. Hashing and dynamic tree building may be used.

Method and apparatus for determining if stored memory range overlaps key memory ranges where the memory address space is organized in a tree form and partition elements for storing key memory ranges

Growing community of inventors

Arlington, MA, United States of America

Randall David Smith