US 7,743,033 B2Grant
Systems and methods for providing a distributed file system utilizing metadata to track information about data stored throughout the system
Issue Date:2010-06-22
•8 Claims
•19 Drawing Sheets
Abstract
The intelligent distributed file system enables the storing of file data among a plurality of smart storage units which are accessed as a single file system. The intelligent distributed file system utilizes a metadata data structure to track and manage detailed information about each file, including, for example, the device and block locations of the file's data blocks, to permit different levels of replication and/or redundancy within a single file system, to facilitate the change of redundancy parameters, to provide high-level protection for metadata, to replicate and move data in real-time, and so forth.
Metadata
Assignee
- Isilon Systems, Inc.
Inventors
- Sujal M. Patel
- Paul A. Mikesell
- Darren P. Schack
Application Information
Application Number:US 11/880,462
Filing Date:2007-07-19
Priority Date:2001-08-03
Art Unit:2161
Classifications
IPC:
G06F7/00G06F17/00G06F17/30
Patent Drawings (19 sheets)
Description
Priority Information
[0001] This application is a continuation of U.S. patent application Ser. No. 10/007,003, filed Nov. 9, 2001, now U.S. Pat. No. 7,685,126 entitled “SYSTEMS AND METHODS FOR PROVIDING A DISTRIBUTED FILE SYSTEM UTILIZING METADATA TO TRACK INFORMATION ABOUT DATA STORED THROUGHOUT THE SYSTEM,” which is herein incorporated by reference in its entirety, and which claims the benefit of U.S. Provisional Application No. 60/309,803, filed Aug. 3, 2001 which is herein incorporated by reference in its entirety.
Field of the Invention
[0002] The systems and methods of the present invention relate generally to the field of distributed file storage, and in particular to intelligent distributed file management.
Background
[0003] The explosive growth of the Internet has ushered in a new area in which information is exchanged and accessed on a constant basis. In response to this growth, there has been an increase in the size of data that is being shared. Users are demanding more than standard HTML documents, wanting access to a variety of data, such as, audio data, video data, image data, and programming data. Thus, there is a need for data storage that can accommodate large sets of data, while at the same time provide fast and reliable access to the data.
[0004] One response has been to utilize single storage devices which may store large quantities of data but have difficulties providing high throughput rates. As data capacity increases, the amount of time it takes to access the data increases as well. Processing speed and power has improved, but disk I/O (Input/Output) operation performance has not improved at the same rate making I/O operations inefficient, especially for large data files.
[0005] Another response has been to allow multiple servers access to shared disks using architectures, such as, Storage Area Network solutions (SANs), but such systems are expensive and require complex technology to set up and to control data integrity. Further, high speed adapters are required to handle large volumes of data requests.
[0006] One problem with conventional approaches is that they are limited in their scalability. Thus, as the volume of data increases, the systems need to grow, but expansion is expensive and highly disruptive.
[0007] Another common problem with conventional approaches is that they are limited in their flexibility. The systems are often configured to use predefined error correction control. For example, a RAID system may be used to provide redundancy and mirroring of data files at the physical disk level giving administrators little or no flexibility in determining where the data should be stored or the type of redundancy parameters that should be used.
Summary
[0008] The intelligent distributed file system advantageously enables the storing of file data among a set of smart storage units which are accessed as a single file system. The intelligent distributed file system advantageously utilizes a metadata data structure to track and manage detailed information about each file, including, for example, the device and block locations of the file's data blocks, to permit different levels of replication and/or redundancy within a single file system, to facilitate the change of redundancy parameters, to provide high-level protection for metadata, to replicate and move data in real-time, and so forth.
[0009] For purposes of this summary, certain aspects, advantages, and novel features of the invention are described herein. It is to be understood that not necessarily all such advantages may be achieved in accordance with any particular embodiment of the invention. Thus, for example, those skilled in the art will recognize that the invention may be embodied or carried out in a manner that achieves one advantage or group of advantages as taught herein without necessarily achieving other advantages as may be taught or suggested herein.
Brief Description of the Drawings
[0010] FIG. 1 illustrates a high-level block diagram of one embodiment of the present invention.
[0011] FIG. 2 illustrates a sample flow of data among the components illustrated in FIG. 1 .
[0012] FIG. 3 illustrates a high-level block diagram of a sample smart storage unit.
[0013] FIG. 4 illustrates a sample file directory.
[0014] FIG. 5 illustrates one embodiment of a metadata data structure.
[0015] FIG. 6A illustrates one embodiment of a data location table structure.
[0016] FIG. 6B illustrates an additional embodiment of a data location table structure.
[0017] FIG. 6C illustrates an additional embodiment of a data location table structure.
[0018] FIG. 6D illustrates an additional embodiment of a data location table structure.
[0019] FIG. 7A illustrates one embodiment of a metadata data structure for a directory.
[0020] FIG. 7B illustrates one embodiment of a metadata data structure for a file.
[0021] FIG. 8A illustrates one embodiment of a data location table.
[0022] FIG. 8B illustrates an additional embodiment of a data location table.
[0023] FIG. 8C illustrates an additional embodiment of a data location table.
[0024] FIG. 9 illustrates a sample metadata data structure of a file with corresponding sample data.
[0025] FIG. 10 illustrates one embodiment of a flow chart for retrieving data.
[0026] FIG. 11 illustrates one embodiment of a flow chart for performing name resolution.
[0027] FIG. 12 illustrates one embodiment of a flow chart for retrieving a file.
[0028] FIG. 13 illustrates one embodiment of a flow chart for creating parity information.
[0029] FIG. 14 illustrates one embodiment of a flow chart for performing error correction.
Detailed Description of Preferred Embodiments
[0030] Systems and methods which represent one embodiment and example application of the invention will now be described with reference to the drawings. Variations to the systems and methods which represent other embodiments will also be described.
[0031] For purposes of illustration, some embodiments will be described in the context of Internet content-delivery and web hosting. The inventors contemplate that the present invention is not limited by the type of environment in which the systems and methods are used, and that the systems and methods may be used in other environments, such as, for example, the Internet, the World Wide Web, a private network for a hospital, a broadcast network for a government agency, an internal network of a corporate enterprise, an intranet, a local area network, a wide area network, and so forth. The figures and descriptions, however, relate to an embodiment of the invention wherein the environment is that of Internet content-delivery and web hosting. It is also recognized that in other embodiments, the systems and methods may be implemented as a single module and/or implemented in conjunction with a variety of other modules and the like. Moreover, the specific implementations described herein are set forth in order to illustrate, and not to limit, the invention. The scope of the invention is defined by the appended claims.
[0032] These and other features will now be described with reference to the drawings summarized above. The drawings and the associated descriptions are provided to illustrate embodiments of the invention and not to limit the scope of the invention. Throughout the drawings, reference numbers may be re-used to indicate correspondence between referenced elements. In addition, the first digit of each reference number generally indicates the figure in which the element first appears.
I. Overview
[0033] The systems and methods of the present invention provide an intelligent distributed file system which enables the storing of data among a set of smart storage units which are accessed as a single file system. The intelligent distributed file system tracks and manages detailed metadata about each file. Metadata may include any data that relates to and/or describes the file, such as, for example, the location of the file's data blocks, including both device and block location information, the location of redundant copies of the metadata and/or the data blocks (if any), error correction information, access information, the file's name, the file's size, the file's type, and so forth. In addition, the intelligent distributed file system permits different levels of replication and/or redundancy for different files and/or data blocks which are managed by the file system, facilitates the changing of redundancy parameters while the system is active, and enables the real-time replication and movement of metadata and data. Further, each smart storage unit may respond to a file request by locating and collecting the file's data from the set of smart storage units.
[0034] The intelligent distributed file system advantageously provides access to data in situations where there are large numbers of READ requests especially in proportion to the number of WRITE requests. This is due to the added complexities of locking on intelligent group of smart storage units, as well as journaling on the individual smart storage units to ensure consistency. Furthermore, the intelligent distributed file system advantageously handles block transactions wherein requests for large blocks of data are common.
[0035] One benefit of some embodiments is that the metadata for files and directories is managed and accessed by the intelligent distributed file system. The metadata may indicate where the metadata for a directory or file is located, where content data is stored, where mirrored copies of the metadata and/or content data are stored, as well as where parity or other error correction information related to the system is stored. Data location information may be stored using, for example, device and block location information. Thus, the intelligent distributed file system may locate and retrieve requested content data using metadata both of which may be distributed and stored among a set of smart storage units. In addition, because the intelligent distributed file system has access to the metadata, the intelligent distributed file system may be used to select where data should be stored and to move, replicate, and/or change data as requested without disrupting the set of smart storage units.
[0036] Another benefit of some embodiments is that data for each file may be stored across several smart storage units and accessed in a timely manner. Data blocks for each file may be distributed among a subset of the smart storage units such that data access time is reduced. Further, different files may be distributed across a different number of smart storage units as well as across different sets of smart storage units. This architecture enables the intelligent distributed file system to store data blocks intelligently based on factors, such as, the file's size, importance, anticipated access rate, as well as the available storage capacity, CPU utilization, and network utilization of each smart storage unit.
[0037] An additional benefit of some embodiments is that the systems and methods may be used to provide various protection schemes, such as, error correction, redundancy, and mirroring, on a data block or file basis such that different data blocks or files stored among the smart storage units may have different types of protection. For example, some directories or files may be mirrored, others may be protected with error and/or loss correction data using a variety of error or loss correction schemes, and others of lower importance may not use any protection schemes.
[0038] A further benefit of some embodiments is that the systems and methods may enable the real-time addition, deletion, and/or modification of smart storage units without disrupting or interrupting ongoing data requests. Thus, as more storage is required, additional smart storage units may be added to the set of smart storage units and incorporated into the intelligent distributed file system in real-time without interrupting the file requests or having to take the existing smart storage units offline. The existing smart storage units may process requests for files as the data blocks of existing files or new files are being distributed by the intelligent distributed file system across the set of smart storage units which now includes the new smart storage units.
[0039] Another benefit of some embodiments is that the systems and methods may perform real-time modifications to the storage of the data blocks by replicating those blocks on one or more of the smart storage units, and thus creating multiple points of access for any individual data block. This replication helps to reduce the utilization of CPU and network resource requirements for individual smart storage units for a file or group of files for which frequent access patterns have been observed. These access patterns are monitored by the smart storage units, and the intelligent distributed file system affords the smart storage units the flexibility to make such data replications while the intelligent distributed file system is still operating.
II. Sample Operation
[0040] For purposes of illustration, a sample scenario will now be discussed in which the intelligent distributed file system is used in operation. In this sample scenario, the intelligent distributed file system is used by a company that offers movie downloads via an Internet web site. The company may use the intelligent distributed file system to store and manage copies of downloadable movies as well as movie trailers, advertisements, and customer information that are accessed by customers via the web site. The data may be stored with various levels of protection and stored across multiple smart storage units for fast access.
[0041] For example, the company may want to store customer survey emails across several smart storage units in the intelligent distributed file system to provide fast access to the emails. The company may, however, keep backup tapes of all emails and may feel that it is not vital to enable immediate recovery of customer surveys. The company may instruct the intelligent distributed file system not to use error correction or mirroring protection on the customer survey emails. Thus, if one or more of the smart storage units become inaccessible, the company may feel it is acceptable that access to the customer survey email on those smart storage units is delayed until the emails can be restored from the backup tapes.
[0042] For advertisements, the company may instruct the intelligent distributed file system to use high error correction parameters such that if one or more smart storage units fail, the intelligent distributed file system can recover the data without interrupting the display of the advertisement. For example, the company may rely upon various fault tolerance measurements to assist in determining how much protection should be given to a particular file. For important information, the company may want to ensure a fault tolerance level of X, and for less important information, the company want to ensure a fault tolerance level of Y where X>Y. It is recognized that other measurements, in addition to or instead of fault tolerance may be used, and that fault tolerance is used to illustrate one measurement of reliability. Thus, the company may ensure its advertisers that the advertisements will be available on a reliable basis even if one or more of the smart storage units fail.
[0043] For the top movie downloads, the company may advantageously set up the intelligent distributed file system to automatically store multiple copies of the movie data to enable more customers access to the data and to ensure that if one or more of the smart storage units fail, then the missing data may be regenerated or retrieved from other locations. Moreover, additional copies of the top movie downloads may be created and stored among the smart storage units if the number of requests increase and/or if one or more of the smart storage units begins to become flooded with requests for the data that resides on the smart storage unit.
[0044] The company may choose to offer other movies that are not as popular and may instruct the intelligent distributed file system to store fewer copies due to the lower demand. Further, as the “top download movies” become less popular, the company may advantageously set up the intelligent distributed file system to delete extra copies of the movies from the smart storage units on which the movies are stored and move the “less popular” movies to smart storage units with slower performance (e.g., those smart storage units with less available disk space). The intelligent distributed file system may be set to automatically take care of these tasks using the smart storage units.
[0045] In addition, as the company acquires more movies, the company may add additional smart storage units to the intelligent distributed file system. The company may then use the new smart storage units to store more movies, to store more copies of existing movies, and/or to redistribute existing movie data to improve response time. The additional smart storage units are incorporated into the intelligent distributed file system such that the intelligent distributed file system appears as a single file system even though the intelligent distributed file system manages and stores data among a set of multiple smart storage units.
[0046] In this example, the intelligent distributed file system provides the company the ability to offer reliable and fast access to top movie downloads, fast access to less popular movies, and access to customer survey emails. For each file, the company may set error and/or loss correction parameters and may select how many additional copies of the file should be stored. In some situations, the company may manually choose how many copies of data should be stored and determine where to store the data. In other situations, the company may rely on the features of the intelligent distributed file system to select how many copies of data should be stored, the error and/or loss correction scheme that should be used (if any), and/or where the data should be stored. Thus, the company is able to efficiently use its storage space to better respond to user requests. Storage space is not wasted on sparsely requested files, and error correction information is not generated and stored for unimportant files.
[0047] While the example above involves a company which offers movies for downloading, it is recognized that this example is used only to illustrate features of one embodiment of an intelligent distributed file system. Further, the intelligent distributed file system may be used in other environments and may be used with other types of and/or combinations of data, including, for example, sound files, audio files, graphic files, multimedia files, digital photographs, executable files, and so forth.
III. Intelligent Distributed File System
[0048] FIG. 1 illustrates one embodiment of an intelligent distributed file system 110 which communicates with a network server 120 to provide remote file access. The intelligent distributed file system 110 may communicate with the network server 120 using a variety of protocols, such as, for example, NFS or CIFS. Users 130 interact with the network server 120 via a communication medium 140, such as the Internet 145, to request files managed by the intelligent distributed file system 110. The exemplary intelligent distributed file system 110 makes use of a switch component 125 which communicates with a set of smart storage units 114 and the network server 120. The intelligent distributed file system 110 enables data blocks of an individual file to be spread across multiple smart storage units 114. This data is stored such that access to the data provides a higher throughput rate than if the data was stored on a single device. In addition, the intelligent distributed file system 110 may be used to store a variety of data files which are stored using a variety of protection schemes.
[0049] The exemplary intelligent distributed file system 110 stores data among a set of smart storage units 114. For a more detailed description about the smart storage units 114, please refer to the section below entitled “Smart Storage Units.”
[0050] The exemplary intelligent distributed file system makes use of a switch component 125, such as a load balancing switch, that directs requests to an application server that can handle the type of data that has been requested. The incoming requests are forwarded to the appropriate application servers using high-speed technology to minimize delays to ensure data integrity.
[0051] It is recognized that a variety of load balancing switches 125 may be used, such as, for example, the 1000 Base-T (copper) Gigabit load Balancing Ethernet Switch, the Extreme Networks Summit 7I, Foundry Fast Iron II, Nortel Networks Alteon ACEswitch 180, F5 Big-Ip), as well as standard Ethernet switches or other load balancing switches. The intelligent distributed file system makes use of a switch which supports large frame sizes, for example, “jumbo” Ethernet frames. In addition, the load balancing switch 125 may be implemented using Foundry Networks' Serverlron switches, Asante's InstraSwitch 6200 switches, Asante's HotStack, Cisco's Catalyst switches, as well as other commercial products and/or proprietary products. One of ordinary skill in the art, however, will recognize that a wide range of switch components 125 may be used, or other technology may be used. Furthermore, it is recognized that the switch component 125 may be configured to transmit a variety of network frame sizes.
[0052] Files of high importance may be stored with high error correction parameters that provide the data with a high recovery rate in case of disk, motherboard, CPU, operating system, or other hardware or software failure that prevents access to one or more of the smart storage units. If any data is lost or missing, a smart storage unit 114 may use the redundancy information or mirroring information in the metadata to obtain the data from another location or to recreate the data. Files in high demand may be mirrored in real-time across the additional smart storage units 114 to provide even higher throughput rates.
[0053] In one embodiment of the intelligent distributed file system 110, the metadata data structure has at least the same protection as the data that it references including any descendants of the directory that corresponds to the metadata data structure. Loss of data in a metadata data structure harms the intelligent distributed file system 110 as it is difficult to retrieve the data without its metadata data structure. In the intelligent distributed file system 110, alternate copies of the metadata data structure may be mirrored in as many locations as necessary to provide the required protection. Thus, a file with parity protection may have its metadata data structure stored with at least the same or greater parity protection and a file mirrored twice may have its metadata structure at least mirrored in two locations.
[0054] While FIG. 1 illustrates one embodiment of an intelligent distributed file system 110, it is recognized that other embodiments may be used. For example, additional servers, such as, application severs may communicate with the switch component 125. These application severs may include, for example, audio streaming servers, video streaming servers, image processing servers, database servers, and so forth. Furthermore, there may be additional devices, such as workstations, that communicate with the switch component 125. In addition, while FIG. 1 illustrates an intelligent distributed file system 110 working with four smart storage units 114, it is recognized that the intelligent distributed file system 110 may work with different numbers of smart storage units 114.
[0055] It is also recognized that the term “remote” may include devices, components, and/or modules not stored locally, that is not accessible via the local bus. Thus, a remote device may include a device which is physically located in the same room and connected via a device such as a switch or a local area network. In other situations, a remote device may also be located in a separate geographic area, such as, for example, in a different location, country, and so forth.
[0056] It is also recognized that a variety of types of data may be stored using the intelligent distributed file system 110. For example, the intelligent distributed file system 110 may be used with large file applications, such as, for example, video-on-demand, online music systems, web-site mirroring, large databases, large graphic files, CAD/CAM design, software updates, corporate presentations, insurance claim files, medical imaging files, corporate document storage, and so forth.
[0057] FIG. 2 illustrates a sample environment in which a web site user 130 has submitted a request to watch an on-demand digital video. In event A, the user 130 sends a request via the Internet 145 to a web site requesting to view a copy of the movie, mymovie.movie. The request is received by the web site's server 120, and the server 120 determines that the file is located at \movies\comedy\mymovie.movie. In event B, the switch component 125 of the intelligent distributed file system 110 sees the request to connect to the intelligent distributed file system 110 and forwards the request to an available smart storage unit 114, such as smart storage unit 0, using standard load balancing techniques. In event C, smart storage unit 0 receives the request for the file /DFSR/movies/comedy/mymovie.movie and determines from its root metadata data structure (for the root directory /DFSR) that the metadata data structure for the subdirectory movies is stored with smart storage unit 2. In event D, smart storage unit 0 sends a request to smart storage unit 2 requesting the location of the metadata data structure for the subdirectory comedy. In event E, smart storage unit 0 receives information that the metadata data structure for the subdirectory comedy is stored with smart storage unit 3. In event F, smart storage unit 0 sends a request to smart storage unit 3 requesting the location of the metadata data structure for the file mymovie.movie. In event G, smart storage unit 0 receives information that the metadata data structure for the file mymovie.movie is stored with smart storage unit 0. Smart storage unit 0 then retrieves the metadata data structure for the file mymovie.movie from local storage. From the metadata data structure, smart storage unit 0 retrieves the data location table for mymovie.movie which stores the location of each block of data in the file. Smart storage unit 0 then uses the data location table information to begin retrieving locally stored blocks and sending requests for data stored with other smart storage units.
[0058] After the file's data or a portion of the data has been retrieved, the file data is sent to the requesting server 120 to be forwarded to the requesting user 130. In one example, the file data may be routed to a video streaming server which regulates how and when the data is sent to the user 130. It is recognized that in some embodiments, it may be advantageous to utilize read ahead techniques to retrieve more data then requested so as to reduce the latency of the requests.
IV. Intelligent File System Structure
[0059] Table 1 illustrates one embodiment of a sample set of file system layers through which a file request is processed in order to access the physical storage device. The exemplary file system layers include a User layer, a Virtual File System layer, a Local File System layer, a Local File Store layer, and a Storage Device layer.
[0060]
| TABLE 1 | ||
|---|---|---|
| User Space | User Layer | |
| Kernel Space | Virtual File System Layer | |
| Local File System Layer | ||
| Local File Store Layer | ||
| Storage Device Layer | ||
[0061] In one type of file request, the request is received via a user-level protocol application for file sharing, such as, for example, HTTPD (the Apache web server), FTPD, or SMBD used on Unix which implements a version of the Microsoft Windows file sharing server protocol. The user-level protocol application performs a kernel level open, read, seek, write, or close system call, such as, for example, by making a function call to libc, the C runtime library.
[0062] The system call is passed onto the Virtual File System layer (“VFS”), which maintains a buffer cache. The buffer cache may be, for example, a least recently used (“LRU”) cache of buffers used to store data or metadata data structures which are received from the lower file system layers.
[0063] The next layer is the Local File System layer which maintains the hierarchical naming system of the file system and sends directory and filename requests to the layer below, the Local File Store layer. The Local File System layer handles metadata data structure lookup and management. For example, in some systems, such as Unix-based file systems, the metadata data structure is a file abstraction which includes information about file access permissions, data block locations, and reference counts. Once a file has been opened via its name, other file operations reference the file via a unique identifier which identifies the metadata structure for the specific file. The benefits of this approach are that a single file may have many different names, a single file may be accessed via different paths, and new files may be copied over old files in the VFS namespace without overwriting the actual file data via the standard UNIX user level utilities, such as, for example, the ‘mv’ command. These benefits may be even more advantageous in environments such as content-delivery and web hosting because content may be updated in place without disrupting current content serving. The reference count within the metadata data structure enables the system to only invalidate the data blocks once all open file handles have been closed.
[0064] The fourth layer is the Local File Store layer which handles “buffer request to block request” translation and data buffer request management. For example, the Local File Store layer uses block allocation schemes to improve and maximize throughput for WRITES and READS, as well as block retrieval schemes for reading.
[0065] The last layer is the Storage Device layer which hosts the device driver for the particular piece of disk hardware used by the file system. For example, if the physical storage device is an ATA disk, then the Storage Device layer hosts the ATA disk driver.
V. Smart Storage Units
[0066] In one embodiment, the smart storage unit 114 is a plug-and-play, high-density, rack-mountable appliance device that is optimized for high-throughput data delivery. The smart storage unit may be configured to communicate with a variety of other smart storage units so as to provide a single virtual file system. As more storage space is needed or if one or more of the smart storage units fail, additional smart storage units may be installed without having to take the entire system down or cause interruption of service.
[0067] As used herein, the word module refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may be represented in hardware or firmware.
[0068] FIG. 3 illustrates one embodiment of a smart storage unit 114 which includes a management module 320, a processing module 330, a cache 340, a stack 350, and a storage device 360. The exemplary smart storage unit 114 may be configured to communicate with the switch component 125 to send and receive requests as illustrated in FIG. 1 .
[0069] A. Management Module
[0070] In one embodiment, the smart storage unit includes a management module 320 for performing management tasks, such as, for example, installation, parameter setting, monitoring of the intelligent distributed file system, logging of events that occur on the intelligent distributed file system 110, and upgrading.
[0071] B. Processing Module
[0072] The exemplary processing module 330 may be configured to receive requests for data files, retrieve locally and/or remotely stored metadata about the requested data files, and retrieve the locally and/or remotely stored data blocks of the requested data files. In addition, the processing module 330 may also perform data recovery and error correction in the event that one or more of the requested data blocks is corrupt or lost.
[0073] In one embodiment, the processing module 330 includes five modules to respond to the file requests, a block allocation manager module 331, a block cache module 333, a local block manager module 335, a remote block manager module 337 and a block device module 339.
[0074] 1. Block Allocation Manager Module
[0075] The block allocation manager 331 module determines where to allocate blocks, locates the blocks in response to a READ request, and conducts device failure recovery. Information about where to allocate the blocks may be determined by policies set as default parameters, policies set by the system administrator via tools, such as a graphical user interface or a shell interface, or a combination thereof. In one embodiment, the block allocation manager 331 resides at the Local File System layer and works in conjunction with standard networking software layers, such as TCP/IP and Ethernet, and/or instead of Berkeley Software Design Universal File System (“BSD UFS”).
[0076] The exemplary block allocation manager 331 includes three submodules, a block request translator module, a forward allocator module, and a failure recovery module.
[0077] a. Block Request Translator Module
[0078] The block request translator module receives incoming READ requests, performs name lookups, locates the appropriate devices, and pulls the data from the device to fulfill the request. If the data is directly available, the block request translator module sends a data request to the local block manager module or to the remote block manager module depending on whether the block of data is stored on the local storage device or on the storage device of another smart storage unit.
[0079] In one embodiment, the block request translator module includes a name lookup process which is discussed below in the section entitled “Intelligent Distributed File System Processes—Processing Name Lookups.”
[0080] The block request translator module may also respond to device failure. For example, if a device is down, the block request translator module may request local and remote data blocks that may be used to reconstruct the data using, for example, parity information. Thus, the data may be generated even though the READ may not be performed. In addition, the block request translator module may communicate with the failure recovery module such that the failure recovery module may re-create the data using parity or other error or loss correction data and re-stripe the loss correction data across free space in the intelligent distributed file system. In other embodiments, the block request translator module may request clean copies of corrupt or missing data.
[0081] b. Forward Allocator Module
[0082] The forward allocator module determines which device's blocks should be used for a WRITE request based upon factors, such as, for example, redundancy, space, and performance. These parameters may be set by the system administrator, derived from information embedded in the intelligent distributed file system 110, incorporated as logic in the intelligent distributed file system 110, or a combination thereof. The forward allocator module 110 receives statistics from the other smart storage units that use the intelligent distributed file system, and uses those statistics to decide where the best location is to put new incoming data. The statistics that are gathered include, for example, measurements of CPU utilization, network utilization, and disk utilization.
[0083] The forward allocator module may also receive latency information from the remote block manager module based upon the response times of the remote smart storage units. If the inter-device latency reaches a high level relative to other smart storage units, the allocation schemes may be adjusted to favor other smart storage units underutilizing the slow smart storage unit, if possible, based on the redundancy settings. In one advantageous example, the intelligent distributed file system may have moved blocks of data from one smart storage unit to another smart storage unit, updating the corresponding metadata structures accordingly. The latency conditions may be logged through a logging system and reported to the system administrator. Reasons for slow link conditions may be, for example, bad network cards, incorrect duplex negotiation, or a device's data being relatively frequently read or written to.
[0084] A variety of strategies may be used to determine where to store the data. These strategies may be adjusted depending on the goals of the system, such as, compliance with parameters set by the system's administrator, meeting of selected redundancy levels, and/or performance improvement. The following provides a few sample strategies that may be employed by the forward allocator module to store data. It is recognized that a wide variety of strategies may be used in addition to or in conjunction with those discussed below.
[0085] The forward allocator module may include an allocation scheme for striping data across multiple smart storage units. Striping data is a common technology typically used in high-end RAID storage devices, but may be employed in single user workstation machines with multiple disks. Striping data simply means that different portions of a file's data live and/or are stored on different storage devices or disks. The advantage to striping data is that when READ requests span the blocks located on multiple disks, each disk participates in the aggregate throughput of data retrieval. With typical systems, striping of data is done at the software device layer. That is, the file system has no information about the striping of the data. Only the software layer underneath the file system understands this structure. In some specialized pieces of hardware, this striping is done even below the software device layer at the actual hardware layer. In the intelligent distributed file system 110, the file system itself handles the striping of data. This implementation provides greater flexibility with striping configurations. As an example, typical RAID technologies are limited in that all disks must be of the same size and have the same performance characteristics. These constraints are necessary to ensure that data is spread evenly across the different devices. For a more detailed discussion about RAID, please refer to “The RAID Book,” by Paul Massiglia, Sixth Edition (1997), which is herein incorporated by reference.
[0086] With the intelligent distributed file system 110, differing disks and disk sizes may be used in various smart storage units 114 and participate in the file striping. The forward allocator module looks up in the root metadata data structure for disk device information and calculates the number of smart storage units across which the file data should be spread using performance metrics or preset rules. The forward allocator module may then allocate the data blocks of the file to a set of smart storage units.
[0087] The forward allocator module may also include an allocation scheme for parity or other error or loss correction protection. In most RAID systems, when file striping is used, parity protection is also used such that all of the disks, except one, are used for data storage. The last disk is purely used for parity information. This parity information is typically calculated by taking a bitwise exclusive or (“XOR”) of each block of data across all of the data disks. This parity information is used to perform data recovery when a disk failure occurs. The lost data is recalculated from taking the bitwise XOR of the remaining disks' data blocks and the parity information. In typical RAID systems, the data is unrecoverable until a replacement disk in inserted into the array to rebuild the lost data.
[0088] With the intelligent distributed file system 110, the lost data may be re-computed and re-written in free space on other portions of the remaining smart storage units because the parity protection takes place at the file system layer instead of the software device layer. If there is not enough free space left to re-write the data, the parity data may be overwritten with re-calculated data, and the fact that the redundancy has dropped below the original levels may be logged and/or reported to the system administrator.
[0089] The forward allocator module may also include an allocation scheme for mirroring of data, that is making multiple copies of the data available on different smart storage units. The forward allocator module may use an allocation scheme to load balance the locations of the blocks of the data across the smart storage units using those smart storage units that are least used in terms of storage space, network utilization, and/or CPU utilization. Mirroring may provide increased performance and increased fault tolerance. If mirroring is requested for certain pieces of content, the forward allocator module allocates space for the original data as well as the mirrored data. If a fault tolerance level of greater than one is requested, the forward allocator may logically divide the smart storage units, or a subset of the smart storage units, by the fault tolerance count and create mirrors of striped data. For example, if there are ten smart storage units 114 in an intelligent distributed file system 110, and a fault tolerance of two is requested, then the forward allocator may logically break the intelligent distributed file system into two sections of five smart storage units each, stripe the data across four smart storage units in each section, and use the fifth smart storage units from each section as a parity disk. This division of smart storage units may be referred to as an array mirror split.
[0090] c. Failure Recovery Module
[0091] The failure recovery module reconfigures the intelligent distributed file system 110, in real-time, to recover data which is no longer available due to a device failure. The failure recovery module may perform the reconfiguration without service interruptions while maintaining performance and may return the data to desired redundancy levels in a short period of time.
[0092] As discussed above, the remote block manager module 337 detects failures and passes notification of such failures to the failure recovery module. For an initial failure, the failure recovery module locates any data blocks that do not meet the redundancy parameters as requested by the system administrator or as set by the intelligent distributed file system 110.
[0093] First, data that can be recreated from parity information is recreated and a request is sent to the forward allocator module to allocate space for the new data. The forward allocator monitors CPU and network utilization and begins operation aggressively until CPU and network utilization reaches a predetermined mark. This predetermined mark may be set by the system administrator or pre-set according to factors such as, for example, the computer processor. Once the mark is reached, the failure recovery module may advantageously re-calculate data at the rate achieved at the time of the mark to reduce impact on the smart storage unit's performance.
[0094] If a recently failed device comes back online, the failure recovery module communicates with the remote block manager module 337 of the recovered device to verify data integrity and fix any inconsistencies.
[0095] The intelligent distributed file system 110 may also support the inclusion of a hot standby device. The hot standby device is an idle storage device that is not currently handling any data storage, but will be put into use at the time of a device failure. In such a situation, the failure recovery module may rebuild the lost data using the hot standby device by communicating with the hot standby device's remote block manager module 337.
[0096] 2. Block Cache Module
[0097] The block cache module 333 manages the caching of data blocks, name looks ups, and metadata data structures. In one embodiment, the block cache module 333 works in conjunction with or instead of BSD Virtual File System's buffer cache.
[0098] The block cache module 333 may cache data blocks and metadata data blocks using the Least Recently Used caching algorithm, though it is recognized that a variety of caching algorithms that may be used, such as, for example, frequency caching. The block cache module 333 may determine which block caching algorithm to use depending on which performs the best, or in other embodiments, an algorithm may be set as the default.
[0099] Least Recently Used caching (“LRU”) is the typical caching scheme used in most systems. LRU is based off the principle that once data is accessed it will most likely be accessed again. Thus, data is stored in order of its last usage such that data that has not been accessed for the longest amount of time is discarded.
[0100] Frequency caching stores data that has been most frequently accessed. Because disk writes are a relatively time intensive operation, additional performance may be gained by tracking access frequencies in the metadata data structures and caching based on access frequencies.
[0101] In addition, the block cache module 333 may utilize an “on demand” protocol or a “read ahead” protocol wherein more data is requested than required. The block cache module 333 may send a request for a set of data and also request some amount of data ahead of the set of data. For example, the block cache module 333 may perform read aheads, such as one packet read aheads, two packet read aheads, ten packet read aheads, twenty packet read aheads, and so forth. In other embodiments, the block cache module 333 may utilize read ahead techniques based upon the latency of the request. For example, the block cache module 333 may perform K packet read aheads where K is calculated using the read rate and the latency of the link. The block cache module 333 may also use other algorithms based on CPU and network utilization to determine the size of the read ahead data. Furthermore, the block cache module may utilize a set caching protocol, or may vary the caching protocol to respond to the system's performance levels.
[0102] The cache 340 may be implemented using the default sizes provided with general multi-user operating systems or modified to increase the cache block size to a different amount but without severely impacting system performance. Such modifications may be determined by various performance tests that depend upon factors, such as, for example, the type of data being stored, the processing speed, the number of smart storage units in the intelligent distributed file system, and the protection schemes being used.
[0103] 3. Local Block Manager Module
[0104] The local block manager module 335 manages the allocation, storage, and retrieval of data blocks stored locally on the storage device 360. The local block manager 335 may perform zero copy file reads to move data from the disk to another portion of the storage device 360, such as, for example, the network card, thereby improving performance. The local block manager 335 may also perform modifications based upon the storage device 360 being used so as to increase performance. In one embodiment, the local block manager module 335 resides at the Local File Store layer and may work in conjunction with or instead of FreeBSD Fast File System.
[0105] 4. Remote Block Manager Module
[0106] The remote block manager module 337 manages inter-device communication, including, for example, block requests, block responses, and the detection of remote device failures. In one embodiment, the remote block manager module 337 resides at the Local File System layer.
[0107] In one embodiment, the smart storage units 114 may be connected to and/or communicate with the other smart storage devices 114 in the intelligent distributed file system 110 via the remote block managers 337.
[0108] The remote block manager modules 337 may enable the smart storage units 114 to talk to each other via a connection such as TCP. In one embodiment, the are at least two TCP connections between each smart storage unit, one for file data transportation and one for control message transportation. The advantage of this dual channel TCP communication architecture is that as long as data blocks are sent in multiples of page sizes, the data may be sent via DMA transfer directly from the network interface card to system memory, and via DMA transfer from system memory to another portion of the system (possibly the network interface card again) without the need for the data to be copied from one portion of system memory to another. This is because there is no need for the CPU to be involved in parsing the data packets as they do not contain non-data headers or identifying information since this information is transferred on the control channel. In high performance server and operating systems, these memory copies from one portion of system memory to another become a severe limitation on system performance.
[0109] In one embodiment, the remote block manager modules 337 communicate using messaging communication utilizing messages, such as, for example, data block access messages (e.g. READ, READ_RESPONSE, WRITE, and WRITE_RESPONSE), metadata access messages (e.g., GET_INODE, GET_INODE_RESPONSE, SET_ADDRESS, GET_ADDRESS, and INVALIDATE_INODE), directory messages (e.g., ADD_DIR and REMOVE_DIR), status messages, as well as a variety of other types of messages.
[0110] While a dual channel protocol is discussed above, it is recognized that other communication protocols may be used to enable communication among the smart storage units 114.
[0111] 5. Block Device Module
[0112] The block device module 339 hosts the device driver for the particular piece of disk hardware used by the file system. For example, if the physical storage device is an ATA disk, then the block device module 339 hosts the ATA disk driver.
[0113] C. Cache
[0114] The cache memory or cache 340 may be implemented using a variety of products that are well known in the art, such as, for example, a 1 G RAM cache. The cache 340 illustrated in FIG. 3 may store blocks of data that have recently been accessed or are to be accessed within a set amount of time. The cache 340 may be implemented using a high-speed storage mechanism, such as a static RAM device, a dynamic RAM device, an internal cache, a disk cache, as well as a variety of other types of devices. Typically, data is accessed from a cache 340 faster than the time it takes to access the non-volatile storage device. The cache 340 stores data such that if the smart storage unit 114 needs to access data from the storage device 360, the cache 340 may be checked first to see if the data has already been retrieved. Thus, use of the cache 340 may improve the smart storage unit's performance in retrieving data blocks.
[0115] D. Network Stack
[0116] In one embodiment, the smart storage unit 310 also includes a network stack 350 that handles incoming and outgoing message traffic using a protocol, such as, for example, TCP/IP. It is recognized, however, that other protocols or data structures may be used to implement the stack 350.
[0117] E. Storage Device
[0118] The storage device 360 is a non-volatile memory device that may be used to store data blocks. The storage device 360 may be implemented using a variety of products that are well known in the art, such as, for example, a 4 1.25 GB ATA100 device, SCSI devices, and so forth. In addition, the size of the storage device 360 may be the same for all smart storage units 114 in an intelligent distributed file system 110 or it may be of varying sizes for different smart storage units 114.
[0119] F. System Information
[0120] In one embodiment, the smart storage unit 114 runs on a computer that enables the smart storage unit 114 to communicate with other smart storage units 114. The computer may be a general purpose computer using one or more microprocessors, such as, for example, a Pentium processor, a Pentium II processor, a Pentium Pro processor, a Pentium IV processor, an xx86 processor, an 8051 processor, a MIPS processor, a Power PC processor, a SPARC processor, an Alpha processor, and so forth.
[0121] In one embodiment, the processor unit runs the open-source FreeBSD operating system and performs standard operating system functions such opening, reading, writing, and closing a file. It is recognized that other operating systems may be used, such as, for example, Microsoft® Windows® 3.X, Microsoft® Windows 98, Microsoft® Windows® 2000, Microsoft® Windows® NT, Microsoft® Windows® CE, Microsoft® Windows® ME, Palm Pilot OS, Apple® MacOS®, Disk Operating System (DOS), UNIX, IRIX, Solaris, SunOS, FreeBSD, Linux®, or IBM® OS/2® operating systems.
[0122] In one embodiment, the computer is equipped with conventional network connectivity, such as, for example, Ethernet (IEEE 802.3), Token Ring (IEEE 802.5), Fiber Distributed Datalink Interface (FDDI), or Asynchronous Transfer Mode (ATM). Further, the computer may be configured to support a variety of network protocols such as, for example NFS v2/v3 over UDP/TCP, Microsoft® CIFS, HTTP 1.0, HTTP. 1.1, DAFS, FTP, and so forth.
[0123] In one embodiment, the smart storage device 114 includes a single or dual CPU 2U rack mountable configuration, multiple ATA100 interfaces, as well as a 1000/100 Network Interface Card that supports jumbo 9K Ethernet frames. It is recognized, however, that a variety of configurations may be used.
VI. Intelligent Distributed File System Data Structures
[0124] FIG. 4 illustrates a sample directory structure that may be used with the intelligent distributed file system. In this example, the ROOT directory is named “DFSR” and includes subdirectories IMPORTANT, TEMP, and USER. The IMPORTANT subdirectory includes the subdirectories PASSWORDS and CREDITCARD. The files USER.TXT and ADMIN.TXT are stored in the PASSWORDS subdirectory. Thus, the address for the USER.TXT file is:
-
- [0125] /DFSR/IMPORTANT/PASSWORDS/USER.TXT
Information or metadata about the directories and the files is stored and maintained by the intelligent distributed file system 110.
- [0125] /DFSR/IMPORTANT/PASSWORDS/USER.TXT
[0126] A. Metadata Data Structures
[0127] FIG. 5 illustrates a sample data structure 510 for storing metadata. The exemplary data structure 510 stores the following information:
[0128]
It is recognized that the sample data structure 510 illustrates one embodiment of a data structure 510 for storing metadata and that a variety of implementations may be used in accordance with the invention. For example, the data structure 510 may include different fields, the fields may be of different types, the fields may be grouped and stored separately, and so forth.
| Field | Description |
|---|---|
| Mode | The mode of the file (e.g., regular file, block |
| special, character special, directory, symbolic | |
| link, fifo, socket, whiteout, unknown) | |
| Owner | Account on the smart storage unit which has |
| ownership of the file | |
| Timestamp | Time stamp of the last modification of the file |
| Size | Size of the metadata file |
| Parity Count | Number of parity devices used |
| Mirror Count | Number of mirrored devices used |
| Version | Version of metadata structure |
| Type | Type of data location table (e.g., Type 0, Type 1, |
| Type 2, or Type 3) | |
| Data Location | Address of the data location table or actual data |
| Table | location table information |
| Reference Count | Number of metadata structures referencing this one |
| Flags | File permissions (e.g., standard UNIX permissions) |
| Parity Map | Pointer to parity block information |
| Pointer | |
It is recognized that the sample data structure 510 illustrates one embodiment of a data structure 510 for storing metadata and that a variety of implementations may be used in accordance with the invention. For example, the data structure 510 may include different fields, the fields may be of different types, the fields may be grouped and stored separately, and so forth.
[0129] FIGS. 6A , 6B, 6C, and 6D provide sample data location table structures for the some of the types of data location tables, that is Type 0, Type 1, Type 2, and Type 3 respectively. In FIG. 6A , the Type 0 data location table includes 24 direct block entries meaning that the entries in the data location table include device/block number pairs which indicate the location in which the data blocks are stored. In FIG. 6B , the Type 1 data location table includes 15 direct block entries, three single-indirect entries, three double-indirect entries, and three triple-indirect entries. The entries for the single-indirect entries indicate the locations in which an additional data location table of direct entries is stored. The entries for the double-indirect entries indicate the locations in which data location tables are stored wherein the data location tables include single-indirect entries. The entries for the triple-indirect entries indicate the locations in which data location tables are stored wherein the data location tables include double-indirect entries.
[0130] Because any block may be mirrored across any number of devices, the metadata data structure 510 is flexible enough to represent blocks with multiple locations and still provide the fast access that comes from direct indexing within a fixed space. Thus, a type may advantageously be associated with the metadata data structure 510 to indicate the type of data location table to be used. In one embodiment of the metadata data structure 510, there may be room for 24 data entries, such as, for example, 24 pointers.
[0131] Type 0 may be used when a data file is small; the data location addresses are stored as direct entries. Thus, a Type 0 metadata data structure includes 24 direct entries. Type 1 may be used to support larger files and mirror of up to two times (three copies of the file). Type 1 uses 15 direct entries, three single-indirect entries, three double-indirect entries, and three triple-indirect entries. Type 2 may be used to support mirroring of up to 7 times (8 copies of the file), and includes eight single-indirect entries, eight double-indirect entries, and eight triple-indirect entries. Type 3 data location tables enable even further mirroring as all of the disk addresses are stored as triple-indirect entries. As a result, up to 24 complete file copies may be stored.
[0132] It is recognized that a variety of data location tables may be used and that FIGS. 6A , 6B, 6C, and 6D illustrate sample embodiments. In other embodiments, for example, the data location tables may include a different mixture of direct and indirect entries. Further, in other embodiments, the data location tables may include a entry field which designates the type of entry for each entry in the table. The types may include, for example, those discussed above (e.g., direct, single-indirect, double-indirect, triple-indirect) as well as others (e.g., quadruple-indirect, etc.). In addition, the data location table may include deeper nesting of data location tables up to X levels wherein X is an integer.
[0133] 1. Directory Metadata
[0134] FIG. 7A illustrates a sample set of metadata for the directory PASSWORDS. In FIG. 7A , the data structure stores information about the PASSWORDS directory. The directory is mirrored twice (three copies total). Because a directory structure is relatively small (e.g., it fits within a block), there are only three direct pointers used, one for each copy. The sample set of metadata includes a data location table 710 which includes direct entries 720 indicating the location of the data block using a device/block number pair as well as a set of unused block entries 730.
[0135] 2. File Metadata
[0136] FIG. 7B illustrates a sample set of metadata for the file USER. TXT. In FIG. 7B , the data structure stores information about the USER. TXT file. There is one copy of each of the data blocks for the USER. TXT file data and the data is protected using a 3+1 parity scheme. The content data for USER. TXT is of size 45K and the block size is 8K, thus, there are 6 blocks of data with the 6th block of data not fully used. The data location table 710 shows the location in which each of the 6 blocks of data are stored 720, wherein the blocks of data are referenced by device number and block number and where the first entry corresponds to the first block of data. Further, the location of the parity information for the content data is stored in a parity map 740 whose location is designated by the last location of the data structure as “parity map pointer.” The USER.TXT file is stored using a 3+1 parity scheme thus, for every three blocks of data, a block of parity data is stored. Because there are six blocks in this 3+1 parity scheme, there are two blocks of parity data (6 divided by 3 and rounding up to the nearest integer). The parity map shows the location in which both of the blocks of parity data are stored, wherein the blocks of parity data are referenced by device number and block number and where the first entry corresponds to the first block of parity data.
[0137] B. Data Location Table Data Structures
[0138] The intelligent distributed file system 110 may provide storage for a wide variety of data files as well as flexibility as to how the data files are stored. Redundancy and mirroring of data files is performed at the file system level enabling the intelligent distributed file system 110 to support varying redundancy parameters for different files. For example, some directories may be mirrored, parity protected, or not protected at all.
[0139] FIGS. 8A , 8B, and 8C illustrate example data location tables that may be used to store data location information for data files of varying protection types and levels. FIGS. 8A , 8B, and 8C are meant to illustrate various data location tables, and it is recognized that a variety of different formats and/or structures may be used.
[0140] FIG. 8A illustrates a sample data location table 810 that indicates where each block of data of the corresponding file is stored. Note that the corresponding metadata for the file, such as that in FIG. 7B , is not shown, though it is recognized that the data location table 810 may correspond to a set of metadata. The exemplary data location table 810 includes both direct entries and indirect entries.
[0141] The direct entry includes a device ID/block pair. The device ID indicates the smart storage unit on which the data is stored, and the offset or block address indicates the location on the storage device where the data is stored. One sample entry in the data location table may be:
[0142]
indicating that Block 1 of the data is stored on device number 7 at block 127.
| Entry | Device | Block |
|---|---|---|
| 1 | 7 | 127 |
indicating that Block 1 of the data is stored on device number 7 at block 127.
[0143] The sample data location table 810 may also include indirect entries which point to additional data location tables enabling a data location table to track data locations for a larger set of data. While the level of indirect entries is theoretically unlimited, the levels may advantageously be limited so as to improve throughput rates. For example, the data location table may be limited to only allow at most double-indirect entries or at most triple-indirect entries. The exemplary data location table 810 illustrates two levels of indirect entries.
[0144] Further, the last entry of the data location table may be reserved to store the address of the parity map (if any). In other examples, the address of the parity map may be stored in other locations, such as, for example, as an entry in the metadata data structure. If a set of data does not include parity protection, the address value may be set to a standard value, such as NULL.
[0145] FIG. 8B illustrates a data location table for data that has been mirrored in two additional locations. The data location table includes a device ID and a block or offset address for each copy of the data. In the exemplary data location table, the mirrored locations have been selected on a block-by-block basis. It is recognized that other schemes may be used such as, for example, selecting one or more smart storage units to mirror specific smart storage units. While the data location table in FIG. 8B includes only direct entries, it is recognized that indirect entries may also be used.
[0146] In one embodiment, the mirroring information for a file may be stored in the file's corresponding metadata structure. This information may include, for example, number of copies of the data, as well as the locations of the data location table for each copy. It is recognized that the data location tables may be stored as a single data structure, and/or separate copies of the data location tables may be stored in different locations.
[0147] The sample data location table of FIG. 8B with mirrored data does not include parity protection though it is recognized that the data location table may include parity information.
[0148] FIG. 8C illustrates a data location table with a parity map. In the exemplary data location table, the data is being protected using a 3+1 parity scheme, that is a set of parity data is being created from every three blocks of data. Techniques well known in the art for creating data may be used, such as, for example, by XORing the blocks of data together on a bit-by-bit, byte-by-byte, or block-by-block basis to create a parity block.
[0149] The exemplary data location table provides information about a data file that consists of 21 data blocks (block 0 to block 20). Because the parity scheme is 3+1, a parity block is created for each set of three data blocks. Table 2 illustrates the correspondence between some of the data blocks and some of the parity blocks shown in FIG. 8C .
[0150]
| TABLE 2 | ||||
|---|---|---|---|---|
| Data Blocks | Parity Blocks | |||
| 0 | 1 | 2 | 0 | |
| Device 5 | Device 9 | Device 7 | Device 0 | |
| Block 100 | Block 200 | Block 306 | Block 001 | |
| 3 | 4 | 5 | 1 | |
| Device 5 | Device 9 | Device 7 | Device 8 | |
| Block 103 | Block 203 | Block 303 | Block 001 | |
[0151] The sample data location table includes a parity map or parity location table. In the exemplary parity map, there is a one to one mapping between the set of block entries used to create data and the parity map. In other embodiments, the parity map also includes variable size entries which specify which blocks, by device and block number, may be parity XORed together to regenerate the data, in the event that it is not available in any of its direct locations, due to device failure. In other embodiments, the parity generation scheme is pre-set such that the location and correspondence of parity data may be determined by the intelligent distributed file system 110 without specifying the blocks which should be XORed together to regenerate data.
[0152] In one embodiment, the parity map is pointed to by the metadata data structure, such as, for example, in the last entry of the metadata data structure, rather than included in the metadata data structure. This map may be pointed to, instead of included directly in the metadata structure because its usage may only be required in the uncommon case of a failed smart storage unit 114. The parity map may also use variable sized entries to express the parity recombine blocks enabling the smart storage unit 114 to traverse the parity map a single time while rebuilding the data and to parse the parity map as it is traversed. In some situations, the compute and I/O time to retrieve and parse an entry is negligible compared to the parity compute time.
[0153] The sample data location table 810 of FIG. 8C with parity location information does not include mirroring information or indirect entries, though it is recognized that one or both may be used in conjunction with the parity location information. Further, it is recognized that other data structures may be used and that the data location table data structure is meant to only illustrate one embodiment of the invention.
[0154] C. Sample Data
[0155] FIG. 9 illustrates a sample data location table 910 and parity map 920 and the corresponding devices on which the data is stored. The example of FIG. 9 shows how data may be stored in varying locations on the devices, that the “stripes” of data are stored across different offset addresses on each device, and that the parity data may be stored in various devices, even for data from the same file. In other embodiments, the data may be stored at the same offset address on each device.
[0156] For example, the parity data for the first stripe is stored on device 3 at location 400 and relates to data block 0 stored on device 0 at location 100, data block 1 stored on device 1 at location 200, and data block 2 stored on device 2 at location 300. The parity data for the second stripe is stored on device 2 at location 600 and relates to data block 3 stored on device 0 at location 300, data block 4 stored on device 4 at location 800, and data block 5 stored on device 1 at location 700.
[0157] In some embodiments, the individual device decides where and/or how to map the locations to the actual locations on disk. For example, if device 0 has 4 physical hard disks, and each hard disk has the storage capacity for 100 blocks, then device 0 would allow for storage to location 0 to location 399. One sample set of guidelines that may be used to determine how the location maps to the block on disk is as follows:
[0158] Disk number=floor of (location/number of blocks per disk)
[0159] Block on disk=location MOD number of blocks per disk.
[0160] Note that MOD is a modulus operator that takes the remainder of a division. It is understood that the guidelines above represent only a sample of the guidelines that may be used for mapping locations to disk and disk block, and that many other guidelines or schemes could be used. For example, one embodiment may utilize a linked list of block ranges representing each disk and conduct a list traversal. A linked list has the advantage of allowing for multiple sized disks.
[0161] Due to the flexibility of the storage of data and parity information, as new smart storage units are added, new data may be stored on the new smart storage units and/or existing data may be moved to the new smart storage units (e.g., by making a copy before deleting the data on the existing unit) without disrupting the system. In addition, data blocks or entire files may be moved or copied in real-time in response to high request volume, disk failure, changes in redundancy or parity parameters, and so forth.
VII. Intelligent Distributed File System Processes
[0162] A. Retrieving Data
[0163] FIG. 10 illustrates one embodiment of a flow chart for retrieving data (“retrieve data process”). A variety of data types may be retrieved, such as, for example, directory metadata, file metadata, content data, and so forth.
[0164] Beginning at a start state, the retrieve data process receives the location at which the data is stored (block 1010). In one embodiment, the location may be designated using a smart storage unit ID and an offset or block address. In other embodiments, the storage device's ID may be used, whereas in other embodiments, a table may be used to map the IDs onto other IDs, and so forth.
[0165] Next, the retrieve data process determines whether the data is stored locally (block 1020). If the data is stored locally, then the retrieve data process retrieves the data from local storage (block 1030). In one embodiment, the retrieve data process may first check the cache and if the data is not there, then check the storage device. In other embodiments, the retrieve data process may check only the storage device.
[0166] If the data is not stored locally, then the retrieve data process sends a request for the data to the smart storage unit on which the data is stored (block 1040). In one embodiment, the request is sent via the switch component 125 shown in FIG. 1 . The receive data process then receives the requested data (block 1050).
[0167] The retrieve data process collects the data that has been requested and returns the data (block 1060). In some embodiments, the data is returned after the entire set of data has been collected. In other embodiments, portions or sets of the data are returned as the data is retrieved form local storage or received from other smart storage units. The portions may be return in sequential order according to the file location table or they may be returned as they are retrieved or received. After the data has been returned, the retrieve data process proceeds to an end state.
[0168] It is recognized that FIG. 10 illustrates one embodiment of a retrieve data process and that other embodiments may be used. In another example, more than one retrieve data process may be used at the same time such that data is being retrieved by multiple retrieve data processes in parallel using techniques or combination of techniques, such as, for example, parallel processing, pipelining, or asynchronous I/O.
[0169] B. Processing Name Lookups
[0170] FIG. 11 illustrates one embodiment of a process for name lookups (“name lookup process”). Beginning at a start state, the name lookup process receives a file name (block 1110), retrieves the root directory's metadata, and sets the location of the root metadata as CURRENT (block 1120). In one embodiment, the root directory's data may be stored in a data structure, such as the data structure of FIG. 5 , though it is recognized that a variety of data structures may be used to store the root directory's metadata. Furthermore, in some embodiments, the root directory's metadata may be stored with each smart storage unit 114 such that each smart storage unit 114 has the same or a similar copy of the root directory's metadata. In other embodiments, the root directory's metadata may be stored in other locations in the intelligent distributed file system 110 or sent to the smart storage units 114 with a file request. It is recognized that well known techniques for ensuring the integrity of multiple copies of the data may be used, such as, for example, locking via mutexes and/or semaphores, and so forth.
[0171] The name lookup process may then retrieve the next token that is part of the file's name (block 1130). The name lookup process then requests the address of the location of the token's metadata from the smart storage unit 114 which stores the data for CURRENT (block 1140). This request may be local or remote. The name lookup process may then set the returned address as CURRENT (block 1150) and determine whether there is another token (block 1160), where a token represents a single level in a directory hierarchy. If there is another token, the name lookup process returns to block 1130. If there are no more tokens, the name lookup process returns the value of or a reference to CURRENT (block 1170) and proceeds to an end state.
[0172] It is recognized that other implementations of a name lookup process may be used. For example, the name lookup process may retrieve the file's metadata data. In addition, once the location of the requested data is found, the name lookup process may determine whether the data is stored locally or with other smart storage units. If the data is stored locally, the name lookup process may send a READ request to the local block manager module 335 of the smart storage unit 114; if the data is stored on another smart storage unit, the name lookup process may send the READ request to the remote block manager module 337 of the remote smart storage unit 114.
[0173] C. Processing a File Request
[0174] FIG. 12 illustrates one embodiment of a flow chart for processing a file request (“file request process”). Beginning at a start state, the file request process receives a request to retrieve a file (block 1210). In one embodiment, the file is designated using the file's full path name, including location and file name. In other embodiments, the path may be a relative path and/or other data structures, such as tables, may be used to store information about the file's address. Next, the file request process performs a name lookup process, such as that illustrated in FIG. 11 (block 1220), to determine the location of the file's metadata data structure.
[0175] The file request process may then retrieve the file's metadata (block 1230) using a retrieve file process such as that shown in FIG. 10 and discussed above, though other retrieve file processes may be used. In one embodiment, the file's metadata may include a data location table that provides access to the locations in which each block of data in the file is stored throughout the intelligent distributed file system.
[0176] Then, for each block of data in the file (blocks 1240, 1270), the file request process obtains the location of the data block (block 1250) by looking it up in the file's metadata and retrieves the data block (block 1260) using a retrieve file process such as that shown in FIG. 10 and discussed above, though other retrieve file processes may be used.
[0177] The file request process then returns the file's data (block 1280) and proceeds to an end state. In some embodiments, the file is returned after the entire set of data has been collected. In other embodiments, one or more blocks of data may be returned as the data is retrieved. The portions may be return in sequential order according to the file location table or they may be returned as they are retrieved or received. In one embodiment, the file request process may put the data blocks in order and/or other modules, such as a streaming server may order the data blocks. After the data has been returned, the retrieve data process proceeds to an end state.
[0178] It is recognized that FIG. 12 illustrates one embodiment of a file request process and that other embodiments may be used. For example, the file request process may determine the file's location using a different name lookup process than that shown in FIG. 11 . In another example, more than one retrieve data process may be used at the same time to retrieve the data blocks enabling the data to be retrieved by multiple retrieve data processes in parallel using techniques or a combination of techniques, such as, for example, parallel processing, pipelining, or asynchronous I/O.
[0179] D. Parity Generation Process
[0180] FIG. 13 illustrates one embodiment of a flow chart for generating parity information (“parity generation process”). Beginning at a start state, the parity generation process receives parity scheme information related to a set of data (block 1310). The set of data may represent file data, file metadata, directory metadata, a subset of file data, and so forth. The parity generation process receives data location information related to the set of data (block 1320). Next, for each set of parity data (block 1330, 1370), the parity generation process retrieves a set of data (block 1340). For example, if the parity is 3+1, the parity generation process retrieves the first three blocks of data using a data retrieve process such as that shown in FIG. 10 . Next, the parity generation process generates the parity data for the set of data (block 1350), such as, performing an XOR operation of the data on a bit-by-bit, byte-by-byte, or block-by-block basis. The parity generation process may then store the data in a buffer and return to block 1330 until the parity information for the set of data has been generated. After the parity information has been generated, the parity generation process determines where to store the parity data (block 1380). The parity generation process may use a rotating parity scheme, wherein each parity block for each successive strip of file data is stored on the next device in the rotation. The parity generation process allocates the parity block on a different device than any of the devices which are holding data for the current stripe to ensure in the event of a device failure that parity information is not lost at the same time as data information. The parity generation process may also take into account other factors, such as storage capacity, CPU utilization, and network utilization to eliminate some devices from being considered for parity storage. The parity generation process then stores the buffered data in the allocated space (block 1390), records the location of the parity data in a parity map (block 1395), and returns to an end state.
[0181] It is recognized that FIG. 13 illustrates one embodiment of a parity generation process and that other embodiments may be used. For example, the parity generation may retrieve blocks of data in parallel and generate parity information in parallel or using well known pipelining or asynchronous I/O techniques. Further, the parity generation process may store the parity information and the location of the parity information without writing to a temporary buffer or the parity generation process may return the parity data or a pointer to the parity data.
[0182] E. Data Recovery Process
[0183] FIG. 14 illustrates one embodiment of a flow chart for recovering lost or corrupt data (“data recovery process”). Beginning at a start state, the data recovery process receives information regarding the parity scheme used (block 1410). The data recovery process then receives information about the failed or corrupt disk or data (block 1420). Next, the data recovery process receives address information for the parity block group in which the missing or corrupt data is assigned (block 1430). The data recovery process then retrieves the data blocks from the available smart storage units (block 1440). The data may be retrieved using a retrieve data process such as that of FIG. 10 . The data recovery process performs error correction (block 1450), such as XORing the blocks according to the parity scheme and stores the result in a buffer (block 1460). The data in the buffer represents the missing data. The data recovery process may then return the data in the buffer (block 1470) and proceeds to an end state.
[0184] It is recognized that FIG. 14 illustrates one embodiment of a data recovery process and that other embodiments may be used. For example, the data recovery process may return the restored data without storing it.
VIII. Conclusion
[0185] While certain embodiments of the invention have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the present invention. Accordingly, the breadth and scope of the present invention should be defined in accordance with the following claims and their equivalents.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A distributed file storage system comprising:
a plurality of storage units, comprising:
a first storage unit comprising a first processing module;
a second storage unit comprising a second processing module; and
a third storage unit comprising a third processing module, the third storage unit different from the first storage unit and the second storage unit;
wherein the first processing module, the second processing module, and the third processing module are configured to process read requests for files stored in a distributed manner across the plurality of storage units;
a file stored in a distributed manner across the plurality of storage units, the file comprising:
a first file portion stored in the first storage unit; and
a second file portion stored in the second storage unit, wherein the second file portion is different from the first file portion; and
file metadata comprising identifications of storage units in which the first file portion and the second file portion are stored and a reference to a parity map, the parity map comprising identifications of storage units in which parity blocks for the file are stored, at least a first portion of the file metadata stored in the third storage unit;
each of the first processing module, the second processing module, and the third processing module further configured to, in real-time:
receive the first portion of file metadata stored in the third storage unit;
receive the first file portion stored in the first storage unit and the second file portion stored in the second storage unit;
generate a parity block based on at least the first file portion and the second file portion;
select a fourth storage unit from the plurality of storage units on which to store the parity block based on one or more of a storage capacity, processor utilization and network utilization of one or more of the plurality of storage units, the fourth storage unit different from the first storage unit and the second storage unit to permit data recovery if the first storage unit or the second storage unit is unavailable;
store the parity block on the fourth storage unit; and
update the parity map to comprise an identification of the fourth storage unit.
2. The system of claim 1, further comprising directory metadata to identify the location of the file metadata.
3. The system of claim 1, further comprising a switch module in communication with the plurality of storage units, the switch module configured to receive a read request for the file stored on the distributed file storage system and to send the read request to any one of the plurality of storage units.
4. The system of claim 1, wherein each of the plurality of storage units comprises at least one executable software module for flexibly distributing across the plurality of storage units at least one of the following: the file metadata, a copy of the file metadata, the first file portion, and the second file portion.
5. The system of claim 1, wherein the file metadata further comprises identifications of blocks in memories of the storage units in which the first file portion and the second file portion are stored.
6. The system of claim 1, further comprising mirrored file portions of the first file portion and the second file portion, and wherein the file metadata further comprises identifications of storage units in which the mirrored file portions are stored.
7. The system of claim 1, wherein each of the first processing module, the second processing module, and the third processing module are further configured to:
monitor an access pattern for the file; and
automatically replicate or delete the file in response to a change in the access pattern.
8. The system of claim 2, wherein each of the first processing module, the second processing module, and the third processing module are further configured to access the directory metadata, the directory metadata stored on a fifth storage unit.
Patent Citations (259)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5163131(A) | 1992-11-01 | Row et al. | Applicant |
| US5181162(A) | 1993-01-01 | Smith et al. | Applicant |
| US5212784(A) | 1993-05-01 | Sparks | Applicant |
| US5230047(A) | 1993-07-01 | Frey et al. | Applicant |
| US5251206(A) | 1993-10-01 | Calvignac et al. | Applicant |
| US5258984(A) | 1993-11-01 | Menon et al. | Applicant |
| US5329626(A) | 1994-07-01 | Klein et al. | Applicant |
| US5359594(A) | 1994-10-01 | Gould et al. | Applicant |
| US5403639(A) | 1995-04-01 | Belsan et al. | Applicant |
| US5548724(A) | 1996-08-01 | Akizawa et al. | Applicant |
| US5596709(A) | 1997-01-01 | Bond et al. | Applicant |
| US5612865(A) | 1997-03-01 | Dasgupta | Applicant |
| US5649200(A) | 1997-07-01 | Leblang et al. | Examiner |
| US5657439(A) | 1997-08-01 | Jones et al. | Applicant |
| US5668943(A) | 1997-09-01 | Attanasio et al. | Applicant |
| US5680621(A) | 1997-10-01 | Korenshtein | Applicant |
| US5694593(A) | 1997-12-01 | Baclawski | Applicant |
| US5696895(A) | 1997-12-01 | Hemphill et al. | Applicant |
| US5734826(A) | 1998-03-01 | Olnowich et al. | Applicant |
| US5761659(A) | 1998-06-01 | Bertoni | Applicant |
| US5774643(A) | 1998-06-01 | Lubbers et al. | Applicant |
| US5799305(A) | 1998-08-01 | Bortvedt et al. | Applicant |
| US5805578(A) | 1998-09-01 | Stirpe et al. | Applicant |
| US5805900(A) | 1998-09-01 | Fagen et al. | Applicant |
| US5806065(A) | 1998-09-01 | Lomet | Applicant |
| US5822790(A) | 1998-10-01 | Mehrotra | Applicant |
| US5862312(A) | 1999-01-01 | Mann et al. | Applicant |
| US5870563(A) | 1999-02-01 | Roper et al. | Applicant |
| US5878410(A) | 1999-03-01 | Zbikowski et al. | Applicant |
| US5878414(A) | 1999-03-01 | Hsiao et al. | Applicant |
| US5884046(A) | 1999-03-01 | Antonov | Applicant |
| US5884098(A) | 1999-03-01 | Mason, Jr. | Applicant |
| US5884303(A) | 1999-03-01 | Brown | Applicant |
| US5890147(A) | 1999-03-01 | Peltonen et al. | Applicant |
| US5917998(A) | 1999-06-01 | Cabrera et al. | Applicant |
| US5933834(A) | 1999-08-01 | Aichelen | Applicant |
| US5943690(A) | 1999-08-01 | Dorricott et al. | Applicant |
| US5966707(A) | 1999-10-01 | Van Huben et al. | Examiner |
| US5996089(A) | 1999-11-01 | Mann et al. | Applicant |
| US6021414(A) | 2000-02-01 | Fuller | Applicant |
| US6029168(A) | 2000-02-01 | Frey | Applicant |
| US6038570(A) | 2000-03-01 | Hitz et al. | Applicant |
| US6044367(A) | 2000-03-01 | Wolff | Applicant |
| US6052759(A) | 2000-04-01 | Stallmo et al. | Applicant |
| US6055543(A) | 2000-04-01 | Christensen et al. | Applicant |
| US6070172(A) | 2000-05-01 | Lowe | Applicant |
| US6081833(A) | 2000-06-01 | Okamoto et al. | Applicant |
| US6081883(A) | 2000-06-01 | Popelka et al. | Applicant |
| US6108759(A) | 2000-08-01 | Orcutt et al. | Applicant |
| US6117181(A) | 2000-09-01 | Dearth et al. | Applicant |
| US6122754(A) | 2000-09-01 | Litwin et al. | Applicant |
| US6138126(A) | 2000-10-01 | Hitz et al. | Applicant |
| US6154854(A) | 2000-11-01 | Stallmo | Applicant |
| US6173374(B1) | 2001-01-01 | Heil et al. | Applicant |
| US6209059(B1) | 2001-03-01 | Ofer et al. | Applicant |
| US6219693(B1) | 2001-04-01 | Napolitano et al. | Applicant |
| US6321345(B1) | 2001-11-01 | Mann et al. | Applicant |
| US6334168(B1) | 2001-12-01 | Islam et al. | Applicant |
| US6353823(B1) | 2002-03-01 | Kumar | Applicant |
| US6384626(B2) | 2002-05-01 | Tsai et al. | Applicant |
| US6385626(B1) | 2002-05-01 | Tamer et al. | Applicant |
| US6393483(B1) | 2002-05-01 | Latif et al. | Applicant |
| US6397311(B1) | 2002-05-01 | Capps | Applicant |
| US6405219(B2) | 2002-06-01 | Saether et al. | Applicant |
| US6408313(B1) | 2002-06-01 | Campbell et al. | Applicant |
| US6421781(B1) | 2002-07-01 | Fox et al. | Applicant |
| US6434574(B1) | 2002-08-01 | Day et al. | Applicant |
| US6449730(B2) | 2002-09-01 | Mann et al. | Applicant |
| US6453389(B1) | 2002-09-01 | Weinberger et al. | Applicant |
| US6457139(B1) | 2002-09-01 | D'Errico et al. | Applicant |
| US6463442(B1) | 2002-10-01 | Bent et al. | Applicant |
| US6499091(B1) | 2002-12-01 | Bergsten | Applicant |
| US6502172(B2) | 2002-12-01 | Chang | Applicant |
| US6502174(B1) | 2002-12-01 | Beardsley et al. | Applicant |
| US6523130(B1) | 2003-02-01 | Hickman et al. | Applicant |
| US6526478(B1) | 2003-02-01 | Kirby | Applicant |
| US6546443(B1) | 2003-04-01 | Kakivaya et al. | Applicant |
| US6549513(B1) | 2003-04-01 | Chao et al. | Applicant |
| US6557114(B2) | 2003-04-01 | Mann et al. | Applicant |
| US6567894(B1) | 2003-05-01 | Hsu et al. | Applicant |
| US6567926(B2) | 2003-05-01 | Mann et al. | Applicant |
| US6571244(B1) | 2003-05-01 | Larson | Applicant |
| US6571349(B1) | 2003-05-01 | Mann | Applicant |
| US6574745(B2) | 2003-06-01 | Mann | Applicant |
| US6594655(B2) | 2003-07-01 | Tal et al. | Applicant |
| US6594660(B1) | 2003-07-01 | Berkowitz et al. | Applicant |
| US6598174(B1) | 2003-07-01 | Parks et al. | Applicant |
| US6618798(B1) | 2003-09-01 | Burton et al. | Applicant |
| US6662184(B1) | 2003-12-01 | Friedberg | Applicant |
| US6671686(B2) | 2003-12-01 | Pardon et al. | Applicant |
| US6671704(B1) | 2003-12-01 | Gondi et al. | Applicant |
| US6732125(B1) | 2004-05-01 | Autrey et al. | Applicant |
| US6848029(B2) | 2005-01-01 | Coldewey | Applicant |
| US6895534(B2) | 2005-05-01 | Wong et al. | Applicant |
| US6907011(B1) | 2005-06-01 | Miller et al. | Applicant |
| US6917942(B1) | 2005-07-01 | Burns et al. | Applicant |
| US6922696(B1) | 2005-07-01 | Lincoln et al. | Applicant |
| US6934878(B2) | 2005-08-01 | Massa et al. | Applicant |
| US6940966(B2) | 2005-09-01 | Lee | Applicant |
| US6954435(B2) | 2005-10-01 | Billhartz et al. | Applicant |
| US6990604(B2) | 2006-01-01 | Binger | Applicant |
| US6990611(B2) | 2006-01-01 | Busser | Applicant |
| US7007044(B1) | 2006-02-01 | Rafert et al. | Applicant |
| US7007097(B1) | 2006-02-01 | Huffman et al. | Applicant |
| US7017003(B2) | 2006-03-01 | Murotani et al. | Applicant |
| US7043485(B2) | 2006-05-01 | Manley et al. | Applicant |
| US7069320(B1) | 2006-06-01 | Chang et al. | Applicant |
| US7111305(B2) | 2006-09-01 | Solter et al. | Applicant |
| US7124264(B2) | 2006-10-01 | Yamashita | Applicant |
| US7146524(B2) | 2006-12-01 | Patel et al. | Examiner |
| US7152182(B2) | 2006-12-01 | Ji et al. | Applicant |
| US7177295(B1) | 2007-02-01 | Sholander et al. | Applicant |
| US7184421(B1) | 2007-02-01 | Liu et al. | Applicant |
| US7225204(B2) | 2007-05-01 | Manley et al. | Applicant |
| US7228299(B1) | 2007-06-01 | Harmer et al. | Applicant |
| US7240235(B2) | 2007-07-01 | Lewalski-Brechter | Applicant |
| US7249118(B2) | 2007-07-01 | Sandler et al. | Applicant |
| US7257257(B2) | 2007-08-01 | Anderson et al. | Applicant |
| US7313614(B2) | 2007-12-01 | Considine et al. | Applicant |
| US7318134(B1) | 2008-01-01 | Oliveira et al. | Applicant |
| US7373426(B2) | 2008-05-01 | Jinmei et al. | Applicant |
| US7440966(B2) | 2008-10-01 | Adkins et al. | Applicant |
| US7451341(B2) | 2008-11-01 | Okaki et al. | Applicant |
| US7509448(B2) | 2009-03-01 | Fachan et al. | Applicant |
| US7533298(B2) | 2009-05-01 | Smith et al. | Applicant |
| US7546354(B1) | 2009-06-01 | Fan et al. | Applicant |
| US7546412(B2) | 2009-06-01 | Ahmad et al. | Applicant |
| US7571348(B2) | 2009-08-01 | Deguchi et al. | Applicant |
| US7680836(B2) | 2010-03-01 | Anderson et al. | Applicant |
| US7680842(B2) | 2010-03-01 | Anderson et al. | Applicant |
| US2001/0042224(A1) | 2001-11-01 | Stanfill et al. | Applicant |
| US2001/0047451(A1) | 2001-11-01 | Noble et al. | Applicant |
| US2001/0056492(A1) | 2001-12-01 | Bressoud et al. | Applicant |
| US2002/0010696(A1) | 2002-01-01 | Izumi | Applicant |
| US2002/0035668(A1) | 2002-03-01 | Nakano et al. | Applicant |
| US2002/0038436(A1) | 2002-03-01 | Suzuki | Applicant |
| US2002/0055940(A1) | 2002-05-01 | Elkan | Applicant |
| US2002/0072974(A1) | 2002-06-01 | Pugliese et al. | Applicant |
| US2002/0075870(A1) | 2002-06-01 | de Azevedo et al. | Applicant |
| US2002/0078180(A1) | 2002-06-01 | Miyazawa | Applicant |
| US2002/0083078(A1) | 2002-06-01 | Pardon et al. | Applicant |
| US2002/0083118(A1) | 2002-06-01 | Sim | Applicant |
| US2002/0087366(A1) | 2002-07-01 | Collier et al. | Applicant |
| US2002/0095438(A1) | 2002-07-01 | Rising et al. | Applicant |
| US2002/0124137(A1) | 2002-09-01 | Ulrich et al. | Applicant |
| US2002/0138559(A1) | 2002-09-01 | Ulrich et al. | Applicant |
| US2002/0156840(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0156891(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0156973(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0156974(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0156975(A1) | 2002-10-01 | Staub et al. | Applicant |
| US2002/0161846(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0161850(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0161973(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0163889(A1) | 2002-11-01 | Yemini et al. | Applicant |
| US2002/0165942(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0166026(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0166079(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0169827(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0174295(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0174296(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0178162(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0191311(A1) | 2002-12-01 | Ulrich et al. | Applicant |
| US2002/0194523(A1) | 2002-12-01 | Ulrich et al. | Applicant |
| US2002/0194526(A1) | 2002-12-01 | Ulrich et al. | Applicant |
| US2002/0198864(A1) | 2002-12-01 | Ostermann et al. | Applicant |
| US2003/0005159(A1) | 2003-01-01 | Kumhyr | Applicant |
| US2003/0014391(A1) | 2003-01-01 | Evans et al. | Examiner |
| US2003/0033308(A1) | 2003-02-01 | Patel et al. | Applicant |
| US2003/0061491(A1) | 2003-03-01 | Jaskiewicz et al. | Applicant |
| US2003/0109253(A1) | 2003-06-01 | Fenton et al. | Applicant |
| US2003/0120863(A1) | 2003-06-01 | Lee et al. | Applicant |
| US2003/0125852(A1) | 2003-07-01 | Schade et al. | Applicant |
| US2003/0131860(A1) | 2003-07-01 | Ashcraft et al. | Applicant |
| US2003/0135514(A1) | 2003-07-01 | Patel et al. | Applicant |
| US2003/0149750(A1) | 2003-08-01 | Franzenburg | Applicant |
| US2003/0158873(A1) | 2003-08-01 | Sawdon et al. | Applicant |
| US2003/0163726(A1) | 2003-08-01 | Kidd | Applicant |
| US2003/0172149(A1) | 2003-09-01 | Edsall et al. | Applicant |
| US2003/0177308(A1) | 2003-09-01 | Lewalski-Brechter | Applicant |
| US2003/0182325(A1) | 2003-09-01 | Manley et al. | Applicant |
| US2004/0003053(A1) | 2004-01-01 | Williams | Applicant |
| US2004/0024731(A1) | 2004-02-01 | Cabrera et al. | Applicant |
| US2004/0024963(A1) | 2004-02-01 | Talagala et al. | Applicant |
| US2004/0078812(A1) | 2004-04-01 | Calvert | Applicant |
| US2004/0133670(A1) | 2004-07-01 | Kaminsky et al. | Applicant |
| US2004/0143647(A1) | 2004-07-01 | Cherkasova | Applicant |
| US2004/0153479(A1) | 2004-08-01 | Mikesell et al. | Applicant |
| US2004/0189682(A1) | 2004-09-01 | Troyansky et al. | Applicant |
| US2004/0199734(A1) | 2004-10-01 | Rajamani et al. | Applicant |
| US2004/0199812(A1) | 2004-10-01 | Earl et al. | Applicant |
| US2004/0205141(A1) | 2004-10-01 | Goland | Applicant |
| US2004/0230748(A1) | 2004-11-01 | Ohba | Applicant |
| US2004/0260673(A1) | 2004-12-01 | Hitz et al. | Applicant |
| US2005/0010592(A1) | 2005-01-01 | Guthrie | Applicant |
| US2005/0066095(A1) | 2005-03-01 | Mullick et al. | Applicant |
| US2005/0114402(A1) | 2005-05-01 | Guthrie | Applicant |
| US2005/0114609(A1) | 2005-05-01 | Shorb | Applicant |
| US2005/0131860(A1) | 2005-06-01 | Livshits | Applicant |
| US2005/0171960(A1) | 2005-08-01 | Lomet | Applicant |
| US2005/0171962(A1) | 2005-08-01 | Martin et al. | Applicant |
| US2005/0188052(A1) | 2005-08-01 | Ewanchuk et al. | Applicant |
| US2005/0192993(A1) | 2005-09-01 | Messinger | Applicant |
| US2005/0289169(A1) | 2005-12-01 | Adya et al. | Applicant |
| US2005/0289188(A1) | 2005-12-01 | Nettleton et al. | Applicant |
| US2006/0004760(A1) | 2006-01-01 | Clift et al. | Applicant |
| US2006/0041894(A1) | 2006-02-01 | Cheng et al. | Applicant |
| US2006/0047925(A1) | 2006-03-01 | Perry | Applicant |
| US2006/0059467(A1) | 2006-03-01 | Wong | Applicant |
| US2006/0074922(A1) | 2006-04-01 | Nishimura | Applicant |
| US2006/0083177(A1) | 2006-04-01 | Iyer et al. | Applicant |
| US2006/0095438(A1) | 2006-05-01 | Fachan et al. | Applicant |
| US2006/0101062(A1) | 2006-05-01 | Godman et al. | Applicant |
| US2006/0129584(A1) | 2006-06-01 | Hoang et al. | Applicant |
| US2006/0129631(A1) | 2006-06-01 | Na et al. | Applicant |
| US2006/0129983(A1) | 2006-06-01 | Feng | Applicant |
| US2006/0155831(A1) | 2006-07-01 | Chandrasekaran | Applicant |
| US2006/0230411(A1) | 2006-10-01 | Richter et al. | Applicant |
| US2006/0277432(A1) | 2006-12-01 | Patel et al. | Applicant |
| US2006/0288161(A1) | 2006-12-01 | Cavallo | Applicant |
| US2007/0091790(A1) | 2007-04-01 | Passey et al. | Applicant |
| US2007/0094269(A1) | 2007-04-01 | Mikesell et al. | Applicant |
| US2007/0094277(A1) | 2007-04-01 | Fachan et al. | Applicant |
| US2007/0094310(A1) | 2007-04-01 | Passey et al. | Applicant |
| US2007/0094431(A1) | 2007-04-01 | Fachan | Applicant |
| US2007/0094452(A1) | 2007-04-01 | Fachan | Applicant |
| US2007/0168351(A1) | 2007-07-01 | Fachan | Applicant |
| US2007/0171919(A1) | 2007-07-01 | Godman et al. | Applicant |
| US2007/0195810(A1) | 2007-08-01 | Fachan | Applicant |
| US2007/0233684(A1) | 2007-10-01 | Verma et al. | Applicant |
| US2007/0233710(A1) | 2007-10-01 | Passey et al. | Applicant |
| US2008/0005145(A1) | 2008-01-01 | Worrall | Applicant |
| US2008/0010507(A1) | 2008-01-01 | Vingralek | Applicant |
| US2008/0021907(A1) | 2008-01-01 | Patel et al. | Applicant |
| US2008/0031238(A1) | 2008-02-01 | Harmelin et al. | Applicant |
| US2008/0034004(A1) | 2008-02-01 | Cisler et al. | Applicant |
| US2008/0044016(A1) | 2008-02-01 | Henzinger | Applicant |
| US2008/0046432(A1) | 2008-02-01 | Anderson et al. | Applicant |
| US2008/0046443(A1) | 2008-02-01 | Fachan et al. | Applicant |
| US2008/0046444(A1) | 2008-02-01 | Fachan et al. | Applicant |
| US2008/0046445(A1) | 2008-02-01 | Passey et al. | Applicant |
| US2008/0046475(A1) | 2008-02-01 | Anderson et al. | Applicant |
| US2008/0046476(A1) | 2008-02-01 | Anderson et al. | Applicant |
| US2008/0046667(A1) | 2008-02-01 | Fachan et al. | Applicant |
| US2008/0059541(A1) | 2008-03-01 | Fachan et al. | Applicant |
| US2008/0126365(A1) | 2008-05-01 | Fachan et al. | Applicant |
| US2008/0154978(A1) | 2008-06-01 | Lemar et al. | Applicant |
| US2008/0168458(A1) | 2008-07-01 | Fachan et al. | Applicant |
| US2008/0294611(A1) | 2008-11-01 | Anglin et al. | Applicant |
| EP774723 | 1997-05-01 | Applicant | |
| WO94/29796 | 1994-12-01 | Applicant | |
| WO/57315 | 2000-09-01 | Applicant | |
| WO1/14991 | 2001-03-01 | Applicant | |
| WO1/33829 | 2001-05-01 | Applicant | |
| WO2/061737 | 2002-08-01 | Applicant | |
| WO3/012699 | 2003-02-01 | Applicant | |
| WO2004/046971 | 2004-06-01 | Applicant | |
| WO2008/021527 | 2008-02-01 | Applicant | |
| WO2008/021528 | 2008-02-01 | Applicant |
Non-Patent Literature (125)
- May 8, 2008 Int'l Search report PCT/US07/018324, 13 pages.Applicant
- Kumar, Akhil, “An analysis of borrowing policies for escrow transactions in a replicated data environment”, Institute of Electrical and Electronics Engineers; Proceedings of the International Conference on Data Engineering, Los Angeles, Feb. 5-9, 1990; Los Alamitos, IEEE, Comp. Soc. Press, US. vol. Conf. 6, Feb. 5, 1990, pp. 446-454, XP010018185 ISBN: 978-0-8186-2025-6 p. 446, left-hand column, line 1—p. 447, last line.Applicant
- MCSA/MSCE/MCDBA Self Paced Training Kit: MS SQL Server 2000 System Administration, May 14, 2003, Microsoft Press, Second Edition, 12 pages.Applicant
- Supp Epo Search Report, App. No. EP 03 78 3599; dated Apr. 29, 2008, 2 pages.Applicant
- Levy E., Ed.—Institute of Electrical and Electronics Engineers: “Incremental restart (database management)” Proc. Int. Conf. Data Eng., Kobe, JP, Apr. 8-12, 1991; IEEE Comp. Soc. Press, U.S., vol. Conf. 7, Apr. 8, 1991, pp. 640-648.Applicant
- Haerder T et al: “Principles of Transaction-Oriented Database Recovery” ACM Computing Surveys, ACM, New York, NY, US, vol. 15, No. 4, Dec. 1, 1983, pp. 287-317.Applicant
- Gray J et al: “Transaction processing: concepts and techniques (excerpt), Passage” Transaction Processing: Concepts and Techniques, Jan. 1, 1993, pp. 373-445.Applicant
- Garcia-Molina H et al: “Database System Implementation, passage” Database System Implementation, Jan. 1, 2000, pp. I-V, 423-509.Applicant
- Wedde H. F., et al.: “A universal framework for managing metadata in the distributed Dragon Slayer System”, Proceedings of the Euromicro Conference. Euromicro. Informatics: Inventing the Future, Proceedings of Euromicro Workshop On Multimedia and Telecommunications, vol. 2, Sep. 5, 2000, pp. 96-101.Applicant
- Tanenbaum, Andrew S., MINIX Operating System, Japan, Apr. 21, 1989, 1st Edition, pp. 328, 505; Also attached is what Applicant believes is the English language version: Tanenbaum, Andrew S., Operating Systems: Design and Implementation, Prentice-Hall, 1987, pp. 279, 347, 348.Applicant
- Yamashita, Hirofumi, et al., “Development of RAID Filesystem VAFS/HR,” The Special Interest Group Notes of IPSJ, Japan, Information Processing Society of Japan, Sep. 16, 1994, vol. 94, No. 80, p. 9-16.Applicant
- Dec. 18, 2003 Non-Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Mar. 19, 2004 Response to Dec. 18, 2003 Non-Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Aug. 17, 2004 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Dec. 20, 2004 Response to Aug. 17, 2004 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Mar. 24, 2005 Non-Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Jun. 27, 2005 Response to Mar. 24, 2005 Non-Final Rejection in in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Sep. 15, 2005 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Dec. 15, 2005 Reponse to Sep. 15, 2005 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Mar. 7, 2006 Restriction Requirement in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Apr. 6, 2006 Response to Mar. 7, 2006 Restriction Requirement in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Jun. 14, 2006 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Dec. 18, 2006 Response to Jun. 14, 2006 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Feb. 15, 2007 Final Rejection in in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Jul. 23, 2007 Response to Feb. 15, 2007 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Oct. 12, 2007 Non-Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Apr. 14, 2008 Response to Oct. 12, 2007 Non-Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Jul. 14, 2008 Restriction Requirement in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Aug. 14, 2008 Response to Jul. 14, 2008 Restriction Requirement in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Nov. 28, 2008 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- May 18, 2004 Restriction Requirement in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Jun. 14, 2004 Response to May 18, 2004 Restriction Requirement in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Aug. 30, 2004 Non-Final Rejection in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Dec. 3, 2004 Response to Aug. 30, 2004 Non-Final Rejection in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Jan. 28, 2005 Final Rejection in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Mar. 28, 2005 Response to Jan. 28, 2005 Final Rejection in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Apr. 11, 2005 Advisory Action in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Apr. 28, 2005 Response to Apr. 11, 2005 Advisory Action in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Jun. 13, 2005 Non-Final Rejection in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Dec. 13, 2005 Response to Jun. 13, 2005 Non-Final Rejection in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Feb. 14, 2006 Final Rejection in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Apr. 13, 2006 Response to Feb. 14, 2006 Final Rejection in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- May 9, 2006 Notice of Allowance in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- May 9, 2006 Examiner's Amendment in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Jul. 19, 2006 Supplemental Notice of Allowance in prosecution of U.S. Pat. No. 7,146,524 issued on Dec. 5, 2006.Applicant
- Aug. 9, 2007 Non-Final Rejection in prosecution of U.S. Pat. No. 7,509,524 issued on Mar. 24, 2009.Applicant
- Feb. 15, 2008 Response to Aug. 9, 2007 Non-Final Rejection in prosecution of U.S. Pat. No. 7,509,524 issued on Mar. 24, 2009.Applicant
- May 9, 2008 Restriction Requirement in prosecution of U.S. Pat. No. 7,509,524 issued on Mar. 24, 2009.Applicant
- Oct. 9, 2008 Response to May 9, 2008 Restriction Requirement in prosecution of U.S. Pat. No. 7,509,524 issued on Mar. 24, 2009.Applicant
- Dec. 19, 2008 Notice of Allowance in prosecution of U.S. Pat. No. 7,509,524 issued on Mar. 24, 2009.Applicant
- Aug. 14, 2006 Non-Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Nov. 14, 2006 Response to Aug. 14, 2006 Non-Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Feb. 8, 2007 Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- May 7, 2007 Response to Feb. 8, 2007 Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Jun. 15, 2007 Non-Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Sep. 19, 2007 Response to Jun. 15, 2007 Non-Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Dec. 6, 2007 Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- May 27, 2008 Response to Dec. 6, 2007 Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Aug. 21, 2008 Non-Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Feb. 20, 2009 Response to Aug. 21, 2008 Non-Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Apr. 15, 2009 Supplemental Response to Aug. 21, 2008 Non-Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Nov. 15, 2002 Int'l Search report PCT/US02/24728.Applicant
- Apr. 20, 2004 Int'l Search report PCT/US03/36699.Applicant
- Aug. 6, 2004 Int'l Search report PCT/US03/33704.Applicant
- May 21, 2007 European Search Report EP 02756944.1-2201.Applicant
- Feb. 22, 2008 Int'l Search report PCT/US07/018326.Applicant
- Philip A. Bernstein, Vassos Hadzilacos, and Nathan Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, 370 pages, 1987.Applicant
- Kenneth P. Birman, Building Secure and Reliable Network Applications, Manning, 1996, pp. 1-327.Applicant
- Kenneth P. Birman, Building Secure and Reliable Network Applications, Manning, 1996, pp. 328-619.Applicant
- Birk, Y., Deterministic load-balancing schemes for disk-based video-on-demand storage servers, Mass Storage Systems 1995; Storage—At the Forefront of Information Infrastructures', Proceedings of the Fourteenth IEEE Symposium on Monterey, CA, Sep. 11-14, 1995, pp. 17-25.Applicant
- Coulouris et al., Distributed Systems Concepts and Design; Addison-Wesley, Second Edition, 1994, pp. 353-371 and 377-405.Applicant
- Jim Gray and Andreas Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993, pp. 1-328.Applicant
- Jim Gray and Andreas Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993, pp. 329-664.Applicant
- Jim Gray and Andreas Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993, pp. 665-1105.Applicant
- Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996, pp. 1-409.Applicant
- Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996 pp. 410-871.Applicant
- Sape Mullender, editor, Distributed Systems (2nd Ed.), ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 1993, pp. 1-327.Applicant
- Sape Mullender, editor, Distributed Systems (2nd Ed.), ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 1993, pp. 328-604.Applicant
- Gibson, Garth A. et al., The Scotch Parallel Storage System, IEEE, 1995, pp. 403-410.Applicant
- Gerhard Weikum, et al., Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery, Morgan Kaufmann, 2002, pp. 1-450.Applicant
- Gerhard Weikum, et al., Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery, Morgan Kaufmann, 2002, pp. 451-863.Applicant
- Sanjay Ghemawat et al., The Google File System, Symposium on Operating Systems Principles, Oct. 19-22, 2003, 15 pages, Bolton Landing, NY.Applicant
- Pei Cao et al., The TickerTAIP parallel RAID architecture, 1993, 12 pages, Princeton, NJ.Applicant
- Pei Cao et al., The TickerTAIP parallel RAID architecture, ACM Transactions on Computer Systems, vol. 12, No. 3, Aug. 1994, 34 pages, Palto Alto, California.Applicant
- Duzett, Bob et al., An Overview of the nCube 3 Supercomputer, IEEE, Jul. 1992, pp. 458-464.Applicant
- Hartman, John Henry, The Zebra Striped Network File System, (Sc.B. (Brown University) 1987, pp. 1-148.Applicant
- Long, Darrell D.E., et al., Swift/RAID: A Distributed RAID System, Computing Systems, vol. 7, No. 3 Summer 1994, pp. 333-359.Applicant
- Stallings, William, Operating Systems, Prentice Hall, Fourth Edition; 2001, pp. 197-253 and 265-293.Applicant
- Michael Stonebraker et al., Distributed Raid: A new Multiple copy Algorithm, IEEE 1990, 24 pages, Berkeley, California.Applicant
- United States Court of Appeals, Federal Circuit, Seachange International, Inc. Vs. nCUBE, Corp., Oct. 26, 2004, 28 pages.Applicant
- United States Court of Appeals, Federal Circuit, Seachange International, Inc. Vs. C-Corp, Inc., Jun. 29, 2005, 22 pages.Applicant
- United States District Court, Delaware, Seachange International, Inc. Vs. nCUBE, Corp., Apr. 7, 2004, 13 pages.Applicant
- United States District Court, Delaware, Seachange International, Inc. Vs. nCUBE, Corp., Aug. 29, 2000, 12 pages, Aug. 5, 2009.Applicant
- Steven M. Bauer, Letter to Steve Goldman, Jul. 31, 2006.Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Aug. 7, 2006.Applicant
- Steven M. Bauer, Letter to Arthur S. Rose, Sep. 25, 2006.Applicant
- Steven M. Bauer, Letter to Arthur S. Rose, Oct. 31, 2006.Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Nov. 9, 2006.Applicant
- Steven M. Bauer, Letter to Arthur S. Rose, Feb. 6, 2006.Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Feb. 23, 2007.Applicant
- Steven M. Bauer, Letter to Arthur S. Rose, Jun. 7, 2007.Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Jun. 22, 2007.Applicant
- Todd A. Gerety, Letter to Arthur S. Rose, Jun. 26, 2007.Applicant
- Isilon Systems, “Isilon IQ Plateform Overview”, 1-4.Applicant
- Isilon Systems, “Uncompromising Reliability through Clustered Storage”, Sep. 2006, 1-10.Applicant
- Byteandswitch, “Discovery Chooses Isilon,” Apr. 23, 2007, 1.Applicant
- Taneja Group Technology Analysts, “The Power of InfiniBand and Clustered Storage”, Dec. 2005, 1-8.Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Aug. 31, 2007.Applicant
- Ramez Elmasri, Fundamentals of Database Systems 3rd ed, Sep. 30, 1999, Addison-Wesley, pp. 155, 169, 171, 172, 173, 178, 181, 182, 381, 771.Applicant
- Oct. 8, 2009 Supplementary European Search Report for Appl. No. EP 02 75 6944, 6 pages.Applicant
- Jan. 23, 2009 Examination Report for Appl. No. EP 02 75 6944, 5 pages.Applicant
- May 18, 2009 Int'l Search report PCT/US08/059798, 18 pages.Applicant
- Oct. 22, 2009 Int'l Preliminary Report on Patentability PCT/US08/059798, 10 pages.Applicant
- Keidar, et al.: Increasing the Resilience of Distributed and Replicated Database Systems (1998) pp. 1-25.Applicant
- Lougher P. et al., “Scalable storage servers for digital audio and video,” International Conference on Storage and Recording Systems, 1994, Keele, UK, Jan. 1, 1994, pp. 140-143.Applicant
- Reddy, P. Krishna et al., Reducing the blocking in two phase commit with backup sites Apr. 15, 2003, Elsevier, pp. 39-47.Applicant
- IOS Commands, Feb. 6, 2005, Pantz.org, [online], <web.archive.org/web/20050206184604/http://pantz.org/os/ios/ioscommands.shtml>, pp. 1-12 as printed.Applicant
- IP Forwarding with Cisco Routers Lab Exercises, Jun. 15, 1999 [online], <ws.edu.isoc.org/data1999/1481713642400af6a2de65a/ip—fwd—cisco—config.ppt>, pp. 1-11 as printed.Applicant
- Hisyuki Aoki, Parallel Filesystem MFS, IPSJ SIG Technical Reports, Japan, Information Processing Society of Japan, Aug. 26, 1996, vol. 96, No. 79, pp. 31 to 36 (stamped Citation 1 / English Translation attached) total 23 pages.Applicant
- Yoshitake Shinkai, Cluster File System: HAMFS, Fujitsu, Japan, Fujitsu Limited, Jul. 9, 1999, vol. 50, No. 4, pp. 210 to 214 (stamped Citation 2 / English Translation attached) total 16 pages.Applicant
- May 28, 2009 Response to Nov. 28, 2008 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Aug. 11, 2009 Supplemental Response to Nov. 28, 2008 Final Rejection in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Oct. 16, 2009 Notice of Allowance in U.S. Appl. No. 10/007,003, filed Nov. 9, 2001.Applicant
- Jul. 10, 2009 Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant
- Oct. 13, 2009 Response to Jul. 10, 2009 Final Rejection in U.S. Appl. No. 10/714,326, filed on Nov. 14, 2003.Applicant