US 7,698,289 B2Grant
Storage system architecture for striping data container content across volumes of a cluster
Issue Date:2010-04-13
•50 Claims
•21 Drawing Sheets
Abstract
A storage system architecture comprises one or more volumes distributed across a plurality of nodes interconnected as a cluster. The volumes are organized as a striped volume set (SVS) and configured to store content of data containers served by the cluster in response to multi-protocol data access requests issued by clients. Each node of the cluster includes (i) a storage server adapted to service a volume of the SVS and (ii) a multi-protocol engine adapted to redirect the data access requests to any storage server of the cluster. Notably, the content of each data container is apportioned among the volumes of the SVS to thereby improve the efficiency of storage service provided by the cluster.
Metadata
Assignee
- NetApp, Inc.
Inventors
- Michael Kazar
- Richard P. Jernigan, IV
- Richard N. Sanzi, Jr.
Application Information
Application Number:US 11/119,278
Filing Date:2005-04-29
Priority Date:2003-12-02
Art Unit:2161
Classifications
IPC:
G06F17/30
Patent Drawings (21 sheets)
Description
[0001] This application is a Continuation-in-Part application of U.S. patent application Ser. No. 10/727,169, entitled METHOD AND APPARATUS FOR DATA STORAGE USING STRIPING, by Michael L. Kazar, et al, filed on Dec. 2, 2003 now U.S. Pat. No. 7,302,520, the contents of which are hereby incorporated by reference.
Field of the Invention
[0002] The present invention is directed to storage systems and, in particular to striping a file across a plurality of volumes on one or more storage systems.
Background of the Invention
[0003] A storage system typically comprises one or more storage devices into which information may be entered, and from which information may be obtained, as desired. The storage system includes a storage operating system that functionally organizes the system by, inter alia, invoking storage operations in support of a storage service implemented by the system. The storage system may be implemented in accordance with a variety of storage architectures including, but not limited to, a network-attached storage environment, a storage area network and a disk assembly directly attached to a client or host computer. The storage devices are typically disk drives organized as a disk array, wherein the term “disk” commonly describes a self-contained rotating magnetic media storage device. The term disk in this context is synonymous with hard disk drive (HDD) or direct access storage device (DASD).
[0004] The storage operating system of the storage system may implement a high-level module, such as a file system, to logically organize the information stored on volumes as a hierarchical structure of data containers, such as files and logical units. For example, each “on-disk” file may be implemented as set of data structures, i.e., disk blocks, configured to store information, such as the actual data for the file. These data blocks are organized within a volume block number (vbn) space that is maintained by the file system. The file system may also assign each data block in the file a corresponding “file offset” or file block number (fbn). The file system typically assigns sequences of fbns on a per-file basis, whereas vbns are assigned over a larger volume address space. The file system organizes the data blocks within the vbn space as a “logical volume”; each logical volume may be, although is not necessarily, associated with its own file system.
[0005] A known type of file system is a write-anywhere file system that does not over-write data on disks. If a data block is retrieved (read) from disk into a memory of the storage system and “dirtied” (i.e., updated or modified) with new data, the data block is thereafter stored (written) to a new location on disk to optimize write performance. A write-anywhere file system may initially assume an optimal layout such that the data is substantially contiguously arranged on disks. The optimal disk layout results in efficient access operations, particularly for sequential read operations, directed to the disks. An example of a write-anywhere file system that is configured to operate on a storage system is the Write Anywhere File Layout (WAFL™) file system available from Network Appliance, Inc., Sunnyvale, Calif.
[0006] The storage system may be further configured to operate according to a client/server model of information delivery to thereby allow many clients to access data containers stored on the system. In this model, the client may comprise an application, such as a database application, executing on a computer that “connects” to the storage system over a computer network, such as a point-to-point link, shared local area network (LAN), wide area network (WAN), or virtual private network (VPN) implemented over a public network such as the Internet. Each client may request the services of the storage system by issuing file-based and block-based protocol messages (in the form of packets) to the system over the network.
[0007] A plurality of storage systems may be interconnected to provide a storage system environment configured to service many clients. Each storage system may be configured to service one or more volumes, wherein each volume stores one or more data containers. Yet often a large number of data access requests issued by the clients may be directed to a small number of data containers serviced by a particular storage system of the environment. A solution to such a problem is to distribute the volumes serviced by the particular storage system among all of the storage systems of the environment. This, in turn, distributes the data access requests, along with the processing resources needed to service such requests, among all of the storage systems, thereby reducing the individual processing load on each storage system. However, a noted disadvantage arises when only a single data container, such as a file, is heavily accessed by clients of the storage system environment. As a result, the storage system attempting to service the requests directed to that data container may exceed its processing resources and become overburdened, with a concomitant degradation of speed and performance.
Summary of the Invention
[0008] The present invention overcomes the disadvantages of the prior art by providing a storage system architecture comprising one or more volumes distributed across a plurality of nodes interconnected as a cluster. The volumes are organized as a striped volume set (SVS) and configured to store content of data containers, such as files and logical units, served by the cluster in response to multi-protocol data access requests issued by clients. Each node of the cluster includes (i) a storage server adapted to service a volume of the SVS and (ii) a multi-protocol engine adapted to redirect the data access requests to any storage server of the cluster. Notably, the content of each data container is apportioned among the volumes of the SVS to thereby improve the efficiency of storage service provided by the cluster.
[0009] According to an aspect of the invention, the SVS comprises one meta-data volume (MDV), and one or more data volumes (DV). The MDV is configured to store a canonical copy of meta-data, including access control lists and directories, associated with all data containers stored on the SVS, whereas each DV is configured to store, at least, data content of those containers. For each data container stored on the SVS, one volume is designated the CAV and, to that end, is configured to store (“cache”) certain, rapidly-changing attribute meta-data associated with that container to thereby offload access requests that would otherwise be directed to the MDV.
[0010] According to another aspect of the invention, the SVS is associated with a set of striping rules that define a stripe algorithm, a stripe width and an ordered list of volumes within the SVS. The stripe algorithm specifies the manner in which data container content is apportioned as stripes across the plurality of volumes, while the stripe width specifies the size/width of each stripe. Moreover, the ordered list of volumes may specify the function and implementation of the various volumes and striping rules of the SVS. For example, the first volume in the ordered list may denote the MDV of the SVS, whereas the ordering of volumes in the list may denote the manner of implementing a particular striping algorithm, e.g., round-robin.
[0011] In the illustrative embodiment, the storage server of each node is embodied as a disk element (D-blade) and the multi-protocol engine is embodied as a network element (N-blade). The N-blade receives a multi-protocol data access request from a client, converts that request into a cluster fabric (CF) message and redirects the message to an appropriate D-blade of the cluster. A CF module of the N-Blade implements a novel Locate( ) function to compute the location of data container content in the SVS volume to which the message is directed to thereby ensure consistency of such content served by the cluster. Each D-blade comprises a file system and a volume striping module (VSM) that cooperate to service a volume of the SVS by processing the CF message in accordance with the striping rules. In particular, the VSM implements the novel Locate( ) function.
Brief Description of the Drawings
[0012] The above and further advantages of invention may be better understood by referring to the following description in conjunction with the accompanying drawings in which like reference numerals indicate identical or functionally similar elements:
[0013] 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;
[0014] FIG. 2 is a schematic block diagram of a node in accordance with an embodiment of the present invention;
[0015] FIG. 3 is a schematic block diagram of a storage operating system that may be advantageously used with the present invention;
[0016] FIG. 4 is a schematic block diagram illustrating the format of a cluster fabric (CF) message in accordance with an embodiment of with the present invention;
[0017] FIG. 5 is a schematic block diagram illustrating the format of a data container handle in accordance with an embodiment of the present invention;
[0018] FIG. 6 is a schematic block diagram of an exemplary inode in accordance with an embodiment of the present invention;
[0019] FIG. 7 is a schematic block diagram of an exemplary buffer tree in accordance with an embodiment of the present invention;
[0020] FIG. 8 is a schematic block diagram of an illustrative embodiment of a buffer tree of a file that may be advantageously used with the present invention;
[0021] FIG. 9 is a schematic block diagram of an exemplary aggregate in accordance with an embodiment of the present invention;
[0022] FIG. 10 is a schematic block diagram of an exemplary on-disk layout of the aggregate in accordance with an embodiment of the present invention;
[0023] FIG. 11 is a schematic block diagram illustrating a collection of management processes in accordance with an embodiment of the present invention;
[0024] FIG. 12 is a schematic block diagram of a volume location database (VLDB) volume entry in accordance with an embodiment of the present invention;
[0025] FIG. 13 is a schematic block diagram of a VLDB aggregate entry in accordance with an embodiment of the present invention;
[0026] FIG. 14 is a schematic block diagram of a striped volume set (SVS) in accordance with an embodiment of the present invention;
[0027] FIG. 15 is a schematic block diagram of a VLDB SVS entry in accordance with an embodiment the present invention;
[0028] FIG. 16 is a schematic block diagram illustrating the periodic sparseness of file content stored on volumes of a SVS in accordance with an embodiment of the present invention;
[0029] FIG. 17 is a flowchart detailing steps of a procedure for creating a new file in accordance with an embodiment of the present invention;
[0030] FIG. 18 is a flowchart detailing the steps of a procedure for deleting a file in accordance with embodiment of the present invention;
[0031] FIG. 18 is a flowchart detailing the steps of a procedure for retrieving attributes of a file in accordance with an embodiment of the present invention;
[0032] FIG. 20 is a flowchart detailing the steps of a procedure for writing/modifying file attributes in accordance with an embodiment of the present invention;
[0033] FIG. 21 is a flowchart detailing the steps of a procedure for processing a read request in accordance with an embodiment of the present invention; and
[0034] FIG. 22 is a flowchart detailing the steps of a procedure for processing a write request in accordance with an embodiment of the present invention.
Detailed Description of an Illustrative Embodiment
[0035] A. Cluster Environment
[0036] FIG. 1 is a schematic block diagram of a plurality of nodes 200 interconnected as a cluster 100 and configured to provide storage service relating to the organization of information on storage devices. The nodes 200 comprise various functional components that cooperate to provide a distributed storage system architecture of the cluster 100. To that end, each node 200 is generally organized as a network element (N-blade 310) and a disk element (D-blade 350). The N-blade 310 includes functionality that enables the node 200 to connect to clients 180 over a computer network 140, while each D-blade 350 connects to one or more storage devices, such as disks 130 of a disk array 120. The nodes 200 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 titled METHOD AND SYSTEM FOR RESPONDING TO FILE SYSTEM REQUESTS, by M. Kazar et al. published Aug. 22, 2002. It should be noted that while there is shown an equal number of N and D-blades in the illustrative cluster 100, there may be differing numbers of N and/or D-blades in accordance with various embodiments of the present invention. For example, there may be a plurality of N-blades and/or D-blades interconnected in a cluster configuration 100 that does not reflect a one-to-one correspondence between the N and D-blades. As such, the description of a node 200 comprising one N-blade and one D-blade should be taken as illustrative only.
[0037] The clients 180 may be general-purpose computers configured to interact with the node 200 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.
[0038] B. Storage System Node
[0039] FIG. 2 is a schematic block diagram of a node 200 that is illustratively embodied as a storage system comprising a plurality of processors 222a,b, a memory 224, a network adapter 225, a cluster access adapter 226, 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, 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 1100 (see FIG. 11 ). 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-blades and D-blades are implemented on separate storage systems or computers, the cluster access adapter 226 is utilized by the N/D-blade for communicating with other N/D-blades in the cluster 100.
[0040] 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 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-blade 310 on the node, while the other processor 222b executes the functions of the D-blade 350.
[0041] 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 is 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.
[0042] 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 may be embodied as an Ethernet network or a Fibre Channel (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.
[0043] 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 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.
[0044] Storage of information on each 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. 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.
[0045] 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 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 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. To that end, the storage server 365 includes a file system module 360 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 SCSI protocol. The VSM 370 illustratively implements a striped volume set (SVS) of the present invention. As described further herein, the VSM cooperates with the file system 360 to enable storage server 365 to service a volume of the SVS. In particular, the VSM 370 implements the novel 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.
[0050] 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 1110 (see FIG. 11 ), 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.
[0051] 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 meta-data describing the layout of its file system; these meta-data 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.
[0052] 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.
[0053] 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.
[0054] 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.
[0055] 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 NT®, or as a general-purpose operating system with configurable functionality, which is configured for storage applications as described herein.
[0056] 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, 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 any where file system, the teachings of the present invention may be utilized with any suitable file system, including a write in place file system.
[0057] D. CF Protocol
[0058] In the illustrative embodiment, the storage server 365 is embodied as D-blade 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-blade 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-blade 310 and D-blade 350 cooperate to provide a highly-scalable, distributed storage system architecture of the cluster 100. To that end, each blade includes a cluster fabric (CF) interface module 340a,b adapted to implement intra-cluster communication among the blades, including D-blade-to-D-blade communication for data container striping operations described herein.
[0059] The protocol layers, e.g., the NFS/CIFS layers and the iSCSI/FC layers, of the N-blade 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-blade 350. That is, the N-blade 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-blades 350 of the cluster 100. Notably, the CF interface modules 340 cooperate to provide a single file system image across all D-blades 350 in the cluster 100. Thus, any network port of an N-blade that receives a client request can access any data container within the single file system image located on any D-blade 350 of the cluster.
[0060] Further to the illustrative embodiment, the N-blade 310 and D-blade 350 are implemented as separately-scheduled processes of storage operating system 300; however, in an alternate embodiment, the blades may be implemented as pieces of code within a single operating system process. Communication between an N-blade and D-blade is thus illustratively effected through the use of message passing between the blades although, in the case of remote communication between an N-blade and D-blade of different nodes, such message passing occurs over the cluster switching fabric 150. A known message-passing mechanism provided by the storage operating system to transfer information between blades (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.
[0061] The CF interface module 340 implements the CF protocol for communicating file system commands among the blades of cluster 100. Communication is illustratively effected by the D-blade exposing the CF API to which an N-blade (or another D-blade) 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-blade 310 encapsulates a CF message as (i) a local procedure call (LPC) when communicating a file system command to a D-blade 350 residing on the same node 200 or (ii) a remote procedure call (RPC) when communicating the command to a D-blade residing on a remote node of the cluster 100. In either case, the CF decoder of CF interface 340b on D-blade 350 de-encapsulates the CF message and processes the file system command.
[0062] FIG. 4 is a schematic block diagram illustrating the format of a CF message 400 in accordance with an embodiment of with the present invention. The CF message 400 is illustratively used for RPC communication over the switching fabric 150 between remote blades 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 blades of the cluster. The CF message 400 includes a media access layer 402, an IP layer 404, a UDP layer 406, a reliable connection (RC) layer 408 and a CF protocol layer 410. 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 410 is that portion of message 400 that carries the file system commands. 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-blade 310) to a destination (e.g., a D-blade 350). The RC layer 408 implements a reliable transport protocol that is adapted to process such envelopes in accordance with a connectionless protocol, such as UDP 406.
[0063] A data container, e.g., a file, is accessed in the file system using a data container handle. FIG. 5 is a schematic block diagram illustrating the format of a data container handle 500 including a SVS ID field 502, an inode number field 504, a unique-ifier field 506 a striped flag field 508 and a striping epoch number field 510. The SVS ID field 502 contains a global identifier (within the cluster 100) of the SVS within which the data container resides. The inode number field 504 contains an inode number of an inode (within an inode file) pertaining to the data container. The unique-ifier field 506 contains a monotonically increasing number that uniquely identifies the data container handle 500. 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 508 is illustratively a Boolean value that identifies whether the data container is striped or not. The striping epoch number field 510 indicates the appropriate striping technique for use with this data container for embodiments where the SVS utilizes differing striping techniques for different data containers.
[0064] E. File System Organization
[0065] In the illustrative embodiment, a data container is represented in the write-anywhere file system as an inode data structure adapted for storage on the disks 130. FIG. 6 is a schematic block diagram of an inode 600, which preferably includes a meta-data section 605 and a data section 660. The information stored in the meta-data section 605 of each inode 600 describes the data container (e.g., a file) and, as such, includes the type (e.g., regular, directory, vdisk) 610 of file, its size 615, time stamps (e.g., access and/or modification time) 620 and ownership, i.e., user identifier (UID 625) and group ID (GID 630), of the file. The meta-data section 605 also includes a generation number 631, and a meta-data invalidation flag field 634. As described further herein, meta-data invalidation flag field 634 is used to indicate whether meta-data in this inode is usable or whether it should be re-acquired from the MDV. The contents of the data section 660 of each inode may be interpreted differently depending upon the type of file (inode) defined within the type field 610. For example, the data section 660 of a directory inode contains meta-data controlled by the file system, whereas the data section of a regular inode contains file system data. In this latter case, the data section 660 includes a representation of the data associated with the file.
[0066] Specifically, the data section 660 of a regular on-disk inode may include file system data or pointers, the latter referencing 4 kB data blocks on disk used to store the file system data. Each pointer is preferably a logical vbn to facilitate efficiency among the file system and the RAID system 380 when accessing the data on disks. Given the restricted size (e.g., 128 bytes) of the inode, file system data having a size that is less than or equal to 64 bytes is represented, in its entirety, within the data section of that inode. However, if the length of the contents of the data container exceeds 64 bytes but less than or equal to 64 kB, then the data section of the inode (e.g., a first level inode) comprises up to 16 pointers, each of which references a 4 kB block of data on the disk.
[0067] Moreover, if the size of the data is greater than 64 kB but less than or equal to 64 megabytes (MB), then each pointer in the data section 660 of the inode (e.g., a second level inode) references an indirect block (e.g., a first level L1 block) that contains 1024 pointers, each of which references a 4 kB data block on disk. For file system data having a size greater than 64 MB, each pointer in the data section 660 of the inode (e.g., a third level L3 inode) references a double-indirect block (e.g., a second level L2 block) that contains 1024 pointers, each referencing an indirect (e.g., a first level L1) block. The indirect block, in turn, that contains 1024 pointers, each of which references a 4 kB data block on disk. When accessing a file, each block of the file may be loaded from disk 130 into the memory 224.
[0068] When an on-disk inode (or block) is loaded from disk 130 into memory 224, its corresponding in-core structure embeds the on-disk structure. For example, the dotted line surrounding the inode 600 indicates the in-core representation of the on-disk inode structure. The in-core structure is a block of memory that stores the on-disk structure plus additional information needed to manage data in the memory (but not on disk). The additional information may include, e.g., a “dirty” bit 670. After data in the inode (or block) is updated/modified as instructed by, e.g., a write operation, the modified data is marked “dirty” using the dirty bit 670 so that the inode (block) can be subsequently “flushed” (stored) to disk. The in-core and on-disk format structures of the WAFL file system, including the inodes and inode file, are disclosed and described in the previously incorporated U.S. Pat. No. 5,819,292 titled METHOD FOR MAINTAINING CONSISTENT STATES OF A FILE SYSTEM AND FOR CREATING USER-ACCESSIBLE READ-ONLY COPIES OF A FILE SYSTEM by David Hitz et al., issued on Oct. 6, 1998.
[0069] FIG. 7 is a schematic block diagram of an embodiment of a buffer tree of a file that may be advantageously used with the present invention. The buffer tree is an internal representation of blocks for a file (e.g., file 700) loaded into the memory 224 and maintained by the write-anywhere file system 360. A root (top-level) inode 702, such as an embedded inode, references indirect (e.g., level 1) blocks 704. Note that there may be additional levels of indirect blocks (e.g., level 2, level 3) depending upon the size of the file. The indirect blocks (and inode) contain pointers 705 that ultimately reference data blocks 706 used to store the actual data of the file. That is, the data of file 700 are contained in data blocks and the locations of these blocks are stored in the indirect blocks of the file. Each level 1 indirect block 704 may contain pointers to as many as 1024 data blocks. According to the “write anywhere” nature of the file system, these blocks may be located anywhere on the disks 130.
[0070] A file system layout is provided that apportions an underlying physical volume into one or more virtual volumes (or flexible volume) of a storage system, such as node 200. An example of such a file system layout is described in U.S. patent application Ser. No. 10/836,817 titled EXTENSION OF WRITE ANYWHERE FILE SYSTEM LAYOUT, by John K. Edwards et al. and assigned to Network Appliance, Inc. The underlying physical volume is an aggregate comprising one or more groups of disks, such as RAID groups, of the node. The aggregate has its own physical volume block number (pvbn) space and maintains meta-data, such as block allocation structures, within that pvbn space. Each flexible volume has its own virtual volume block number (vvbn) space and maintains meta-data, such as block allocation structures, within that vvbn space. Each flexible volume is a file system that is associated with a container file; the container file is a file in the aggregate that contains all blocks used by the flexible volume. More-over, each flexible volume comprises data blocks and indirect blocks that contain block pointers that point at either other indirect blocks or data blocks.
[0071] In one embodiment, pvbns are used as block pointers within buffer trees of files (such as file 700) stored in a flexible volume. This “hybrid” flexible volume embodiment involves the insertion of only the pvbn in the parent indirect block (e.g., inode or indirect block). On a read path of a logical volume, a “logical” volume (vol) info block has one or more pointers that reference one or more fsinfo blocks, each of which, in turn, points to an inode file and its corresponding inode buffer tree. The read path on a flexible volume is generally the same, following pvbns (instead of vvbns) to find appropriate locations of blocks; in this context, the read path (and corresponding read performance) of a flexible volume is substantially similar to that of a physical volume. Translation from pvbn-to-disk,dbn occurs at the file system/RAID system boundary of the storage operating system 300.
[0072] In an illustrative dual vbn hybrid flexible volume embodiment, both a pvbn and its corresponding vvbn are inserted in the parent indirect blocks in the buffer tree of a file. That is, the pvbn and vvbn are stored as a pair for each block pointer in most buffer tree structures that have pointers to other blocks, e.g., level 1 (L1) indirect blocks, inode file level 0 (L0) blocks. FIG. 8 is a schematic block diagram of an illustrative embodiment of a buffer tree of a file 800 that may be advantageously used with the present invention. A root (top-level) inode 802, such as an embedded inode, references indirect (e.g., level 1) blocks 804. Note that there may be additional levels of indirect blocks (e.g., level 2, level 3) depending upon the size of the file. The indirect blocks (and inode) contain pvbn/vvbn pointer pair structures 808 that ultimately reference data blocks 806 used to store the actual data of the file.
[0073] The pvbns reference locations on disks of the aggregate, whereas the vvbns reference locations within files of the flexible volume. The use of pvbns as block pointers 808 in the indirect blocks 804 provides efficiencies in the read paths, while the use of vvbn block pointers provides efficient access to required meta-data. That is, when freeing a block of a file, the parent indirect block in the file contains readily available vvbn block pointers, which avoids the latency associated with accessing an owner map to perform pvbn-to-vvbn translations; yet, on the read path, the pvbn is available.
[0074] FIG. 9 is a schematic block diagram of an embodiment of an aggregate 900 that may be advantageously used with the present invention. Luns (blocks) 902, directories 904, qtrees 906 and files 908 may be contained within flexible volumes 910, such as dual vbn flexible volumes, that, in turn, are contained within the aggregate 900. The aggregate 900 is illustratively layered on top of the RAID system, which is represented by at least one RAID plex 950 (depending upon whether the storage configuration is mirrored), wherein each plex 950 comprises at least one RAID group 960. Each RAID group further comprises a plurality of disks 930, e.g., one or more data (D) disks and at least one (P) parity disk.
[0075] Whereas the aggregate 900 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 900 may include one or more files, wherein each file contains a flexible volume 910 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 that corresponds to locations within the file, which locations are then translated to dbns on disks. Since the flexible volume 910 is also a logical volume, it has its own block allocation structures (e.g., active, space and summary maps) in its vvbn space.
[0076] 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 meta-data root directory that contains subdirectories of flexible volumes:
WAFL/fsid/filesystem file, storage label file
WAFL/fsid/filesystem file, storage label file
[0077] Specifically, a physical file system (WAFL) directory includes a subdirectory for each flexible volume in the aggregate, with the name of subdirectory being a file system identifier (fsid) of the flexible volume. Each fsid subdirectory (flexible volume) contains at least two files, a filesystem file and a storage label file. The storage label file is illustratively a 4 kB file that contains meta-data 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.
[0078] FIG. 10 is a schematic block diagram of an on-disk representation of an aggregate 1000. The storage operating system 300, e.g., the RAID system 380, assembles a physical volume of pvbns to create the aggregate 1000, with pvbns 1 and 2 comprising a “physical” volinfo block 1002 for the aggregate. The volinfo block 1002 contains block pointers to fsinfo blocks 1004, each of which may represent a snapshot of the aggregate. Each fsinfo block 1004 includes a block pointer to an inode file 1006 that contains inodes of a plurality of files, including an owner map 1010, an active map 1012, a summary map 1014 and a space map 1016, as well as other special meta-data files. The inode file 1006 further includes a root directory 1020 and a “hidden” meta-data root directory 1030, 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 1040 and storage label file 1090. Note that root directory 1020 in the aggregate is empty; all files related to the aggregate are organized within the hidden meta-data root directory 1030.
[0079] In addition to being embodied as a container file having level 1 blocks organized as a container map, the filesystem file 1040 includes block pointers that reference various file systems embodied as flexible volumes 1050. The aggregate 1000 maintains these flexible volumes 1050 at special reserved inode numbers. Each flexible volume 1050 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 1062, summary map 1064 and space map 1066, are located in each flexible volume.
[0080] Specifically, each flexible volume 1050 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 1080. To that end, each flexible volume 1050 has a volinfo block 1052 that points to one or more fsinfo blocks 1054, 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 1060 that, as noted, has the same inode structure/content as the aggregate with the exceptions noted above. Each flexible volume 1050 has its own inode file 1060 and distinct inode space with corresponding inode numbers, as well as its own root (fsid) directory 1070 and subdirectories of files that can be exported separately from other flexible volumes.
[0081] The storage label file 1090 contained within the hidden meta-data root directory 1030 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 1090. Illustratively, the storage label file 1090 includes the name 1092 of the associated flexible volume 1050, the online/offline status 1094 of the flexible volume, and other identity and state information 1096 of the associated flexible volume (whether it is in the process of being created or destroyed).
[0082] F. VLDB
[0083] FIG. 11 is a schematic block diagram illustrating a collection of management processes that execute as user mode applications 1100 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 1110 and a volume location database (VLDB) process 1130, each utilizing a data replication service (RDB 1150) linked as a library. The management framework 1110 provides a user to an administrator 1170 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.
[0084] The VLDB 1130 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-blade 310 of each node accesses a configuration table 235 that maps the SVS ID 502 of a data container handle 500 to a D-blade 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 910”) and aggregates 900 within the cluster. Examples of such VLDB entries include a VLDB volume entry 1200 and a VLDB aggregate entry 1300.
[0085] FIG. 12 is a schematic block diagram of an exemplary VLDB volume entry 1200. The entry 1200 includes a volume ID field 1205, an aggregate ID field 1210 and, in alternate embodiments, additional fields 1215. The volume ID field 1205 contains an ID that identifies a volume 910 used in a volume location process. The aggregate ID field 1210 identifies the aggregate 900 containing the volume identified by the volume ID field 1205. Likewise, FIG. 13 is a schematic block diagram of an exemplary VLDB aggregate entry 1300. The entry 1300 includes an aggregate ID field 1305, a D-blade ID field 1310 and, in alternate embodiments, additional fields 1315. The aggregate ID field 1305 contains an ID of a particular aggregate 900 in the cluster 100. The D-blade ID field 1310 contains an ID of the D-blade hosting the particular aggregate identified by the aggregate ID field 1305.
[0086] The VLDB illustratively implements a RPC interface, e.g., a Sun RPC interface, which allows the N-blade 310 to query the VLDB 1130. When encountering contents of a data container handle 500 that are not stored in its configuration table, the N-blade sends an RPC to the VLDB process. In response, the VLDB 1130 returns to the N-blade the appropriate mapping information, including an ID of the D-blade that owns the data container. The N-blade caches the information in its configuration table 235 and uses the D-blade ID to forward the incoming request to the appropriate data container. All functions and interactions between the N-blade 310 and D-blade 350 are coordinated on a cluster-wide basis through the collection of management processes and the RDB library user mode applications 1100.
[0087] To that end, the management processes have interfaces to (are closely coupled to) RDB 1150. 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 1150 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.
[0088] G. Storage System Architecture
[0089] The present invention is related to a storage system architecture illustratively comprising two or more volumes 910 distributed across a plurality of nodes 200 of cluster 100. The volumes are organized as a SVS and configured to store content of data containers, such as files and luns, served by the cluster in response to multi-protocol data access requests issued by clients 180. Notably, the content of each data container is apportioned among the volumes of the SVS to thereby improve the efficiency of storage service provided by the cluster. To facilitate a description and understanding of the present invention, data containers are hereinafter referred to generally as “files”.
[0090] According to an aspect of the invention, the SVS comprises a meta-data volume (MDV) and one or more data volumes (DV). The MDV is configured to store a canonical copy of meta-data, including access control lists (ACLs) and directories, associated with all files stored on the SVS, whereas each DV is configured to store, at least, data content of those files. For each file stored on the SVS, one volume is designated the CAV and, to that end, is configured to store (“cache”) certain, rapidly-changing attribute meta-data associated with that file to thereby offload access requests that would otherwise be directed to the MDV. In the illustrative embodiment described herein, determination of the CAV for a file is based on a simple rule: designate the volume holding the first stripe of content (data) for the file as the CAV for the file. Not only is this simple rule convenient, but it also provides an optimization for small files. That is, a CAV may be able to perform certain operations without having to communicate with other volumes of the SVS if the file is small enough to fit within the specified stripe width. Ideally, the first stripes of data for files are distributed among the DVs of the SVS to thereby facilitate even distribution of CAV designations among the volumes of the SVS. In an alternate embodiment, data for files is striped across the MDV and the DVs.
[0091] FIG. 14 is a schematic block diagram of the inode files of an SVS 1400 in accordance with an embodiment of the present invention. The SVS 1400 illustratively comprises three volumes, namely MDV 1405 and two DVs 1410, 1415. It should be noted that in alternate embodiments additional and/or differing numbers of volumes may be utilized in accordance with the present invention. Illustratively, the MDV 1405 stores a plurality of inodes, including a root directory (RD) inode 1420, a directory (DIR) inode 1430, file (F) inodes 1425, 1435, 1445 and an ACL inode 1440. Each of these inodes illustratively includes meta-data (M) associated with the inode. In the illustrative embodiment, each inode on the MDV 1405 does not include data (D); however, in alternate embodiments, the MDV may include user data.
[0092] In contrast, each DV 1410, 1415 stores only file (F) inodes 1425, 1435, 1445 and ACL inode 1440. According to the inventive architecture, a DV does not store directories or other device inodes/constructs, such as symbolic links; however, each DV does store F inodes, and may store cached copies of ACL inodes, that are arranged in the same locations as their respective inodes in the MDV 1405. A particular DV may not store a copy of an inode until an I/O request for the data container associated with the inode is received by the D-Blade serving a particular DV. Moreover, the contents of the files denoted by these F inodes are periodically sparse according to SVS striping rules, as described further herein. In addition, since one volume is designated the CAV for each file stored on the SVS 1400, DV 1415 is designated the CAV for the file represented by inode 1425 and DV 1410 is the CAV for the files identified by inodes 1435, 1445. Accordingly, these CAVs cache certain, rapidly-changing attribute meta-data (M) associated with those files such as, e.g., file size 615, as well as access and/or modification time stamps 620.
[0093] According to another aspect of the invention, the SVS is associated with a set of striping rules that define a stripe algorithm, a stripe width and an ordered list of volumes within the SVS. The striping rules for each SVS are illustratively stored as an entry of VLDB 1130 and accessed by SVS ID. FIG. 15 is a schematic block diagram of an exemplary VLDB SVS entry 1500 in accordance with an embodiment of the present invention. The VLDB entry 1500 includes a SVS ID field 1505 and one or more sets of striping rules 1530. In alternate embodiments additional fields 1535 may be included. The SVS ID field 1505 contains the ID of a SVS which, in operation, is specified in data container handle 500.
[0094] Each set of striping rules 1530 illustratively includes a stripe width field 1510, a stripe algorithm ID field 1515, an ordered list of volumes field 1520 and, in alternate embodiments, additional fields 1525. The striping rules 1530 contain information for identifying the organization of a SVS. For example, the stripe algorithm ID field 1515 identifies a striping algorithm used with the SVS. In the illustrative embodiment, multiple striping algorithms could be used with a SVS; accordingly, stripe algorithm ID is needed to identify which particular algorithm is utilized. Each striping algorithm, in turn, specifies the manner in which file content is apportioned as stripes across the plurality of volumes of the SVS. The stripe width field 1510 specifies the size/width of each stripe. The ordered list of volumes field 1520 contains the IDs of the volumes comprising the SVS. In an illustrative embodiment, the ordered list of volumes comprises a plurality of tuples comprising of a flexible volume ID and the aggregate ID storing the flexible volume. Moreover, the ordered list of volumes may specify the function and implementation of the various volumes and striping rules of the SVS. For example, the first volume in the ordered list may denote the MDV of the SVS, whereas the ordering of volumes in the list may denote the manner of implementing a particular striping algorithm, e.g., round-robin.
[0095] According to yet another aspect of the invention, a Locate( ) function 375 is provided that enables the VSM 370 and other modules (such as those of N-blade 310) to locate a D-blade 350 and its associated volume of a SVS 1400 in order to service an access request to a file. The Locate( ) function takes as arguments, at least (i) a SVS ID 1505, (ii) an offset within the file, (iii) the inode number for the file and (iv) a set of striping rules 1530, and returns the volume 910 on which that offset begins within the SVS 1400. For example, assume a data access request directed to a file is issued by a client 180 and received at the N-blade 310 of a node 200, where it is parsed through the multi-protocol engine 325 to the appropriate protocol server of N-blade 310.
[0096] To determine the location of a D-blade 350 to which to transmit a CF message 400, the N-blade 310 may first retrieve a SVS entry 1500 to acquire the striping rules 1530 (and list of volumes 1520) associated with the SVS. The N-blade 310 then executes the Locate( ) function 375 to identify the appropriate volume to which to direct an operation. Thereafter, the N-Blade may retrieve the appropriate VLDB volume entry 1200 to identify the aggregate containing the volume and the appropriate VLDB aggregate entry 1300 to ultimately identify the appropriate D-blade 350. The protocol server of N-blade 310 then transmits the CF message 400 to the D-blade 350.
[0097] FIG. 16 is a schematic block diagram illustrating the periodic sparseness of file content stored on volumes A 1605, B 1610 and C 1615 of SVS 1600 in accordance with an embodiment of the present invention. As noted, file content is periodically sparse according to the SVS striping rules, which specify a striping algorithm (as indicated by stripe algorithm ID field 1515) and a size/width of each stripe (as indicated by stripe width field 1510). Note that, in the illustrative embodiment, a stripe width is selected to ensure that each stripe may accommodate the actual data (e.g., stored in data blocks 806) referenced by an indirect block (e.g., level 1 block 804) of a file. In accordance with an illustrative round robin striping algorithm, volume A 1605 contains a stripe of file content or data (D) 1620 followed, in sequence, by two stripes of sparseness (S) 1622, 1624, another stripe of data (D) 1626 and two stripes of sparseness (S) 1628, 1630. Volume B 1610, on the other hand, contains a stripe of sparseness (S) 1632 followed, in sequence, by a stripe of data (D) 1634, two stripes of sparseness (S) 1636, 1638, another stripe of data (D) 1640 and a stripe of sparseness (S) 1642. Volume C 1615 continues the round robin striping pattern and, to that end, contains two stripes of sparseness (S) 1644, 1646 followed, in sequence, by a stripe of data (D) 1648, two stripes of sparseness (S) 1650, 1652 and another stripe of data (D) 1654.
[0098] H. SVS Operations
[0099] According to the storage system architecture described herein, a plurality of SVS operations are provided to enable efficient and accurate serving of file (and other data container) content distributed across volumes of a SVS. These SVS operations include, among others, create file, delete file, retrieve attributes of file, write/modify attributes of file, read file and write file operations. FIG. 17 is a flowchart detailing the steps of a procedure 1700 for creating a new file in accordance with an embodiment of the present invention. The procedure 1700 begins in step 1705 and continues to step 1710 where an N-blade 310 receives a request to create a new file by, e.g., a client 180 sending a create file request to node 200. In step 1715, the N-blade re-directs the request to the appropriate D-blade serving the MDV 1405 of a SVS 1400. Illustratively, the N-blade translates the create file request to a procedure call (LPC or RPC) and then determines an action it should take depending upon the CF API function associated with that call. For example, in response to a create file request, the N-blade issues a corresponding create file procedure call to the MDV 1405 or, more specifically, the VSM 370 of the D-blade 350 serving the MDV.
[0100] In the illustrative embodiment, the N-blade determines which volume of a SVS 1400 is the MDV by examining the ordered list of volumes 1520 within the SVS entry 1500 of the VLDB 1130. As noted, the first volume listed in the ordered list of volumes 1520 is illustratively the MDV, although it will be understood to those skilled in the art that any volume position within the ordered list can be designated the MDV 1405. Moreover, the VLDB entry 1500 can be augmented to explicitly state which volume in the ordered list 1520 is the MDV of the SVS.
[0101] Upon receiving the create file procedure call, the VSM 370 processes that call by updating the directory (i.e., creating a new directory entry for the file) on the MDV in Step 1718 and, in step 1720, allocating an inode for the file. The allocated inode is preferably selected from among available inodes in the SVS using, e.g., any conventional inode selection technique. Note that each volume of the SVS 1400 is allocated the same inode for the newly created file. Moreover, the inode is allocated in the same position/location of the inode file for each volume, i.e., the file inode on each volume is allocated the same inode index to the inode file. In step 1735, the VSM 370 of the MDV 1405 completes file creation by, e.g., instructing the file system 360 operating on the D-blade 350 to create a file using the allocated inode. The procedure 1700 then completes in step 1740.
[0102] FIG. 18 is a flowchart detailing the steps of a procedure 1800 for deleting a file in accordance with an embodiment of the present invention. The procedure 1800 begins in step 1805 and continues to step 1810 where an N-blade receives a client request to delete a file. In step 1815, the N-blade re-directs the request as a delete file procedure call to the VSM 370 of the appropriate D-blade serving the MDV 1405 of a SVS 1400, as described herein. In step 1825, the VSM passes a corresponding delete request to the file system 360 via, e.g., a conventional IPC mechanism such as issuing a procedure call or passing a message. In step 1830, the file system processes the delete (deletion) request up to the point of actually removing the inode from the file system. At this point, the file system alerts the VSM 370 that it has reached this particular state (step 1835) via, e.g., the IPC mechanism. In step 1840, the VSM sends requests to all DVs in the SVS to free the storage associated with the inode. Illustratively, the VSM 370 sends these requests as CF messages 400 in cooperation with the CF interface modules 340 of the D-blades serving the DVs of the SVS 1400. Then, in step 1842, the CSM waits until all of the DVs have acknowledged completion of the request. In step 1845, the VSM instructs the file system 360 to delete the inode and, in response, the file system deletes the inode in step 1850. The procedure then completes in step 1855.
[0103] FIG. 19 is a flowchart detailing the steps of a procedure 1900 for retrieving attributes of a file in accordance with an embodiment of the present invention. The procedure 1900 begins in step 1905 and continues to step 1910 where an N-blade receives a request to retrieve (read) file attributes. In step 1915, the N-blade forwards the request to the VSM of the D-blade hosting the CAV of the file. In step 1920, the VSM 370 determines whether its cached copy of the meta-data attributes is valid, i.e., has been invalidated, by checking the meta-data invalidation flag 634 of the inode 600 of the file. If the cached copy has not been invalidated, the VSM returns the requested attributes in step 1930 and the procedure completes in step 1935. However, if the cached copy has been invalidated, the procedure branches to step 1925 where the VSM retrieves the attributes from the MDV 1405 by, e.g., sending an attribute retrieval request to the D-blade 350 serving the MDV. Illustratively, such a request is sent as a CF message 400 via the CF interface modules 340. The procedure then continues to step 1930 where the VSM of the D-blade hosting the CAV returns the requested attributes before completing in step 1935.
[0104] FIG. 20 is a flowchart detailing the steps of a procedure 2000 for writing/modifying file attributes in accordance with an embodiment of the present invention. The procedure 2000 begins in step 2005 and continues to step 2010 where an N-blade receives a request to modify file attributes. In step 2015, the N-blade forwards the request to the VSM 370 of the D-blade 350 hosting the MDV. The VSM serving the MDV then, in step 2020, forwards a request to invalidate its cached copy of meta-data to the VSM serving the CAV of the file. In response, the VSM of the CAV invalidates it cache in step 2025 by, for example, setting the meta-data invalidation flag 634 to signify that its cached meta-data is not valid. The VSM serving the CAV also forwards the invalidation request to all DVs and waits until it has received a response from each VSM before then acknowledging that it has invalidated its cache in step 2030. Once the VSM serving the MDV receives this acknowledgement, it modifies the canonical copy of the meta-data per the received request to modify file attributes (step 2035). The VSM then returns a status indicator, e.g., indicating that the operation was successful, to the N-Blade in step 2040, before the N-Blade responds to the client with a status in step 2045. The procedure then completes step 2050.
[0105] FIG. 21 is a flowchart detailing the steps of a procedure 2100 for processing a read request in accordance with an embodiment of the present invention. The procedure 2100 begins in step 2105 and continues to step 2110 where an N-blade receives the read request from a client. In step 2115, the N-blade utilizes the Locate( ) function 375 to identify the D-blade to which to re-direct the request. As noted above, the Locate( ) function takes as arguments a SVS ID, a set of striping rules, an inode number and an offset into the file, and returns the identity (ID) of the appropriate volume that serve the file offset. In step 2120, the N-blade forwards the request to the appropriate D-blade 350, where the VSM 370 determines if the read request will fit onto a single stripe on the volume, i.e., whether the read request is for data that is entirely contained within a stripe on this volume. If so, then the VSM 370 illustratively performs a series of checks to determine whether it may immediately process the request.
[0106] For example, the VSM determines whether its local cached copy of certain meta-data exists (step 2125), whether the read request is less than the cached file length (step 2130) and whether the CAV for the file has been consulted recently (step 2135). Collectively, these checks ensure that the CAV has relatively recently checked the appropriate meta-data for the file. If any of these checks are answered in the negative, the procedure branches to step 2140 where the VSM of the CAV updates its locally cached copy of the file meta-data by, e.g., querying the MDV for the most up-to-date meta-data. However, if the checks are positively satisfied, the procedure proceeds to step 2145 where the VSM passes the read request to the file system. In step 2150, the file system processes the read request by, e.g., retrieving the appropriate data from disk. In step 2155, the file system returns a response to the N-blade which, in step 2160, returns the appropriate response to the client. This response includes, e.g., the requested read data from the volume and also any requested data retrieved from other volumes as described further below. The procedure then completes in step 2165.
[0107] However, if in step 2122 a determination is made that the requested read data does not entirely fit onto the stripe, the procedure branches to step 2170 where the VSM passes a read request for the data that does not fit onto this stripe to the VSM of the volume serving the next stripe of data. In response, the VSM of the volume holding the next stripe of data services the read request and returns the requested data to the requesting VSM in step 2175. The procedure then continues to step 2125.
[0108] FIG. 22 is a flowchart detailing the steps of a procedure 2200 for processing a write request in accordance with an embodiment of the present invention. The procedure 2200 begins in step 2202 and continues to step 2205 where an N-blade receives the write request from a client. In step 2210, the N-blade illustratively utilizes the Locate( ) function 375, as described herein, to identify the D-blade to which to re-direct the request for processing. In step 2215, the N-blade forwards the request to the appropriate D-blade(s). In step 2220, the VSM on the D-blade determines whether the data to be written fits into a single stripe. Illustratively, the VSM may compute this determination by analyzing the size of the write operation, the stripe width and the offset within the stripe where the write operation begins.
[0109] If the write fits within a single stripe, the VSM performs the three checks described above with respect to a read operation, namely determining whether a local cache is ready for use (step 2225), whether the write request is less than the cached file length (step 2230) and whether the FAV has been consulted recently (step 2235). If any of these checks fail, the procedure branches to step 2255 where the VSM retrieves the meta-data from the CAV and onto step 2240. However, if the answers to all the checks are positive, the procedure continues directly to step 2240 where the VSM passes the write request to the file system. In step 2245, the file system processes the write request before returning a status to the N-blade in step 2250. The procedure then completes in step 2290.
[0110] In step 2270, the VSM passes a portion of the data associated with the write operation to its file system 360 360, which writes that portion of the data to its volume in step 2275. In step 2280, the VSM passes the excess data associated with the write operation to the volume in the SVS configured to store a next stripe. In step 2285, the VSM for that volume passes the excess data to its file system for writing (storing) on the volume. Thereafter, in step 2250, the file system returns a status to the N-blade and the procedure completes in step 2290.
[0111] The foregoing description has been directed to particular embodiments of this 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 present invention may be implemented in non-distributed file systems. Furthermore, while this description has been written in terms of N and D-blades, the teachings of the present invention are equally suitable to systems where the functionality of the N and D-blades are implemented in a single system. Alternately, the functions of the N and D-blades may be distributed among any number of separate systems, wherein each system performs one or more of the functions. 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.
The invention claimed is:
1. A system for striping one or more data containers across a striped volume set, the system comprising:
a plurality of volumes organized into the striped volume set, the striped volume set defined by a set of striping rules, wherein each volume is a logical arrangement of a plurality of storage devices; and
a volume striping module executing on one or more computers in a cluster, each of the computers serving one or more of the plurality of volumes, wherein the volume striping module implements commands directed to storing a data container across the plurality of volumes of the striped volume set.
2. The system of claim 1 wherein the set of file striping rules comprises a stripe width.
3. The system of claim 1 wherein the striping rules comprises a striping algorithm identifier that identifies a striping algorithm utilized with the striped volume set.
4. The system of claim 1 wherein the striping rules comprises an ordered set of volumes.
5. The system of claim 4 wherein a first of the ordered set of volumes comprises a meta-data volume.
6. The system of claim 1 wherein one of the plurality of volumes is defined as a container attribute volume for each of the one or more data containers striped across the striped volume set.
7. The system of claim 1, wherein the data container is a file.
8. The system of claim 1, wherein the data container is a logical unit.
9. A system for striping one or more data containers across a striped volume set, the system comprising:
one or more network elements adapted to receive commands from a client directed to the striped volume set and further adapted to translate the received commands into a protocol for communication with one of one or more disk elements, wherein each volume of the striped volume set is a logical arrangement of a plurality of storage devices;
wherein each of the disk elements comprises a volume striping module adapted to process the protocol to implement operations directed to store a data container across the plurality of volumes of the striped volume set.
10. The system of claim 9 wherein the striped volume set comprises of a plurality of volumes, each of the plurality of volumes being served by one of the one or more disk elements.
11. The system of claim 9 wherein the striped volume set is defined by a set striping rules.
12. The system of claim 11 wherein the set of striping rules comprises a stripe width.
13. The system of claim 11 wherein the striping rules comprises a striping algorithm indicator, the striping algorithm indicator identifying a striping algorithm utilized with the striped volume set.
14. The system of claim 11 wherein the striping rules comprises an ordered set of volumes.
15. The system of claim 11 wherein a first of the ordered set of volumes comprises a meta-data volume.
16. The system of claim 9, wherein the data container is a file.
17. The system of claim 9, wherein the data container is a logical unit.
18. A method for striping one or more data containers across a striped volume set, comprising:
defining the striped volume set using a set of striping rules;
organizing a plurality of volumes organized into the striped volume set, the striped volume set defined by a set of striping rules and each volume is a logical arrangement of a plurality of storage devices; and
providing a volume striping module executing on one or more computers in a cluster, each of the computers serving one or more of the plurality of volumes, wherein the volume striping module implements commands directed to store a data container across the plurality of volumes of the striped volume set.
19. The method of claim 18 wherein the set of striping rules comprises a stripe width.
20. The method of claim 18 wherein the striping rules comprises a striping algorithm identifier that identifies a striping algorithm utilized with the striped volume set.
21. The method of claim 18 wherein the striping rules comprises an ordered set of volumes.
22. The method of claim 21 wherein a first of the ordered set of volumes comprises a meta-data volume.
23. The method of claim 18 further comprising defining one of the plurality of volumes as a container attribute volume for each of the one or more data containers striped across the striped volume set.
24. The method of claim 18 further comprising defining one of the plurality of volumes as a meta-data volume.
25. The method of claim 18, wherein the data container is a file.
26. The method of claim 18, wherein the data container is a logical unit.
27. A system, comprising:
two or more computers coupled together to form a cluster;
a plurality of volumes distributed across the two or more computers to form a striped volume set, wherein the striped volume set is defined by a set of striping rules, and each volume is a logical arrangement of storage space attached to a computer of the two or more computers; and
a volume striping module executed on one or more computers in the cluster, wherein the volume striping module stripes one or more data containers across the striped volume set.
28. The system of claim 27, wherein the plurality of volumes are a plurality of virtual volumes.
29. The system of claim 28, wherein one or more storage devices attached to a first computer of the two or more computers are logically arranged to form an aggregate with a global storage space.
30. The system of 29, wherein one or more of the plurality of virtual volumes are stored within the aggregate of the first computer.
31. The system of claim 27, wherein the plurality of volumes are physical volumes.
32. The system of claim 27, wherein the data container is a file or a lun.
33. The system of claim 27, wherein one volume of the plurality of volumes is a metadata volume and stores access control lists and directories of the data containers stored across the striped volume set.
34. The system of claim 33, wherein one or more volumes of the plurality of volumes is a data volume and stores data of the one or more data containers.
35. The system of claim 27, wherein the set of file striping rules comprises a stripe width.
36. The system of claim 27, wherein the striping rules comprises a striping algorithm identifier that identifies a striping algorithm utilized with the striped volume set.
37. The system of claim 27, wherein the striping rules comprises an ordered set of volumes.
38. The system of claim 27, further comprising:
one or more network elements configured to receive commands from a client directed to the striped volume set and further configured to translate the received commands into a protocol for communication with one of one or more disk elements.
39. The system of claim 38, wherein each of the plurality of volumes is served by one of the one or more disk elements.
40. A method, comprising:
coupling two or more computers together to form a cluster;
organizing a plurality of volumes as a striped volume set using a set of striping rules, wherein the plurality of volumes are distributed across the cluster and each volume is a logical arrangement of storage space attached to a computer of the two or more computers; and
storing one or more data containers in a stripe across the striped volume set.
41. The method of claim 40, wherein the set of striping rules comprises a stripe width and an ordered set of volumes.
42. The method of claim 40, wherein the striping rules comprises a striping algorithm identifier that identifies a striping algorithm utilized with the striped volume set.
43. The method of claim 40, wherein the data container is a file or a lun.
44. The method of claim 40, wherein one volume of the plurality of volumes is a metadata volume and stores access control lists and directories of the data containers stored across the striped volume set, and one or more volumes of the plurality of volumes is a data volume and stores data of the one or more data containers.
45. The method of claim 40, wherein the plurality of volumes are a plurality of virtual volumes.
46. The method of claim 45, wherein one or more storage devices attached to a first computer of the two or more computers are logically arranged to form an aggregate with a global storage space, and the aggregate stores one or more virtual volumes of the plurality of virtual volumes.
47. The method of claim 40, wherein the plurality of volumes are physical volumes.
48. A system for striping one or more data containers across a striped volume set, the system comprising:
a plurality of volumes organized into the striped volume set, the striped volume set defined by a set of striping rules, wherein each volume is a logical arrangement of a plurality of storage devices;
a volume striping module executing on one or more computers in a cluster, each of the computers serving one or more of the plurality of volumes, wherein the volume striping module implements commands directed to storing a data container across the plurality of volumes of the striped volume set; and
a RAID system module striping each portion of the data container across the plurality of storage devices in each volume assigned to store a portion of the data container.
49. A computer readable storage medium containing executable program instructions executed by a processor, comprising:
program instructions that define a striped volume set using a set of striping rules;
program instructions that organize a plurality of volumes organized into the striped volume set, the striped volume set defined by a set of striping rules and each volume is a logical arrangement of a plurality of storage devices; and
program instructions that provide a volume striping module executing on one or more computers in a cluster, each of the computers serving one or more of the plurality of volumes, wherein the volume striping module implements commands directed to store a data container across the plurality of volumes of the striped volume set.
50. A method, comprising:
coupling two or more computers together to form a cluster;
organizing a plurality of volumes as a striped volume set using a set of striping rules, wherein the plurality of volumes are distributed across the cluster and each volume is a logical arrangement of one or more RAID groups; and
storing one or more data containers in a stripe across the striped volume set.
Patent Citations (62)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4899342(A) | 1990-02-01 | Potter et al. | Applicant |
| US4916608(A) | 1990-04-01 | Shultz | Applicant |
| US4989206(A) | 1991-01-01 | Dunphy, Jr. et al. | Applicant |
| US5124987(A) | 1992-06-01 | Milligan et al. | Applicant |
| US5155835(A) | 1992-10-01 | Belsan | Applicant |
| US5163131(A) | 1992-11-01 | Row et al. | Applicant |
| US5202979(A) | 1993-04-01 | Hillis et al. | Applicant |
| US5355453(A) | 1994-10-01 | Row et al. | Applicant |
| US5485579(A) | 1996-01-01 | Hitz et al. | Applicant |
| US5581724(A) | 1996-12-01 | Belsan et al. | Applicant |
| US5701516(A) | 1997-12-01 | Cheng et al. | Applicant |
| US5802366(A) | 1998-09-01 | Row et al. | Applicant |
| US5819292(A) | 1998-10-01 | Hitz et al. | Applicant |
| US5897661(A) | 1999-04-01 | Baranovsky et al. | Applicant |
| US5931918(A) | 1999-08-01 | Row et al. | Applicant |
| US5941972(A) | 1999-08-01 | Hoese et al. | Applicant |
| US5963962(A) | 1999-10-01 | Hitz et al. | Applicant |
| US5987477(A) | 1999-11-01 | Schmuck et al. | Applicant |
| US6032216(A) | 2000-02-01 | Schmuck et al. | Applicant |
| US6038570(A) | 2000-03-01 | Hitz et al. | Applicant |
| US6065037(A) | 2000-05-01 | Hitz et al. | Applicant |
| US6173293(B1) | 2001-01-01 | Thekkath et al. | Applicant |
| US6275898(B1) | 2001-08-01 | DeKoning | Applicant |
| US6324581(B1) | 2001-11-01 | Xu et al. | Applicant |
| US6425035(B2) | 2002-07-01 | Hoese et al. | Applicant |
| US6502166(B1) | 2002-12-01 | Cassidy | Examiner |
| US6564252(B1) | 2003-05-01 | Hickman et al. | Applicant |
| US6606690(B2) | 2003-08-01 | Padovano | Applicant |
| US6636879(B1) | 2003-10-01 | Doucette et al. | Applicant |
| US6643654(B1) | 2003-11-01 | Patel et al. | Applicant |
| US6671773(B2) | 2003-12-01 | Kazar et al. | Applicant |
| US6697846(B1) | 2004-02-01 | Soltis | Applicant |
| US6721764(B2) | 2004-04-01 | Hitz et al. | Applicant |
| US6868417(B2) | 2005-03-01 | Kazar et al. | Applicant |
| US6931450(B2) | 2005-08-01 | Howard et al. | Applicant |
| US6978283(B1) | 2005-12-01 | Edwards et al. | Applicant |
| US7010528(B2) | 2006-03-01 | Curran et al. | Applicant |
| US7038050(B2) | 2006-05-01 | Lee et al. | Applicant |
| US7159093(B2) | 2007-01-01 | Dalal et al. | Examiner |
| US7162486(B2) | 2007-01-01 | Patel et al. | Applicant |
| US7185144(B2) | 2007-02-01 | Corbett et al. | Examiner |
| US7194597(B2) | 2007-03-01 | Willis et al. | Applicant |
| US7231412(B2) | 2007-06-01 | Hitz et al. | Applicant |
| US7302520(B2) | 2007-11-01 | Kazar et al. | Applicant |
| US7366837(B2) | 2008-04-01 | Corbett et al. | Applicant |
| US7409494(B2) | 2008-08-01 | Edwards et al. | Applicant |
| US7409497(B1) | 2008-08-01 | Jernigan et al. | Applicant |
| US7412496(B2) | 2008-08-01 | Fridella et al. | Applicant |
| US2002/0049883(A1) | 2002-04-01 | Schneider et al. | Applicant |
| US2003/0188045(A1) | 2003-10-01 | Jacobson | Examiner |
| US2004/0030668(A1) | 2004-02-01 | Pawlowski et al. | Applicant |
| US2004/0122917(A1) | 2004-06-01 | Menon et al. | Applicant |
| US2004/0133570(A1) | 2004-07-01 | Soltis | Applicant |
| US2004/0139167(A1) | 2004-07-01 | Edsall et al. | Applicant |
| US2005/0097260(A1) | 2005-05-01 | McGovern et al. | Applicant |
| US2005/0192932(A1) | 2005-09-01 | Kazar et al. | Applicant |
| US2006/0184587(A1) | 2006-08-01 | Federwisch et al. | Applicant |
| US2006/0184731(A1) | 2006-08-01 | Corbett et al. | Examiner |
| US2007/0088702(A1) | 2007-04-01 | Fridella et al. | Applicant |
| EP892347 | 1999-01-01 | Applicant | |
| JP10003440(A) | 1998-06-01 | Applicant | |
| WO/07101(A1) | 2000-02-01 | Applicant |
Non-Patent Literature (66)
- Hartman J H et al., “Zebra: A Striped Network File System” Proceedings of the Usenix File Systems Workshop, Apr. 1998 pp. 1-9, XP002926950.Applicant
- Hartman J H et al: “The Zebra Striped Network File System” Dec. 1, 1993, Operating Systems Review, ACM, New York, NY, US, pp. 29-43, XP000418681, Issn: 0163-5908.Applicant
- Simitch H et al: “Adaptive disk striping for Parallel Input/output” Mass Storage Systems, 1999. 16th IEEE Symposium on San Diego, CA, USA, Mar. 15-18, 1999, Piscataway, NJ, USA, IEEE, US, Mar. 15, 1999, pp. 88-102, XP010376289.Applicant
- Shinkai E et al: “HAMFS File System” Reliable distributed systems, 1999. Proceedings of the 18th IEEE Symposium on Lausanne, Switzerland Oct. 19-22, 1999, Los Alamitos, CA, USA, IEEE Comput. Soc., US, Oct. 19, 1999, pp. 190-201, XP010356993.Applicant
- International Search Report for International Application No. PCT/US2005/030889, International Searching Authority, Authorized Officer Katrin Sommermeyer Jan. 13, 2006.Applicant
- Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration. PCT/US2006/016055. Apr. 27, 2006.Applicant
- Efficient, Distributed Data Placement Strategies for Storage Area Networks, Andrew Brinkmann, et al. XP-002404501, 2000.Applicant
- Disk Subsystem Load Balancing: Disk Striping vs. Conventional Data Placement, Gregory R. Ganger, et al. Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor. Jan. 5, 1993.Applicant
- A Fast Algorith for Online Placement and Reorganization of Replicated Data, R.J. Honicky, et al. Storage Systems Research Center, University of California, Santa Cruz. Apr. 22, 2003.Applicant
- A Row Permutated Data Reorganization Algorithm for Growing Server-Less Video-On-Demand Systems, T.K. Ho, et al. Department of Information Engineering, The Chinese University of Hong Knog, Shatin, N.T., Hong Kong. May 12, 2003.Applicant
- Administration Guide found at http://www.openafs.org/pages/doc/AdminGuide/auagd010.htm, visited on Mar. 2, 2005, 34 pages.Applicant
- Auspex Systems, LFS—A Local File System for Multiprocessor NFS Network Servers, 1994, 6 pages.Applicant
- Blasgen, M.W. et al., System R:An architectural Overview,Reprinted from IBM Systems Journal vol. 20, No. 1, 1981, Copyright 1981, 1999, 22 pages.Applicant
- Borenstein, Nathaniel S., CMU's Andrew project a retrospective, Communications of ACM, 39(12), Dec. 1996, 33 pages.Applicant
- Brown, Mark R. et al., The Alpine file system, ACM Transactions on Computing Systems, 3(4):261-293, Nov. 1985.Applicant
- Carns, P. H., et al, “PVFS: A Parallel File System for Linux Clusters”, Proceedings of the 4.sup.th Annual Linux Showcase and Conference, Atlanta, GA, Oct. 2000, pp. 317-327.Applicant
- Celerra File Server Architecture for High Availability, EMC2 where information lives, Aug. 1999, 12 pages.Applicant
- Chutani, Sailesh, et al., The Episode File System, In Proceedings of the USENIX Winter 1992, 18 pages.Applicant
- Dibble, Peter C., et al., Beyond Striping: The Bridge Multiprocessor File System, Computer Science Department, University of Rochester, Aug. 11, 1989, 8 pages.Applicant
- Douglis, Fred, et al., A comparison of two distributed systems: Amoeba and Sprite—Computing Systems, 4(4), Fall 1991, pp. 353-385.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, 14 pages.Applicant
- Gait, Jason, Phoenix: A Safe In-Memory File System. Communications of the ACM, 33(1): pp. 81-86, Jan. 1990.Applicant
- Gray, Jim, at al., The Recovery Manager of the System R Database Manager, ACM Computing Surveys, (13)2:223-242 1981, 20 pages.Applicant
- Hartman, John H. at al., Performance Measurements of a Multiprocessor Sprite Kernel, Proceedings of the USENIX Conference, 1990, 13 pages.Applicant
- Hartman, J. H., et al., “Zebra: A Striped Network File System” Proceedings of the Usenix File Systems Workshop, Apr. 1998 pp. 1-9, XP002926950.Applicant
- Hartman, J. H., et al. “The Zebra Striped Network File System” Dec. 1, 1993, Operating Systems Review, ACM, New York, NY, US, pp. 29-43, XP000418681, ISSN: 0163-5908.Applicant
- Hitz, Dave et al., File System Design for an NFS File Server Appliance, Technical Report 3002, Rev. C395, presented Jan. 19, 1994, 23 pages.Applicant
- Howard, John H., An Overview of the Andrew File System, Carnegie Mellon University, CMU-ITC-88-062 1988, 6 pages.Applicant
- Howard, John H, et al., Scale and Performance in a Distributed File System, Carnegie Mellon University, CMU-ITC-87-068, Aug. 5, 1987, 33 pages.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 L., et al., Decorum File System Architectural Overview, USENIX Summer Conference, Anaheim, California, 1990, 13 pages.Applicant
- Kazar, Michael L., Synchronization and Caching Issues in the Andrew File System, Carnegie Mellon University, CMU-ITC-88-063, 12 pages.Applicant
- Ligon, W. B. III, et al., “Implementation and Performance of a Parallel File System for High Performance Distributed Application”, Proceedings of the fifth IEEE International Symposium on High Performance Distributed Computing, Aug. 1996, 10 pages.Applicant
- Lorie, Raymond, A, Physical Integrity in a large segmented database, ACM Trans. Database Systems, 2(1): 91-104, Mar. 1977.Applicant
- Lorie, RA, Shadow Page Mechanism, IBM Technical Disclosure Bulletin, Jun. 1986, pp. 340-342.Applicant
- McKusick, Marshall Kirk, et al., A Fast File System for UNIX, Computer Science Division, Department of Electrical Engineering and Computer Sciences, Univ. of CA, Berkley, Feb. 18, 1994, 14 pages.Applicant
- Miller, Ethan L., et al., RAMA: A File System for Massively Parallel Computers, 12.sup.th IEEE Symposium on Mass Storage Systems, Monterey CA, Apr. 1993, pp. 163-168.Applicant
- Morris, James H., et al., Andrew: A Distributed Personal Computing Environment, Comm. of the ACM, vol. 29, Mar. 1986, pp. 184-201.Applicant
- Nelson, Michael et al., “Caching in the Sprite Network File System”, ACM, Nov. 1987, pp. 3-4.Applicant
- Network Appliance, Inc., Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, International Application No. PCT/US2005/030889, International Filing Date Aug. 31, 2005, Date of Mailing Jan. 13, 2006, 14 pages.Applicant
- Network Appliance, Inc., Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, International Application No. PCT/US2005/031220, International Filing Date Sep. 1, 2005, Date of Mailing Oct. 18, 2006, 12 pages.Applicant
- Ousterhout, John K. et al., The Sprite Network Operating System, Computer Science Division, Department of Electrical Engineering and Computer Sciences, Univ. of CA, Berkley, Nov. 19, 1987, 32 pages.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, 18 pages.Applicant
- Performance Without Compromise: The Virtual Storage Architecture 1997, 11 pages.Applicant
- Quinlan, Sean, A Cached WORM File System, Software-Practice and Experience, 21(12):1289-1299 (1991).Applicant
- Rosenberg, J., et al., Stability in a Persistant Store Based on a Large Virtual Memory, In Security and Persistence, Rosenber, J. & Keedy, J.L. (ed), Springer-Verlag (1990) pp. 229-245.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
- Rosenblum, Mendel, et al., The LFS Storage Manager, Computer Science Division, Electrical Engin. And Computer Sciences, Univ. of CA, presented at Summer '90 USENIX Technical Conference, Anaheim, CA Jun. 1990, 16 pages.Applicant
- Ross, R. B. et al., “Using the Parallel Virtual File System”, Jul. 2002, 31 pages.Applicant
- Sandberg, Russel et al., Design and implementation of the Sun Network Filesystem. In Proc. Summer 1985 USENIX Conf., pp. 119-130, Portland OR (USA), Jun. 1985.Applicant
- Santry, Douglas S., et al., Deciding When to Forget in the Elephant File System, Operating Systems Review, 34(5), (Dec. 1999) pp. 110-123.Applicant
- Satyanarayanan, M., at al., The ITC Distributed File System: Principles and Design, In Proceedings of the 10th ACM Symposium on Operating Systems Principles, (19)5:56-67, Dec. 1985.Applicant
- Satyanarayanan, M., A survey of distributed file-systems. Annual Review of Computing Science, 4(73-104), 1989.Applicant
- Satyanarayanan, M., et al., Coda: A highly available file system for a distributed workstation environment Carnegie Mellon University, CMU-ITC.Applicant
- Satyanarayanan, M., et al., Coda: A highly available file system for a distributed workstation environment. IEEE Transactions on Computers, 39(4):447-459, 1990.Applicant
- Satyanarayanan, M., Scalable, Secure, and Highly Available Distributed File Access, Computer May 1990: 9-21.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
- Shinkai, E., et al.: “HAMFS File System” Reliable distributed systems, 1999. Proceedings of the 18th IEEE Symposium on Lausanne, Switzerland Oct. 19-22, 1999, Los Alamitos, CA, USA, IEEE Comput. Soc., US, Oct. 19, 1999, pp. 190-201, XP010356993.Applicant
- Sidebotham, Bob, Volumes: The Andrew File System Data Structuring Primitive, EEUG Conference Proceedings, Manchester, UK, Autumn 1986.Applicant
- Simitci, H., et al.: “Adaptive disk striping for Parallel Input/output” Mass Storage Systems, 1999. 16th IEEE Symposium on San Diego, CA, USA, Mar. 15-18, 1999, Piscataway, NJ, USA, IEEE, US, Mar. 15, 1999, pp. 88-102, XP010376289.Applicant
- Subramanian, Muralidhar, et al., Performance Challenges in Object-Relational DBMSs, Data Engineering Journal 22, Feb. 1999 pp. 28-32.Applicant
- Welch, Brent B., et al., Pseudo Devices: User-Level Extensions to the Sprite File System, Computer Science Division, Department of Electrical Engineering and Computer Sciences, Univ. of CA, Berkley, Apr. 1988, 13 pages.Applicant
- Welch, Brent B., et al., Pseudo-File-Systems, Computer Science Division, Department of Electrical Engineering and Computer Sciences. Univ. of CA, Berkley, Oct. 1989, 22 pages.Applicant
- West, Michael, et al. The ITC Distributed File System: Prototype and Experience, Carnegie-Mellon University, Technical Report CMU-ITC-040, Mar. 1985, 17 pages.Applicant