Patent Grant
10534681
Field of the Invention
The present invention is related to data storage, and more particularly to a system and method for accessing data within a storage area network.
Description of the Related Art
A storage area network (SAN) provides direct, high-speed physical connections, e.g., Fibre Channel connections, between multiple hosts and disk storage. The emergence of SAN technology offers the potential for multiple computer systems to have high-speed access to shared data. However, the software technologies that enable true data sharing are mostly in their infancy. While SANS offer the benefits of consolidated storage and a high-speed data network, existing systems do not share that data as easily and quickly as directly connected storage. Data sharing is typically accomplished using a network filesystem such as Network File System (NFS™ by Sun Microsystems, Inc. of Santa Clara, Calif.) or by manually copying files using file transfer protocol (FTP), a cumbersome and unacceptably slow process.
The challenges faced by a distributed SAN filesystem are different from those faced by a traditional network filesystem. For a network filesystem, all transactions are mediated and controlled by a file server. While the same approach could be transferred to a SAN using much the same protocols, that would fail to eliminate the fundamental limitations of the file server or take advantage of the true benefits of a SAN. The file server is often a bottleneck hindering performance and is always a single point of failure. The design challenges faced by a shared SAN filesystem are more akin to the challenges of traditional filesystem design combined with those of high-availability systems.
Traditional filesystems have evolved over many years to optimize the performance of the underlying disk pool. Data concerning the state of the filesystem (metadata) is typically cached in the host system's memory to speed access to the filesystem. This caching—essential to filesystem performance—is the reason why systems cannot simply share data stored in traditional filesystems. If multiple systems assume they have control of the filesystem and cache filesystem metadata, they will quickly corrupt the filesystem by, for instance, allocating the same disk space to multiple files. On the other hand, implementing a filesystem that does not allow data caching would provide unacceptably slow access to all nodes in a cluster.
Systems or software for connecting multiple computer systems or nodes in a cluster to access data storage devices connected by a SAN have become available from several companies. EMC Corporation of Hopkington, Mass. offers HighRoad file system software for their Celerra™ Data Access in Real Time (DART) file server. Veritas Software of Mountain View, Calif. offers SANPoint which provides simultaneous access to storage for multiple servers with failover and clustering logic for load balancing and recovery. Sistina Software of Minneapolis, Minn. has a similar clustered file system called Global File System™ (GFS). Advanced Digital Information Corporation of Redmond, Wash. has several SAN products, including Centra Vision for sharing files across a SAN. As a result of mergers the last few years, Hewlett-Packard Company of Palo Alto, Calif. has more than one cluster operating system offered by their Compaq Computer Corporation subsidiary which use the Cluster File System developed by Digital Equipment Corporation in their TruCluster and OpenVMS Cluster products. However, none of these products are known to provide direct read and write over a Fibre Channel by any node in a cluster. What is desired is a method of accessing data within a SAN which provides true data sharing by allowing all SAN-attached systems direct access to the same filesystem. Furthermore, conventional hierarchal storage management uses an industry standard interface called data migration application programming interface (DMAPI). However, if there are five machines, each accessing the same file, there will be five separate events and there is nothing tying those DMAPI events together.
It is an aspect of the present invention to allow simultaneously shared direct access to mass storage, such as disk drives, in a clustered filesystem accessed by a mixture of trusted and untrusted nodes.
It is another aspect of the present invention to ensure that all shared data is stored with labeling used by the trusted nodes.
It is a further aspect of the present invention to share file data and metadata between trusted and untrusted nodes in a clustered filesystem.
It is yet another aspect of the present invention to enforce file data and metadata access limits based on labeling used by trusted nodes in a clustered filesystem accessed by a mixture of trusted and untrusted nodes.
At least one of the above aspects can be attained by a cluster of computer systems sharing direct read/write access to filesystems administered by at least one trusted metadata server node on storage devices connected to the computer system nodes via a storage area network, including assigning a mandatory access control label as an extended attribute of each filesystem object administered by the at least one trusted metadata server node regardless of whether required by a client node accessing the filesystem object. Preferably, the trusted metadata server node uses one of three sources for the mandatory access control label assigned to the filesystem object when the client node requesting access to the filesystem has no mandatory access control label for accessing the filesystem. A filesystem mandatory access control label is used if previously assigned to the filesystem. Alternatively, a networking mandatory access control label is used if previously assigned to the client node and no filesystem mandatory access control label is assigned to the filesystem. If neither a filesystem nor a networking mandatory access control label is available, a default label providing the least possible access is used.
These together with other aspects and advantages which will be subsequently apparent, reside in the details of construction and operation as more fully hereinafter described and claimed, reference being had to the accompanying drawings forming a part hereof, wherein like numerals refer to like parts throughout.
Following are several terms used herein that are in common use in describing filesystems or SANs, or are unique to the disclosed system. Several of the terms will be defined more thoroughly below.
In addition there are three types of input/output operations that can be performed in a system according to the present invention: buffered I/O, direct I/O and memory mapped I/O. Buffered I/O are read and write operations via system calls where the source or result of the I/O operation can be system memory on the machine executing the I/O, while direct I/O are read and write operations via system calls where the data is transferred directly between the storage device and the application programs memory without being copied through system memory.
Memory mapped I/O are read and write operations performed by page fault. The application program makes a system call to memory map a range of a file. Subsequent read memory accesses to the memory returned by this system call cause the memory to be filled with data from the file. Write accesses to the memory cause the data to be stored in the file. Memory mapped I/O uses the same system memory as buffered I/O to cache parts of the file.
A SAN layer model is illustrated in
Layer 2 is SAN management and includes tools to facilitate monitoring and management of the various components of a SAN. All the tools used in direct-attach storage environments are already available for SANs. Comprehensive LAN management style tools that tie common management functions together are being developed. SAN management will soon become as elegant as LAN management.
The real promise of SANS, however, lies in layer 3, the distributed, shared filesystem. Layer 1 and layer 2 components allow a storage infrastructure to be built in which all SAN-connected computer systems potentially have access to all SAN-connected storage, but they don't provide the ability to truly share data. Additional software is required to mediate and manage shared access, otherwise data would quickly become corrupted and inaccessible.
In practice, this means that on most SANS, storage is still partitioned between various systems. SAN managers may be able to quickly reassign storage to another system in the face of a failure and to more flexibly manage their total available storage, but independent systems cannot simultaneously access the same data residing in the same filesystems.
Shared, high-speed data access is critical for applications where large data sets are the norm. In fields as diverse as satellite data acquisition and processing, CAD/CAM, and seismic data analysis, it is common for files to be copied from a central repository over the LAN to a local system for processing and then copied back. This wasteful and inefficient process can be completely avoided when all systems can access data directly over a SAN.
Shared access is also crucial for clustered computing. Access controls and management are more stringent than with network filesystems to ensure data integrity. In most existing high-availability clusters, storage and applications are partitioned and another server assumes any failed server's storage and workload. While this may prevent denial of service in case of a failure, load balancing is difficult and system and storage bandwidth is often wasted. In high-performance computing clusters, where workload is split between multiple systems, typically only one system has direct data access. The other cluster members are hampered by slower data access using network file systems such as NFS.
In a preferred embodiment, the SAN includes hierarchical storage management (HSM) such as data migration facility (DMF) by Silicon Graphics, Inc. (SGI) of Mountain View, Calif. The primary purpose of HSM is to preserve the economic value of storage media and stored data. The high input/output bandwidth of conventional machine environments is sufficient to overrun online disk resources. HSM transparently solves storage management issues, such as managing private tape libraries, making archive decisions, and journaling the storage so that data can be retrieved at a later date.
Preferably, a volume manager, such as XVM from SGI supports the cluster environment by providing an image of storage devices across all nodes in a cluster and allowing for administration of the devices from any cell in the cluster. Disks within a cluster can be assigned dynamically to the entire cluster or to individual nodes within the cluster. In one embodiment, disk volumes are constructed using XVM to provide disk striping, mirroring, concatenation and advanced recovery features. Low-level mechanisms for sharing disk volumes between systems are provided, making defined disk volumes visible across multiple systems. XVM is used to combine a large number of disks across multiple Fibre Channels into high transaction rate, high bandwidth, and highly reliable configurations. Due to its scalability, XVM provides an excellent complement to CXFS and SANs. XVM is designed to handle mass storage growth and can configure millions of terabytes (exabytes) of storage in one or more filesystems across thousands of disks.
An example of a cluster computing system formed of heterogeneous computer systems or nodes is illustrated in
Other kinds of storage devices besides disk drives 28 may be connected to the Fibre Channel switch 30 via Fibre Channel connections 32. Tape drives 38 are illustrated in
In a conventional SAN, the disks are partitioned for access by only a single node per partition and data is transferred via the LAN. On the other hand, if node 22c needs to access data in a partition to which node 22b has access, according to the present invention very little of the data stored on disk 28 is transmitted over LAN 34. Instead LAN 34 is used to send metadata describing the data stored on disk 28, token messages controlling access to the data, heartbeat signals and other information related to cluster operation and recovery.
In the preferred embodiment, the cluster filesystem is layer that distributes input/output directly between the disks and the nodes via Fibre Channel 30, 32 while retaining an underlying layer with an efficient input/output path using asynchronous buffering techniques to avoid unnecessary physical input/outputs by delaying writes as long as possible. This allows the filesystem to allocate the data space efficiently and often contiguously. The data tends to be allocated in large contiguous chunks, which yields sustained high bandwidths.
Preferably, the underlying layer uses a directory structure based on B-trees, which allow the cluster filesystem to maintain good response times, even as the number of files in a directory grows to tens or hundreds of thousands of files. The cluster filesystem adds a coordination layer to the underlying filesystem layer. Existing filesystems defined in the underlying layer can be migrated to a cluster filesystem according to the present invention without necessitating a dump and restore (as long as the storage can be attached to the SAN). For example, in the IRIX nodes 22, XVM is used for volume management and XFS is used for filesystem access and control. Thus, the cluster filesystem layer is referred to as CXFS.
In the cluster file system of the preferred embodiment, one of the nodes, e.g., IRIX node 22b, is a metadata server for the other nodes 22, 24, 26 in the cluster which are thus metadata clients with respect to the file system(s) for which node 22b is a metadata server. Other node(s) may serve as metadata server(s) for other file systems. All of the client nodes 22, 24 and 26, including metadata server 22b, provide direct access to files on the filesystem. This is illustrated in
As illustrated in
Token Infrastructure
The tokens operated on by the token client 46 and token server 50 in an exemplary embodiment are listed below. Each token may have three levels, read, write, or shared write. Token clients 46a and 46b (
Certain types of write operations may be performed simultaneously by more than one client, in which case the shared write level is used. An example is maintaining the timestamps for a file. To reduce overhead, when reading or writing a file, multiple clients can hold the shared write level and each update the timestamps locally. If a client needs to read the timestamp, it obtains the read level of the token. This causes all the copies of the shared write token to be returned to the metadata server 22b along with each client's copy of the file timestamps. The metadata server selects the most recent timestamp and returns this to the client requesting the information along with the read token.
Acquiring a token puts a reference count on the token, and prevents it from being removed from the token client. If the token is not already present in the token client, the token server is asked for it. This is sometimes also referred to as obtaining or holding a token. Releasing a token removes a reference count on a token and potentially allows it to be returned to the token server. Recalling or revoking a token is the act of asking a token client to give a token back to the token server. This is usually triggered by a request for a conflicting level of the token.
When a client needs to ask the server to make a modification to a file, it will frequently have a cached copy of a token at a level which will conflict with the level of the token the server will need to modify the file. In order to minimize network traffic, the client ‘lends’ its read copy of the token to the server for the duration of the operation, which prevents the server from having to recall it. The token is given back to the client at the end of the operation.
Following is a list of tokens in an exemplary embodiment:
DVN_EXIST is the existence token. Represents the fact that a client has references to the vnode. Each client which has a copy of the inode has the read level of this token and keeps it until they are done with the inode. The client does not acquire and release this token around operations, it just keeps it in the token client. The server keeps one reference to the vnode (which keeps it in memory) for each client which has an existence token. When the token is returned, this reference count is dropped. If someone unlinks the file—which means it no longer has a name, then the server will conditionally recall all the existence tokens. A conditional recall means the client is allowed to refuse to send the token back. In this case the clients will send back all the tokens and state they have for the vnode if no application is currently using it. Once all the existence tokens are returned, the reference count on the server's vnode drops to zero, and this results in the file being removed from the filesystem.
DVN_IOEXCL is the I/O exclusive token. The read token is obtained by any client making read or write calls on the vnode. The token is held across read and write operations on the file. The state protected by this token is what is known as the I/O exclusive state. This state is cached on all the clients holding the token. If the state is true then the client knows it is the only client performing read/write operations on the file. The server keeps track of when only one copy of the token has been granted to a client, and before it will allow a second copy to be given out, it sends a message to the first client informing it that the I/O exclusive state has changed from true to false. When a client has an I/O exclusive state of true is allowed to cache changes to the file more aggressively than otherwise.
DVN_IO is the IO token which is used to synchronize between read and write calls on different computers. CXFS enforces a rule that buffered reads are atomic with respect to buffered writes, and writes are atomic with respect to other writes. This means that a buffered read operation happens before or after a write, never during a write. Buffered read operations hold the read level of the token, buffered writes hold the write level of the token. Direct reads and writes hold the read level of the token.
DVN_PAGE_DIRTY represents the right to hold modified file data in memory on a system.
DVN_PAGE_CLEAN represents the right to hold unmodified file data in memory on a computer. Combinations of levels of DVN_PAGE_DIRTY and DVN_PAGE_CLEAN are used to maintain cache coherency across the cluster.
DVN_NAME is the name token. A client with this token in the token client for a directory is allowed to cache the results of lookup operations within the directory. So if we have a name we are looking up in a directory, and we have done the same lookup before, the token allows us to avoid sending the lookup to the server. An operation such as removing or renaming, or creating a file in a directory will obtain the write level of the token on the server and recall the read token—invalidating any cached names for that directory on those clients.
DVN_ATTR protects fields such as the ownership information, the extended attributes of the file, and other small pieces of information. Held by the client for read, and by the server for write when the server is making modifications. Recall of the read token causes the invalidation of the extended attribute cache.
DVN_TIMES protects timestamp fields on the file. Held at the read level by hosts who are looking at timestamps, held at the shared write level by hosts doing read and write operations, and held at the write level on the server when setting timestamps to an explicit value. Recall of the shared write token causes the client to send back its modified timestamps, the server uses the largest of the returned values as the true value of the timestamp.
DVN_SIZE protects the size of the file, and the number of disk blocks in use by the file. Held for read by a client who wants to look at the size, or for write by a client who has a true IO exclusive state. This allows the client to update the size of the file during write operations without having to immediately send the updated size back to the server.
DVN_EXTENT protects the metadata which indicates where the data blocks for a file are on disk, known as the extent information. When a client needs to perform read or write operation it obtains the read level of the token and gets of a copy of the extent information with it. Any modification of the extent information is performed on the server and is protected by the write level of the token. A client which needs space allocated in the file will lend its read token to the server for this operation.
DVN_DMAPI protects the DMAPI event mask. Held at the read level during IO operations to prevent a change to the DMAPI state of the file during the IO operation. Only held for write by DMAPI on the server.
Data coherency is preferably maintained between the nodes in a cluster which are sharing access to a file by using combinations of the DVN_PAGE_DIRTY and DVN_PAGE_CLEAN tokens for the different forms of input/output. Buffered and memory mapped read operations hold the DVN_PAGE_CLEAN_READ token, while buffered and memory mapped write operations hold the DVN_PAGE_CLEAN_WRITE and VN_PAGE_DIRTY_WRITE tokens. Direct read operations hold the DVN_PAGE_CLEAN_SHARED_WRITE token and direct write operations hold the DVN_PAGE_CLEAN_SHARED_WRITE and VN_PAGE_DIRTY_SHARED_WRITE tokens. Obtaining these tokens causes other nodes in the cluster which hold conflicting levels of the tokens to return their tokens. Before the tokens are returned, these client nodes perform actions on their cache of file contents. On returning the DVN_PAGE_DIRTY_WRITE token a client node must first flush any modified data for the file out to disk and then discard it from cache. On returning the DVN_PAGE_CLEAN_WRITE token a client node must first flush any modified data out to disk. If both of these tokens are being returned then both the flush and discard operations are performed. On returning the DVN_PAGE_CLEAN_READ token to the server, a client node must first discard any cached data for the file it has in system memory.
An illustration to aid in understanding how tokens are requested and returned is provided in
If metadata client 44a had wanted a write token in the preceding example, the write token must be returned by metadata client 44c. The request for the write token continues from metadata client 44c to token client 46c via path 74 and is returned via paths 76 and 78 to metadata server 48 which forwards the write token to token server 50 via path 80. Once token server 50 has the write token, it is supplied to metadata client 44a via paths 68 and 66 as in the case of the read token described above.
Appropriate control of the tokens for each file by metadata server 48 at node 22b enables nodes 22, 24, 26 in the cluster to share all of the files on disk 28 using direct access via Fibre Channel 30, 32. To maximize the speed with which the data is accessed, data on the disk are cached at the nodes as much as possible. Therefore, before returning a write token, the metadata client 44 flushes the write cache to disk. Similarly, if it is necessary to obtain a read token, the read cache is marked invalid and after the read token is obtained, contents of the file are read into the cache.
Mounting of a filesystem as a metadata server is arbitrated by a distributed name service (DNS), such as “white pages” from SGI. A DNS server runs on one of the nodes, e.g., node 22c, and each of the other nodes has DNS clients. Subsystems such as the filesystem, when first attempting to mount a filesystem as the metadata server, first attempt to register a filesystem identifier with the distributed name service. If the identifier does not exist, the registration succeeds and the node mounts the filesystem as the server. If the identifier is already registered, the registration fails and the contents of the existing entry for the filesystem identifier are returned, including the node number of the metadata server for the filesystem.
Extended Attribute Caching
According to the present invention, extended attributes are basically name-value pairs of information associated with a filesystem object. Each extended attribute includes a free form data area, associated with any filesystem object, that provides separate storage from the file data or device. The structure of the value is defined by the applications that use the extended attribute. One example of an application that uses extended attributes is the data migration package.
There may be two types of extended attributes: short form, and regular. When there is extra space in an inode due to the padding and buffering requirements of the filesystem, an extended attribute that is small enough may be stored in the extra, unused space of an inode, to save disk space. XFS stored extended attributes for recording inside the inode in this manner.
Special extended attributes (called root attributes) are writable only by privileged user applications and system software. One example of a root extended attribute in CXFS is SGI_DMI_DMFATTR which contains a file's DMF status information. A major use of root extended attributes is storing access control lists (ACLs) and mandatory access control (MAC) labels for filesystem security. Examples are SGI_MAC_FILE (used to hold an object's MAC label) and SGI_ACL_FILE (used to hold an object's access control list). These extended attributes are used in high security systems, such as those handling government classified data. TRIX is a version of IRIX which uses extended attributes for increased security, while other versions of IRIX use extended attributes to store other information related to filesystem objects.
Each node in a TRIX cluster is a trusted entity and thus, has full access to the filesystem. Therefore, the extended attributes, including those used for security, can be distributed by the filesystem server to the filesystem clients and cached by the filesystem clients without any security concerns. Each node controls access by users and applications to the filesystem. Caching of extended attributes distributes the state of the attributes to the filesystem clients which makes it possible to maintain access control lists and mandatory access control information on a file in a distributed manner while still maintaining the security of that file. This provides the benefit of optimizing access control checks to improve the performance of a secure system.
The extended attributes for a file object are stored on a disk separate from the file data and are therefore accessible only by the filesystem server. If extended attributes used to hold security information about a filesystem object are not cached, the filesystem client needs to request those extended attributes every time a check is performed. In some cases, the same attribute needs to be checked several times for a single filesystem object during a single operation. By caching the extended attributes which are protected by the operating system, the filesystem client only needs to make one request for the attribute. When the client needs to check the attribute later, the filesystem client uses its local copy of the attribute.
To access an extended attribute in the local cache, a CXFS client uses an ATTR token to protect the coherency of the client's attribute cache. The CXFS server issues the CXFS client the ATTR read token when the client requests an extended attribute. The client's cached value for the extended attribute is valid as long as it has the ATTR read token. Any number of filesystem client nodes can have outstanding ATTR read tokens. If an application program executing on a filesystem client wants to modify a file system object's attribute, it sends a message to the filesystem server. Only the filesystem server has access to the extended attributes stored on disk. Therefore, if a client wants to change an extended attribute, it has to ask the server to do it on behalf of the client. Before the server changes the value of the extended attribute, it will send a message to all clients that have outstanding ATTR read tokens telling them to release their ATTR read token. When a CXFS client receives the request to release it's ATTR read token, it clears and invalidates its extended attribute cache. Subsequent checks against the extended attribute would generate a request to the server for the new value of the extended attribute.
As noted above, one use of extended attributes is to store access control lists. An access control list (ACL) is a list of file permissions that are more extendable than the standard UNIX owner-group-other permissions. The standard UNIX owner-group-other permissions allow a filesystem object to have only three sets of permissions for different classes of users-one for the owner of the file (the UID assigned to the file), one for a group (the file's GID), and one for any user who's not the owner and not in the group. The standard UNIX environment can control read, write and execute permissions for those three classes. An ACL may contain several entries for individual users or groups, each with different sets of permissions. An access control list identifies particular user(s) who have specific permissions and particular groups may have specific permissions. The ACL is a list of those permissions for any filesystem object, such as a particular file or directory.
Preferably, an access control list may be used to control operations on each directory. In addition, each directory may have a default access control list that is assigned to new files created in that directory. In a secure system, it is preferable that files do not exist without an access control list. Therefore, when a file is created, its initial or default access control list is inherited from an extended attribute which is held in the parent directory.
In addition to or as an alternative to ACLs, a clustered filesystem according to the present invention may include root extended attributes called mandatory access control (MAC) labels which provide compartmentalization of data in a system. According to the present invention, a MAC label has two parts. One part deals with sensitivity of data to indicate whether any user or process can look at the data, or just certain users and processes. The other part deals with the integrity of data to indicate whether the data came from a reliable source. If any user is permitted to modify the contents of a file, it is given a low integrity rating (mintlow). If a file may be modified by only specified user(s), it is given a high integrity rating (minthigh). If a file may be viewed by anyone, it would have a low sensitivity rating (msenlow). It a file contains information only a few people should know about, it would have a high sensitivity rating (msenhigh).
In a preferred embodiment, a cluster having a mixture of TRIX and non-TRIX nodes uses TRIX nodes as metadata servers for all filesystems which will have MAC label file data and metadata access limits enforced. Only a TRIX node has the software necessary to enforce file access limits based on MAC labels. An application can check the integrity rating of a filesystem object to verify that it meets it's criteria.
For example, MAC labels may be assigned to non-TRIX nodes in one of three ways. The first alternative into use a default MAC label for the filesystem. One of the options when mounting a filesystem is to assign a default MAC label for accesses to the filesystem by nodes without MAC labels. If the filesystem being accessed was mounted using this option, the default MAC label for the filesystem is used.
If the filesystem doesn't have a default MAC label, the second alternative is to use a default MAC label assigned to the node. A TRIX node maintains a remote host database in the kernel that includes an IP address for each host in communication with the TRIX node and trust attributes for the node, regardless of whether the node is a TRIX or non-TRIX node. The default MAC label for the node is obtained from the remote host database if the filesystem was not assigned a MAC label.
If, for any reason, no entry can be found for the non-TRIX node in the database, e.g., the access request is being handled during reloading of the remote host database, preferably the weakest possible access is assigned to the request. In this case, the access request is considered to be highly sensitive, but not from a reliable source (msenhigh/mintlow).
Hierarchical Storage Management
In addition to caching data that is being used by a node, in the preferred embodiment hierarchical storage management (HSM), such as the data migration facility (DMF) from SGI, is used to move data to and from tertiary storage, particularly data that is infrequently used. As illustrated in
Flowcharts of the operations performed when client node 22a requests access to data under hierarchical storage management are provided in
As illustrated in
The possible DMAPI events are read, write and truncate. When a read event is queued, the DMAPI server informs the HSM software to ensure that data is available on disks. If necessary, the file requested to be read is transferred from tape to disk. If a write event is set, the HSM software is informed that the tape copy will need to be replaced or updated with the contents written to disk. Similarly, if a truncate event is set, the appropriate change in file size is performed, e.g., by writing the file to disk, adjusting the file size and copying to tape.
Upon completion of the DMAPI event, a reply is forwarded 140 by metadata server 50 to client node 22a which receives 142 the reply and user application 92 performs 146 input/output operations. Upon completion of those operations, the DMAPI token is released 148.
Maintaining System Availability
In addition to high-speed disk access obtained by caching data and shared access to disk drives via a SAN, it is desirable to have high availability of the cluster. This is not easily accomplished with so much data being cached and multiple nodes sharing access to the same data. Several mechanisms are used to increase the availability of the cluster as a whole in the event of failure of one or more of the components or even an entire node, including a metadata server node.
One aspect of the present invention that increases the availability of data is the mirroring of data volumes in mass storage 28. As in the case of conventional mirroring, during normal operation the same data is written to multiple devices. Mirroring may be used in conjunction with striping in which different portions of a data volume are written to different disks to increase speed of access. Disk concatenation can be used to increase the size of a logical volume. Preferably, the volume manager allows any combination of striping, concatenation and mirroring.
The volume manager may have several servers which operate independently, but are preferably chosen using the same logic. A node is selected from the nodes that have been in the cluster membership the longest and are capable of hosting the server. From that pool of nodes the lowest numbered node is chosen. The volume manager servers are chosen at cluster initialization time or when a server failure occurs. In an exemplary embodiment, there are four volume manager servers, termed boot, config, mirror and pal.
The volume manager exchanges configuration information at cluster initialization time. The boot server receives configuration information from all client nodes. Some of the client nodes could have different connectivity to disks and thus, could have different configurations. The boot server merges the configurations and distributes changes to each client node using a volume manager multicast facility. This facility preferably ensures that updates are made on all nodes in the cluster or none of the nodes using two-phase commit logic. After cluster initialization it is the config server that coordinates changes. The mirror server maintains the mirror specific state information about whether a revive is needed and which mirror legs are consistent.
In a cluster system according to the present invention, all data volumes and their mirrors in mass storage 28 are accessible from any node in the cluster. Each mirror has a node assigned to be its mirror master. The mirror master may be chosen using the same logic as the mirror server with the additional constraint that it must have a physical connection to the disks. During normal operation, queues may be maintained for input/output operations for all of the client nodes by the mirror master to make the legs of the mirror consistent across the cluster. In the event of data loss on one of the disk drives forming mass storage 28, a mirror revive process is initiated by the mirror master, e.g., node 22c (
If a client node, e.g., node 22a, terminates abnormally, the mirror master node 22c will search the mirror input/output queues for outstanding input/output operations from the failed node and remove the outstanding input/output operations from the queues. If a write operation from a failed process to a mirrored volume is in a mirror input/output queue, a mirror revive process is initiated to ensure that mirror consistency is maintained. If the mirror master fails, a new mirror master is selected and the mirror revive process starts at the beginning of the mirror of a damaged data volume and continues to the end of the mirror.
When a mirror revive is in progress, the mirror master coordinates input/output to the mirror. The mirror revive process uses an overlap queue to hold I/O requests from client nodes made during the mirror revive process. Prior to beginning to read from an intact leg of the mirror, the mirror revive process ensures that all other input/output activity to the range of addresses is complete. Any input/output requests made to the address range being revived are refused by the mirror master until all the data in that range of addresses has been written by the mirror revive process.
If there is an I/O request for data in an area that is currently being copied in reconstructing the mirror, the data access is retried after a predetermined time interval without informing the application process which requested the data access. When the mirror master node 22c receives a message that an application wants to do input/output to an area of the mirror that is being revived, the mirror master node 22c will reply that the access can either proceed or that the I/O request overlaps an area being revived. In the latter case, the client node will enter a loop in which the access is retried periodically until it is successful, without the application process being aware that this is occurring.
Input/output access to the mirror continues during the mirror revive process with the volume manager process keeping track of the first unsynchronized block of data to avoid unnecessary communication between client and server. The client node receives the revive status and can check to see if it has an I/O request preceding the area being synchronized. If the I/O request precedes that area, the I/O request will be processed as if there was no mirror revive in progress.
Data read from unreconstructed portions of the mirror by applications are preferably written to the copy being reconstructed, to avoid an additional read at a later period in time. The mirror revive process keeps track of what blocks have been written in this manner. New data written by applications in the portion of the mirror that already have been copied by the mirror revive process are mirrored using conventional mirroring. If an interior mirror is present, it is placed in writeback mode. When the outer revive causes reads to the interior mirror, it will automatically write to all legs of the interior mirror, thus synchronizing the interior mirror at the same time.
Recovery and Relocation
In the preferred embodiment, a common object recovery protocol (CORPSE) is used for server endurance. As illustrated in
As illustrated in
The node in the leader state 206 sends out messages to all of the other nodes that it has identified and requests information from each of those nodes about the nodes to which they are connected. Upon receipt of these messages, nodes in the nascent state 204 and stable state 208 transition to the follower state 210. The information received in response to these requests is accumulated by the node in the leader state 206 to identify the largest set of fully connected nodes for a proposed membership. Identifying information for the nodes in the proposed membership is then transmitted to all of the nodes in the proposed membership. Once all nodes accept the membership proposed by the node in the leader state 206, all of the nodes in the membership transition to the stable state 208 and recovery is initiated 212 if the change in membership was due to a node failure. If the node in the leader state 206 is unable to find sufficient operating nodes to form a cluster, i.e., a quorum, all of the nodes transition to a dead state 214.
If a node is deactivated in an orderly fashion, the node sends a withdrawal request to the other nodes in the cluster, causing one of the nodes to transition to the leader state 206. As in the case described above, the node in the leader state 206 sends a message with a proposed membership causing the other nodes to transition to the follower state 210. If a new membership is established, the node in the leader state 206 sends an acknowledgement to the node that requested withdrawal from membership and that node transitions to a shutdown state 216, while the remaining nodes transition to the stable state 208.
In the stable state 208, message channels are established between the nodes 22, 24, 26 over LAN 34. A message transport layer in the operating system handles the transmission and receipt of messages over the message channels. One set of message channels is used for general messages, such as token requests and metadata. Another set of channels is used just for membership. If it is necessary to initiate recovery 212, the steps illustrated in
Upon notification of a node failure, the CMS daemon blocks 228 new nodes from joining the membership and initiates 230 the membership protocol represented by the state machine diagram in
In the preferred embodiment, CMS includes support for nodes to operate under different versions of the operating system, so that it is not necessary to upgrade all of the nodes at once. Instead, a rolling upgrade is used in which a node is withdrawn from the cluster, the new software is installed and the node is added back to the cluster. The time period between upgrades may be fairly long, if the people responsible for operating the cluster want to gain some experience using the new software.
Version tags and levels are preferably registered by the various subsystems to indicate version levels for various functions within the subsystem. These tags and levels are transmitted from follower nodes to the CMS leader node during the membership protocol 230 when joining the cluster. The information is aggregated by the CMS leader node and membership delivery 232 includes the version tags and levels for any new node in the cluster. As a result all nodes in the know the version levels of functions on other nodes before any contact between them is possible so they can properly format messages or execute distributed algorithms.
Upon initiation 212 of recovery, the following steps are performed. The first step in recovery involves the credential service subsystem. The credential subsystem caches information about other nodes, so that each service request doesn't have to contain a whole set of credentials. As the first step of recovery, the CMS daemon notifies 234 the credential subsystem in each of the nodes to flush 236 the credentials from the failed node.
When the CMS daemon receives acknowledgment that the credentials have been flushed, common object recovery is initiated 238. Details of the common object recovery protocol for server endurance (CORPSE) will be described below with respect to
After all of the messages from the failed node have been processed, CORPSE recovers the system in three passes starting with the lowest layer (cluster infrastructure) and ending with the file system. In the first pass, recovery of the kernel object relocation engine (KORE) is executed 242 for any in-progress object relocation involving a failed node. In the second pass, the distributed name server (white pages) and the volume manager, such as XVM, are recovered 244 making these services available for filesystem recovery. In the third pass the file system is recovered 246 to return all files to a stable state based on information available from the remaining nodes. Upon completion of the third pass, the message channels are closed 248 and new nodes are allowed 250 to join.
As illustrated in
The next step to be performed includes detargeting a chandle. A chandle or client handle is a combination of a barrier lock, some state information and an object pointer that is partially subsystem specific. A chandle includes a node identifier for where the metadata server can be found and a field that the subsystem defines which tells the chandle how to locate the metadata server on that node, e.g., using a hash address or an actual memory address on the node. Also stored in the chandle is a service identifier indicating whether the chandle is part of the filesystem, vnode file, or distributed name service and a multi-reader barrier lock that protects all of this. When a node wants to send a message to a metadata server, it acquires a hold on the multi-reader barrier lock and once that takes hold the service information is decoded to determine where to send the message and the message is created with the pointer to the object to be executed once the message reaches the metadata server.
With messages interrupted and create locks held, celldown callouts are performed 268 to load object information into a manifest object and detarget the chandles associated with the objects put into the manifest. By detargeting a chandle, any new access on the associated object is prevented. The create locks are previously held 266 on the objects needed for recovery to ensure that the objects are not instantiated for continued processing on a client node in response to a remote processing call (RPC) previously initiated on a failed metadata server. An RPC is a thread initiated on a node in response to a message from another node to act as a proxy for the requesting node. In the preferred embodiment, RPCs are used to acquire (or recall) tokens for the requesting node. During celldown callouts 268 the metadata server recovers from any lost clients, returning any tokens the client(s) held and purging any state held on behalf of the client.
The CORPSE subsystems executing on the metadata clients go through all of the objects involved in recovery and determine whether the server for that client object is in the membership for the cluster. One way of making this determination is to examine the service value in the chandle for that client object, where the service value contains a subsystem identifier and a server node identifier. Object handles which identify the subsystems and subsystem specific recovery data necessary to carry out further callouts are placed in the manifest. Server nodes recover from client failure during celldown callouts by returning failed client tokens and purging any state associated with the client.
When celldown callouts have been performed 268 for all of the objects associated with a failed node, the operations frozen 266 previously are thawed or released 270. The message channel is thawed 270, so that any threads that are waiting for responses can receive error messages that a cell is down, i.e., a node has failed, so that that the threads can do any necessary cleanup and then drop the chandle hold. This allows all of the detargets to be completed. In addition, the create locks are released 270. The final result of the operations performed in step 270 is that all client objects associated with the filesystem are quiesced, so that no further RPCs will be sent or are awaiting receipt.
After the celldown callouts 268 have processed the information about the failed node(s), vote callouts are performed 272 in each of the remaining nodes to elect a new server. The votes are sent to the CORPSE leader which executes 274 election callouts to identify the node(s) that will host the new servers. The election algorithm used is subsystem specific. The filesystem selects the next surviving node listed as a possible server for the filesystem, while the DNS selects the oldest server capable node.
When all of the nodes are notified of the results of the election, gather callouts are performed 276 on the client nodes to create manifests for each server on the failed node(s). Each manifest contains information about one of the servers and is sent to the node elected to host that server after recovery. A table of contents of the information in the bag is included in each manifest, so that reconstruct callouts can be performed 278 on each object and each manifest from each of the nodes.
The reconstruct callouts 278 are executed on the new elected server to extract information from the manifests received from all the nodes while the chandles are detargeted, so that none of the nodes attempt to access the elected server. When the reconstruct callouts 278 are completed, a message is sent to the CORPSE leader that it is ready to commit 280 to instantiate the objects of the server. The instantiate callouts are then performed 282 and upon instantiation of all of the objects, a commitment 284 is sent to the CORPSE leader for retargeting the chandles to the elected server. The instantiate commit 280 and retarget commit 284 are performed by the CORPSE leader, to save information regarding the extent of recovery, in case there is another node failure prior to completion of a pass. If a failure occurs prior to instantiate commit 280, the pass is aborted and recovery is restarted with freezing 224 of message channels. However, once the CORPSE leader notifies any node to go forward with instantiating 282 new server(s), recovery of any new node failure is delayed until the current pass completes, then recovery rolls back to freezing 224 message channels. If the failed node contains the elected server, the client nodes are targeted to the now-failed server and the process of recovering the server begins again.
In the case of the second pass, WP/XVM 244, a single chandle accesses the DNS server and the manifest created at each client node contains all of the file identifiers in use at that node prior to entering recovery. During the reconstruct callouts 278 of the second pass, the DNS server goes through all of the entries in the manifest and creates a unique entry for each filesystem identifier it receives. If duplicate entries arrive, which is likely since many nodes may have the entry for a single filesystem, tokens are allocated for the sending node in the previously created entry.
After all of the retargets are performed 286 in each of the nodes, a complete callout is performed 288 by the subsystem being recovered to do any work that is required at that point. Examples are deallocating memory used during recovery or purging any lingering state associated with a failed node, including removing DNS entries still referencing a failed node. As discussed above with respect to
Kernel Object Relocation Engine
As noted above, the first pass 242 of recovery is to recover from an incomplete relocation of a metadata server. The kernel object relocation engine (KORE) is used for an intentional relocation of the metadata server, e.g. for an unmount of the server or to completely shutdown a node at which a metadata server is located, to return the metadata server to a previously failed node, or for load shifting. Provided no nodes fail, during relocation an object manifest can be easily created, since all of the information required for the new, i.e., target, metadata server can be obtained from the existing, i.e., source, metadata server.
As illustrated in
In response, the source metadata server initiates 310 retargeting and creation of client structures (objects) for the vnodes and the vfs, then all clients are informed 312 to detarget 314 that node as the metadata server. When the source metadata server has been informed that all of the clients have completed detargeting 314, a source bag is generated 316 with all of the tokens and the state of server objects which are sent 318 to the target metadata server. The target metadata server unbags 320 the objects and initiates execution of the metadata server. The target metadata server informs the source metadata server to inform 322 the clients to retarget 324 the target metadata server and processing resumes on the target metadata server. The source metadata server is informed when each of the clients completes retargeting 324, so that the source node can end 326 operation as the metadata server.
The stages of the relocation process are illustrated in
Interruptible Token Acquisition
Preferably interruptible token acquisition is used to enable recovery and relocation in several ways: (1) threads processing messages from failed nodes that are waiting for the token state to stabilize are sent an interrupt to be terminated to allow recovery to begin; (2) threads processing messages from failed nodes which may have initiated a token recall and are waiting for the tokens to come back are interrupted; (3) threads that are attempting to lend tokens which are waiting for the token state to stabilize and are blocking recovery/relocation are interrupted; and (4) threads that are waiting for the token state to stabilize in a filesystem that has been forced offline due to error are interrupted early. Threads waiting for the token state to stabilize first call a function to determine if they are allowed to wait, i.e. none of the factors above apply, then go to sleep until some other thread signals a change in token state.
To interrupt, CORPSE and KORE each wake all sleeping threads. These threads loop, check if the token state has changed and if not attempt to go back to sleep. This time, one of the factors above may apply and if so a thread discovering it returns immediately with an “early” status. This tells the upper level token code to stop trying to acquire, lend, etc. and to return immediately with whatever partial results are available. This requires processes calling token functions to be prepared for partial results. In the token acquisition case, the calling process must be prepared to not get the token(s) requested and to be unable to perform the intended operation. In the token recall case, this means the thread will have to leave the token server data structure in a partially recalled state. This transitory state is exited when the last of the recalls comes in, and the thread returning the last recalled token clears the state. In lending cases, the thread will return early, potentially without all tokens desired for lending.
The many features and advantages of the invention are apparent from the detailed specification and, thus, it is intended by the appended claims to cover all such features and advantages of the invention that fall within the true spirit and scope of the invention. Further, since numerous modifications and changes will readily occur to those skilled in the art, it is not desired to limit the invention to the exact construction and operation illustrated and described, and accordingly all suitable modifications and equivalents may be resorted to, falling within the scope of the invention.
The present application is a continuation and claims the priority benefit of U.S. patent application Ser. No. 14/042,438 filed Sep. 30, 2013, issuing as U.S. Pat. No. 9,405,606, which is a continuation and claims the priority benefit of U.S. patent application Ser. No. 13/438,304 filed Apr. 3, 2012, now U.S. Pat. No. 8,578,478, which is a continuation and claims the priority benefit of U.S. patent application Ser. No. 12/648,501 filed Dec. 29, 2009, now U.S. Pat. No. 8,151,347, which is a continuation and claims the priority benefit of U.S. patent application Ser. No. 10/414,239 filed Apr. 16, 2003, now U.S. Pat. No. 7,640,582, which is a continuation and claims the priority benefit of U.S. patent application Ser. No. 10/197,211 filed Jul. 18, 2002, which is a continuation-in-part and claims the priority benefit of U.S. patent application Ser. No. 10/162,258 filed Jun. 5, 2002, now U.S. Pat. No. 6,950,833, which claims the priority benefit of U.S. provisional application No. 60/296,046 filed Jun. 5, 2001, the disclosures of which are incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 1785256 | Greve | Dec 1930 | A |
| 4930121 | Shiobara | May 1990 | A |
| 5206455 | Williams et al. | Apr 1993 | A |
| 5363487 | Willman et al. | Nov 1994 | A |
| 5440727 | Bhide et al. | Aug 1995 | A |
| 5454108 | Devarakonda | Sep 1995 | A |
| 5490270 | Devarakonda | Feb 1996 | A |
| 5515537 | Tavares et al. | May 1996 | A |
| 5537574 | Elko | Jul 1996 | A |
| 5566177 | Bhandari et al. | Oct 1996 | A |
| 5611050 | Theimer et al. | Mar 1997 | A |
| 5634122 | Loucks | May 1997 | A |
| 5666486 | Alfieri et al. | Sep 1997 | A |
| 5668958 | Bendert et al. | Sep 1997 | A |
| 5727206 | Fish et al. | Mar 1998 | A |
| 5734898 | He | Mar 1998 | A |
| 5742812 | Baylor et al. | Apr 1998 | A |
| 5774689 | Curtis et al. | Jun 1998 | A |
| 5778387 | Wilkerson et al. | Jul 1998 | A |
| 5778429 | Sukegawa et al. | Jul 1998 | A |
| 5786814 | Moran et al. | Jul 1998 | A |
| 5805785 | Dias et al. | Sep 1998 | A |
| 5822531 | Gorczyca et al. | Oct 1998 | A |
| 5832496 | Anand et al. | Nov 1998 | A |
| 5842003 | Holmes et al. | Nov 1998 | A |
| 5852747 | Bennett et al. | Dec 1998 | A |
| 5859966 | Hayman et al. | Jan 1999 | A |
| 5869966 | Gatehouse | Feb 1999 | A |
| 5872747 | Johnson | Feb 1999 | A |
| 5875479 | Blount et al. | Feb 1999 | A |
| 5878421 | Ferrel et al. | Mar 1999 | A |
| 5889952 | Hunnicutt | Mar 1999 | A |
| 5903732 | Reed et al. | May 1999 | A |
| 5907837 | Ferrel et al. | May 1999 | A |
| 5917988 | Eto | Jun 1999 | A |
| 5917998 | Cabrera et al. | Jun 1999 | A |
| 5918229 | Davis et al. | Jun 1999 | A |
| 5933824 | Dekoning et al. | Aug 1999 | A |
| 5941947 | Brown | Aug 1999 | A |
| 5950199 | Schmuck et al. | Sep 1999 | A |
| 5963962 | Hitz et al. | Oct 1999 | A |
| 5987566 | Vishlitzky et al. | Nov 1999 | A |
| 5991877 | Luckenbaugh | Nov 1999 | A |
| 5999712 | Moiin et al. | Dec 1999 | A |
| 6003075 | Arendt et al. | Dec 1999 | A |
| 6014669 | Slaughter et al. | Jan 2000 | A |
| 6014699 | Ratcliff et al. | Jan 2000 | A |
| 6016553 | Schneider et al. | Jan 2000 | A |
| 6026452 | Pitts | Feb 2000 | A |
| 6032216 | Schmuck et al. | Feb 2000 | A |
| 6041383 | Jeffords et al. | Mar 2000 | A |
| 6044367 | Wolff | Mar 2000 | A |
| 6047294 | Deshayes et al. | Apr 2000 | A |
| 6047323 | Krause | Apr 2000 | A |
| 6047332 | Viswanathan et al. | Apr 2000 | A |
| 6052797 | Ofek et al. | Apr 2000 | A |
| 6058400 | Slaughter | May 2000 | A |
| 6067545 | Wolff | May 2000 | A |
| 6073132 | Gehman | Jun 2000 | A |
| 6073218 | DeKoning et al. | Jun 2000 | A |
| 6075467 | Ninagawa | Jun 2000 | A |
| 6078932 | Haye et al. | Jun 2000 | A |
| 6088693 | Van Huben et al. | Jul 2000 | A |
| 6094654 | Van Huben et al. | Jul 2000 | A |
| 6101508 | Wolff | Aug 2000 | A |
| 6105026 | Kruglikov et al. | Aug 2000 | A |
| 6105132 | Fritch et al. | Aug 2000 | A |
| 6108699 | Moiin | Aug 2000 | A |
| 6111893 | Volftsun et al. | Aug 2000 | A |
| 6131148 | West et al. | Oct 2000 | A |
| 6134673 | Chrabaszcz | Oct 2000 | A |
| 6144992 | Turpin et al. | Nov 2000 | A |
| 6144999 | Khalidi et al. | Nov 2000 | A |
| 6151588 | Tozzoli et al. | Nov 2000 | A |
| 6151688 | Wipfel et al. | Nov 2000 | A |
| 6157635 | Wang et al. | Dec 2000 | A |
| 6163855 | Shrivastava et al. | Dec 2000 | A |
| 6173293 | Thekkath et al. | Jan 2001 | B1 |
| 6178529 | Short et al. | Jan 2001 | B1 |
| 6182139 | Brendel | Jan 2001 | B1 |
| 6182198 | Hubis et al. | Jan 2001 | B1 |
| 6185601 | Wolff | Feb 2001 | B1 |
| 6189016 | Cabrera et al. | Feb 2001 | B1 |
| 6192401 | Modiri et al. | Feb 2001 | B1 |
| 6212531 | Blea et al. | Apr 2001 | B1 |
| 6230185 | Salas et al. | May 2001 | B1 |
| 6240335 | Wehrung et al. | May 2001 | B1 |
| 6243744 | Snaman et al. | Jun 2001 | B1 |
| 6275990 | Dapper et al. | Aug 2001 | B1 |
| 6279032 | Short et al. | Aug 2001 | B1 |
| 6289462 | McNabb et al. | Sep 2001 | B1 |
| 6295585 | Gillett et al. | Sep 2001 | B1 |
| 6298425 | Whitaker et al. | Oct 2001 | B1 |
| 6314408 | Salas et al. | Nov 2001 | B1 |
| 6324581 | Xu et al. | Nov 2001 | B1 |
| 6339793 | Bostian et al. | Jan 2002 | B1 |
| 6341339 | Kontothanassis et al. | Jan 2002 | B1 |
| 6349343 | Foody et al. | Feb 2002 | B1 |
| 6353837 | Blumenau | Mar 2002 | B1 |
| 6363495 | MacKenzie et al. | Mar 2002 | B1 |
| 6370529 | Kruglikov et al. | Apr 2002 | B1 |
| 6385701 | Krein | May 2002 | B1 |
| 6389420 | Vahalia et al. | May 2002 | B1 |
| 6389451 | Hart | May 2002 | B1 |
| 6393485 | Chao et al. | May 2002 | B1 |
| 6401120 | Gamache et al. | Jun 2002 | B1 |
| 6438705 | Chao et al. | Aug 2002 | B1 |
| 6449641 | Moiin et al. | Sep 2002 | B1 |
| 6453354 | Jiang et al. | Sep 2002 | B1 |
| 6453426 | Gamache et al. | Sep 2002 | B1 |
| 6463573 | Maddalozza, Jr. et al. | Oct 2002 | B1 |
| 6466978 | Mukherjee et al. | Oct 2002 | B1 |
| 6473775 | Kusters et al. | Oct 2002 | B1 |
| 6487561 | Ofek et al. | Nov 2002 | B1 |
| 6490631 | Teich et al. | Dec 2002 | B1 |
| 6493715 | Funk et al. | Dec 2002 | B1 |
| 6493796 | Arnon et al. | Dec 2002 | B1 |
| 6493804 | Soltis et al. | Dec 2002 | B1 |
| 6499031 | Hopmann | Dec 2002 | B1 |
| 6532494 | Frank et al. | Mar 2003 | B1 |
| 6560234 | Ben-Michael et al. | May 2003 | B1 |
| 6571259 | Zheng et al. | May 2003 | B1 |
| 6574749 | Parsons | Jun 2003 | B1 |
| 6594751 | Leivent | Jul 2003 | B1 |
| 6636499 | Dowling | Oct 2003 | B1 |
| 6640233 | Lewis et al. | Oct 2003 | B1 |
| 6651075 | Kusters et al. | Nov 2003 | B1 |
| 6651096 | Gai et al. | Nov 2003 | B1 |
| 6654912 | Viswanathan et al. | Nov 2003 | B1 |
| 6674713 | Berg et al. | Jan 2004 | B1 |
| 6681389 | Engel | Jan 2004 | B1 |
| 6684270 | Chmara et al. | Jan 2004 | B1 |
| 6697846 | Soltis | Feb 2004 | B1 |
| 6711559 | Kogota et al. | Mar 2004 | B1 |
| 6725264 | Christy | Apr 2004 | B1 |
| 6732124 | Koseki et al. | May 2004 | B1 |
| 6732125 | Autrey et al. | May 2004 | B1 |
| 6751616 | Chan | Jun 2004 | B1 |
| 6754181 | Elliot et al. | Jun 2004 | B1 |
| 6766430 | Arakawa et al. | Jul 2004 | B2 |
| 6785892 | Miller et al. | Aug 2004 | B1 |
| 6799189 | Huxoll | Sep 2004 | B2 |
| 6799258 | Linde | Sep 2004 | B1 |
| 6804719 | Cabrera et al. | Oct 2004 | B1 |
| 6807557 | Novaes et al. | Oct 2004 | B1 |
| 6819918 | Chin et al. | Nov 2004 | B2 |
| 6823356 | Novaes et al. | Nov 2004 | B1 |
| 6829610 | Hickman et al. | Dec 2004 | B1 |
| 6832330 | Boudrie et al. | Dec 2004 | B1 |
| 6839752 | Miller et al. | Jan 2005 | B1 |
| 6840687 | Riis et al. | Jan 2005 | B2 |
| 6868417 | Kazar et al. | Mar 2005 | B2 |
| 6873627 | Miller et al. | Mar 2005 | B1 |
| 6883170 | Garcia | Apr 2005 | B1 |
| 6889253 | Griffin et al. | May 2005 | B2 |
| 6904544 | DeRolf et al. | Jun 2005 | B2 |
| 6917626 | Duvvury et al. | Jul 2005 | B1 |
| 6947940 | Anderson et al. | Sep 2005 | B2 |
| 6948001 | Bradley | Sep 2005 | B1 |
| 6950833 | Costello et al. | Sep 2005 | B2 |
| 6952688 | Goldman et al. | Oct 2005 | B1 |
| 6954437 | Sylvest et al. | Oct 2005 | B1 |
| 6957254 | Iterum et al. | Oct 2005 | B1 |
| 6957439 | Lewallen | Oct 2005 | B1 |
| 6959310 | Eshel et al. | Oct 2005 | B2 |
| 6965569 | Carolan et al. | Nov 2005 | B1 |
| 6965934 | Reynolds et al. | Nov 2005 | B1 |
| 6973455 | Vahalia et al. | Dec 2005 | B1 |
| 6976060 | Manezak et al. | Dec 2005 | B2 |
| 6981005 | Cabrera et al. | Dec 2005 | B1 |
| 6981097 | Martin | Dec 2005 | B2 |
| 6983456 | Poznanovic et al. | Jan 2006 | B2 |
| 7006614 | Feinberg et al. | Feb 2006 | B2 |
| 7043663 | Pittelkow et al. | May 2006 | B1 |
| 7062563 | Lewis et al. | Jun 2006 | B1 |
| 7072984 | Polonsky et al. | Jul 2006 | B1 |
| 7088995 | Rao | Aug 2006 | B2 |
| 7089567 | Girardot | Aug 2006 | B2 |
| 7103664 | Novaes et al. | Sep 2006 | B1 |
| 7103914 | Focke et al. | Sep 2006 | B2 |
| 7127633 | Olson et al. | Oct 2006 | B1 |
| 7133846 | Ginter et al. | Nov 2006 | B1 |
| 7139925 | Dinker et al. | Nov 2006 | B2 |
| 7145898 | Elliott | Dec 2006 | B1 |
| 7159125 | Beadles et al. | Jan 2007 | B2 |
| 7171121 | Skarica et al. | Jan 2007 | B1 |
| 7180909 | Achler | Feb 2007 | B1 |
| 7185017 | Cauvin et al. | Feb 2007 | B1 |
| 7185076 | Novaes et al. | Feb 2007 | B1 |
| 7191433 | Narad et al. | Mar 2007 | B2 |
| 7200144 | Terrell et al. | Apr 2007 | B2 |
| 7203663 | Buisman et al. | Apr 2007 | B1 |
| 7209551 | Schroeder et al. | Apr 2007 | B1 |
| 7210169 | Smith et al. | Apr 2007 | B2 |
| 7225249 | Barry et al. | May 2007 | B1 |
| 7225276 | Garnett et al. | May 2007 | B2 |
| 7240100 | Wein et al. | Jul 2007 | B1 |
| 7254645 | Nishi | Aug 2007 | B2 |
| 7284191 | Grefenstette et al. | Oct 2007 | B2 |
| 7292567 | Terrell et al. | Nov 2007 | B2 |
| 7315903 | Bowden | Jan 2008 | B1 |
| 7325064 | Eshel | Jan 2008 | B2 |
| 7337241 | Boucher et al. | Feb 2008 | B2 |
| 7373422 | Paul et al. | May 2008 | B1 |
| 7394761 | Foster et al. | Jul 2008 | B2 |
| 7451199 | Kandefer et al. | Nov 2008 | B2 |
| 7487509 | Hugly et al. | Feb 2009 | B2 |
| 7559052 | Kalia et al. | Jul 2009 | B2 |
| 7593968 | Beck | Sep 2009 | B2 |
| 7617292 | Moore et al. | Nov 2009 | B2 |
| 7627694 | Sreenivasan et al. | Dec 2009 | B2 |
| 7640582 | Beck | Dec 2009 | B2 |
| 7649908 | Schwalb | Jan 2010 | B2 |
| 7765329 | Cruciani et al. | Jul 2010 | B2 |
| 7814058 | Beck | Oct 2010 | B2 |
| 8001222 | Beck | Aug 2011 | B2 |
| 8010558 | Wehrman et al. | Aug 2011 | B2 |
| 8151347 | Beck | Apr 2012 | B2 |
| 8156080 | Beck | Apr 2012 | B2 |
| 8209704 | McCann et al. | Jun 2012 | B1 |
| 8359603 | McCann et al. | Jan 2013 | B1 |
| 8396908 | Moore et al. | Mar 2013 | B2 |
| 8527463 | Beck | Sep 2013 | B2 |
| 8578478 | Beck | Nov 2013 | B2 |
| 8683021 | Beck | Mar 2014 | B2 |
| 8838658 | Moore et al. | Sep 2014 | B2 |
| 9405606 | Beck | Aug 2016 | B2 |
| 9438638 | Raymond et al. | Sep 2016 | B2 |
| 9519657 | Beck | Dec 2016 | B2 |
| 9606874 | Moore et al. | Mar 2017 | B2 |
| 20010016879 | Sekiguchi et al. | Aug 2001 | A1 |
| 20010039548 | Shinkai | Nov 2001 | A1 |
| 20010056492 | Bressoud et al. | Dec 2001 | A1 |
| 20020004857 | Arakawa et al. | Jan 2002 | A1 |
| 20020016827 | McCabe et al. | Feb 2002 | A1 |
| 20020049845 | Sreenivasan et al. | Apr 2002 | A1 |
| 20020095470 | Cochran et al. | Jul 2002 | A1 |
| 20020128562 | Bocek et al. | Sep 2002 | A1 |
| 20020133729 | Therien et al. | Sep 2002 | A1 |
| 20020143801 | Okamoto et al. | Oct 2002 | A1 |
| 20020152060 | Tseng et al. | Oct 2002 | A1 |
| 20020156613 | Geng et al. | Oct 2002 | A1 |
| 20020161855 | Manczak et al. | Oct 2002 | A1 |
| 20020161957 | Comeau et al. | Oct 2002 | A1 |
| 20020165979 | Vincent | Nov 2002 | A1 |
| 20020174369 | Miyazaki et al. | Nov 2002 | A1 |
| 20030018606 | Eshel | Jan 2003 | A1 |
| 20030028514 | Lord et al. | Feb 2003 | A1 |
| 20030031176 | Sim | Feb 2003 | A1 |
| 20030046542 | Chen et al. | Mar 2003 | A1 |
| 20030065760 | Casper et al. | Apr 2003 | A1 |
| 20030078946 | Costello et al. | Apr 2003 | A1 |
| 20030079155 | Kingsbury | Apr 2003 | A1 |
| 20030177187 | Levine et al. | Sep 2003 | A1 |
| 20030177387 | Osterwalder et al. | Sep 2003 | A1 |
| 20030787861 | Lubbers et al. | Oct 2003 | |
| 20030208750 | Tapper et al. | Nov 2003 | A1 |
| 20030217096 | McKelvie et al. | Nov 2003 | A1 |
| 20030217105 | Zircher et al. | Nov 2003 | A1 |
| 20040001501 | Delveaux et al. | Jan 2004 | A1 |
| 20040022237 | Elliot et al. | Feb 2004 | A1 |
| 20040024786 | Anderson et al. | Feb 2004 | A1 |
| 20040030951 | Armangau | Feb 2004 | A1 |
| 20040044655 | Cotner et al. | Mar 2004 | A1 |
| 20040064694 | Lee et al. | Apr 2004 | A1 |
| 20040088279 | Atzmueller et al. | May 2004 | A1 |
| 20040088297 | Coates et al. | May 2004 | A1 |
| 20040122917 | Menon et al. | Jun 2004 | A1 |
| 20040139125 | Strassburg et al. | Jul 2004 | A1 |
| 20040153841 | Beck | Aug 2004 | A1 |
| 20040178020 | Rodemer et al. | Sep 2004 | A1 |
| 20040187020 | Leerssen et al. | Sep 2004 | A1 |
| 20040210656 | Beck et al. | Oct 2004 | A1 |
| 20040215830 | Shenfield | Oct 2004 | A1 |
| 20040249904 | Moore et al. | Dec 2004 | A1 |
| 20040250113 | Beck | Dec 2004 | A1 |
| 20040261073 | Herle et al. | Dec 2004 | A1 |
| 20050033777 | Moraes et al. | Feb 2005 | A1 |
| 20050100113 | Corts et al. | May 2005 | A1 |
| 20050138242 | Pope et al. | Jun 2005 | A1 |
| 20050233737 | Lin | Oct 2005 | A1 |
| 20050267951 | Joshi et al. | Dec 2005 | A1 |
| 20050268223 | Hanson et al. | Dec 2005 | A1 |
| 20060004765 | Anderson et al. | Jan 2006 | A1 |
| 20060148495 | Wilson | Jul 2006 | A1 |
| 20060165074 | Modi et al. | Jul 2006 | A1 |
| 20080216160 | Rollet | Sep 2008 | A1 |
| 20080244738 | Shiozawa et al. | Oct 2008 | A1 |
| 20090220080 | Herne et al. | Sep 2009 | A1 |
| 20100142542 | Wie et al. | Jun 2010 | A1 |
| 20100211780 | Mukkara et al. | Aug 2010 | A1 |
| 20120059854 | Wehrman et al. | Mar 2012 | A1 |
| 20120072558 | Beck | Mar 2012 | A1 |
| 20120192270 | Beck | Jul 2012 | A1 |
| 20130198350 | Moore et al. | Aug 2013 | A1 |
| 20130346371 | Beck | Dec 2013 | A1 |
| 20130346739 | VanHeyningen et al. | Dec 2013 | A1 |
| 20140032958 | Beck | Jan 2014 | A1 |
| 20140108668 | Zhang et al. | Apr 2014 | A1 |
| 20140157387 | Lee et al. | Jun 2014 | A1 |
| 20140188955 | Beck | Jul 2014 | A1 |
| 20140280984 | Raymond et al. | Sep 2014 | A1 |
| 20140282906 | Ignatchenko et al. | Sep 2014 | A1 |
| 20140282907 | Ignatchenko et al. | Sep 2014 | A1 |
| 20150012778 | Moore et al. | Jan 2015 | A1 |
| 20150019492 | Beck | Jan 2015 | A1 |
| 20150150114 | Kuker et al. | May 2015 | A1 |
| 20160087933 | Johnson et al. | Mar 2016 | A1 |
| 20170041402 | Raymond et al. | Feb 2017 | A1 |
| Entry |
|---|
| Devarakona et al., Murthy; “Recovery in the Calypso File System”, ACM Transactions on Computer Systems, vol. 14, No. 3, Aug. 1996, pp. 287-310. |
| Eisenhauer, Event Services for High Performance Computing, 9th International Symposium on High Performance Distributed Computing, Aug. 1-4, 2000, 113-130 pgs. |
| Eisenhauer, Native Data Representation, an Efficient Wire Format for High-Performance Distributed Computing, IEEE Transactions on Parallel and Distributed Systems, V13, 112, Dec. 2002, 1234-1246 pgs. |
| Falkner, The Provision of Relocation Transparency Through a Formalized Naming System in a Distributed Mobile Object System, Oct. 3, 2000, 1-197 pgs. |
| Farquhar, William G.; Fault Detection and Recovery in a Data-Driven Real-Time Multiprocessor. 1994. IEEE. |
| Krueger, Small Computer Systems Interface Protocol Over the Internet (iSCSI) Requirements and Design Considerations, Jul. 2002, 26 pgs. |
| Lee et al., Jae Min; “Physical Layer Redundancy Method for Fault-Tolerant Networks”, Sep. 6-8, 2000, IEEE. |
| McCloghrie, Managed Objects for Controlling the Collection and Storage of Accounting Information for Connection-Oriented Networks, Feb. 1999, 29 pgs. |
| Mohindra, Ajay; Davarakonda, Murthy; Distributed Token Management in Calypso File System. 1994. IEEE. |
| Pazel, Neptune: A Dynamic Resource Allocation and Planning System for a Cluster Computing Utility, 2002, 8 pgs. |
| Pinheiro, S-DSM for Heterogeneous Machine Architectures, U. Rochester, Apr. 2000, 7 pgs. |
| Sjoberg, Real-time Transpmt Protocol (RIP) Payload Format and File Storage Format for the Adaptive Multi-Rate (AMR) and Adaptive Multi-Rate Wideband (AMR-WB) Audio Codecs, Jun. 2002, 49 pgs. |
| Tanenbaum, Structured Computer Organization, 3rd Ed., Prentice Hall, 1990, 43-44 pgs. |
| Theimer, Overlook: Sca!able Name Service on an Overlay Network, 2002, 33 pgs. |
| U.S. Appl. No. 10/414,239 Final Office Action dated Feb. 27, 2009. |
| U.S. Appl. No. 10/414,239 Office Action dated Aug. 21, 2008. |
| U.S. Appl. No. 10/414,239 Final Office Action dated Mar. 3, 2008. |
| U.S. Appl. No. 10/414,239 Office Action dated Aug. 8, 2007. |
| U.S. Appl. No. 10/414,239 Final Office Action dated Jan. 25, 2007. |
| U.S. Appl. No. 10/414,239 Office Action dated May 31, 2006. |
| U.S. Appl. No. 13/438,304 Office Action dated Jan. 24, 2013. |
| U.S. Appl. No. 12/615,930 Final Office Action dated Jul. 28, 2011. |
| U.S. Appl. No. 12/615,930 Office Action dated dated Jan. 19, 2011. |
| U.S. Appl. No. 12/615,930 Office Action dated Nov. 29, 2011. |
| U.S. Appl. No. 13/794,483 Final Office Action dated Mar. 28, 2014. |
| U.S. Appl. No. 13/794,483 Office Action dated Nov. 26, 2013. |
| Moore, Notice of Allowance, U.S. Appl. No. 10/414,236, dated Jul. 2, 2009, 7 pgs. |
| Moore, Notice of Allowance, U.S. Appl. No. 12/615,930, dated Aug. 10, 2012, 17 pgs. |
| Moore, Office Action, U.S. Appl. No. 10/414,236, dated Apr. 10, 2007, 7 pgs. |
| Moore, Office Action, U.S. Appl. No. 10/414,236, dated Dec. 2, 2008, 10 pgs. |
| Moore, Office Action, U.S. Appl. No. 10/414,236, dated Oct. 2, 2007, 8 pgs. |
| Moore, Office Action, U.S. Appl. No. 12/615,930, dated Jan. 19, 2011, 11 pgs. |
| Moore, Office Action, U.S. Appl. No. 12/615,930, dated Jul. 28, 2011, 13 pgs. |
| Moore, Office Action, U.S. Appl. No. 12/615,930, dated Nov. 29, 2011, 7 pgs. |
| Steven Levine, “XVM Volume Manager Administrator's Guide”, SGI, Inc., Chapter 4: XVM Administration Commands, 2003, pp. 63-106. |
| U.S. Appl. No. 10/162,258 Office Action dated Nov. 16, 2004. |
| U.S. Appl. No. 10/345,357 Final Office Action dated Oct. 26, 2006. |
| U.S. Appl. No. 10/682,841 Final Office Action dated Dec. 14, 2006. |
| U.S. Appl. No. 10/682,841 Office Action dated Apr. 11, 2006. |
| U.S. Appl. No. 12/648,239 Office Action dated Jul. 14, 2011. |
| U.S. Appl. No. 14/012,894 Office Action dated Jun. 16, 2014. |
| Wehrman, Notice of Allowance, U.S. Appl. No. 10/620,387, dated Apr. 28, 2011, 7 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 10/620,387, dated Aug. 4, 2006, 9 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 10/620,387, dated Jan. 2, 2008, 6 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 10/620,387, dated Jan. 23, 2009, 10 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 10/620,387, dated Jan. 24, 2006, 7 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 10/620,387, dated Jun. 13, 2007, 9 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 10/620,387, dated Jun. 19, 2008, 9 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 10/620,387, dated May 13, 2010, 18 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 10/620,387, dated Sep. 30, 2009, 18 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 10/620,387, dated Sep. 30, 2010, 17 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 13/220,257, dated Apr. 5, 2012, 14 pgs. |
| Wehrman, Office Action, U.S. Appl. No. 13/220,257, dated Feb. 22, 2013, 14 pgs. |
| A. M. Gheith et al.: “Shared Virtual Disk for a Cluster of Processors with Separate I/O Devices and Shared Memory”, Jun. 1993, IBM Technical Disclosure Bulletin, vol. 36, No. 06B pp. 375-377. |
| Beck, Decision on Appeal, U.S. Appl. No. 10/345,357, Jan. 30, 2009, 9 pgs. |
| Beck, Examiner's Answer, U.S. Appl. No. 10/345,357, dated Oct. 9, 2007, 19 pgs. |
| Beck, Notice of Allowability, U.S. Appl. No. 10/345,357, dated Feb. 3, 2009, 6 pgs. |
| Beck, Notice of Allowability, U.S. Appl. No. 12/903,096, dated Feb. 10, 2012, 16 pgs. |
| Beck, Notice of Allowance, U.S. Appl. No. 10/414,239, dated Aug. 12, 2009, 6 pgs. |
| Beck, Notice of Allowance, U.S. Appl. No. 11/785,255, dated Mar. 30, 2011, 8 pgs. |
| Beck, Notice of Allowance, U.S. Appl. No. 11/785,256, dated Jun. 4, 2010, 6 pgs. |
| Beck, Notice of Allowance, U.S. Appl. No. 12/648,501, dated Nov. 28, 2011, 10 pgs. |
| Beck, Notice of Allowance, U.S. Appl. No. 12/903,096, dated Dec. 7, 2011, 17 pgs. |
| Beck, Office Action, U.S. Appl. No. 10/345,357, dated Apr. 7, 2006, 9 pgs. |
| Beck, Office Action, U.S. Appl. No. 10/345,357, dated Jul. 27, 2005, 8 pgs. |
| Beck, Office Action, U.S. Appl. No. 10/345,357, dated Oct. 20, 2006, 14 pgs. |
| Beck, Office Action, U.S. Appl. No. 10/414,239, dated Aug. 21, 2008, 6 pgs. |
| Beck, Office Action, U.S. Appl. No. 10/414,239, dated Aug. 8, 2007, 8 pgs. |
| Beck, Office Action, U.S. Appl. No. 10/414,239, dated Feb. 27, 2009, 9 pgs. |
| Beck, Office Action, U.S. Appl. No. 10/414,239, dated Jan. 25, 2007, 9 pgs. |
| Beck, Office Action, U.S. Appl. No. 10/414,239, dated Mar. 3, 2008, 10 pgs. |
| Beck, Office Action, U.S. Appl. No. 10/414,239, dated May 31, 2006, 7 pgs. |
| Beck, Office Action, U.S. Appl. No. 11/785,255, dated Apr. 16, 2009, 8 pgs. |
| Beck, Office Action, U.S. Appl. No. 11/785,255, dated Mar. 30, 2010, 14 pgs. |
| Beck, Office Action, U.S. Appl. No. 11/785,255, dated Nov. 24, 2009, 10 pgs. |
| Beck, Office Action, U.S. Appl. No. 11/785,255, dated Sep. 17, 2010, 15 pgs. |
| Beck, Office Action, U.S. Appl. No. 11/785,256, dated Mar. 24, 2010, 7 pgs. |
| Beck, Office Action, U.S. Appl. No. 11/785,256, dated Sep. 16, 2009, 5 pgs. |
| Beck, Office Action, U.S. Appl. No. 12/648,501, dated Jul. 14, 2011, 7 pgs. |
| Beck, Office Action, U.S. Appl. No. 12/903,096, dated Jun. 24, 2011, 16 pgs. |
| Beck, Office Action, U.S. Appl. No. 13/438,304, dated Jan. 24, 2013, 10 pgs. |
| Beck, Office Action, U.S. Appl. No. 13/442,037, dated Nov. 20, 2012, 16 pgs. |
| Brandt et al. Efficient Metadata Management in Large Distributed Storage System, Apr. 2003, pp. 290-298. |
| Cruciani, Notice of Allowance, U.S. Appl. No. 10/414,245, dated Mar. 23, 2010, 11 pgs. |
| Cruciani, Office Action, U.S. Appl. No. 10/414,245, dated Aug. 13, 2007, 10 pgs. |
| Cruciani, Office Action, U.S. Appl. No. 10/414,245, dated Dec. 18, 2008, 7 pgs. |
| Cruciani, Office Action, U.S. Appl. No. 10/414,245, dated Dec. 21, 2006, 7 pgs. |
| Cruciani, Office Action, U.S. Appl. No. 10/414,245, dated Mar. 18, 2008, 10 pgs. |
| Cruciani, Office Action, U.S. Appl. No. 10/414,245, dated Sep. 2, 2009, 8 pgs. |
| U.S. Appl. No. 13/211,200 Final Office Action dated Oct. 4, 2013. |
| U.S. Appl. No. 13/211,200 Office Action dated Apr. 12, 2013. |
| U.S. Appl. No. 14/199,619 Final Office Action dated May 26, 2015. |
| U.S. Appl. No. 14/199,619 Final Office Action dated May 31, 2016. |
| U.S. Appl. No. 14/199,619 Office Action dated Jan. 15, 2016. |
| U.S. Appl. No. 14/199,619 Office Action dated Jan. 26, 2015. |
| U.S. Appl. No. 11/785,255 Final Office Action dated Nov. 24, 2009. |
| U.S. Appl. No. 11/785,255 Final Office Action dated Sep. 17, 2010. |
| U.S. Appl. No. 11/785,255 Office Action dated Mar. 30, 2010. |
| U.S. Appl. No. 11/785,255 Office Action dated Apr. 16, 2009. |
| U.S. Appl. No. 10/414,236 Final Office Action dated Dec. 2, 2008. |
| U.S. Appl. No. 10/414,236 Notice of Allowance dated Jul. 2, 2009. |
| U.S. Appl. No. 10/414,236 Office Action dated Oct. 2, 2007. |
| U.S. Appl. No. 10/414,236 Office Action dated Apr. 10, 2007. |
| Number | Date | Country | |
|---|---|---|---|
| 20170026378 A1 | Jan 2017 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60296046 | Jun 2001 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14042438 | Sep 2013 | US |
| Child | 15219797 | US | |
| Parent | 13438304 | Apr 2012 | US |
| Child | 14042438 | US | |
| Parent | 12648501 | Dec 2009 | US |
| Child | 13438304 | US | |
| Parent | 10414239 | Apr 2003 | US |
| Child | 12648501 | US | |
| Parent | 10197211 | Jul 2002 | US |
| Child | 10414239 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10162258 | Jun 2002 | US |
| Child | 10197211 | US |
