US 6,931,450 B2Grant
Direct access from client to storage device
Issue Date:2005-08-16
•26 Claims
•9 Drawing Sheets
Abstract
An apparatus includes a computing node and a metadata server. The computing node may transmit a request to open a file to the metadata server, which may provide a corresponding file identifier to the computing node. The computing node may use the file identifier to directly access the storage storing the file. In one embodiment, the storage may be an object-based storage. The storage may receive the file identifier with an access command and may perform the mapping from file identifier to storage blocks internally. Thus, accesses to the storage may be performed on an arbitrary boundary within the file. In other words, the entire block including the data needed by the computing node may not be transferred to the computing node. Instead, the storage may select the data requested from the file (e.g. via an offset and a number of bytes or some similar mechanism) and return that data to the computing node.
Metadata
Assignee
- Sun Microsystems, Inc.
Inventors
- John H. Howard
- David Robinson
- Randall D. Rettberg
Application Information
Application Number:US 09/740,542
Filing Date:2000-12-18
Priority Date:2000-12-18
Art Unit:2144
Patent Drawings (9 sheets)
Description
Background of the Invention
[0001] 1. Field of the Invention
[0002] This invention is related to a network of computer systems and, more particularly, to storage in the network and access to the storage by client computer systems.
[0003] 2. Description of the Related Art
[0004] Frequently, computer systems are deployed in a networked environment. In the networked environment, one or more client computer systems running user applications may be connected to one or more file servers which provide networked access to files used by the applications. Such a networked environment is referred to as a distributed file system.
[0005] Unfortunately, current distributed file systems have a number of drawbacks. Current distributed file systems are based on complex and error-prone mechanisms for managed access to shared files across multiple client computer systems. These mechanisms typically rely heavily on local client caching of file data and metadata (information locating the file such as directories, allocation tables, etc. and/or information describing other attributes of the file, such as access permissions, etc.). When multiple clients cache such data, some form of locking or serialization is used to coordinate metadata updates and to prevent conflicting updates. The caches are complex and difficult to implement correctly. Furthermore, such caches complicate the recovery from system failures (either in the client or in the file servers). Thus, it is desirable to eliminate client caching of file data and metadata while still retaining high performance access to files in a distributed file system.
Summary of the Invention
[0006] An apparatus includes a computing node and a metadata server. The computing node may transmit a request to open a file to the metadata server, which may provide a corresponding file identifier to the computing node. The computing node may use the file identifier to directly access the storage storing the file. Since the accesses are performed directly between the computing node and the storage, without passing through a file server each time, the latency of the accesses may be reduced. Thus, it may not be necessary to cache file data in the computing node to provide high performance. Instead, the file data may be requested as needed from the storage.
[0007] In one embodiment, the storage may be an object-based storage. The storage may receive the file identifier with an access command and may perform the mapping from file identifier to storage blocks internally. Thus, accesses to the storage may be performed on an arbitrary boundary within the file. In other words, the entire block including the data needed by the computing node may not be transferred to the computing node. Instead, the storage may select the data requested from the file (e.g. via an offset and a number of bytes or some similar mechanism) and return that data to the computing node. Thus, transfers between the computing node and the storage may be relatively small. These small transfers may reduce the bandwidth needed to support the low latency access by computing nodes to the storage device and may further aid in the elimination of caching of large portions of the file data at the computing node. Since only the needed data is transferred, caching of the remaining block data may not be needed.
Brief Description of the Drawings
[0008] The following detailed description refers to the accompanying drawings in which:
[0009] FIG. 1 is a block diagram of one embodiment of a network of computer systems;
[0010] FIG. 2 is a block diagram of one embodiment of a client, a metadata server, and an object-based storage shown in FIG. 1 ;
[0011] FIG. 3 is a block diagram illustrating one embodiment of a client operation on a file for the network shown in FIG. 1 ;
[0012] FIG. 4 is a block diagram of one embodiment of a block map and a cache for one embodiment of an object-based storage;
[0013] FIG. 5 is a flowchart illustrating operation of one embodiment of an object-based storage in response to a client write;
[0014] FIG. 6 is a flowchart illustrating operation of one embodiment of an object-based storage in response to a commit command;
[0015] FIG. 7 is a flowchart illustrating operation of one embodiment of an object-based storage in response to a checkpoint;
[0016] FIG. 8 is a flowchart illustrating operation of one embodiment of an object-based storage in response to a system crash;
[0017] FIG. 9 is an example of an inode and an updated inode;
[0018] FIG. 10 is a second example of an inode and an updated inode; and
[0019] FIG. 11 is a third example of an inode and an updated inode.
[0020] While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that the drawings and detailed description thereto are not intended to limit the invention to the particular form disclosed, but on the contrary, the intention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the present invention as defined by the appended claims.
Detailed Description of the Preferred Embodiments
[0021] Turning now to FIG. 1 , a block diagram of a networked computing environment is shown. Other embodiments are possible and contemplated. In the embodiment of FIG. 1 , the networked computing environment includes a plurality of clients 10A-10C, a plurality of object-based storages 12A-12C, a metadata server 14, a gateway 16, and other networks 18A-18B. Clients 10A-10C, storages 12A-12C, metadata server 14, and gateway 16 are connected via an interconnect 20. In various embodiments, metadata server 14 may be replicated for reliability and/or performance or may be implemented as software components in other nodes.
[0022] Generally, clients 10A-10C execute user applications that operate upon files stored on storages 12A-12C. A client 10A-10C may open a file by transmitting an open command to metadata server 14, which maps the file name used by the application to: (i) a file identifier (file ID) identifying the file to the storage 12A-12C storing the file; and (ii) a device identifier (device ID) identifying which storage 12A-12C stores the file. The metadata server 14 provides this information to the requesting client 10A-10C in response to the open command. The requesting client 10A-10C the performs various read and write commands directly to the storage 12A-12C identified by the device ID. Finally, the requesting client 10A-10C may perform a close command to the storage 12A-12C when the requesting client 10A-10C is finished accessing the file.
[0023] Object-based storage 12A-12C stores variable-sized objects instead of blocks. Each object is zero or more bytes, and a given object may be of an arbitrary length. For example, a file may be an object. Alternatively, a file may comprise two or more objects. The storage medium within object-based storage 12A-12C may still employ blocks, and in such an embodiment the object-based storage 12A-12C may perform the function of mapping files to blocks. As used herein, a block is a fixed-sized unit of storage space which is the smallest unit of allocation of space within the storage. Blocks may be of various sizes. For example, 4 kilobytes may be a suitable block size. Since the storage performs the block mapping function, access to the storage may be on an object basis (e.g. a file or a portion of a file) instead of a block basis. For example, a client 10A-10C may write one or more bytes to a file by transmitting a write command to the storage 12A-12C storing the file. The write command may include the file ID and the data to be written. The storage 12A-12C may handle merging the written bytes with the other data within the block. Previously, merging of writes into data blocks was performed by the client 10A-10C (by reading the affected block from the storage, updating the affected block locally in the client, and writing the affected block back to the storage). Similarly, a client 10A-10C may read one or more bytes from a file by transmitting a read command to the storage 12A-12C storing the file. The read command may include the file ID and the number of bytes to be read. Accordingly, the amount of data transmitted between the client and the storage may be reduced. Furthermore, client locking of blocks during updating may be eliminated.
[0024] Interconnect 20 may be a high bandwidth, low latency interconnect. For example, in one embodiment, interconnect 20 may be compatible with the Infiniband specification available from the Infiniband Trade Association. The Infiniband interconnect is based on switched serial links to device groups and devices. In other words, these devices or device groups may be connected with serial links either directly or through a switch. Devices on an InfiniBand network may be connected through switches and routers to several hosts. Each switch may operate a specific subnetwork of directly attached devices, while routers may interconnect several switches. InfiniBand devices may thus be connected in a fabric. Infiniband may use either packet or connection-based methods to communicate messages. Messages may include read or write operations, channel send or receive messages, atomic operations, or multicast operations. However, any interconnect having low latency may be used, including a variety of intranet or internet interconnects. For example, Fibre Channel or Ethernet interconnects may be used. For example, typical latencies from 1 to 100 microseconds may be provided by Infiniband.
[0025] Since clients directly access storage using a low latency interconnect, caching of file data on clients may be unnecessary. The low latency of the interconnect 20 may allow rapid access to file data, and the object-based nature of the storages 12A-12C may allow for relatively small amounts of data to be transferred for each request (e.g. less than a block). Accordingly, the complexities of client data caching may be eliminated.
[0026] Additionally, two or more clients 10A-10C may concurrently access a file on a storage 12A-12C. One or more of the clients may write the file while the other clients read the file. If the clients employed caching, complex interactions among the clients would be necessary to allow the concurrent access. Without caching, the clients may directly access the storage 12A-12C, and the storage 12A-12C may be responsible for handling file consistency in view of writes from two or more clients and in view of reads and writes to the file from two or more clients. Thus, the complexities of handling caching in such situations in the clients may be eliminated. As used herein, clients “concurrently access a file” if the clients have the file open concurrently and perform access commands even though the file is open by another client.
[0027] Generally, each of clients 10A-10C and metadata server 14 may be a computing node. A computing node may comprise one or more computer systems operating in concert to perform a computing operation. A computer system may be a collection of: (i) one or more processors, interface circuitry, disk drives, network adapters, and other I/O devices; and (ii) an operating system and other applications which operate together to performing a designated computing function. Each computer system may be housed in a separate housing from other computer systems and may have a connection to interconnect 20.
[0028] Metadata server 14 stores file metadata. Among other things, the metadata stored by metadata server 14 may include the directory structures of the file systems within the networked computing environment shown in FIG. 1. The directory structures map a file name (which is a string of characters naming the file in a human-readable fashion) to a file ID (which is used to locate the file on the storage device, and may be a number having meaning only to the storage device storing the file). It is noted that there may be any number of metadata servers 14, as desired. Similarly, there may be any number of clients 10A-10C and storages 12A-12C, as desired.
[0029] Although storages 12A-12C have been described above as object-based storage, other embodiments may use any type of storage, as desired. Generally, storages 12A-12C may include any form of non-volatile computer readable medium. For example, storages 12A-12C may each include one or more fixed or removable disk drives, tape drives, CD-ROMs, writeable CD-ROMs, etc. Additionally, storages 12A-12C may include hardware and/or software for managing the mapping of file IDs to blocks within the storage, for object-based embodiments. In yet another alternative, storages 12A-12C may be block based storages with software providing the object-based interface. The software may operate on the metadata server (or a combination of the metadata server and the storages), on the client (or a combination of the client and the storages), or on any combination of the metadata server, the client, and the storages.
[0030] Gateway 16 may be a computer system bridging from interconnect 20 to other networks 18A-18B. The other networks 18A-18B may be any form of network (e.g. the Internet, intranets, etc.). Additionally, one or more of the other networks may be networks interconnected by interconnect 20.
[0031] It is noted that clients 10A-10C, metadata server 14, object-based storages 12A-12C, and gateway 16 may each have independent connections to interconnect 20. Each of clients 10A-10C, metadata server 14, object-based storages 12A-12C, and gateway 16 may transmit messages to any other device connected to interconnect 20. Interconnect 20 may route the messages to the addressed device on interconnect 20.
[0032] Turning now to FIG. 2 , a block diagram illustrating one embodiment of metadata server 14, client 10A, and object-based storage 12A in greater detail is shown. Other embodiments are possible and contemplated. In the illustrated embodiment, metadata server 14 includes a set of directories 30, a cache 32, and a storage manager 34. Client 10A includes one or more applications 36A-36B, a library 38, and a storage proxy 40. Object-based storage 12A includes a block manager 42, a block map 44, a cache 46, and a disk storage 48.
[0033] Generally, client 10A may execute applications 36A and 36B to perform various user-desired operations. The applications 36A-36B may use a variety of library routines which may be shared by the applications executable on client 10A. Among the library routines may be routines to open a file, read a file, write a file, and close a file. Applications may use these routines to access files. Applications 36A-36B and library 38 may operate at user privilege level, while storage proxy 40 may operate at a supervisor privilege level generally reserved for the operating system kernel. Storage proxy 40 may be part of the operating system kernel of client 10A. In other embodiments, both library 38 and storage proxy 40 may operate at the user privilege level, or at the supervisor privilege level, as desired.
[0034] In response to an application executing the open file routine, library 38 passes an open file command to the operating system kernel (e.g. to the storage proxy 40). The storage proxy 40 generates an open file command on the interconnect 20, addressed to metadata server 14. It is noted that storage proxy 40 may operate as a null driver in this case, simply passing the open file command as a message on interconnect 20 to metadata server 14.
[0035] Metadata server 14 (and more particularly storage manager 34) receives the open file command and consults the directories 30 to translate the file name to a file ID for one of storages 12A-12C. Storage manager 34 returns the file ID (and the device ID of the device storing the file, e.g. storage 12A) to storage proxy 40, which associates the file ID with the file name (or a file handle generated by library 38).
[0036] Subsequent read and write commands to the file are received from library 38 by storage proxy 40. The read and write commands include the file name or file handle. Storage proxy 40 generates corresponding read and write commands including the file ID corresponding to the file name or file handle, and transmit the read and write commands directly to storage 12A. As used herein, a command is directly transmitted from a client to a storage if the command is routed from the client to the storage without any intervening interpretation of the command other than to route the command to the destination storage. In other words, various circuitry included within interconnect 20 may interpret the address information used to route the command, but does not otherwise change the command. Similarly, a client may directly access a storage if commands are directly transmitted to the storage.
[0037] Storage 12A receives the read and write commands from client 10A. Block manager 42 may access a block map 44 to map the file ID to a set of one or more blocks within disk storage 48. The block affected by the command may thereby be identified, and the command may be performed. In the case of the write command, the block may be updated. In one embodiment described in more detail below, storage 12A may employ a copy on write protocol in which, rather than updating a block directly in response to a write command, a new block may be allocated and may be included in the block map for the file. When the file is closed or synchronized, the old block may be released for allocation to another file. Additional details for such an embodiment are provided further below. In the case of a read, the requested data may be read and provided back to the client 10A.
[0038] Generally speaking, the block map converts each file ID to a list of zero or more blocks corresponding to the file. In one embodiment, the file ID is an inode number identifying an inode corresponding to the file. The inode includes pointers (directly or indirectly) to each block storing the file data. The inode may also include various file attributes, as desired.
[0039] It is noted that caches 32 and 46 may be used by storage manager 34 and block manager 42 (respectively) to accelerate operations. Caches 32 and 46 may be higher speed memories than the memory storing directories 30 and block map 44. For example, directories 30 and block map 44 may be stored on local disk storage of metadata server 14 and storage 12A, respectively. Caches 32 and 46 may be static random access memory (SRAM) or dynamic random access memory (DRAM), for example. Generally, caches 32 and 46 may be volatile memory while directories 30 and block map 44 maybe stored in non-volatile memory.
[0040] Storage manager 34 may use cache 32 to cache recently accessed directory entries. If the directory entries are accessed again, they may be read from the cache 32 instead of directories 30.
[0041] Block manager 42 may use cache 46 as a working memory for blocks and block map information (e.g. inodes and allocation maps). If a block is read from disk storage 48 (or is allocated for a write), the block may be stored in cache 46. If the block is read again, the block may be accessed in cache 46 and data provided to client 10A. If the block is allocated for a write, the block may be stored in cache 46 and written to disk storage 48 at a later time.
[0042] Storage manager 34 and storage proxy 40 may each preferably be one or more software routines included within the kernel of the operating system of metadata server 14 and client 10A, respectively. Block manager 42 may be implemented as one or more software routines executable by a processor embedded in storage 12A. However, any combination of hardware and/or software may be used to implement any of storage manager 34, storage proxy 40, and block manager 42.
[0043] It is noted that, in some embodiments, a file may be represented by multiple objects on multiple object-based storage devices. In such a case, multiple file IDs may be used to locate the objects comprising the file. Furthermore, in some embodiments, object-based storage devices may be a combination of storage nodes (e.g. a Redundant Array of Inexpensive Disks (RAID) storage system, data striping storage systems, replicated storage systems, or concatenated storage systems). In such embodiments, the metadata server may provide the client with several device IDs in response to the open command, along with an indication of which device should be used for each read or write.
[0044] Turning next to FIG. 3 , a diagram illustrating the commands forming a file access are shown according to one embodiment of the networked system shown in FIGS. 1 and 2 . Other embodiments are possible and contemplated. Client 10A, object-based storage 12A, and metadata server 14 are illustrated in FIG. 3. Similar commands may be used between other clients and/or storages. It is noted that the commands are routed between client 10A, metadata server 14, and storage 12A via interconnect 20 shown in FIG. 1. Terms enclosed in less than (“<”) and greater than (“>”) signs are placeholders for values which are inserted in the specific instance of the command. For example, <filename> is a placeholder for the string of characters comprising the name of the file to be opened.
[0045] Client 10A initiates a file access by sending an open file command to metadata server 14 (reference numeral 50). The open file command may include an encoding identifying the command as an open file command, and further includes the file name of the file to be opened. Additionally, the open file command may include a user identification (e.g. user name or a number) identifying the user which is requesting that the file be opened. It is noted that, as used herein, opening a file refers to converting the file name to a value which can be used to access the file. During the opening of the file, permission information may be checked to ensure that the file is accessible and/or writeable by the user, etc., as desired.
[0046] Metadata server 14 responds to the open file command with a positive response (reference numeral 52). Metadata server 14 may also respond with a negative response if an error condition is detected (e.g. the file does not exist in directories 30, or the user does not have permission to open the file, etc.). The positive response includes a file ID identifying the file on the storage storing the file. As used herein, the file identifier (file ID) may be any value identifying the file to the storage storing the file. The file ID may be a number, for example, rather than the string of characters comprising the file name. In one embodiment, the file ID may be an “I-number” identifying an inode which locates the file with the storage. More particularly, the I-number may be an index into an inode file within the block map 44. The corresponding inode may be stored at that index.
[0047] The positive response may further include a device ID. The device ID may be an address for the storage storing the file (e.g. storage 12A, in this example), which may be used by interconnect 20 for routing purposes. Alternatively, interconnect 20 may be a shared communication medium in which commands are visible to all devices and the device ID may be used by the storage 12A to detect commands directed at the device.
[0048] Additionally, the positive response may include an access key. The access key may be provided for security purposes, and may be encrypted. The key may include permission information, and may further serve to identify client 10A as the one who opened the file. Metadata server 14 may transmit a message (reference numeral 54) to storage 12A indicating that the file was opened. The message may include the file ID, and may further include the user name and the same access key sent to client 10A. The positive response may further include a checksum for the file (not shown), if desired.
[0049] Client 10A may perform one or more read or write commands (access commands) to the file. An exemplary access command is illustrated at reference numeral 56. The access command includes an encoding of the read or write nature of the command, and the file ID. Additionally, the access command may include an offset (not shown) into the file to locate the data desired by the operation. Other embodiments may locate the data via other mechanisms. The access command may include a size identifying the number of bytes to be read or written. If the access command is a write, the data to be written is also included. As noted above, the size of the access command may be a number of bytes less than or greater than the number of bytes in a block. Furthermore, the command may not be aligned to block boundaries. Instead, the size of the command may be the actual number of bytes actually desired by client 10A. The access command may also include the access key, if desired.
[0050] Object-based storage 12A responds to the access command with a positive response (reference numeral 58). If the access command is a read, the positive response includes the read data. The positive response may further include a checksum for the data, if desired. Storage 12A may response with a negative response if an error is detected.
[0051] It is noted that the access commands are transmitted from client 12A to object-based storage 12A independent of any operation of metadata server 14. In other words, once the file ID is provided by metadata server 14, the remainder of the operation does not involve metadata server 14 (until the file is closed).
[0052] Once client 10A has completed the access commands to the file, client 10A may transmit a close file command (reference numeral 60). The close file command may include the file ID, and may further include the access key. Storage 12A may respond with a positive response (reference numeral 62), which again may include a checksum, if desired. If an error is detected during the file close, storage 12A may respond with a negative response instead.
[0053] Additionally, in response to the file close command, storage 12A may transmit a message (reference numeral 64) to metadata server 14. The message may indicate the file ID of the file that has been closed, and may further include a new checksum for the file, if the file has been modified.
[0054] Alternatively, client 10A may transmit the close file command to metadata server 14, which may transmit a message to storage 12A indicating such closure.
[0055] In one embodiment, storage 12A may treat the commands of a file access as a transaction. More particularly, the modifications to the file in response to one or more write commands may all be performed successfully, or none of them may be performed and the file may remain in the same state that it was prior to the transaction. The transaction is committed via a commit command. In the illustration, the file close command may be the commit command for storage 12A. Additionally, a synchronization command (e.g. the Unix fsync command) may be supported which may commit all prior changes without closing the file. By treating the updates as a transaction, file integrity may be enhanced in the presence of a system failure. Since the updates are atomically performed via the commit command (rather than possibly partially performed over time as the various write commands are performed), the commit will have been processed either before the system failure (and thus the file updates are recorded in storage 12A after the failure) or after the system failure (and thus the file updates are not recorded in storage 12A).
[0056] FIGS. 4-8 illustrate one embodiment of the transactional interface and other details of one embodiment of storage 12A which may enhance the reliability of storage 12A.
[0057] Turning next to FIG. 4 , a block diagram of one embodiment of block map 44 and cache 46 is shown. Other embodiments are possible and contemplated. In the embodiment of FIG. 4 , block map 44 includes a journal 70, an inode file 72, an inode allocation bitmap 74, and a block allocation bitmap 76. Journal 70 includes a checkpoint record 78 with pointers to the inode file 72, the inode allocation bitmap 74, and the block allocation bitmap 76. Journal 70 further includes one or more records 80A-80C. Record 80C is shown in exploded view as an example of a record. Record 80C includes a sequence number 82, an I-number 84, and an inode 86. Cache 46 includes a pending block allocation bitmap 88, a committed block allocation bitmap 90, a pending inode allocation bitmap 92, a committed inode allocation bitmap 94, a working master inode 96, unwritten data blocks 98, unwritten pointer blocks 100, and working copies of inodes 102.
[0058] Generally, storage 12A attempts to improve reliability by atomically performing any write which commits a file update. A write to a block is an approximation of atomicity, since a write smaller than a block does not occur on disk storage 48. A write to multiple blocks is not atomic, since the write to one block completes before the write to the next block begins. Generally, an action is “atomic” or performed “atomically” if the action delivers the specified result or, if the action does not complete (e.g. due to error), leaves all parts of the system unaffected by the attempt to perform the action. For example, a write to a file (a “file update”) may be atomic if either all bytes in the file and any updates to the file metadata are updated or none of the bytes nor the file metadata are updated (e.g. if a system crash occurs).
[0059] When an update to a block within a file is detected, the block is copied to a new block and the update is performed to the new block. Pointers within the file's inode structure may then be updated to indicate the new block. The updated inode is held in working memory (e.g. cache 46) until the file is committed. Writing the inode to a nonvolatile memory may commit all of the updates to the various blocks atomically (since the inode is less than a block in size, and thus a write of an inode is atomic).
[0060] Inode file 72, inode allocation bitmap 74, and block allocation bitmap 76 may be larger than a block, and thus may not be atomically written. Similar to the update to other files, the blocks within inode file 72 which are to be updated with committed inodes may be copied and the updated inodes may be written to the copied blocks. A working copy of the inode pointing to the inode file (the master inode) may be updated to indicate the copied blocks. The master inode may be written to non-volatile storage to atomically update the inode file 72. Working copies of the inode allocation bitmap 74 and the block allocation bitmap 76 may be maintained by storage 12A. The working copies may be written to disk and inodes for the files subsequently written to perform an atomic update of these files. It is noted that, while files 72-76 are illustrated in FIG. 4 as part of block map 44, which may be a nonvolatile storage separate from disk storage 48, files 72-76 may preferably be stored in disk storage 48. Journal 70 may preferably be stored outside of disk storage 48 (e.g. another local disk, or some other nonvolatile memory) to reduce competition for writes to disk storage 48 for the underlying file data.
[0061] Journal 70 is used to record updated copies of committed inodes (inodes corresponding to committed files). Generally, checkpoint record 78 records inodes for inode file 72, inode allocation bitmap 74, and block allocation bitmap 76. More particularly, inode 78A corresponds to inode file 72 and is also referred to as the master inode, inode 78B corresponds to inode allocation bitmap 74, and inode 78C corresponds to block allocation bitmap 76. Inode file 72, inode allocation bitmap 74, and block allocation bitmap 76 are a stable copy of these files corresponding to the committed updates at the time the checkpoint was made.
[0062] Subsequent to creating the checkpoint, inodes corresponding to committed files are written into the journal (e.g. records 80A-80C) in response to the commit commands corresponding to those files. The updates to the underlying file data are completed prior to writing the corresponding inode to journal 70, and thus the atomic write of the inode to journal 70 may indicate the successful completion of the file transaction represented by the inode. In one embodiment, storage 12A copies the blocks of the underlying files which are updated to new blocks and performs the update in the new blocks. Pointers within the inode structure of a working copy of the inode are updated to point to the new blocks. When the working copy of the inode is committed to the journal, all of the updates to the file are atomically performed.
[0063] Thus, writes to files and to the files storing file metadata (inodes, allocation bitmaps, etc.) are all performed atomically. Reliability of storage 12A may be high, since the window for failure during an atomic update is narrow as compared to non-atomic updates. Failure recovery using the journal is described in more detail below.
[0064] An inode record in journal 70 for the illustrated embodiment includes a sequence number field 82, an I-number field 84, and an inode field 86. Inode field 86 stores the updated inode. The I-number of the inode is stored in I-number field 84, thus identifying the entry within inode file 72 in which the inode belongs.
[0065] The sequence number field stores a sequence number which identifies the end of journal 70. Journal 70 may be circular in nature, with records being written in consecutive locations of the journal until the physical end of the journal is reached. When the physical end is reached, the next write is performed at the physical beginning of the journal. Each record is written with a larger sequence number than the previous record. Thus, when scanning the journal, the end is reached if the sequence number of the next-encountered record is less than the sequence number of the previously-encountered record.
[0066] It is noted that, while the checkpoint record 78 is shown in FIG. 4 at the physical beginning of journal 70, the checkpoint record 78 may appear at any location within journal 78. The checkpoint record 78 is inserted into the journal consecutive to the most recently committed inode at the time the checkpoint is made. Anything prior to the checkpoint record within journal 70 is reflected in the files pointed to by the checkpoint record 78. It is noted that, in one embodiment, the pointers to files 72-76 may each be an inode, with the pointers within the inode structure indicating blocks storing data from the corresponding file. It is further noted that, in addition to the inode records, other information may be entered into the journal to further accelerate recovery from a system failure. For example, records of the allocation and release of blocks corresponding to a committed file may be written, to allow for quicker reconstruction of the allocation bitmaps.
[0067] Cache 46 may be used to store working copies of files and inodes which are in the process of being updated (i.e. uncommitted transactions are outstanding to the files). For example, committed block allocation bitmap 90 may store a bitmap identifying those blocks of disk storage 48 that are storing data corresponding to committed files. Pending block allocation bitmap 88 may store a bitmap identifying those blocks which are storing data corresponding to pending file updates (those updates that have yet to be committed). Similarly, committed inode allocation bitmap 94 may store a bitmap identifying those inodes which correspond to committed files, and pending inode allocation bitmap 92 may store a bitmap identifying those inodes which correspond to pending files. Inodes are allocated to files on creation. Thus, an inode may be recorded in pending inode allocation bitmap 92 if the corresponding file transaction is a transaction which created the file.
[0068] Working master inode 96 may be a working copy of master inode 78A pointing to the inode file. As inodes are committed, they may be written both to journal 70 and to copied blocks corresponding to inode file 72. Working master inode 96 may include pointers to the copied blocks, and may thus represent a copy of the inode file 72 reflecting the currently committed inodes. Storing working master inode 96 to a checkpoint record in journal 70 atomically updates the inode file 72. As an alternative to maintaining working master inode 96, checkpoint creation may include copying the inode file from the previous checkpoint and updating the inodes from the previous checkpoint to the end of the journal. In yet another alternative, the inode file could include two copies of each inode, with alternate copies being updated each time the inode is written.
[0069] Storage 12A may be configured to defer writing data blocks to disk to allow for multiple blocks of data corresponding to contiguous data within a file to be written to contiguous blocks on disk. For such an embodiment, cache 46 may store the unwritten data 98. Similarly, writing pointer blocks for dual indirect inodes (shown in FIG. 11 below) may be deferred. For such an embodiment, cache 46 may store unwritten pointer blocks 100.
[0070] Working copies of inodes 102 are inodes corresponding to files for which an update transaction is in progress. An inode is removed from working copies of inodes 102 and is written to journal 70 to successfully commit the transaction.
[0071] Turning now to FIG. 5 , a flowchart is shown illustrating operation of one embodiment of storage 12A (and more particularly block manager 42, for the embodiment shown in FIG. 2 ) in response to a write command from a client. Other embodiments are possible and contemplated. While the blocks shown in the flowchart of FIG. 5 are illustrated in a particular order for ease of understanding, any suitable order may be used. Furthermore, various blocks may be performed in parallel, as desired.
[0072] Storage 12A allocates new blocks for each block affected by the write. The allocated blocks are blocks which are free in both the pending block allocating bitmap 88 and the committed block allocation bitmap 90. Storage 12A copies the data from the original blocks affected by the write to the new blocks (block 110). Storage 112 updates the new blocks with the data corresponding to the write (block 112). In this manner, the original data (prior to the write) is retained in the original blocks. If the write is not committed at a later point, the original data is still available in the original blocks. It is noted that, if the write is creating a new file, an inode may be allocated as well.
[0073] Since new blocks have been allocated to the file, storage 12A updates the inode for the file to point to the new blocks. More particularly, the working copy of the inode is updated, and the working copy of the inode is committed when the writes are committed with a commit command. In the present embodiment, there may be at least three types of inodes: direct inodes in which the data is stored in the inode (for small files), indirect inodes in which the inode stores pointers to blocks storing the file data, and dual indirect inodes in which the inode stores pointers to a first set of one or more blocks, and the first set of blocks store pointers to the blocks storing the file data. If the inode is a direct inode, allocating the new block for the updates results in updating the working copy of the inode as well, since the data is stored in the inode. If the inode is indirect (decision block 114), then storage 12A updates the working copy of the inode by replacing the pointer to the original block with a pointer to the newly allocated block (block 116). The committed inode (in inode file 72 or in journal 70) retains a pointer to the previously allocated block, and thus the contents of the file prior to the update are retained.
[0074] On the other hand, if the inode for the file is dual indirect (decision block 118), storage 12A allocates an additional block for the pointer block including the pointer pointing to the block being updated (block 120). Again, the additional block is a block which is free in both the pending block allocation bitmap 88 and the committed allocation bitmap 90. Storage 12A copies the pointers from the original pointer block to the additional block, and inserts the pointer to the newly allocated block into the additional block (block 122). Storage 12A then updates the working copy of the inode to replace the pointer to the original pointer block with a pointer to the additional block (block 124).
[0075] Finally, no matter which type of inode the file has, storage 12A updates the pending block allocation bitmap to reflect the allocated block(s) (block 126). It is noted that the operation illustrated in FIG. 5 need not be performed immediately in response to a client write. Storage 12A may accumulate one or more writes corresponding to a transaction, and allocate blocks for the one or more writes as a whole. This may allow for optimization by allocating several blocks of the file physically adjacent on the disk storage, which may reduce seeks when the file is read and/or written. Any number of writes may be handled in this fashion, including deferring until the transaction including the writes is committed.
[0076] Turning now to FIG. 6 , a flowchart is shown illustrating operation of one embodiment of storage 12A (and more particularly block manager 42, for the embodiment shown in FIG. 2 ) in response to a commit command from a client. Other embodiments are possible and contemplated. While the blocks shown in the flowchart of FIG. 6 are illustrated in a particular order for ease of understanding, any suitable order may be used. Furthermore, various blocks may be performed in parallel, as desired.
[0077] In the illustrated embodiment, the commit command may comprise either a file close command or an fsync command from the client. Other embodiments may include more or fewer commit commands, and may include alternative commands to these commands.
[0078] Storage 12A completes any writes corresponding to the transaction which have not yet been written to disk storage (block 130). In some embodiments, writes may not be deferred and block 130 may be optional. Additionally, storage 12A updates the committed block allocation bitmap 90 and the committed inode allocation bitmap 94 to reflect the file changes (block 132). That is, blocks which are freed (because newly allocated blocks replace the blocks in the file) are marked as free in the committed block allocation bitmap and blocks which are allocated are marked as allocated. Similarly, inodes which are freed are marked as freed and inodes which are allocated are marked as allocated. It is noted that inodes may be allocated to each version of a file as that file is created, and deallocated as each version of the file is deleted. For example, versions are created when one or more updates to a file are made, and the updates are committed when the file commit command is received. The previous version's inode may be freed in response to the new version's commit, or when the new version is part of a new checkpoint.
[0079] Storage 12A writes the working copy of the inode corresponding to the file to the journal (block 134). The writing of the inode to the journal atomically commits the file changes performed by the transaction. Additionally, the inode may be written to the inode file. The write to the inode file may be accomplished in a manner similar to client writes to blocks. That is, the block of the inode file storing the inode corresponding to the transaction may be copied to a newly allocated block, and the newly allocated block may be updated with the inode. The working copy of the master inode may be updated to point to the newly allocated block. A subsequent atomic write of the working copy of the master inode to a checkpoint record of the journal 70 atomically commits the inode updates (as described below in FIG. 7).
[0080] Turning next to FIG. 7 , a flowchart is shown illustrating operation of one embodiment of storage 12A (and more particularly block manager 42, for the embodiment shown in FIG. 2 ) to create a checkpoint. Other embodiments are possible and contemplated. While the blocks shown in the flowchart of FIG. 7 are illustrated in a particular order for ease of understanding, any suitable order may be used. Furthermore, various blocks may be performed in parallel, as desired.
[0081] Generally, a checkpoint is performed before the preceding checkpoint is overwritten within journal 70. Various triggers may be used to cause a checkpoint, including, for example, an allocation of all blocks to either pending updates or prior data blocks (or an allocation of a predetermined percentage of the blocks), a periodic timer, etc. Any mechanism for causing checkpoints to occur may be used.
[0082] Storage 12A writes the committed allocation bitmaps (committed block allocation bitmap 90 and committed inode allocation bitmap 94) to disk storage (e.g. disk storage 48) (block 140). Storage 12A inserts a checkpoint record at the current point in the journal 70 (block 142). Storage 12A writes the working master inode 96 to the checkpoint record, thereby atomically updating the inode file 72 (block 144). Additionally, storage 12A writes inodes locating the bitmap files written in block 140 into the checkpoint record, thereby atomically updating those files.
[0083] Turning now to FIG. 8 , a flowchart is shown illustrating operation of one embodiment of storage 12A (and more particularly block manager 42, for the embodiment shown in FIG. 2 ) to recover from a failure. Other embodiments are possible and contemplated. While the blocks shown in the flowchart of FIG. 8 are illustrated in a particular order for ease of understanding, any suitable order may be used. Furthermore, various blocks may be performed in parallel, as desired.
[0084] After a failure, the contents of cache 46 are indeterminate. Thus, uncommitted updates (which are recorded only in cache 46 via the working inodes 102 and 96 and pending bitmaps 88 and 92) are lost. However, committed updates are recorded either in files 72-76 or journal 70, and thus storage 12A may be recovered to an uncorrupted state.
[0085] More particularly, storage 12A scans the journal 70 to locate the most recent checkpoint and any subsequent file commit records (records 80A-80N in FIG. 4 ) (block 150). Storage 12A copies the master inode from the checkpoint to cache 46 as working master inode 96 (block 152). Storage 12A copies the bitmap files 74 and 76 to cache 46 as the committed bitmaps 90 and 94 (block 154). Storage 12A updates the inode file (using the copying of inode file blocks and updating working master inode 96 as described above) to reflect the committed inodes reflected in the journal (block 156). Additionally, storage 12A updates the committed bitmaps to reflect the committed inodes. In this manner, the committed state of storage 12A may be rapidly recovered from the failure.
[0086] Turning now to FIG. 9 , a block diagram of a first example of an inode 160 within inode file 72 and a corresponding updated inode 162 within working inodes 102 is shown. FIG. 9 is an example of a direct inode. Thus, the data corresponding to the file is stored within inodes 160 and 162. Inode 160 stores the data prior to the update, and inode 162 stores the updated data (although not every byte within the data need be updated). An atomic write of inode 162 thus commits the updates to the file atomically.
[0087] FIG. 10 is a block diagram of a second example of an inode 164 within inode file 72 and a corresponding updated inode 166 within working inodes 102. FIG. 10 is an example of a indirect inode. Thus, each of inodes 164 and 166 include pointers to blocks storing the file data. For example, inode 164 includes pointers 168A, 168B, and 168N to blocks 170A, 170B, and 170N. In the example of FIG. 10 , block 170B has been updated with an uncommitted write to block 170B. Accordingly, inode 166 includes pointers 168A and 168N to unmodified blocks 170A and 170N (respectively). Additionally, inode 166 includes pointer 172 to updated block 174. An atomic update of inode 166 commits pointer 172 (and thus block 174) to the file. Block 170B becomes free via the atomic write of inode 166 as well.
[0088] FIG. 11 is a block diagram of a second example of an inode 176 within inode file 72 and a corresponding updated inode 177 within working inodes 102. FIG. 11 is an example of a dual indirect inode. Thus, inode 176 includes pointers 178A, 178B, and 178N to pointer blocks 180A, 180B, and 180N. Pointer block 180B includes pointers to blocks 182A, 182B, and 182N which store the file data. Pointer block 180B may include pointers to other blocks which store file data as well, and pointer blocks 180A and 180N include pointers to other blocks (not shown). In the example of FIG. 10 , block 182B has been updated with an uncommitted write to block 182B. Accordingly, inode 177 includes pointers 178A and 178N to unmodified pointer blocks 180A and 180N (respectively). Additionally, inode 177 includes pointer 184 to updated pointer block 186. Updated pointer block 186 includes pointers to unmodified blocks 182A and 182N and a pointer to modified block 188. An atomic update of inode 177 commits pointer 184 (and thus pointer block 186 and block 188) to the file. Pointer block 180B and block 182B become free via the atomic write of inode 177 as well.
[0089] Numerous variations and modifications will become apparent to those skilled in the art once the above disclosure is fully appreciated. It is intended that the following claims be interpreted to embrace all such variations and modifications.
Claims
1. An apparatus comprising:
a computing node configured to generate a request to open a file, wherein said computing node is configured not to cache data from said file;
a storage; and
a metadata server coupled to receive said request, wherein said metadata server is configured to provide at least a first file identifier corresponding to said file responsive to said request, said first file identifier identifying at least a portion of said file within said storage, and wherein said metadata server is further configured to provide a device identifier identifying said storage on an interconnect to which at least said computing node and said storage are coupled;
wherein said computing node is coupled to receive said first file identifier and said device identifier for directly accessing said storage on said interconnect, and wherein said computing node is configured to transmit an access command to said storage to close said file, and wherein said storage is configured to transmit an indication to said metadata server including said first file identifier to inform said metadata server of said file being closed.
2. The apparatus as recited in claim 1 wherein said metadata server is configured to assign an access key to said request.
3. The apparatus as recited in claim 2 wherein said computing node is coupled to receive said access key, and wherein said computing node is configured to transmit said access key with an access command to said storage.
4. The apparatus as recited in claim 3 wherein said storage is coupled to receive said access key from said metadata server, and wherein said storage is configured to validate said access key from said computing node.
5. The apparatus as recited in claim 1 wherein said request includes a file name of said file.
6. The apparatus as recited in claim 5 wherein said metadata server includes a directory, and wherein said directory maps said file name to said first file identifier.
7. The apparatus as recited in claim 1 wherein said computing node is configured to transmit an access command to said storage to access one or more bytes, and wherein a number of said one or more bytes affected by said access command is not equal to a block size of said storage.
8. The apparatus as recited in claim 1 further comprising said interconnect, wherein said computing node, said metadata server, and said storage are each coupled directly to said interconnect.
9. The apparatus as recited in claim 8 wherein said computing node is configured to transmit said request to said metadata server through said interconnect, and wherein said computing node is configured to receive said first file identifier and said device identifier from said metadata server through said interconnect.
10. A method comprising:
generating a request to open a file from a computing node;
providing at least a first file identifier corresponding to said file from a metadata server responsive to said request, said first file identifier corresponding to said file and identifying said file within a storage storing at least a portion of said file;
providing a device identifier identifying said storage on an interconnect to which at least said computing node and said storage are coupled, the providing responsive to said request;
directly accessing said storage from said computing node on said interconnect responsive to said first file identifier and said device identifier, wherein said computing node is configured not to cache data from said file;
said computing node transmitting an access command to said storage to close said file; and
said storage transmitting an indication to said metadata server including said first file identifier to inform said metadata server of said file being closed.
11. The method as recited in claim 10 further comprising assigning an access key to said computing node responsive to said generating said request.
12. The method as recited in claim 11 further comprising transmitting said access key from said computing node to said storage with an access command for said storage.
13. The method as recited in claim 12 further comprising: receiving said access key from said metadata server into said storage; receiving said access key from said computing node into said storage; and validating said access key from said computing node using said access key from said metadata server.
14. The method as recited in claim 10 wherein said directly accessing comprises generating an access command for one or more bytes and transmitting said access command to said storage, wherein a number of said one or more bytes does not equal a block size of said storage.
15. The apparatus as recited in claim 1 wherein said interconnect comprises one or more devices configured to route communications on said interconnect, and wherein said one or more devices are configured to use said device identifier to route communications from said computing node to said storage.
16. The apparatus as recited in claim 1 wherein said storage is configured to detect direct accesses by said computing node to said storage on said interconnect using said device identifier.
17. The method as recited in claim 10 wherein said interconnect comprises one or more devices configured to route communications on said interconnect, and wherein the method further comprises said one or more devices using said device identifier to route communications from said computing node to said storage.
18. The method as recited in claim 10 further comprising said storage detecting direct accesses by said computing node to said storage on said interconnect using said device identifier.
19. The apparatus as recited in claim 1 wherein said storage is an object-based storage.
20. An apparatus comprising:
a computing node configured to generate a request to open a file, wherein said computing node is configured not to cache data from said file;
a storage; and
a metadata server coupled to receive said request, wherein said metadata server is configured to provide, responsive to said request: (i) at least a first file identifier corresponding to said file, wherein said first file identifier identifies at least a portion of said file within said storage; (ii) a device identifier identifying said storage on an interconnect to which at least said computing node and said storage are coupled; and (iii) an access key assigned by said metadata server to said computing node for said file;
wherein said metadata server is further configured to provide said access key to both said storage and said computing node; and
wherein said computing node is coupled to receive said first file identifier, said access key, and said device identifier for directly accessing said storage on said interconnect, and wherein said computing node is configured to transmit an access command to said storage to access said file, and wherein said access command includes said first file identifier, said device identifier, and said access key, and wherein said storage is configured to verify access by said computing node to said file using said access key.
21. The apparatus as recited in claim 20 wherein said access key is encrypted.
22. The apparatus as recited in claim 20 wherein said access key includes one or more permissions for said computing node for accessing said file.
23. The apparatus as recited in claim 20 wherein said access command accesses one or more bytes on said storage, and wherein a number of said one or more bytes affected by said access command is not equal to a block size of said storage.
24. The apparatus as recited in claim 20 further comprising said interconnect, wherein said computing node, said metadata server, and said storage are each coupled directly to said interconnect.
25. The apparatus as recited in claim 24 wherein said computing node is configured to transmit said request to said metadata server through said interconnect, and wherein said computing node is configured to receive said first file identifier, said device identifier, and said access key from said metadata server through said interconnect.
26. The apparatus as recited in claim 20 wherein said storage is an object-based storage.
Patent Citations (28)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5566331(A) | 1996-10-01 | Irwin et al. | Examiner |
| US5761677(A) | 1998-06-01 | Senator et al. | Applicant |
| US5828876(A) | 1998-10-01 | Fish et al. | Applicant |
| US5893140(A) | 1999-04-01 | Vahalia et al. | Examiner |
| US5915253(A) | 1999-06-01 | Christiansen | Applicant |
| US5940594(A) | 1999-08-01 | Ali et al. | Examiner |
| US6012060(A) | 2000-01-01 | Loaiza et al. | Examiner |
| US6014660(A) | 2000-01-01 | Lim et al. | Applicant |
| US6128623(A) | 2000-10-01 | Mattis et al. | Applicant |
| US6219693(B1) | 2001-04-01 | Napolitano et al. | Applicant |
| US6269431(B1) | 2001-07-01 | Dunham | Applicant |
| US6324581(B1) | 2001-11-01 | Xu et al. | Examiner |
| US6339793(B1) | 2002-01-01 | Bostian et al. | Examiner |
| US6360330(B1) | 2002-03-01 | Mutalik et al. | Applicant |
| US6389420(B1) | 2002-05-01 | Vahalia et al. | Examiner |
| US6401120(B1) | 2002-06-01 | Gamache et al. | Applicant |
| US6405284(B1) | 2002-06-01 | Bridge | Applicant |
| US6442613(B1) | 2002-08-01 | Gregg et al. | Examiner |
| US6453354(B1) | 2002-09-01 | Jiang et al. | Examiner |
| US6493804(B1) | 2002-12-01 | Soltis et al. | Examiner |
| US6556998(B1) | 2003-04-01 | Mukherjee et al. | Applicant |
| US6567853(B2) | 2003-05-01 | Shomler | Examiner |
| US6594676(B1) | 2003-07-01 | Moore | Applicant |
| US6629189(B1) | 2003-09-01 | Sandstrom et al. | Applicant |
| US6651140(B1) | 2003-11-01 | Kumar | Examiner |
| US2002/0161855(A1) | 2002-10-01 | Manczak et al. | Applicant |
| EP1049029 | 2000-11-01 | Applicant | |
| WO94/29807 | 1994-12-01 | Applicant |
Non-Patent Literature (16)
- H. Gobioff et al, “Security for Network Attached Storage Devices”, White Paper CMU-CS-97-185, Oct. 1997.Examiner
- R. Baird, “Distributed Information Storage Architecture,” Twelfth IEEE Symposium on Mass Storage Systems, IEEE, 1993, pp. 145-155.Applicant
- Gray et al., Transaction Processing: Concepts and Techniques, © 1993 Morgan Kaufmann Publishers, Inc., pp. 5-7.Applicant
- Gibson et al., “NASD Scalable Storage Systems,” Jun. 1999, pp. 1-6.Applicant
- “VERITAS File System Performance,” © 1996 VERITAS Software Corp., pp. 1-41.Applicant
- “File System Performance,” © 1996 VERITAS Software Corp., pp. 1-17.Applicant
- “File System,” © 1996 VERITAS Software Corp., pp. 1-17.Applicant
- Hitz et al., “File System Design for an NFS File Server Appliance,” © 1994 The USENIX Assoc., pp. 1-23.Applicant
- “Object Based Storage Devices: A Command Set Proposal,” Oct. 1999, pp. 1-65.Applicant
- David F. Nagle, et al., “Network Support for Network-Attached Storage,” Dept. of Electrical and Computer Engineering, Carnegie Mellon Univ., 6 pages, Proceedings Hot Interconnect, Aug. 1999.Applicant
- Best, S., “JFS Log. How the Journaled File System Performs Logging,” Proceedings of the 4th Annual Linux Showcase and Conference,—Oct. 10, 2000, XP-002231204, 6 pages.Applicant
- Gray, J. et al., “Transaction Processing: Concepts and Techniques,” 1994, Morgan Kaufman Publishers, Inc., XP-002231205, 5 pages.Applicant
- Srinivasan, B. et al., “Recoverable File System for Microprocessor Systems,” Microprocessors and Microsystems, IPC Business Press LTD. Longd, vol. 9, No. 4, May 1, 1995, XP-002026284, pp. 179-183.Applicant
- Coyne, et al., “An Introduction to the Mass Storage System Reference Model, Version 5,” Twelfth IEEE Symposium on Mass Storage Systems, 1993, pp. 47-53.Applicant
- Karamooz, et al., “Distributed Information Storage Architecture,” Twelfth IEEE Symposium on Mass Storage Systems, 1993, pp. 145-155.Applicant
- International Search Report for PCT/US 01/48733, mailed Feb. 20, 2003, 7 pages.Applicant