US 7,613,947 B1Grant

System and method for storage takeover

Issue Date:2009-11-03

•27 Claims

•12 Drawing Sheets

Abstract

A takeover system and method for high availability in the face of component failures for a multiple-node storage system cluster is provided. When a takeover is triggered either through a loss of cluster heartbeat, or through a user-initiated command, the system of the present invention is configured such that one or more surviving nodes asserts ownership on one or more of the failed node's disks such that all of the disks become locally owned by one of the surviving nodes. An assimilation of the disks into one or more aggregates is performed, and any duplicated file system identification numbers are corrected to avoid errors. As the disks thus appear to be locally owned by the surviving nodes, one or more newly assimilated aggregates are thus exposed to any N-module that interfaces with the surviving nodes.

Metadata

Assignee

NetApp, Inc.

Inventors

Susan M. Coatney
Kayuri Patel
Stephen H. Strange
Steven S. Watanabe

Application Information

Application Number:US 11/606,727

Filing Date:2006-11-30

Priority Date:2006-11-30

Art Unit:2113

Classifications

IPC:

G06F11/00

Patent Drawings (12 sheets)

Description

CROSS REFERENCE TO RELATED APPLICATIONS

[0001] This application is related to the following United States Patent Applications:

[0002] U.S. patent application Ser. No. 11/606,452 entitled SYSTEM AND METHOD FOR IMPROVED RESOURCE GIVE BACK, by Susan M. Coatney et al., which is presently incorporated by reference in its entirety; and

[0003] U.S. patent application Ser. No. 11/606,538 entitled SYSTEM AND METHOD FOR MAINTAINING DISK LOCATION VIA HOMENESS, by Steven S. Watanabe, et al., which is presented incorporated by reference herein in its entirety.

BACKGROUND OF THE INVENTION

[0004] 1. Field of the Invention

[0005] The present invention relates to networked storage systems and, more particularly, to takeover procedures in clustered storage systems.

[0006] 2. Background Information

[0007] A storage system is a computer that provides storage service relating to the organization of information on writeable persistent storage devices, such as memories, tapes or disks. The storage system is commonly deployed within a storage area network (SAN) or a network attached storage (NAS) environment. When used within a NAS environment, the storage system may be embodied as a file server including an operating system that implements a file system to logically organize the information as a hierarchical structure of directories and files on, e.g. the disks. Each “on-disk” file may be implemented as a set of data structures, e.g., disk blocks, configured to store information, such as the actual data for the file. A directory, on the other hand, may be implemented as a specially formatted file in which information about other files and directories are stored.

[0008] The file server, or filer, may be further configured to operate according to a client/server model of information delivery to thereby allow many client systems (clients) to access shared resources, such as files, stored on the filer. Sharing of files is a hallmark of a NAS system, which is enabled because of semantic level of access to files and file systems. Storage of information on a NAS system is typically deployed over a computer network comprising a geographically distributed collection of interconnected communication links, such as Ethernet, that allow clients to remotely access the information (files) on the file server. The clients typically communicate with the filer by exchanging discrete frames or packets of data according to pre-defined protocols, such as the Transmission Control Protocol/Internet Protocol (TCP/IP).

[0009] In the client/server model, the client may comprise an application executing on a computer that “connects” to the filer over a computer network, such as a point-to-point link, shared local area network, wide area network or virtual private network implemented over a public network, such as the Internet. NAS systems generally utilize file-based access protocols; therefore, each client may request the services of the filer by issuing file system protocol messages (in the form of packets) to the file system over the network. By supporting a plurality of file system protocols, such as the conventional Common Internet File System (CIFS), the Network File System (NFS) and the Direct Access File System (DAFS) protocols, the utility of the filer may be enhanced for networking clients.

[0010] A SAN is a high-speed network that enables establishment of direct connections between a storage system and its storage devices. The SAN may thus be viewed as an extension to a storage bus and, as such, an operating system of the storage system enables access to stored information using block-based access protocols over the “extended bus”. In this context, the extended bus is typically embodied as Fibre Channel (FC) or Ethernet media adapted to operate with block access protocols, such as Small Computer Systems Interface (SCSI) protocol encapsulation over FC (FCP) or TCP/IP/Ethernet (iSCSI). A SAN arrangement or deployment allows decoupling of storage from the storage system, such as an application server, and some level of storage sharing at the application server level. There are, however, environments wherein a SAN is dedicated to a single server. When used within a SAN environment, the storage system may be embodied as a storage appliance that manages access to information in terms of block addressing on disks using, e.g., a logical unit number (LUN) in accordance with one or more block-based protocols, such as FCP.

[0011] One example of a SAN arrangement, including a multi-protocol storage appliance suitable for use in the SAN, is described in United States Patent Application Publication No. US2004/0030668 A1, filed on Feb. 14, 2004, entitled MULTI-PROTOCOL STORAGE APPLIANCE THAT PROVIDES INTEGRATED SUPPORT FOR FILE AND BLOCK ACCESS PROTOCOLS by Brian Pawlowski et al., which is incorporated herein by reference in its entirety.

[0012] It is advantageous for the services and data provided by a storage system, such as a storage node, to be available for access to the greatest degree possible. Accordingly, some storage systems provide a plurality of storage system nodes organized as a cluster, with a first storage system node being clustered with a second storage system node. Each storage system node is configured to take over serving data access requests for the other storage system node if the other storage system node fails. The storage nodes in the cluster notify one another of continued operation using a heartbeat signal which is passed back and forth over a cluster interconnect, and over a cluster switching fabric. If one of the storage system nodes detects the absence of a heartbeat from the other storage node over both the cluster interconnect and the cluster switching fabric, a failure is detected and a takeover procedure is initiated. It is noted that the failure is also usually confirmed by the surviving storage node by checking a master mailbox disk of the other storage node to confirm that it is in fact a failure of the other storage node itself and not simply a failure of the cluster interconnect coupling.

[0013] More specifically, a mailbox mechanism includes a set of procedures for determining the most up-to-date coordinating information through the use of one or more mailbox disks. Such disks receive messages from the node with which they are associated in order to confirm that the node continues to be in communication with the mailbox disk, which indicates that the node continues to be capable of writing to the disks assigned to that node. Further details on the configuration and operation of the master mailbox disk are provided in commonly-owned U.S. patent application Ser. No. 10/378,400, of Larson et al., for a SYSTEM AND METHOD FOR COORDINATING CLUSTER STATE INFORMATION, filed on Mar. 3, 2003, which is presently incorporated by reference herein in its entirety.

[0014] Many cluster configurations include the concept of partnering. Specifically, each storage system node in the cluster is partnered with a second storage system node in such a manner that the partner storage system node is available to take over and provide the services and the data otherwise provided by the second storage system node. The partner assumes the tasks of processing and handling any data access requests normally processed by the second storage system node. One such example of a partnered storage system cluster configuration is described in U.S. patent application Ser. No. 10/421,297, entitled SYSTEM AND METHOD FOR TRANSPORT-LEVEL FAILOVER OF FCP DEVICES IN A CLUSTER, by Arthur F. Lent, et al., the contents of which are hereby incorporated by reference. It is further noted that in such storage system node clusters, an administrator may desire to take one of the storage system nodes offline for a variety of reasons including, for example, to upgrade hardware, etc. In such situations, it may be advantageous to perform a “voluntary” user-initiated takeover operation, as opposed to a failover operation. After the takeover operation is complete, the storage system node's data is serviced by its partner until a giveback operation is performed.

[0015] Another example of a storage system node cluster configuration takeover technique is described in U.S. patent application Ser. No. 11/411,502, entitled SINGLE NODE NAME CLUSTER SYSTEM FOR FIBER CHANNEL, by Britt Bolen et al., the contents of which are hereby incorporated by reference. In this configuration, the cluster has a single world wide node name so that the cluster as a whole appears to the client as a single device. In such clusters, two storage system nodes are partnered such that a first storage system node serves its own “locally owned” data from the disks to which it is directly connected, and proxies requests for its partner disks to a partner storage system node. During takeover operations, the locally owned data of the failed storage system node is serviced by its partner until a give back operation is performed.

[0016] In such cases employing a partner mode, additional infrastructure is often required. For example, requests are tracked to determine whether they are partner requests. Data structures are also duplicated. Separate tables describing the data, such as for example, a volume location database (VLDB) must be maintained for the local disks and for the partner disks. In addition, registry files which store options and configuration parameters are also maintained separately in a local registry file and a partner registry file. As will be apparent to those skilled in the art, this results in additional code complexity in many systems.

[0017] It is also noted that, in some storage system architectures, the nodes in each cluster are generally organized as a network element (N-module) and a disk element (D-module). The N-module includes functionality that enables the node to connect to clients over a computer network, while each D-module connects to one or more storage devices such as the disks of a disk array. A file system architecture of the type is generally described in United States Patent Application Publication No. US 2002/0116593 entitled METHOD AND SYSTEM FOR RESPONDING TO FILE SYSTEM REQUESTS, by M. Kazar et al. (the contents of which are incorporated herein by reference in entirety).

[0018] In some recent architectures however, additional functionality has been moved to the N-module which may have previously been performed by the D-module. For example, the N-module handles aspects such as network connectivity. In such configurations, it may be desirable to deliver to upper layers of the N-module a single view of all aggregates that a particular D-module is serving, rather than exposing two sets of aggregates to the N-module (i.e., a local image of the disks being served by the surviving D-module, and a set of partner disks). In previous designs, in a failover, the surviving N-module and D-module took over network addresses and performed other administrative tasks which consumed operational bandwidth in the storage architecture system.

[0019] There remains a need, therefore, for a system which eliminates partner mode failover, but allows for a takeover that results in one or more newly assimilated aggregates to be available for access by the N-modules in a multiple node cluster.

SUMMARY OF THE INVENTION

[0020] The disadvantages of prior techniques are overcome by the present invention which provides a technique for takeover of a failed node's disks and that produces one or more newly assimilated aggregates to be available for access by the N-modules in a multiple node cluster. When a takeover procedure is triggered, either through a lack of heartbeat, or a command for a takeover is received, the system of the present invention is configured such that one or more surviving nodes of the cluster asserts ownership of disks previously served by a failed node, so that all of the disks are locally owned by one of the surviving nodes in the cluster. So, as a result, one or more new aggregates are established that include all of the failed node's disks. According to the invention, one or more newly assimilated aggregates, now served by one or more surviving D-modules, is then exposed to any N-module that interfaces with the surviving nodes. For clarity of illustration, the invention is described with reference to a single newly assimilated aggregate. It should be understood, however, that one or more newly assimilated aggregates can be served by one or more surviving D-modules, while remaining within the scope of the present invention.

[0021] In the illustrative embodiment, when the takeover procedure is invoked, a surviving node changes two elements of ownership with respect to each disk or portion thereof. Specifically, the surviving node first changes one or more ownership attributes (such as SCSI-3 reservations or export rules, as described further herein) to reflect its access rights to the failed node's disks, and secondly, it changes a “current owner” status in an ownership location on the disk to reflect itself (the surviving node) as the current owner of the disk assigned to that surviving node. The newly acquired disks are then properly assimilated into one or more aggregates by a suitable process such as a RAID system of the surviving node. A section of the non-volatile memory (NVRAM), which contains the most recent data about the RAID system, referred to herein as the RAID section of the NVRAM is replayed to flush any final parity computations with respect to the disks forming the new aggregate(s).

[0022] Duplications in fsid numbers are corrected so that each volume in the newly assimilated aggregate has its own unique fsid identifier. A file system section of the NVRAM of the node is replayed to bring all data up to date, and the volumes are then brought online to thereby enable the surviving node to serve data access requests as if it locally owns all of the volumes that it claimed from the failed node, which volumes are now contained in the newly assimilated aggregate. Notably, the system and method described herein are performed without requiring a partner mode in the takeover procedure.

BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The above and further advantages of the invention may be better understood by reference to the following description in conjunction with the accompanying drawings in which like reference numerals indicate identical or functionally similar elements:

[0024] FIG. 1 is a schematic block diagram of a plurality of nodes interconnected as a cluster in accordance with an embodiment of the present invention;

[0025] FIG. 2 is a schematic block diagram of a node in accordance with an embodiment of the present invention;

[0026] FIG. 3 is a schematic block diagram of a storage operating system that may be advantageously used with the present invention;

[0027] FIG. 4 is an illustrative example of the disk ownership table maintained by the ownership module of the storage operating system;

[0028] FIG. 5 is a schematic block diagram illustrating the format of a cluster fabric (CF) message in accordance with an illustrative embodiment of the present invention;

[0029] FIG. 6 is a schematic block diagram illustrating the format of a data container handle in accordance with an illustrative embodiment of the present invention;

[0030] FIG. 7 is a schematic block diagram of an exemplary aggregate in accordance with an illustrative embodiment of the present invention;

[0031] FIG. 8 is a schematic block diagram of an exemplary on-disk layout of the aggregate in accordance with an embodiment of the present invention;

[0032] FIG. 9 is a schematic block diagram illustrating a collection of management processes in accordance with an illustrative embodiment of the present invention;

[0033] FIG. 10 is a schematic block diagram of a volume location database (VLDB) volume entry in accordance with an illustrative embodiment of the present invention;

[0034] FIG. 11 is a schematic block diagram of a VLDB aggregate entry in accordance with an illustrative embodiment of the present invention; and

[0035] FIGS. 12A and 12B together form a flow chart of a procedure for takeover operation in accordance with an illustrative embodiment of the present invention.

DETAILED DESCRIPTION OF AN ILLUSTRATIVE EMBODIMENT

A. Cluster Environment

[0036] FIG. 1 is a schematic block diagram of a plurality of nodes 200 a,b interconnected as a cluster 100 and configured to provide storage services relating to the organization of information on storage devices. The nodes 200 a,b comprise various functional components that cooperate to provide a distributed storage system architecture of the cluster 100. To that end, each node 200 a,b is generally organized as a network element (N-module 310) and a disk element (D-module 350). The N-module 310 includes functionality that enables the node 200a, for example, to connect to clients 180 over a computer network 140, while each D-module 350 connects to one or more storage devices, such as disks 130a. The nodes 200 a,b are interconnected by a cluster switching fabric 150 which, in the illustrative embodiment, may be embodied as a Gigabit Ethernet switch. An exemplary distributed file system architecture is generally described in U.S. Patent Application Publication No. US 2002/0116593 entitled METHOD AND SYSTEM FOR RESPONDING TO FILE SYSTEM REQUESTS, by M. Kazar et al., published Aug. 22, 2002, which is incorporated by reference herein in its entirety. It should be noted that while there is shown an equal number of N and D-modules in the illustrative cluster 100, there may be differing numbers of N and/or D-modules in accordance with various embodiments of the present invention. For example, there may be a plurality of N-modules and/or D-modules interconnected in a cluster configuration 100 that does not reflect a one-to-one correspondence between the N and D-modules. As such, the description of a node 200 a,b comprising one N-module and one D-module should be taken as illustrative only.

[0037] The nodes 200 a,b are also coupled across a cluster interconnect 190 which provides an additional communication path between the nodes. The cluster interconnect 190 may be Fibre Channel (FC), InfiniBand or another suitable medium. The cluster interconnect 190 may be used to provide heartbeat signals (“heartbeats”) between the two nodes, which signals are used monitor the active state of each node. The cluster heartbeats are also sent across the cluster switching fabric 150 over which communications between an N-module and D-module are illustratively effected through remote message passing over the cluster switching fabric 150, which is sometimes also referred to as the “storage layer.” The “death” of a node is indicated by the loss of heartbeat from both the cluster interconnect and the storage layer. The cluster interconnect is sometimes also referred to as the storage takeover interconnect. That is, as described further hereinafter, if the heartbeat terminates (i.e., “times out”), then a takeover procedure is enabled.

[0038] The clients 180 may be general-purpose computers configured to interact with the nodes 200 a,b in accordance with a client/server model of information delivery. That is, each client may request the services of the node, and the node may return the results of the services requested by the client, by exchanging packets over the network 140. The client may issue packets including file-based access protocols, such as the Common Internet File System (CIFS) protocol or Network File System (NFS) protocol, over the Transmission Control Protocol/Internet Protocol (TCP/IP) when accessing information in the form of files and directories. Alternatively, the client may issue packets including block-based access protocols, such as the Small Computer Systems Interface (SCSI) protocol encapsulated over TCP (iSCSI) and SCSI encapsulated over Fibre Channel (FCP), when accessing information in the form of blocks.

[0039] During normal cluster operation, the storage system node (e.g., node 200a) that is connected to a set of disks 130a is identified as the “home” of the disks 130a. That storage system node is also identified as the “current owner” at initialization and is primarily responsible for servicing data requests directed to blocks on volumes contained on its set of disks. For example, the storage system node 200a is primarily responsible for the volumes of the disk array which are represented as disk 130a. Similarly, the storage system node 200b is primarily responsible for the disks in the volumes represented as disk 130b in FIG. 1. The clustered storage system 100 is configured such that either storage system node 200a or 200b can take over data servicing capabilities for the other storage system node in the event of a failure in the manner described further herein. Notably, in a multiple node cluster, a failed node's disks may not all be claimed by a single takeover node. Instead, some of the disks may be claimed by a first takeover node, with the remaining disks being claimed by a second takeover node, for example. This may be used for load balancing of I/O traffic.

B. Storage System Node

[0040] FIG. 2 is a schematic block diagram of a node 200 that is illustratively embodied as a storage system comprising a plurality of processors 222 a,b, a memory 224, a network adapter 225, a cluster access adapter 226, NVRAM 227 (non-volatile random access memory), a storage adapter 228 and local storage 230 interconnected by a system bus 223. The local storage 230 comprises one or more storage devices, such as disks, which can be utilized by the node to locally store configuration information (e.g., in configuration table 235) provided by one or more management processes that execute as user mode applications 900 (see FIG. 9). Alternatively, such information may be stored remotely. The cluster access adapter 226 comprises a plurality of ports adapted to couple the node 200 to other nodes of the cluster 100. In the illustrative embodiment, Ethernet is used as the clustering protocol and interconnect media, although it will be apparent to those skilled in the art that other types of protocols and interconnects may be utilized within the cluster architecture described herein. In alternate embodiments where the N-modules and D-modules are implemented on separate storage systems or computers, the cluster access adapter 226 is utilized by the N/D-module for communicating with other N/D-modules in the cluster 100.

[0041] Each node 200 is illustratively embodied as a dual processor storage system executing a storage operating system 300 that preferably implements a high-level module, such as a file system, to logically organize the information as a hierarchical structure of named data containers, such as directories, files and special types of files called virtual disks (hereinafter generally “blocks”) on the disks. However, it will be apparent to those of ordinary skill in the art that the node 200 may alternatively comprise a single or more than two processor system. Illustratively, one processor 222a executes the functions of the N-module 310 on the node, while the other processor 222b executes the functions of the D-module 350.

[0042] The memory 224 illustratively comprises storage locations that are addressable by the processors and adapters for storing software program code and data structures associated with the present invention. The processor and adapters may, in turn, comprise processing elements and/or logic circuitry configured to execute the software code and manipulate the data structures. The storage operating system 300, portions of which are typically resident in memory and executed by the processing elements, functionally organizes the node 200 by, inter alia, invoking storage operations in support of the storage service implemented by the node. It will be apparent to those skilled in the art that other processing and memory means, including various computer readable media, may be used for storing and executing program instructions pertaining to the invention described herein.

[0043] The network adapter 225 comprises a plurality of ports adapted to couple the node 200 to one or more clients 180 over point-to-point links, wide area networks, virtual private networks implemented over a public network (Internet) or a shared local area network. The network adapter 225 thus may comprise the mechanical, electrical and signaling circuitry needed to connect the node to the network. Illustratively, the computer network 140 (FIG. 1) may be embodied as an Ethernet network or a FC network. Each client 180 may communicate with the node over network 140 by exchanging discrete frames or packets of data according to pre-defined protocols, such as TCP/IP.

[0044] The storage adapter 228 cooperates with the storage operating system 300 executing on the node 200 to access information requested by the clients. The information may be stored on any type of attached array of writable storage device media such as video tape, optical, DVD, magnetic tape, bubble memory, electronic random access memory, micro-electro mechanical and any other similar media adapted to store information, including data and parity information. However, as illustratively described herein, the information is preferably stored on the disks 130 of the disk array 120. The storage adapter comprises a plurality of ports having input/output (I/O) interface circuitry that couples to the disks over an I/O interconnect arrangement, such as a conventional high-performance, FC link topology.

[0045] Storage of information on each disk array 120 is preferably implemented as one or more storage “volumes” that comprise a collection of physical storage disks 130 cooperating to define an overall logical arrangement of volume block number (vbn) space on the volume(s). Each logical volume is generally, although not necessarily, associated with its own file system. The disks within a logical volume/file system are typically organized as one or more groups, wherein each group may be operated as a Redundant Array of Independent (or Inexpensive) Disks (RAID). Most RAID implementations, such as a RAID-4 level implementation, enhance the reliability/integrity of data storage through the redundant writing of data “stripes” across a given number of physical disks in the RAID group, and the appropriate storing of parity information with respect to the striped data, once all of the disks in a given RAID group are assimilated. An illustrative example of a RAID implementation is a RAID-4 level implementation, although it should be understood that other types and levels of RAID implementations may be used in accordance with the inventive principles described herein.

C. Storage Operating System

[0046] To facilitate access to the disks 130, the storage operating system 300 implements a write-anywhere file system that cooperates with one or more virtualization modules to “virtualize” the storage space provided by disks 130. The file system logically organizes the information as a hierarchical structure of named data containers such as directories and files on the disks. Each “on-disk” file may be implemented as set of disk blocks configured to store information, such as data, whereas the directory may be implemented as a specially formatted file in which names and links to other files and directories are stored. The virtualization module(s) allow the file system to further logically organize information as a hierarchical structure of data containers such as blocks on the disks that are exported as named logical unit numbers (LUNs).

[0047] In the illustrative embodiment, the storage operating system is preferably the NetApp® Data ONTAP® operating system available from Network Appliance, Inc., Sunnyvale, Calif. that implements a Write Anywhere File Layout (WAFL®) file system. However, it is expressly contemplated that any appropriate storage operating system may be enhanced for use in accordance with the inventive principles described herein. As such, where the term “WAFL” is employed, it should be taken broadly to refer to any storage operating system that is otherwise adaptable to the teachings of this invention.

[0048] FIG. 3 is a schematic block diagram of the storage operating system 300 that may be advantageously used with the present invention. The storage operating system comprises a series of software layers organized to form an integrated network protocol stack or, more generally, a multi-protocol engine 325 that provides data paths for clients to access information stored on the node using block and file access protocols. The multi-protocol engine includes a media access layer 312 of network drivers (e.g., gigabit Ethernet drivers) that interfaces to network protocol layers, such as the IP layer 314 and its supporting transport mechanisms, the TCP layer 316 and the User Datagram Protocol (UDP) layer 315. A file system protocol layer provides multi-protocol file access and, to that end, includes support for the Direct Access File System (DAFS) protocol 318, the NFS protocol 320, the CIFS protocol 322 and the Hypertext Transfer Protocol (HTTP) protocol 324. A VI layer 326 implements the VI architecture to provide direct access transport (DAT) capabilities, such as RDMA, as required by the DAFS protocol 318. An iSCSI driver layer 328 provides block protocol access over the TCP/IP network protocol layers, while a FC driver layer 330 receives and transmits block access requests and responses to and from the node. The FC and iSCSI drivers provide FC-specific and iSCSI-specific access control to the blocks and, thus, manage exports of luns to either iSCSI or FCP or, alternatively, to both iSCSI and FCP when accessing the blocks on the node 200.

[0049] In addition, the storage operating system includes a series of software layers organized to form a storage server 365 that provides data paths for accessing information stored on the disks 130 of the node 200. As described further herein, the software layers of the storage server are illustratively embodied as a D-module 350. The storage server 365 illustratively comprises a takeover monitor module 376 that maintains a data structure such as the takeover monitor resource table 362. It should be understood that the takeover monitor resource table 362 is not the only possible embodiment of the data structure, but it is described herein for illustrative purposes. The takeover monitor resource table 362 is configured to maintain information regarding takeover procedures, as described further herein. The file system module 360 interacts in cooperating relation with a volume striping module (VSM) 370, a RAID system module 380 and a disk driver system module 390. The RAID system 380 manages the storage and retrieval of information to and from the volumes/disks in accordance with I/O operations, while the disk driver system 390 implements a disk access protocol such as, e.g., the Small Computer System Interface (SCSI) protocol. However, it should be understood that processes other than the RAID system 380 may in other embodiments perform such tasks while remaining within the scope of the present invention.

[0050] The VSM 370 illustratively implements a striped volume set (SVS) and, as such cooperates with the file system 360 to enable storage server 365 to service a volume of the SVS. In particular, the VSM 370 implements a Locate( ) function 375 to compute the location of data container content in the SVS volume to thereby ensure consistency of such content served by the cluster.

[0051] A disk ownership module 382 manages ownership of the disks with respect to their related aggregates and volumes using, for example, one or more data structures such as tables, including, for example, the disk ownership table 400. In particular, the ownership module 382 cooperates with the disk driver system 390 to identify the appropriate D-module for processing data access requests for particular volumes on the disk array 120. To that end, the ownership module consults disk ownership table 400, which contains disk ownership information that is illustratively generated at boot-up time, and that is updated by various components of the storage operating system to reflect changes in ownership of disks. Further details regarding the data structure implemented as ownership table 400 are provided in the above-incorporated U.S. patent application Ser. No. 11/606,538.

[0052] Notably, the disk ownership module 382 includes program instructions for writing proper ownership information at a proper location on each disk, which is referred to herein as the ownership location. The disk ownership module 382 also includes program instructions for asserting and eliminating SCSI reservation tags.

[0053] FIG. 4 is an illustrative example of the data structure implemented as disk ownership table 400, which is maintained by the ownership module 382 of the storage operating system 300. The table comprises a plurality of entries 410, 420, 430 and 440, one for each disk accessible by the appropriate D-module. The individual fields are depicted for an illustrative entry 420, including a drive identification field 402, a world wide name field 404, ownership information field 406 and a field for other information 408. The world wide name is a 64-bit identification number which is unique for every item attached to a fibre channel network. World wide names are described in ANSI X3.230-1995, Fibre Channel Physical and Signaling Interface (FC-PH) and Bob Snively, New Identifier Formats Based on IEEE Registration X3T11/96-467, revision 2, which are hereby incorporated by reference. The world wide name is generally loaded into disk drives during manufacturing. For file servers (such as D-module 350), the world wide name is normally generated by adding additional data bits to a file server serial number identified within the NVRAM. However, it is expressly contemplated that other means for generating a world wide name (or other appropriate standardized unique naming scheme) for file servers (and D-modules) are possible, including, but not limited to adding the manufacturer's name to a processor identification, etc.

[0054] Initially, the disk ownership table 400 is generated upon boot up of the system. More specifically, I/O services of the disk driver system 390 query all devices (e.g., disks 130) attached to the system. This query requests information as to the nature of the attached disks. Upon completion of the query, the ownership module 382 instructs the disk driver system 390 to read the ownership information from each disk. In response, the disk driver system reads the ownership information for each disk 132a from each on-disk ownership location 134a (FIG. 1), and then the ownership module 382 creates the entries in the disk ownership table 400 with this information.

[0055] Subsequently, the ownership module 382 accesses the disk ownership table 400 to extract the identification of all disks that are owned by the appropriate D-module. The ownership module then verifies the SCSI reservations on each disk owned by that D-module by reading the ownership information stored in the ownership location on each disk. If the SCSI reservations and on-disk information do not match, the ownership module changes the SCSI reservation to match the on-disk ownership information. Once the SCSI reservations and on-disk ownership information match for all disks identified as owned by the D-module, the ownership module 382 then passes the information to the file system and the RAID module, which configure the individual disks into the appropriate RAID groups and volumes for the D-module 350.

[0056] Referring again to FIG. 3, a takeover monitor process 376 operates in conjunction with a cluster fabric (CF) interface module 340b to monitor the heartbeats between the node and the one or more other nodes in the cluster. If the absence of a heartbeat is detected, the takeover monitor process 376 initiates the takeover procedure. In addition, the takeover monitor is also responsive to a storage takeover command by e.g., an administrator. In response to lack of heartbeat or issuance of a storage takeover command, a takeover procedure is triggered at the takeover monitor process 376. When a takeover is initiated by the takeover monitor process 376, it first consults takeover monitor resource table 362, which sets forth the routines to be followed in order to effect a takeover. These routines are summarized illustratively in the flowchart of FIGS. 12A and 12B. The takeover monitor process 376 thereafter notifies other processes, such as the file system 360, the RAID system 380, the ownership module 382 and the disk driver system 390, instructing each to perform respective routines/threads that are necessary steps, which steps are illustratively illustrated herein in the flowchart of FIGS. 12A and 12B, to implement the takeover procedures, in the manner described herein.

[0057] The file system 360 implements a virtualization system of the storage operating system 300 through the interaction with one or more virtualization modules illustratively embodied as, e.g., a virtual disk (vdisk) module (not shown) and a SCSI target module 335. The vdisk module enables access by administrative interfaces, such as a user interface of a management framework 900 (see FIG. 9), in response to a user (system administrator) issuing commands to the node 200. The SCSI target module 335 is generally disposed between the FC and iSCSI drivers 328, 330 and the file system 360 to provide a translation layer of the virtualization system between the block (lun) space and the file system space, where luns are represented as blocks.

[0058] The file system 360 is illustratively a message-based system that provides logical volume management capabilities for use in access to the information stored on the storage devices, such as disks. That is, in addition to providing file system semantics, the file system 360 provides functions normally associated with a volume manager. These functions include (i) aggregation of the disks, (ii) aggregation of storage bandwidth of the disks, and (iii) reliability guarantees, such as mirroring and/or parity (RAID). The file system 360 illustratively implements the WAFL® file system (hereinafter generally the “write-anywhere file system”) having an on-disk format representation that is block-based using, e.g., 4 kilobyte (kB) blocks and using index nodes (“inodes”) to identify files and file attributes (such as creation time, access permissions, size and block location). The file system uses files to store metadata describing the layout of its file system; these metadata files include, among others, an inode file. A file handle, i.e., an identifier that includes an inode number, is used to retrieve an inode from disk.

[0059] Broadly stated, all inodes of the write-anywhere file system are organized into the inode file. A file system (fs) info block specifies the layout of information in the file system and includes an inode of a file that includes all other inodes of the file system. Each logical volume (file system) has an fsinfo block that is preferably stored at a fixed location within, e.g., a RAID group. The inode of the inode file may directly reference (point to) data blocks of the inode file or may reference indirect blocks of the inode file that, in turn, reference data blocks of the inode file. Within each data block of the inode file are embedded inodes, each of which may reference indirect blocks that, in turn, reference data blocks of a file.

[0060] Operationally, a request from the client 180 is forwarded as a packet over the computer network 140 and onto the node 200 where it is received at the network adapter 225. A network driver (of layer 312 or layer 330) processes the packet and, if appropriate, passes it on to a network protocol and file access layer for additional processing prior to forwarding to the write-anywhere file system 360. Here, the file system generates operations to load (retrieve) the requested data from disk 130 if it is not resident “in core”, i.e., in memory 224. If the information is not in memory, the file system 360 indexes into the inode file using the inode number to access an appropriate entry and retrieve a logical vbn. The file system then passes a message structure including the logical vbn to the RAID system 380; the logical vbn is mapped to a disk identifier and disk block number (disk,dbn) and sent to an appropriate driver (e.g., SCSI) of the disk driver system 390. The disk driver accesses the dbn from the specified disk 130 and loads the requested data block(s) in memory for processing by the node. Upon completion of the request, the node (and operating system) returns a reply to the client 180 over the network 140.

[0061] It should be noted that the software “path” through the storage operating system layers described above needed to perform data storage access for the client request received at the node may alternatively be implemented in hardware. That is, in an alternate embodiment of the invention, a storage access request data path may be implemented as logic circuitry embodied within a field programmable gate array (FPGA) or an application specific integrated circuit (ASIC). This type of hardware implementation increases the performance of the storage service provided by node 200 in response to a request issued by client 180. Moreover, in another alternate embodiment of the invention, the processing elements of adapters 225, 228 may be configured to offload some or all of the packet processing and storage access operations, respectively, from processor 222, to thereby increase the performance of the storage service provided by the node. It is expressly contemplated that the various processes, architectures and procedures described herein can be implemented in hardware, firmware or software.

[0062] As used herein, the term “storage operating system” generally refers to the computer-executable code operable on a computer to perform a storage function that manages data access and may, in the case of a node 200, implement data access semantics of a general purpose operating system. The storage operating system can also be implemented as a microkernel, an application program operating over a general-purpose operating system, such as UNIX® or Windows XP®, or as a general-purpose operating system with configurable functionality, which is configured for storage applications as described herein.

[0063] In addition, it will be understood to those skilled in the art that the invention described herein may apply to any type of special-purpose (e.g., file server, filer or storage serving appliance) or general-purpose computer, including a standalone computer or portion thereof, embodied as or including a storage system. Moreover, the teachings of this invention can be adapted to a variety of storage system architectures including, but not limited to, a network-attached storage environment, and a storage area network and disk assembly directly attached to a client or host computer. The term “storage system” should therefore be taken broadly to include such arrangements in addition to any subsystems configured to perform a storage function and associated with other equipment or systems. It should be noted that while this description is written in terms of a write-anywhere file system, the teachings of the present invention may be utilized with any suitable file system, including a write-in-place file system.

D. CF Protocol

[0064] In the illustrative embodiment, the storage server 365 is embodied as D-module 350 of the storage operating system 300 to service one or more volumes of array 120. In addition, the multi-protocol engine 325 is embodied as N-module 310 to (i) perform protocol termination with respect to a client issuing incoming data access request packets over the network 140, as well as (ii) redirect those data access requests to any storage server 365 of the cluster 100. Moreover, the N-module 310 and D-module 350 cooperate to provide a highly-scalable, distributed storage system architecture of the cluster 100. To that end, each blade includes a CF interface module 340a,b adapted to implement intra-cluster communication among the N- and D-modules, including D-module-to-D-module communication for data container striping operations.

[0065] The protocol layers, e.g., the NFS/CIFS layers and the iSCSI/FC layers, of the N-module 310 function as protocol servers that translate file-based and block-based data access requests from clients into CF protocol messages used for communication with the D-module 350. That is, the N-module servers convert the incoming data access requests into file system primitive operations (commands) that are embedded within CF messages by the CF interface module 340 for transmission to the D-modules 350 of the cluster 100. Notably, the CF interface modules 340 cooperate to provide a single file system image across all D-modules 350 in the cluster 100. Thus, any network port of an N-module that receives a client request can access any data container within the single file system image located on any D-module 350 of the cluster.

[0066] Further to the illustrative embodiment, the N-module 310 and D-module 350 are implemented as separately-scheduled processes of storage operating system 300; however, in an alternate embodiment, the modules may be implemented as pieces of code within a single operating system process. Communication between an N-module and D-module is thus illustratively effected through the use of message passing between the modules although, in the case of remote communication between an N-module and D-module of different nodes, such message passing occurs over the cluster switching fabric 150. As noted, the cluster switching fabric 150 is also used as a second medium over which heartbeats between the nodes are transmitted and received. A known message-passing mechanism provided by the storage operating system to transfer information between modules (processes) is the Inter Process Communication (IPC) mechanism. The protocol used with the IPC mechanism is illustratively a generic file and/or block-based “agnostic” CF protocol that comprises a collection of methods/functions constituting a CF application programming interface (API). Examples of such an agnostic protocol are the SpinFS and SpinNP protocols available from Network Appliance, Inc. The SpinFS protocol is described in the above-referenced U.S. Patent Application Publication No. US 2002/0116593.

[0067] The CF interface module 340 implements the CF protocol for communicating file system commands among the modules of cluster 100. Communication is illustratively effected by the D-module exposing the CF API to which an N-module (or another D-module) issues calls. To that end, the CF interface module 340 is organized as a CF encoder and CF decoder. The CF encoder of, e.g., CF interface 340a on N-module 310 encapsulates a CF message as (i) a local procedure call (LPC) when communicating a file system command to a D-module 350 residing on the same node 200 or (ii) a remote procedure call (RPC) when communicating the command to a D-module residing on a remote node of the cluster 100. In either case, the CF decoder of CF interface 340b on D-module 350 de-encapsulates the CF message and processes the file system command.

[0068] FIG. 5 is a schematic block diagram illustrating the format of a CF message 500 in accordance with an embodiment of the present invention. The CF message 500 is illustratively used for RPC communication over the switching fabric 150 between remote modules of the cluster 100; however, it should be understood that the term “CF message” may be used generally to refer to LPC and RPC communication between modules of the cluster. The CF message 500 includes a media access layer 502, an IP layer 504, a UDP layer 506, a reliable connection (RC) layer 508 and a CF protocol layer 510. As noted, the CF protocol is a generic file system protocol that conveys file system commands related to operations contained within client requests to access data containers stored on the cluster 100; the CF protocol layer 510 is that portion of message 500 that carries the file system commands. For example, the storage system command issued by the administrator in accordance with the invention may be sent over the CF fabric to another storage system node in the cluster, if necessary. Illustratively, the CF protocol is datagram based and, as such, involves transmission of messages or “envelopes” in a reliable manner from a source (e.g., an N-module 310) to a destination (e.g., a D-module 350). The RC layer 508 implements a reliable transport protocol that is adapted to process such envelopes in accordance with a connectionless protocol, such as UDP 506.

[0069] A data container, e.g., a file, is accessed in the file system using a data container handle. FIG. 6 is a schematic block diagram illustrating the format of a data container handle 600 including a SVS ID field 602, an inode number field 604, a unique-ifier field 606 a striped flag field 608 and a striping epoch number field 610. The SVS ID field 602 contains a global identifier (within the cluster 100) of the SVS within which the data container resides. The inode number field 604 contains an inode number of an inode (within an inode file) pertaining to the data container. The unique-ifier field 606 contains a monotonically increasing number that uniquely identifies the data container handle 600. The unique-ifier is particularly useful in the case where an inode number has been deleted, reused and reassigned to a new data container. The unique-ifier distinguishes that reused inode number in a particular data container from a potentially previous use of those fields. The striped flag field 608 is illustratively a Boolean value that identifies whether the data container is striped or not. The striping epoch number field 610 indicates the appropriate striping technique for use with this data container for embodiments where the SVS utilizes differing striping techniques for different data containers.

E. File System Organization

[0070] FIG. 7 is a schematic block diagram of an embodiment of an aggregate 700 (which may also be a data container, such as a physical volume) that may be advantageously used with the present invention. Luns (blocks) 702, directories 704, qtrees 706 and files 708 may be contained within flexible volumes 710, such as dual vbn flexible volumes, that, in turn, are contained within the aggregate 700. The aggregate 700 is illustratively layered on top of the RAID system, which is represented by at least one RAID plex 750 (depending upon whether the storage configuration is mirrored), wherein each plex 750 comprises at least one RAID group 760. Each RAID group further comprises a plurality of disks 730, e.g., one or more data (D) disks and zero or more (P) parity disks.

[0071] Whereas the aggregate 700 is analogous to a physical volume of a conventional storage system, a flexible volume is analogous to a file within that physical volume. That is, the aggregate 700 may include one or more files, wherein each file contains a flexible volume 710 and wherein the sum of the storage space consumed by the flexible volumes is physically smaller than (or equal to) the size of the overall physical volume. The aggregate utilizes a physical pvbn space that defines a storage space of blocks provided by the disks of the physical volume, while each embedded flexible volume (within a file) utilizes a logical vvbn space to organize those blocks, e.g., as files. Each vvbn space is an independent set of numbers, each of which corresponds to an offset within the file. These offset values are then translated to dbns on disks. Since the flexible volume 710 is also a logical volume, it has its own block allocation structures (e.g., active, space and summary maps) in its vvbn space.

[0072] A container file is a file in the aggregate that contains all blocks used by a flexible volume. The container file is an internal (to the aggregate) feature that supports a flexible volume; illustratively, there is one container file per flexible volume. Similar to a pure logical volume in a file approach, the container file is a hidden file (not accessible to a user) in the aggregate that holds every block in use by the flexible volume. The aggregate includes an illustrative hidden metadata root directory that contains subdirectories of flexible volumes:

- [0073] WAFL/fsid/filesystem file, storage label file

[0074] Specifically, a physical file system (WAFL) directory includes a subdirectory for each flexible volume in the aggregate, with the name of the subdirectory being a file system identifier (fsid) of the flexible volume. Each fsid subdirectory (flexible volume) contains at least two files, a file system file and a storage label file. The storage label file is illustratively a 4 kB file that contains metadata similar to that stored in a conventional RAID label. In other words, the storage label file is the analog of a RAID label and, as such, contains information about the state of the flexible volume such as, e.g., the name of the flexible volume, a universal unique identifier (uuid) and fsid of the flexible volume, whether it is online, being created or being destroyed, etc.

[0075] FIG. 8 is a schematic block diagram of an exemplary on-disk layout of an aggregate 800 in accordance with an embodiment of the present invention. The storage operating system 300, e.g., the RAID system 380, assembles a physical volume of pvbns to create the aggregate 800, with pvbns 1 and 2 comprising a “physical” volinfo block 802 for the aggregate. The volinfo block 802 contains block pointers to fsinfo blocks 804, each of which may represent a snapshot of the aggregate. The fsinfo block 804 contains the fsid which is the file system identifier that indicates the snapshot number. As discussed further herein, the software program of the present invention searches for duplicate fsids among the fsid info blocks 804 in the newly formed aggregate 800, and assigns new numbers to each fsid that is a duplication of an fsid already used in the surviving node's original aggregate.

[0076] Each fsinfo block 804 includes a block pointer to an inode file 806 that contains inodes of a plurality of files, including an owner map 810, an active map 812, a summary map 814 and a space map 816, as well as other special meta-data files. The inode file 806 further includes a root directory 820 and a “hidden” meta-data root directory 830, the latter of which includes a namespace having files related to a flexible volume in which users cannot “see” the files. The hidden meta-data root directory includes the WAFL/fsid/directory structure that contains filesystem file 840 and storage label file 890. Note that root directory 820 in the aggregate is empty; all files related to the aggregate are organized within the hidden meta-data root directory 830.

[0077] In addition to being embodied as a container file having level 1 blocks organized as a container map, the filesystem file 840 includes block pointers that reference various file systems embodied as flexible volumes 850. The aggregate 800 maintains these flexible volumes 850 at special reserved inode numbers. Each flexible volume 850 also has special reserved inode numbers within its flexible volume space that are used for, among other things, the block allocation bitmap structures. As noted, the block allocation bitmap structures, e.g., active map 862, summary map 864 and space map 866, are located in each flexible volume.

[0078] Specifically, each flexible volume 850 has the same inode file structure/content as the aggregate, with the exception that there is no owner map and no WAFL/fsid/filesystem file, storage label file directory structure in a hidden meta-data root directory 880. To that end, each flexible volume 850 has a volinfo block 852 that points to one or more fsinfo blocks 854, each of which may represent a snapshot, along with the active file system of the flexible volume. Each fsinfo block, in turn, points to an inode file 860 that, as noted, has the same mode structure/content as the aggregate with the exceptions noted above. Each flexible volume 850 has its own inode file 860 and distinct inode space with corresponding inode numbers, as well as its own root (fsid) directory 870 and subdirectories of files that can be exported separately from other flexible volumes.

[0079] The storage label file 890 contained within the hidden meta-data root directory 830 of the aggregate is a small file that functions as an analog to a conventional RAID label. A RAID label includes physical information about the storage system, such as the volume name; that information is loaded into the storage label file 890. Illustratively, the storage label file 890 includes the name 892 of the associated flexible volume 850, the online/offline status 894 of the flexible volume, and other identity and state information 896 of the associated flexible volume (whether it is in the process of being created or destroyed).

F. VLDB

[0080] FIG. 9 is a schematic block diagram illustrating a collection of management processes that execute as user mode applications 900 on the storage operating system 300 to provide management of configuration information (i.e. management data) for the nodes of the cluster. To that end, the management processes include a management framework process 910 and a volume location database (VLDB) process 930, each utilizing a data replication service (RDB 950) linked as a library. The management framework 910 provides a user to an administrator 970 interface via a command line interface (CLI) and/or a web-based graphical user interface (GUI). The management framework is illustratively based on a conventional common interface model (CIM) object manager that provides the entity to which users/system administrators interact with a node 200 in order to manage the cluster 100.

[0081] The VLDB 930 is a database process that tracks the locations of various storage components (e.g., SVSs, flexible volumes, aggregates, etc.) within the cluster 100 to thereby facilitate routing of requests throughout the cluster. In the illustrative embodiment, the N-module 310 of each node accesses a configuration table 235 that maps the SVS ID 602 of a data container handle 600 to a D-module 350 that “owns” (services) the data container within the cluster. The VLDB includes a plurality of entries which, in turn, provide the contents of entries in the configuration table 235; among other things, these VLDB entries keep track of the locations of the flexible volumes (hereinafter generally “volumes 710”) and aggregates 700 within the cluster. Examples of such VLDB entries include a VLDB volume entry 1000 (FIG. 10) and a VLDB aggregate entry 1100 (FIG. 11).

[0082] FIG. 10 is a schematic block diagram of an exemplary VLDB volume entry 1000. The entry 1000 includes a volume ID field 1005, an aggregate ID field 1010 and, in alternate embodiments, additional fields 1015. The volume ID field 1005 contains an ID that identifies a volume 710 used in a volume location process. The aggregate ID field 1010 identifies the aggregate 700 containing the volume identified by the volume ID field 1005. Likewise, FIG. 11 is a schematic block diagram of an exemplary VLDB aggregate entry 1100. The entry 1100 includes an aggregate ID field 1105, a D-module ID field 1110 and, in alternate embodiments, additional fields 1115. The aggregate ID field 1105 contains an ID of a particular aggregate 700 in the cluster 100. The D-module ID field 1110 contains an ID of the D-module hosting the particular aggregate identified by the aggregate ID field 1105.

[0083] The VLDB illustratively implements a RPC interface, e.g., a Sun RPC interface, which allows the N-module 310 to query the VLDB 930. When encountering contents of a data container handle 600 that are not stored in its configuration table, the N-module sends an RPC to the VLDB process. In response, the VLDB 930 returns to the N-module the appropriate mapping information, including an ID of the D-module that owns the data container. The N-module caches the information in its configuration table 235 and uses the D-module ID to forward the incoming request to the appropriate data container. All functions and interactions between the N-module 310 and D-module 350 are coordinated on a cluster-wide basis through the collection of management processes and RDB library user mode applications.

[0084] To that end, the management processes have interfaces to (are closely coupled to) RDB 950. The RDB comprises a library that provides a persistent object store (storing of objects) for the management data processed by the management processes. Notably, the RDB 950 replicates and synchronizes the management data object store access across all nodes 200 of the cluster 100 to thereby ensure that the RDB database image is identical on all of the nodes 200. At system startup, each node 200 records the status/state of its interfaces and IP addresses (those IP addresses it “owns”) into the RDB database.

G. Takeover

[0085] As discussed, a takeover process is performed upon absence of a heartbeat, or when the storage takeover command is issued. In either case, the takeover monitor 376 receives notice of the triggered failover and consults the takeover monitor resource table 362 to obtain the procedures which are to be followed by one or more processes in the storage server 365 in order to perform a takeover of the failed node's disks by the surviving storage system node. For example, the takeover monitor process 376 notifies other processes, such as the file system 360, the RAID system 380, the ownership module 382 and the disk driver system 390, instructing each to perform respective routines/threads that are necessary steps to implement the takeover procedures, in the manner described herein.

[0086] One of the procedures, illustratively, is to confirm that there is, in fact, a failure of the node (and not simply a failure of the cluster interconnect coupling or the cluster switching fabric). To that end, the surviving node accesses a master mailbox disk of the failed node (i.e., D-module). The mailbox is created upon boot up of the takeover process software. If the failed D-module has not written to the mailbox in a timely fashion, the failure is confirmed and the takeover monitor instructs the surviving node to begin takeover of the disks.

[0087] Next, the takeover monitor process 376 instructs the disk driver system 390 of the surviving storage system node's D-module to assert new SCSI-3 reservations on each disk formerly owned by the failed D-module. Notably, the illustrative embodiment is described with reference to a SCSI environment, as will be understood by those skilled in the art, in which SCSI level 3 persistent reservations (as described in SCSI primary commands-3 by Community 10 of the National Committee for Information Technology Standards, which is incorporated fully herein by reference) would have been previously placed on the disks by the now failed D-module. Using SCSI-3 reservations, a D-module can write to a disk if it holds the SCSI-3 reservations for that disk, i.e., non-owning D-modules are prevented from writing to disks because they do not have the SCSI-3 reservation. However, the non-owning file service can read ownership information from a predetermined location on the disk. In accordance with the invention, the disk driver process in the D-module has been programmed with instructions allowing it to pre-empt SCSI reservations on disks in the cluster. Thus, upon a failure, the takeover monitor instructs the surviving D-module to first pre-empt the existing SCSI reservations on the disks previously serviced by the failed node. Once these SCSI reservations have been pre-empted, the surviving node asserts its own SCSI reservations on the disks of the failed node, in the manner defined in the above-cited SCSI-3 ANSI standard specification.

[0088] In an alternative aspect of the invention, two or more nodes can simultaneously access and serve data from a common set of disks, but from separate regions (i.e., blocks) on those disks. More specifically, as will be understood by those skilled in the art, individual disks may be logically divided up into regions of contiguous blocks, and ownership information for each region is maintained in a separate ownership location on the disk for each region. This allows two or more nodes to simultaneously access and to serve data access requests from a common set of disks, but from separate regions of those disks. However, in such a configuration, SCSI reservations would not be applicable because such SCSI reservations apply to an entire disk. Consequently, alternative software and/or hardware mechanisms are applied in accordance with the invention to permit or to restrict access to portions of disks.

[0089] For example, access can be controlled by appropriately changing the ownership information for each region of the disk and/or by using a fencing technique whereby access permission rights are granted or denied for specific regions of the disks. Such fencing techniques may be for example: A) a distributed protocol running across the D-modules that guarantees that only one node has access to a file system region of the disk at any one time (a region being defined as one or more disk blocks, up to the entire disk, not necessarily contiguous) in a system in which each D-module is programmed to honor its access constraints; and B) hardware and/or firmware logic in the shared storage stack underneath the D-modules, e.g., the disk shelf, provides the fencing. A distributed protocol is typically still required; however, enforcement is stricter in that a D-module in this embodiment cannot write outside its ownership areas. These and other suitable techniques may also be employed when the invention is implemented in a non-SCSI environment for the assertion of ownership on the disks by the takeover node.

[0090] As noted herein, in an illustrative embodiment of the invention, ownership information is also stored in a particular location of the disk, which acts as the definitive ownership location on the disk. In an illustrative embodiment of the invention, if the SCSI-3 reservations do not match the on-disk ownership location data, the on-disk ownership information is used. In the case of takeover, the takeover monitor 376 cooperates with the disk driver system 390 to assert new SCSI-3 reservations on each disk formerly owned by the failed D-module and which now are under the control of the surviving D-module.

[0091] After asserting its SCSI-3 reservations, the surviving node calls the surviving D-module's RAID system 380 to assimilate all newly owned disks into one or more aggregates 700. The proper RAID calculations and configurations are then performed. Thereafter, to finalize the RAID assimilation, the RAID system initiates replay of the RAID section of the NVRAM to flush any final parity computations therefrom.

[0092] Specifically, the RAID system 380 adjusts the “current owner” status in the ownership location of each newly assimilated disk to indicate that the surviving node is now the “current owner” of that disk. Thereafter, each newly assimilated aggregate appears to be locally owned by the surviving D-module. On the surviving node, the NVRAM log containing NVRAM entries of the failed node is replayed so that any data in the newly assimilated aggregates are fully up to date.

[0093] As will be understood by those skilled in the art, a data write request issued by a client is not acknowledged as having been received successfully until the data has been written and stored in a non-volatile memory. Illustratively, in the present cluster environment, a client-issued data write request is first stored in the NVRAM 227 of the node 200 having the D-module that currently owns the relevant disk. The write request data is then written to a backup NVRAM of another (partner) D-module in the cluster prior to the write operation being acknowledged to the client. Later, at a consistency point, the newly obtained data is written from the NVRAM of the current owner D-module to the actual disk. This protects the data in such a cluster environment, so that if a failure occurs prior to the data being written to disk, that data has been stored in the backup NVRAM of the partner D-module in the cluster.

[0094] Accordingly, when a takeover occurs, the NVRAM data of the failed node is stored within the NVRAM of the surviving node and can be played back (written to the disks) at the appropriate time to bring the data into the most current state possible. Illustratively, the NVRAM has a RAID section which stores RAID calculation updates, and a file system section which stores file system data. Each section of the NVRAM is replayed at the appropriate time as discussed in further detail with respect to the flow chart of FIGS. 12A and 12B.

[0095] In accordance with the present invention, the data of the failed node is to be assimilated into a new aggregate image. However, as noted herein, the data had been originally owned by two different D-modules, and thus some of the file system IDs (“fsids”) may be duplicated. In accordance with the invention, in order to avoid any inconsistencies and errors, these duplicate fsids are corrected so that each fsid for each volume in the newly assimilated aggregate is unique. This, in turn, ensures that the newly assimilated aggregate does not contain any identical (duplicate) fsids.

[0096] The volumes of the newly assimilated aggregate are then brought online and the VLDB is updated. As noted, the VLDB keeps track of the location of the volumes 710 and aggregates 700 within the cluster as well as their host D-module. Thus, the VLDB 930 changes the D-module ID 1110 to reflect the new D-module hosting the aggregate. Thereafter, the N-module is allowed to send requests to the updated surviving D-module. The D-module processes data access requests for its locally-owned disks and the newly acquired disks until further notice. The surviving D-module then continues to process data access requests while the failed D-module remains in a “waiting for send home” state.

[0097] The method of takeover in accordance with the present invention is described in further detail in the flowcharts of FIGS. 12A and 12B. As set forth in FIG. 12A, the procedure starts at step 1202 and continues to step 1204 where a failure is detected or a storage takeover command is received at the takeover monitor process 376. At step 1206, the surviving storage system node pre-empts the SCSI reservations, as described herein on the disks previously associated with the failed storage system node. In step 1208, the surviving storage system node asserts its own SCSI reservations on the failed node's disks. As noted herein, another technique, such as a fencing technique, can be employed when only a portion of the disk is involved, or when the implementation is not using the SCSI protocol to access the disks, or in such other circumstances as desired in a particular application of the invention.

[0098] In the illustrative implementation of the invention, the surviving storage system node then calls the RAID system of the surviving D-module in step 1210. In step 1212, each disk previously associated with the failed storage system node is assimilated into a new data container. Illustratively, the RAID system 380 performs block-based assimilation of the newly acquired disks into aggregates, and the proper RAID calculations and configurations are performed. Notably, other embodiments of the invention may not include a RAID system, in which case other suitable processes will assimilate the disks into aggregates. In step 1213, the VLDB is updated. The procedure continues to step 1214 where the RAID system initiates replay of the RAID section of the NVRAM to flush any final parity computations from the RAID section of the NVRAM. It should be appreciated, however, that if the storage network does not use RAID, the blocks of data on the disks can be assimilated by another suitable process while remaining within the scope of the present invention.

[0099] Once the RAID assimilation has been performed, then, as illustrated in step 1215, in order to avoid any inconsistencies and errors, any fsid duplications are corrected if the new aggregate refers to an identical fsid as the node's original aggregate. It is noted that aggregate IDs are unique within a cluster, so the aggregate ID numbers will not need to be checked because there should not be such duplications. Then, the procedure continues to step 1216 where the RAID system adjusts the “current owner” status in the ownership location on the disks to indicate that the surviving node is now the current owner of the newly assimilated disks. In step 1218, the newly assimilated aggregates now appear to be locally owned by the surviving D-module. The file system 360 on the surviving node then receives notice that the aggregates have been successfully assimilated, as illustrated in step 1218. On the surviving node, the file system NVRAM log containing the file system NVRAM entries of the failed node is replayed so that data in the newly assimilated aggregates is brought fully up to date (step 1220). As noted, for purposes of clarity of illustration, the invention is described with reference to a single newly assimilated aggregate. It should be under stood, however, that one or more newly assimilated aggregates can be served by one or more surviving D-modules, while remaining within the scope of the present invention.

[0100] The volumes are brought online as shown in step 1224. The procedure then continues to step 1228, in which the N-module is allowed to send requests to the updated surviving D-module. As shown in step 1230, the D-module processes data access requests for its locally owned disks and for the newly acquired disks until further notice. The surviving D-module then continues to process data access requests while the failed D-module remains in the waiting for send home state. The procedure ends at step 1232.

[0101] The procedure of FIGS. 12A and 12B is illustrative of a configuration in which a single D-module takes over all of the disks of a failed D-module. It should be understood, however, that the invention also encompasses other configurations in which multiple D-modules are connected together in the cluster. For example, a system may be configured in such a manner that D-modules “A” “B” and “C” are interconnected such that write data for half of module A's aggregate are routed to module B and the other half are routed to module C for a takeover. More specifically, upon a failure of module A, the takeover monitor process 376 running in module B is programmed such that module B performs steps 1206 through 1230 (FIGS. 12A/12B) on the set of disks that it has been assigned to take over from module A. Similarly, module C follows the procedure for the remaining disks of failed module A. In this case, the newly assimilated aggregate is spread across two D-modules. Alternatively, multiple newly assimilated aggregates can be produced in accordance with the invention. This allows for load balancing of I/O traffic.

[0102] It should be understood that once the takeover is performed, all aggregate/volumes operate as if they are local to the surviving D-module. From this point onward, there is no partner to local association as in prior systems. In addition, management processes ensure that there is a unique aggregate name throughout the cluster. It should be understood that the present invention provides a simple process for takeover: of disks in a storage takeover cluster. The technique has the feature of eliminating partner mode such that it presents a newly assimilated aggregate to its upper software layers and to the N-module. In other words, the images of the disks exposed by the D-module are collapsed into a newly assimilated aggregate during takeover as opposed to requiring a separate partner and local image to be maintained.

[0103] Advantageously, the present invention reduces code complexity and operational resources. Thus, the present invention provides a system in which in any set of disks that represents an aggregate can be taken over by any D-module so that the disks are properly recognized as being served by the surviving D-module. It is further noted that the procedure described herein is accomplished without involvement of the processes of the N-module.

[0104] The foregoing description has been directed to particular embodiments of the invention. It will be apparent, however, that other variations and modifications may be made to the described embodiments, with the attainment of some or all of their advantages. Specifically, it should be noted that the principles of the invention may be implemented in a non-distributed file system. Furthermore, while this description has been written in terms of D and N-modules, the teachings of the present invention are equally suitable to systems where the functionality of the N- and D-modules is implemented in a single system. Alternatively, the functions of the N- and D-modules may be distributed among a number of separate systems, wherein each system performs one or more functions. Additionally, the features of the present invention have been described with respect to a cluster which contains two nodes, however, it is equally applicable to clusters including a plurality of nodes, which allow for n-way fail over. Additionally, the procedures, processes and/or modules described herein may be implemented in hardware, software, embodied as a computer readable medium having program instructions, firmware, or a combination thereof. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.

Claims

Certificate of Correction present

The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.

What is claimed is:

1. A method for performing a takeover procedure in a storage system environment, the method comprising the steps of:

coupling two or more storage system nodes in a cluster, each storage system node configured to service one or more volumes of a disk array;

in response to a failure of one of said storage system nodes, notifying one or more surviving storage system nodes in the cluster to takeover a set of assigned disks previously associated with the failed storage system node;

at said surviving storage system nodes, asserting ownership of each disk previously associated with the failed storage system node that are assigned to that surviving storage system node;

assimilating each disk previously associated with the failed storage system node into one or more new data containers;

bringing online volumes associated with the new data container; and

processing at each surviving storage system node, at least one of data access requests for data volumes of said new data container, and data access requests for data originally associated with that surviving storage system node.

2. The method as defined in claim 1 comprising the further steps of assigning one or more ownership locations on each disk, and identifying in said ownership locations on each disk the current owner of that disk being the disk element that is currently responsible for data access requests directed to data on that disk.

3. The method as defined in claim 2 comprising the further steps of, upon a failure, at said surviving storage system node, writing said surviving storage system node as the current owner in the ownership location of each disk in said set of disks previously associated with the failed storage system node that are assigned to that storage system node.

4. The method as defined in claim 1 comprising the further steps of checking volume identifications for each volume in the new data container, and assigning new identification numbers to volumes that have duplicate identification numbers.

5. The method as defined in claim 1 comprising the further step of replaying a RAID section of a non-volatile memory of said RAID system.

6. The method as defined in claim 1 comprising the further step of replaying a file system section of a non-volatile memory log of the failed storage system node.

7. The method as defined in claim 1 comprising the further step of updating the volume location database of each surviving storage system node to reflect the new disk element of the new data container.

8. The method as defined in claim 1 comprising the further step of, after the other steps are performed, allowing a network element to send data access requests for volumes in one or more new data containers, comprising one or more aggregates.

9. The method as defined in claim 1 further comprising the step of detecting a failure by receiving a storage takeover command from an administrator that a particular surviving storage system node in the cluster is to take over one or more of the disks of another storage system node in the cluster.

10. The method as defined in claim 1 further comprising the step of detecting a failure by determining at said surviving storage system node, the absence of a heartbeat received from a failed storage system node.

11. The method as defined in claim 1 wherein the step of asserting ownership further comprises: at said surviving storage system node, pre-empting SCSI reservations on one or more of the disks associated with the failed storage system node in the cluster, and assigning each surviving storage system node in the cluster a set of disks to take over, and each said surviving storage system node asserting its own SCSI reservations on each disk in said assigned disks.

12. The method as defined in claim 1 wherein all of the disks of said failed storage system node are assigned to a single surviving storage system node.

13. The method as defined in claim 1 wherein said step of asserting ownership further comprises at said surviving storage system node asserting ownership on a portion of a disk.

14. The method as defined in claim 13 wherein said step of asserting ownership on a portion of a disk includes using a fencing technique.

15. A system for a clustered storage environment takeover, the system comprising:

a cluster of interconnected storage system nodes that provide storage services for one or more clients, said storage system nodes each having a plurality of storage devices containing data on disks;

a cluster interconnect that provides a direct communication path between the storage system nodes in the cluster; and

a takeover monitor program executing within each storage system node that includes program instructions for detecting a failure in one or more other storage system nodes in the cluster and initiating a takeover procedure as a surviving storage system node as to one or more disks of the failed node to which it has been assigned for assimilating each assigned disk into one or more new data containers for processing incoming data access requests for the data that was originally serviced by the failed storage system node.

16. The system as defined in claim 15 further comprising a takeover monitor resource data structure that includes software program instructions for routines to be followed when a takeover is triggered.

17. The system as defined in claim 15 wherein said storage system nodes have an ownership software program that includes program instructions for reading and writing to an ownership location on a disk.

18. The system as defined in claim 17 wherein said takeover monitor program includes program instructions instructing said ownership module to change a current owner entry in said ownership location on each disk that it takes over as surviving storage system node to indicate said surviving storage system node as said current owner when a takeover is triggered.

19. The system as defined in claim 15 wherein said one or more new data containers comprise one or more new aggregates.

20. A computer readable medium for providing a takeover of data containers in a clustered storage environment, comprising program instructions for performing the steps of:

coupling two or more storage system nodes in a cluster with a cluster interconnect;

detecting a failure of a storage system node in the cluster being a failed storage system node;

notifying one or more a surviving storage system nodes in the cluster to takeover one or more volumes previously associated with the failed storage system node;

at each said surviving storage system node, asserting ownership over each disk previously associated with said failed storage system node that has been assigned to that surviving storage system node;

performing an assimilation on said disks of said failed storage system node to create a new data container;

bringing online volumes associated with each new data container; and

processing at said one or more surviving storage system nodes, data access requests for data in said volumes of said new data container, and volumes originally serviced by each said surviving storage system node.

21. The computer readable medium for providing for takeover of data containers in a clustered storage environment as defined in claim 20, comprising program instructions for performing the further step of:

upon a takeover, writing at said surviving storage system node, said surviving storage system node as the current owner in an ownership location of each disk associated with the failed storage system node that has been assigned to that storage system node.

22. The computer readable medium for providing for takeover of data containers in a clustered storage environment as defined in claim 20, comprising program instructions for performing the further step of:

checking file system identifications for each volume in the new data container, and assigning new file system identification numbers to volumes that have duplicate identification numbers.

23. The computer readable medium for providing for takeover of data containers in a clustered storage environment as defined in claim 20, comprising program instructions for performing the further step of:

at said surviving storage system node, pre-empting SCSI reservations on one or more disks associated with the failed storage system node in the cluster assigned to that surviving storage system node, and said surviving storage system node asserting its own SCSI reservations said assigned disks.

24. The computer readable medium for providing for takeover of data containers in a clustered storage environment as defined in claim 20, comprising program instructions for performing the further step of:

at said surviving storage system node, asserting ownership over a portion of one or more disks associated with the failed storage system node in the cluster assigned to that surviving storage system node.

25. The computer readable medium for providing for takeover of data containers in a clustered storage environment as defined in claim 24, comprising program instructions for performing the further step of:

asserting ownership over said portion of one or more disks using a fencing technique.

26. The computer readable medium for providing for takeover of data containers in a clustered storage environment as defined in claim 20 wherein all of the disks of the failed storage system node are assigned to a single surviving storage system node.

27. The computer readable medium as defined in claim 20 comprising further program instructions for performing the step of performing said assimilation on said disks by using a RAID system.

Patent Citations (144)

Patent	Date	Inventor	Cited By
US3876978(A)	1975-04-01	Bossen et al.	Applicant
US4092732(A)	1978-05-01	Ouchi	Applicant
US4201976(A)	1980-05-01	Patel	Applicant
US4205324(A)	1980-05-01	Patel	Applicant
US4375100(A)	1983-02-01	Tsuji et al.	Applicant
US4467421(A)	1984-08-01	White	Applicant
US4517663(A)	1985-05-01	Imazeki et al.	Applicant
US4547882(A)	1985-10-01	Tanner	Applicant
US4570217(A)	1986-02-01	Allen et al.	Applicant
US4667326(A)	1987-05-01	Young et al.	Applicant
US4688221(A)	1987-08-01	Nakamura et al.	Applicant
US4722085(A)	1988-01-01	Flora et al.	Applicant
US4755978(A)	1988-07-01	Takizawa et al.	Applicant
US4761785(A)	1988-08-01	Clark et al.	Applicant
US4775978(A)	1988-10-01	Hartness	Applicant
US4796260(A)	1989-01-01	Schilling et al.	Applicant
US4817035(A)	1989-03-01	Timsit	Applicant
US4825403(A)	1989-04-01	Gershenson et al.	Applicant
US4837680(A)	1989-06-01	Crockett et al.	Applicant
US4847842(A)	1989-07-01	Schilling	Applicant
US4849929(A)	1989-07-01	Timsit	Applicant
US4849974(A)	1989-07-01	Schilling et al.	Applicant
US4849976(A)	1989-07-01	Schilling et al.	Applicant
US4870643(A)	1989-09-01	Bultman et al.	Applicant
US4899342(A)	1990-02-01	Potter et al.	Applicant
US4989205(A)	1991-01-01	Dunphy, Jr. et al.	Applicant
US4989206(A)	1991-01-01	Dunphy, Jr. et al.	Applicant
US5077736(A)	1991-12-01	Dunphy, Jr. et al.	Applicant
US5088081(A)	1992-02-01	Farr	Applicant
US5101492(A)	1992-03-01	Schultz et al.	Applicant
US5124987(A)	1992-06-01	Milligan et al.	Applicant
US5128810(A)	1992-07-01	Halford	Applicant
US5148432(A)	1992-09-01	Gordon et al.	Applicant
USRE34100(E)	1992-10-01	Hartness	Applicant
US5163131(A)	1992-11-01	Row et al.	Applicant
US5166936(A)	1992-11-01	Ewert et al.	Applicant
US5179704(A)	1993-01-01	Jibbe et al.	Applicant
US5202979(A)	1993-04-01	Hillis et al.	Applicant
US5208813(A)	1993-05-01	Stallmo	Applicant
US5210860(A)	1993-05-01	Pfeffer et al.	Applicant
US5218689(A)	1993-06-01	Hotle	Applicant
US5233618(A)	1993-08-01	Glider et al.	Applicant
US5235601(A)	1993-08-01	Stallmo et al.	Applicant
US5237658(A)	1993-08-01	Walker et al.	Applicant
US5257367(A)	1993-10-01	Goodlander et al.	Applicant
US5271012(A)	1993-12-01	Blaum et al.	Applicant
US5274799(A)	1993-12-01	Brant et al.	Applicant
US5278979(A)	1994-01-01	Foster et al.	Applicant
US5305326(A)	1994-04-01	Solomon et al.	Applicant
US5351246(A)	1994-09-01	Blaum et al.	Applicant
US5355453(A)	1994-10-01	Row et al.	Applicant
US5375128(A)	1994-12-01	Menon et al.	Applicant
US5403667(A)	1995-04-01	Simoens	Applicant
US5410667(A)	1995-04-01	Belsan et al.	Applicant
US5485579(A)	1996-01-01	Hitz et al.	Applicant
US5537567(A)	1996-07-01	Galbraith et al.	Applicant
US5579475(A)	1996-11-01	Blaum et al.	Applicant
US5581724(A)	1996-12-01	Belsan et al.	Applicant
US5623595(A)	1997-04-01	Bailey	Applicant
US5657468(A)	1997-08-01	Stallmo et al.	Applicant
US5802366(A)	1998-09-01	Row et al.	Applicant
US5805788(A)	1998-09-01	Johnson	Applicant
US5812753(A)	1998-09-01	Chiariotti	Applicant
US5819292(A)	1998-10-01	Hitz et al.	Applicant
US5862158(A)	1999-01-01	Baylor et al.	Applicant
US5884098(A)	1999-03-01	Mason, Jr.	Applicant
US5892955(A)	1999-04-01	Ofer	Applicant
US5894588(A)	1999-04-01	Kawashima et al.	Applicant
US5931918(A)	1999-08-01	Row et al.	Applicant
US5941972(A)	1999-08-01	Hoese et al.	Applicant
US5948110(A)	1999-09-01	Hitz et al.	Applicant
US5950225(A)	1999-09-01	Kleiman	Applicant
US5956734(A)	1999-09-01	Schmuck et al.	Applicant
US5963962(A)	1999-10-01	Hitz et al.	Applicant
US5975738(A)	1999-11-01	DeKoning et al.	Applicant
US6038570(A)	2000-03-01	Hitz et al.	Applicant
US6061770(A)	2000-05-01	Franklin	Applicant
US6065037(A)	2000-05-01	Hitz et al.	Applicant
US6081875(A)	2000-06-01	Clifton et al.	Applicant
US6092215(A)	2000-07-01	Hodges et al.	Applicant
US6128734(A)	2000-10-01	Gross et al.	Applicant
US6138125(A)	2000-10-01	DeMoss	Applicant
US6138126(A)	2000-10-01	Hitz et al.	Applicant
US6138201(A)	2000-10-01	Rebalski	Applicant
US6158017(A)	2000-12-01	Han et al.	Applicant
US6205481(B1)	2001-03-01	Heddaya et al.	Applicant
US6223300(B1)	2001-04-01	Gotoh	Applicant
US6247157(B1)	2001-06-01	Edirisooriya	Applicant
US6289356(B1)	2001-09-01	Hitz et al.	Applicant
US6341341(B1)	2002-01-01	Grummon et al.	Applicant
US6343324(B1)	2002-01-01	Hubis et al.	Examiner
US6347248(B1)	2002-02-01	Gliner	Applicant
US6425035(B2)	2002-07-01	Hoese et al.	Applicant
US6449622(B1)	2002-09-01	LaRue et al.	Applicant
US6532548(B1)	2003-03-01	Hughes	Applicant
US6557123(B1)	2003-04-01	Wiencko et al.	Applicant
US6571326(B2)	2003-05-01	Spiegel et al.	Applicant
US6581185(B1)	2003-06-01	Hughes	Applicant
US6654902(B1)	2003-11-01	Brunelle et al.	Applicant
US6671772(B1)	2003-12-01	Cousins	Applicant
US6671773(B2)	2003-12-01	Kazar et al.	Applicant
US6708265(B1)	2004-03-01	Black	Applicant
US6725392(B1)	2004-04-01	Frey et al.	Examiner
US6742137(B1)	2004-05-01	Frey, Jr.	Applicant
US6757695(B1)	2004-06-01	Noveck et al.	Applicant
US6779095(B2)	2004-08-01	Selkirk et al.	Applicant
US6993701(B2)	2006-01-01	Corbett et al.	Applicant
US7073115(B2)	2006-07-01	English et al.	Applicant
US7085883(B1)	2006-08-01	Dalgic et al.	Examiner
US7127577(B2)	2006-10-01	Koning et al.	Applicant
US7149859(B2)	2006-12-01	Fujibayashi	Examiner
US7203892(B2)	2007-04-01	Corbett et al.	Applicant
US7231489(B1)	2007-06-01	Larson et al.	Applicant
US7260678(B1)	2007-08-01	Agarwal et al.	Applicant
US7260737(B1)	2007-08-01	Lent et al.	Applicant
US7272613(B2)	2007-09-01	Sim et al.	Applicant
US7296068(B1)	2007-11-01	Sarma et al.	Applicant
US7328305(B2)	2008-02-01	Kleiman et al.	Applicant
US7376679(B2)	2008-05-01	Pasupathy	Applicant
US7409625(B2)	2008-08-01	Corbett et al.	Applicant
US7546302(B1)	2009-06-01	Coatney et al.	Applicant
US2002/0083037(A1)	2002-06-01	Lewis et al.	Applicant
US2002/0099914(A1)	2002-07-01	Matsunami et al.	Applicant
US2002/0124137(A1)	2002-09-01	Ulrich et al.	Applicant
US2002/0174207(A1)	2002-11-01	Battou	Applicant
US2003/0061491(A1)	2003-03-01	Jaskiewicz et al.	Applicant
US2003/0097611(A1)	2003-05-01	Delaney et al.	Applicant
US2003/0120743(A1)	2003-06-01	Coatney et al.	Applicant
US2003/0126139(A1)	2003-07-01	Lee et al.	Applicant
US2003/0182593(A1)	2003-09-01	Emberty et al.	Examiner
US2004/0030668(A1)	2004-02-01	Pawlowski et al.	Applicant
US2004/0088297(A1)	2004-05-01	Coates et al.	Examiner
US2005/0193226(A1)	2005-09-01	Ahmed et al.	Applicant
US2006/0056421(A1)	2006-03-01	Zaki	Applicant
US2006/0218210(A1)	2006-09-01	Sarma et al.	Applicant
US2007/0118706(A1)	2007-05-01	Pepper	Examiner
US2007/0124341(A1)	2007-05-01	Lango et al.	Examiner
US2007/0124453(A1)	2007-05-01	Slaughter et al.	Applicant
US2007/0168693(A1)	2007-07-01	Pittman	Examiner
US2007/0244908(A1)	2007-10-01	Rajan	Examiner
US2007/0276878(A1)	2007-11-01	Zheng et al.	Examiner
EP1324200(A2)	2003-07-01		Applicant
WO-01/13236(A1)	2001-02-01		Applicant
WO-02/29539(A2)	2002-04-01		Applicant

Non-Patent Literature (103)

Akyurek, Sedat, Placing Replicated Data to Reduce Seek Delays, Department of Computer Science, University of Maryland, UMIACS-TR-91-121, CS-TR-2746, Aug. 1991.Applicant
Bitton, Dina, Disk Shadowing, Proceedings of the 14th VLDB Conference, LA, CA 1988.Applicant
Chaudhuri, Surajit, et al., Self-Tuning Technology in Microsoft SQL Server, Data Engineering Journal 22, 2 1999 pp. 20-27.Applicant
Chutani, Sailesh, et al., The Episode File System, in Proceedings of the USENIX Winter 1992.Applicant
Coyne, Robert A., et al., Storage Systems for National Information Assets, Proc. Supercomputing 92, Minneapolis, Nov, 1992, pp. 626-633.Applicant
Finlayson, Ross S., et al., Log Files: An Extended File Service Exploiting Write-Once Storage Department of Computer Science, Stanford University, Report No. STAN-CS-87-1177, Sep. 1987.Applicant
Gray, Jim, et al., The Recovery Manager of the System R Database Manager, ACM Computing Surveys, 13(2):223-242 1981.Applicant
Hecht, Matthew S., et al. Shadowed Management of Free Disk Pages with a Linked List, ACM Transactions on Database Systems, 8/4, Dec. 1983, pp. 503-514.Applicant
Howard, John, H. et al., Scale and Performance in a Distributed File System, Carnegie Mellon University, CMU-ITC-87-068, Aug. 1987.Applicant
Howard, John H., An Overview of the Andrew File System, Carnegie Mellon University, CMU-ITC-88-062 1988.Applicant
Howard, John, H. et al., Scale and Performance in a Distributed File System, ACM Trans. Computer System, 6(1), Feb. 1988 pp. 51-81.Applicant
Kazar, Michael Leon, Synchronization and Caching Issues in the Andrew File System, Carnegie Mellon University, CMU-ITC-88-063.Applicant
Kazar, Michael L., et al., Decorum File System Architectural Overview, USENIX Summer Conference, Anaheim, California, 1990.Applicant
Kemper, Alfons, et al., Performance Tuning for SAP R/3, Data Engineering Journal 22, 2 1999 pp. 33-40.Applicant
Kent, Jack et al., Optimizing Shadow Recovery Algorithms, IEEE Transactions on Software Engineering, 14( 2): 155-168, Feb. 1988.Applicant
Kistler, et al., Disconnected Operation in the Coda File System, ACM Transactions on Computer Systems, vol. 10, No. 1, Feb. 1992, pp. 3-25.Applicant
Lorie, Raymond, A. Physical Integrity in a Large Segmented Database, ACM Trans. Database Syst., vol. 2, Mar. 1977, pp. 91-104.Applicant
Ousterhout, John et al., Beating the I/O Bottleneck: A Case for Log-Structured File Systems, Technical Report, Computer Science Division, Electrical Engineering and Computer Sciences, University of California at Berkeley, Oct. 30, 1988.Applicant
Patterson, D., et al., A Case for Redundant Arrays of Inexpensive Disks (RAID), Technical Report, CSD-87-391, Computer Science Division, Electrical Engineering and Computer Sciences, University of California at Berkeley 1987.Applicant
Patterson, D., et al., A Case for Redundant Arrays of Inexpensive Disks (RAID), SIGMOD International Conference on Management of Data, Chicago, IL, USA, Jun. 1-3, 1988, SIGMOD Record (17)3:109-16 Sep. 1988.Applicant
Peterson, Zachary Nathaniel Joseph, Data Placement for Copy-on-Write Using Virtual Contiguity, University of CA, Santa Cruz, Master's Thesis for the Department of Science in Computer Science, Sep. 2002.Applicant
Quinlan, Sean, A Cached WORM File System, Software-Practice and Experience, 21(12):1289-1299 1991.Applicant
Rosenblum, Mendel, et al., The LFS Storage Manager, Computer Science Division, Electrical Engineering And Computer Sciences, Univ. of CA, presented at Summer '90 USENIX Technical Conference, Anaheim, CA Jun. 1990.Applicant
Rosenblum, Mendel, et al. The Design and Implementation of a Log-Structured File System Jul. 24, 1991 pp. 1-15.Applicant
Rosenblum, Mendel, The Design and Implementation of a Log-Structured File System, 1992 pp. 1-93.Applicant
Rosenblum, Mendel, et al., The Design and Implementation of a Log-Structured File System, In Proceedings of ACM Transactions on Computer Systems, (10)1:26-52, Feb. 1992.Applicant
Schiefer, Berni, et al., D82 Universal Database Performance Tuning, Data Engineering Journal 22, 2 1999 pp. 12-19.Applicant
Seltzer, Margo I., et al., Journaling Versus Soft Updates: Asynchronous Meta-Data Protection in File Systems, Proceedings of 200 USENIX Annual Technical Conference, Jun. 18-23, 2000.Applicant
Shasha, Dennis, Tuning Time Series Queries in Finance: Case Studies and Recommendations, Data Engineering Journal 22, 2 1999 pp. 41-47.Applicant
Sidebotham, Bob, Volumes: The Andrew File System Data Structuring Primitive, EEUG Conference Proceedings, Manchester, UK, Autumn 1986.Applicant
Subramanian, Muralidhar, et al., Performance Challenges in Object-Relational DBMSs, Data Engineering Journal 22, 2 1999 pp. 28-32.Applicant
Weikum, Gerhard, et al., Towards Self-Tuning Memory Management for Data Servers, Data Engineering Journal 22, 2 1999 pp. 3-11.Applicant
West, Michael, et al. The ITC Distributed File System: Prototype and Experience, Carnegie-Mellon University, Technical Report CMU-ITC-040, Mar. 1985.Applicant
Zayas, Edward R., AFS-3 Programmer's Reference: Architectural Overview, Transarc Corporation, Pittsburgh, PA, 1.0 edition 1991.Applicant
Anvin, Peter H, “The Mathematics of RAID 6,” Dec. 2004.Applicant
Auspex 4Front NS2000, System Architecture, Network-Attached Storage For a New Millennium, Auspex Engineering Technical Report 24, Jan. 1999.Applicant
Bestavros, Azer, et al., Reliability and Performance of Parallel Disks, Technical Memorandum 45312-891206-01 TM, AT&T, Bell Laboratories, Department 45312, Holmdel, NJ, Dec. 1989..Applicant
Blaum, Mario, et al., Evenodd: An Optimal Scheme for Tolerating Double Disk Failures in RAID Architectures, Computer Architectures News, Association for Computing Machinery, New York, US, vol. 22, No. XP000450355, Apr. 1, 1994.Applicant
Blaum, Mario, et al., Evenodd: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures, IEEE Transactions on Computers, vol. 44, No. 2, Feb. 1995, pp. 192-202.Applicant
Bultman, David L., High Performance SCSI Using Parallel Drive Technology, In Proc. BUSCON Conf., pp. 40-44, Anaheim, CA, Feb. 1988.Applicant
Chen, Peter et al., Two Papers on RAIDs. Technical Report, CSD-88-479, Computer Science Division, Electrical Engineering and Computer Sciences, University of California at Berkeley (1988).Applicant
Chen, Peter M., et al., An Evaluation of Redundant Arrays of Disks Using an Amdahl 5890, Performance Evaluation, pp. 74-85, 1990 - check to see if exact same compy as one in WAFL.Applicant
Chen, Peter M.., et al, Maximizing Performance in a Striped Disk Array, Proc. 1990 ACM SIGARCH 17th Intern. Symp. on Comp. Arch., Seattle, WA, May 1990, pp. 322-331.Applicant
Chen, Peter M., et al., RAID:High Performance, Reliable Secondary Storage, ACM Computing Surveys, 26(2):145-185, Jun. 1994.Applicant
Chervenak, Ann L., Performance Measurement of the First RAID Prototype, Technical Report UCB/CSD 90/574, Computer Science Division (EECS), University of California, Berkeley, May 1980.Applicant
Copeland, George, et al., A Comparison of High-Availability Media Recovery techniques, in Proc. ACM-SIGMOD Int. Conf. Management of Data, 1989.Applicant
Courtright II, William V., et al., RAIDframe: A Rapid Prototyping Tool for RAID Systems, Computer Science Technical Report CMU-CS97-142, Carnegie Mellon University, Pittsburgh, PA 15213, Jun. 4, 1997..Applicant
Evans The Tip of the lceberg:RAMAC Virtual Array—Part I, Technical Support, Mar. 1997, pp. 1-4.Applicant
Gibson, Garth A., et al., Coding Techniques for Handling Failures in Large Disk Arrays, Technical Report UCB/CSD 88/477, Computer Science Division, University of California, (Jul. 1988).Applicant
Gibson, Garth A., et al., Failure Correction Techniques for Large Disk Arrays, In Proceedings Architectural Support for Programming Languages and Operating Systems, Boston, Apr. 1989, pp. 123-132.Applicant
Gibson, Garth A., et al., Strategic Directions in Storage I/O Issues in Large-Scale Computing, ACM Computing Survey, 28(4):779-93, Dec. 1996.Applicant
Goldick, Jonathan S., et al., Multi-resident AFS: An Adventure in Mass Storage, In Proceedings of the 1995 USENIX Technical Conference, pp. 47-58, Jan. 1995.Applicant
Graham, Susan L., et al., Massive Information Storage, Management, and Use, (NSF Institutional Infrastructure Proposal), Technical Report No. UCB/CSD 89/493, Jan. 1989.Applicant
Gray, Jim et al., Parity striping of disc arrays: Low-Cost Reliable Storage with Acceptable Throughput. In Proceedings of the 16th Very Large Data Bases Conference, pp. 148-161, Brisbane, Australia, 1990.Applicant
Grimes, DW Martinez, Two Dimensional Parity Error Correction Procedure, IBM Technical Disclosure Bulletin 2686-2689, Oct. 1982.Applicant
Grimes, DW Martinez, Vertical Parity Generator for Two Dimensional Panty, IBM Technical Disclosure Bulletin 2682-2685, Oct. 1982.Applicant
Hellerstein, Lisa, et al,. Coding Techniques for Handling Failures in Large Disk Arrays. In Algorithmica vol. 2, Nr. 3, 182-208 (1994).Applicant
Hitz, David, TR3002 File System Design for a NFS File Server Appliance, Network Appliance, Inc.Applicant
Hughes, James, et al., High Performance RAIT , Tenth NASA Goddard Conference on Mass Storage Systems and Technologies and Nineteenth IEEE Symposium on Mass Storage Systems, Adelphi, Maryland, USA, Apr. 2002.Applicant
Johnson, Theodore, et al, Tape Group Parity Protection, IEEE Symposium on Mass Storage, pp. 72-79, Mar. 1999.Applicant
Katz, Randy H. et al., Disk System Architectures for High Performance Computing, undated.Applicant
Kim, Michelle Y., Synchronized Disk Interleaving, IEEE Transactions on Computers, C-35(11):978-988, Nov. 1986.Applicant
Kim, Michelle, et al., Asynchronous Disk Interleaving Approximating Access Delays, IEEE Transactions on Computers, vol. 40, No. 7, Jul. 1991, pp. 801-810.Applicant
Lawlor, F. D., Efficient Mass Storage Parity Recovery Mechanism, IBM Technical Disclosure Bulletin 24(2):986-987, Jul. 1991 , pp. 801-810.Applicant
Lee, Edward K., et al., RAID-II: A Scalable Storage Architecture for High-Bandwidth Network File Service, Technical Report UCB/CSD 92/672, (Feb. 1992).Applicant
Lee, Edward K., et al., The Performance of Parity Placements in Disk Arrays, IEEE Transactions on Computers, vol. 42 No. 6, Jun. 1993, 14 pages.Applicant
Li, Don, et al., Authors' Reply, IEEE Transactions on Communications, 46:575, May 1998.Applicant
Limited Distributed DASD Checksum, A RADI Hybrid, IBW Technical Disclosure Bulletin, IBM Corp. New York, US, vol. 35, No. 4A, XP000314813, Sep. 1, 1992.Applicant
Livny, Miron, et al., Multi-Disk Management Algorithms, In Proceedings of the ACM International Cofnerence on Measurement and Modeling of Computer Systems (SIGMETRICS), pp. 69-77, Banff, Alberta, Canada, May 1987.Applicant
Meador, Wes E.,Disk Array Systems, Proceedings of COMPCON, 1989, pp. 143-146.Applicant
Menon, Jai, et al., Methods for Improved Update Performance of Disk Arrays, IBM Almaden Research Center, IEEE, Jan. 1992, 10 pages.Applicant
Menon, Jai, et al., Floating Parity and Data Disk Arrays, Journal of Parallel and Distributed Computing, Boston: Academic Press, Inc., vol. 17 No. 1 and 2, Jan./Feb. 1993, 13 pages.Applicant
Microsoft Computer Dictionary, 5th Edition, 2002, p. 211.Applicant
Ng, Spencer, et al., Trade-Offs Between Devices and Paths in Achieving Disk Interleaving, IEEE Intermational Symposium on Computer Architecture, 1988, pp. 196-201.Applicant
Ng, Spencer, Some Design Issues of Disk Arrays, Proceedings of Compcon Spring '89, pp. 137-42.Applicant
Park, Arvin, et al., Providing Fault Tolerance in Parallel Secondary Storage Systems, Technical Report CS-TR-057-86, Princeton, Nov. 1986.Applicant
Patel, Arvind M., Adaptive Cross-Parity (AXP) Code for a High-Density Magnetic Tape Subsystem, IBM Technical Disclosure Bulletin 29(6):546-562, Nov. 1986.Applicant
Patterson, David A., et al., Introduction to Redundant Arrays of Inexpensive Disks (RAID). In IEEE Spring 89 COMPCON, San Francisco, IEEE Computer Society Press, Feb. 27 - Mar. 3, 1989, pp. 112-117..Applicant
Storagesuite, Performance Without Compromise: The Virtual Storage Architecture, catalogue, 1997.Applicant
Reddy, A. L. Narasimha, et al., An Evaluation of Multiple-Disk I/O Systems, IEEE Transactions on Computers, vol. 38, No. 12, Dec. 1989, pp. 1680-1690.Applicant
Scheuermann, Peter, et al.,Data Partitioning and Load Balancing in Parallel Disk Systems, The VLDB Journal, vol. 7, Springer-Verlag, Copyright Feb. 1998. 19 pages.Applicant
Schulze, Martin E., Considerations in the Design of a RAID Prototype, Computer Science Division, Department of Electrical Engineering and Computer Sciences, Univ. of CA, Berkley, Aug. 25, 1988.Applicant
Schulze, Martin., et al., How Reliable is a RAID?, Proceedings of COMPCON, 1989, pp. 118-123.Applicant
Shirriff, Kenneth W., Sawmill:A Logging File System for a High-Performance RAID Disk Array, CSD-95-862, Jan. 1995.Applicant
Stanek, William R., Microsoft Windows 2000 Server: Administering vol. Sets and RAID Arrays, Jan. 10, 2006, (http://www.microsoft.com/technet/prodtechnol/windows2000serv/maintain/operate/11w2kada.mspx), (Printed 1999).Applicant
Stodolsky, Daniel, et al., Parity Logging Overcoming the Small Write Problem in Redundant Disk Array, School of Computer Science and Department of Electrical and Computer Engineering, Carnegie Mellon University, IEEE, May 1993, 12 pages.Applicant
Stonebraker, Michael, et al., The Design of XPRS, Proceedings of the 14th VLDB Conference, LA, CA (1988).Applicant
Tanabe, Takaya, et al, Redundant Optical Storage System Using DVD-RAM Library, IEEE Symposium on Mass Storage, pp. 80-87, Mar. 1999.Applicant
TEKRAM —“About RAID 6”.Applicant
Tweten, David, Hiding Mass Storage Under UNIX: NASA's MSS-H Architecture, IEEE Symposium on Mass Storage, pp. 140-145, May 1990.Applicant
Weikum, Gerhard, et al., Dynamic File Allocation in Disk Arrays, ETH Zurich, Department of Computer Science Information Systems - Databases, ACM SIGMOD Record, vol. 20, Issue 2, Jun. 1991, 10 pages.Applicant
Wilkes, John, et al., The HP AutoRAID hierarchical storage system, ACM Transactions on Computer Systems, Feb. 1996, vol. 14, pp. 108-36.Applicant
American National Standards Institute, Inc.; American National Standard for Information Technology; Fibre Channel- Physical and Signaling Interface (FC-PH); Nov. 14, 1994.Applicant
American National Standards Institute, Inc.; American National Standard for Information Technology - Fibre Channel Arbitrated Loop (FC-AL-2); Dec. 8, 1999.Applicant
SNIA Storage Networking Industry Association; Common Internet File System (CIFS), Version: CIFS-Spec. 0.9. Work Group in Progress.Applicant
Fibre Channel Generic Services - 3 (FC-GS-3), Revision 6.0; NCITS Working Draft Proposed American National Standard for Information Technology; Nov. 24, 1999.Applicant
Draft Proposed American National Standard for Information Systems - SCSI-3 Primary Commands; Mar. 28, 1997.Applicant
New Identifier Formats Based on IEEE Registration; http://standards.ieee.org/regauth/oui/tutorials/fibreformat.html; Accessed on Aug. 6, 2001.Applicant
Soltis S et al. “The Design and Performance of a Shared Disk File System for IRIX” NASA Goddard Space Flight Center Conference on Mass Storage and Technologies in Cooperation with the IEEE Symposium on Mass Storage Systems, Mar. 23, 1998, pp. 1-17, XP002194621.Applicant
Hu Yoshida: “LUN Security Considerations for Storage Area Networks” Hitachi Data Systems, 1999, pp. 1-7, XP002185193.Applicant
White, Brian et al., “An Integrated Experimental Environment for Distributed Systems and Networks”, Dec. 23, 2002, School of Computing, University of Utah, http://www.cs.utah.ed/flux/netbed, pp. 1-16.Applicant
Bolen et al., Application for Single Nodename Cluster System for Fibre Channel, U.S. Appl. No. 11/411,502, filed Apr. 26, 2006, 54 pages.Applicant
Watanabe et al., Application for Method and System for Maintaining Disk Location Via Homeness, U.S. Appl. No. 11/606,538, filed Nov. 30, 2006, 46 pages.Applicant

Abstract