US 6,317,844 B1Grant
File server storage arrangement
Issue Date:2001-11-13
•75 Claims
•3 Drawing Sheets
Abstract
The invention provides a storage system that is highly available even in the face of component failures in the storage system, and a method for operating that storage system. A first and a second file server each includes a file server request log for storing incoming file server requests. Both the first and second file servers have access to a common set of mass storage elements. Each incoming file server request is copied to both the first and second file servers; the first file server processes the file server request while the second file server maintains a copy in its file server request log. Each file server operates using a file system that maintains consistent state after each file server request. On failover, the second file server can perform those file server requests in its file server request log since the most recent consistent state. There is no single point of failure that prevents access to any individual mass storage element.
Metadata
Assignee
- Network Appliance, Inc.
Inventor
- Steven Kleiman
Application Information
Application Number:US 09/037,652
Filing Date:1998-03-10
Priority Date:1998-03-10
Art Unit:7
Classifications
IPC:
H02H 305H03K 19003
Field of Search:
714 6714 5714 42714 47711114707 10709216709217709219
Patent Drawings (3 sheets)
Description
Background of the Invention
[0002] 1. Field of the Invention
[0003] The invention relates to storage systems.
[0004] 2. Related Art
[0005] Computer storage systems are used to record and retrieve data. In some computer systems, storage systems communicate with a set of client devices, and provide services for recording and retrieving data to those client devices. Because data storage is important to many applications, it is desirable for the services and data provided by the storage system to be available for service to the greatest degree possible. It is therefore desirable to provide storage systems that can remain available for service even in the face of component failures in the storage system.
[0006] One known technique for providing storage systems that can remain available for service is to provide a plurality of redundant storage elements, with the property that when a first storage element fails, a second storage element is available to provide the services and the data otherwise provided by the first. Transfer of the function of providing services from the first to the second storage element is called “failover.” The second storage element maintains a copy of the data maintained by the first, so that failover can proceed without substantial interruption.
[0007] A first known technique for achieving failover is to cause the second storage element to copy all the operations of the first. Thus, each storage operation completed by the first storage element is also completed by the second. This first known technique is subject to drawbacks: (1) It uses a substantial amount of processing power at the second storage element duplicating efforts of the first, most of which is wasted. (2) It slows the first storage element in confirming completion of operations, because the first storage element waits for the second to also complete the same operations.
[0008] A second known technique for achieving failover is to identify a sequence of checkpoints at which the first storage element is at a consistent and known state. On failover, the second storage element can continue operation from the most recent checkpoint. For example, the NFS (Network File System) protocol requires all write operations to be stored to disk before they are confirmed, so that confirmation of a write operation indicates a stable file system configuration. This second known technique is subject to drawbacks: (1) It slows the first storage element in performing write operations, because the first storage element waits for write operations to be completely stored to disk. (2) It slows recovery on failover, because the second storage element addresses any inconsistencies left by failure of the first between identified checkpoints.
[0009] Accordingly, it would be advantageous to provide a storage system, and a method for operating a storage system, that efficiently uses all storage system elements, quickly completes and confirms operations, and quickly recovers from failure of any storage element. This advantage is achieved in an embodiment of the invention in which the storage system implements frequent and rapid checkpoints, and in which the storage system rapidly distributes duplicate commands for those operations between checkpoints among its storage elements.
Summary of the Invention
[0010] The invention provides a storage system that is highly available even in the face of component failures in the storage system, and a method for operating that storage system. A first and a second file server each includes a file server request log for storing incoming file server requests. Both the first and second file servers have access to a common set of mass storage elements. Each incoming file server request is copied to both the first and second file servers; the first file server processes the file server request while the second file server maintains a copy in its file server request log. Each file server operates using a file system that maintains consistent state after each file server request. On failover, the second file server can perform those file server requests in its file server request log since the most recent consistent state.
[0011] In a second aspect of the invention, a file server system provides mirroring of one or more mass storage elements. Each incoming file server request is copied to both the first file server and the second file server. The first file server performs the file server requests to modify a primary set of mass storage elements, and also performs the same file server requests to modify a mirror set of mass storage elements. The mirror mass storage elements are disposed physically separately from the primary mass storage elements, such as at another site, and provide a resource in the event the entire primary set of mass storage elements is to be recovered.
Brief Description of the Drawings
[0012] FIG. 1 shows a block diagram of a highly available file server system.
[0013] FIG. 2 shows a block diagram of a file server in the file server system.
[0014] FIG. 3 shows a process flow diagram of operation of the file server system.
Detailed Description of the Preferred Embodiment
[0015] In the following description, a preferred embodiment of the invention is described with regard to preferred process steps and data structures. However, those skilled in the art would recognize, after perusal of this application, that embodiments of the invention may be implemented using one or more general purpose processors (or special purpose processors adapted to the particular process steps and data structures) operating under program control, and that implementation of the preferred process steps and data structures described herein using such equipment would not require undue experimentation or further invention.
[0016] File Server Pair and Failover Operation
[0017] FIG. 1 shows a block diagram of a highly available file server system.
[0018] A file server system 100 includes a pair of file servers 110, both coupled to a common set of mass storage devices 120. A first one of the file servers 10 is coupled to a first I/O bus 130 for controlling a first selected subset of the mass storage devices 120. Similarly, a second one of the file servers 110 is coupled to a second I/O bus 130 for controlling a second selected subset of the mass storage devices 120.
[0019] Although both file servers 110 are coupled to all of the common mass storage devices 120, only one file server 110 operates to control any one mass storage device 120 at any designated time. Thus, even though the mass storage devices 120 are each controllable by only one file server 110 at a time, each of the mass storage devices 120 remains available even if one of its two associated file servers 110 fails.
[0020] In a preferred embodiment, the file server system 100 includes a pair of such file servers 110; however, in alternative embodiments, more than two such file servers 110 may be included in a single file server system 100.
[0021] In a preferred embodiment, the first I/O bus 130 and the second I/O bus 130 each include a mezzanine bus such as the PCI bus architecture.
[0022] In a preferred embodiment, the mass storage devices 120 include magnetic disk drives, optical disk drives, or magneto-optical disk drives. In alternative embodiments, however, other storage systems may be used, such as bubble memory, flash memory, or systems using other storage technologies. Components of the mass storage devices 120 are referred to as “disks,” even though those components may comprise other forms or shapes.
[0023] Each mass storage device 120 can include a single disk or a plurality of disks. In a preferred embodiment, each mass storage device 120 includes a plurality of disks and is disposed and operated as a RAID (Redundant Array of Inexpensive Disks) storage system.
[0024] In a preferred embodiment, the first file server 110 is coupled to the second file server 110 using a common interconnect. The common interconnect provides a remote memory access capability for each file server 110, so that data can be stored at each file server 110 from a remote location. In a preferred embodiment, the common interconnect includes a Tandem “ServerNet” interconnect. The common interconnect is coupled to each file server 110 using a device controller coupled to an I/O bus for each file server 110.
[0025] The first file server 110 is coupled to a first network interface 140, which is disposed to receive file server requests 151 from a network 150. Similarly, the second file server 110 is coupled to a second network interface 140, which is also disposed to receive file server requests 151 from the network 150.
[0026] The first file server 110 includes a first server request memory 160 (also referred to as a file server change memory herein), which receives the file server requests 151 and records them. In the event the first file server 110 recovers from a power failure or other service disruption, the outstanding file server requests 151 in the first server request memory 160 are re-performed to incorporate them into a next consistent state of the file system maintained by the first file server 110.
[0027] Similarly, the second file server 110 includes a second server request memory 160 (also referred to as a file server change memory herein), which receives the file server requests 151 and records them. In the event the second file server 110 recovers from a power failure or other service disruption, the outstanding file server requests 151 in the second server request memory 160 are reperformed to incorporate them into a next consistent state of the file system maintained by the second file server 110.
[0028] When the first file server 110 receives a file server request 151 from the network 150, that file server request 151 is copied into the first server request memory 160. The file server request 151 is also copied into the second server request memory 160 using remote memory access over the common interconnect. Similarly, when the second file server 110 receives a file server request 151 from the network 150, that file server request 151 is copied into the second server request memory 160. The file server request 151 is also copied into the first server request memory 160 using remote memory access over the common interconnect. Using remote memory access is relatively quicker and has less communication overhead than using a networking protocol.
[0029] In the event that either file server 110 fails, the other file server 110 can continue processing using the file server requests 151 stored in its own server request memory 160.
[0030] In a preferred embodiment, each server request memory 160 includes a nonvolatile memory, so those file server requests stored in either server request memory 160 are not lost due to power failures or other service interruptions.
[0031] The first and second file servers 110 and their respective server request (change) memories 160 communicate via interconnection(s) 165, which in one embodiment of the invention are implemented in a NUMA (Non-Uniform Memory Access) interconnection network.
[0032] The responding file server 110 processes the file server request 151 and possibly modifies stored files on one of the mass storage devices 120. The non-responding file server 110, partner to the responding file server 110, maintains the file server request 151 stored in its server request memory 160 to prepare for the possibility that the responding file server 110 might fail. In the event the responding file server 110 fails, the non-responding file server 110 processes the file server request 151 as part of a failover technique.
[0033] In a preferred embodiment, each file server 110 controls its associated mass storage devices 120 so as to form a redundant array, such as a RAID storage system, using inventions described in the following patent applications:
[0034] U.S. Pat. No. 5,948,110, issued Sep. 7, 1999, on application Ser. No. 08/471,218, filed Jun. 5, 1995, in the name of inventors David Hitz et al., titled “A Method for Providing Parity in a Raid Sub-System Using Non-Volatile Memory”;
[0035] U.S. Pat. No. 5,819,292, issued Oct. 6, 1998, on application Ser. No. 08/454,921, filed May 31, 1995, in the name of inventors David Hitz et al., titled “Write Anywhere File-System Layout”;
[0036] U.S. Pat. No. 6,038,570, issued Mar. 14, 2000, on application Ser. No. 08/464,591, filed May 31, 1995, in the name of inventors David Hitz et al., titled “Method for Allocating Files in a File System Integrated with a Raid Disk Sub-System”.
[0037] Each of these applications is hereby incorporated by reference as if fully set forth herein. They are collectively referred to as the “WAFL (White Anywhere File System Layout) Disclosures.”
[0038] As part of the techniques shown in the WAFL Disclosures, each file server 110 controls its associated mass storage devices 120 in response to file server requests 151 in an atomic manner. The final action for any file server request 151 is to incorporate the most recent consistent state into the file system 121. Thus, file system 121 is in an internally consistent state after completion of each file server request 151. Thus, a file system 121 defined over the mass storage devices 120 will be found in an internally consistent state, regardless of which file server 110 controls those mass storage devices 120. Exceptions to the internally consistent state will only include a few of the most recent file server requests 151, which will still be stored in the server request memory 160 for both file servers 110. Those most recent file server requests 151 can be incorporated into a consistent state by performing them with regard to the most recent consistent state.
[0039] For any file server request 151, in the event the file server 110 normally responding to that file server request 151 fails, the other file server 110 will recognize the failure and perform a failover method to take control of mass storage devices 120 previously assigned to the failing file server 110. The failover file server 110 will find those mass storage devices 120 with their file system 121 in an internally consistent state, but with the few most recent file server requests 151 as yet unperformed. The failover file server 110 will have copies of these most recent file server requests 151 in its server request memory 160, and will perform these file server requests 151 in response to those copies.
[0040] File Server Node
[0041] FIG. 2 shows a block diagram of a file server in the file server system.
[0042] Each file server 110 includes at least one processor 111, a program and data memory 112, the server request memory 160 (including a nonvolatile RAM), a network interface element 114, and a disk interface element 115. These elements are interconnected using a bus 117 or other known system architecture for communication among processors, memory, and peripherals.
[0043] In a preferred embodiment, the network interface element 114 includes a known network interface for operating with the network 150. For example, the network interface element 114 can include an interface for operating with the FDDI interface standard or the 100Base T interface standard.
[0044] After failover, the file server 110 responds to file server requests directed to either itself or its (failed) partner file server 110. Each file server 110 is therefore capable of assuming an additional network identity on failover, one for itself and one for its failed partner file server 110. In a preferred embodiment, the network interface element 114 for each file server 110 includes a network adapter capable of responding to two separate addresses upon instruction by the file server 110. In an alternative embodiment, each file server 110 may have two such network adapters.
[0045] In a preferred embodiment, the disk interface element 115 includes a known disk interface for operating with magnetic, optical, or magneto-optical disks, that has two independent ports with each port coupled to a separate file server 110, such as the FC-AL interface. This helps prevent failure of one file server 110 from affecting low-level operation of the other file server 110.
[0046] In a preferred embodiment, the bus 117 includes at least a memory bus 171 and the mezzanine bus 130. The memory bus 171 couples the processor 111 and the program and data memory 112. The mezzanine bus 130 couples the network interface element 114 and the disk interface element 115. The memory bus 171 is coupled to the mezzanine bus 130 using an I/O controller 173 or other known bus adapter technique.
[0047] In a preferred embodiment, each disk in the mass storage 120 is statically assigned to either the first file server 110 or the second file server 110, responsive to whether the disk is wired for primary control by either the first file server 110 or the second file server 110. Each disk has two control ports A and B; the file server 110 wired to port A has primary control of that disk, while the other file server 110 only has control of that disk when the other file server 110 has failed.
[0048] Operation Process Flow
[0049] FIG. 3 shows a process flow diagram of operation of the file server system.
[0050] A method 300 is performed by the components of the file server 100, and includes a set of flow points and process steps as described herein.
[0051] At a flow point 310, a device coupled to the network 150 desires to make a file system request 151.
[0052] At a step 311, the device transmits the file system request 151 to the network 150.
[0053] At a step 312, the network 150 transmits the file server request 151 to the file server 110.
[0054] At a step 313, a first file server 110 at the file server system 100 receives the file server request 151. The first file server 110 copies the file server request 151 into the first server request memory 160, and also copies the file server request 151 into the second server request memory 160 using the common interconnect. The target of the copying operation in the second server request memory 160 is to an area reserved for this purpose. The copying operation requires no further processing by the second file server 110, and the second file server 110 does not normally process or respond to the file server request 151.
[0055] At a step 314, the first file server 110 responds to the file server request 151.
[0056] At a flow point 320, the file server request has been successfully processed.
[0057] In a second aspect of the invention, the first file server 110 provides mirroring of one or more of its mass storage devices 120.
[0058] As with the first aspect of the invention, each incoming file server request is copied to both the first file server 110 and the second file server 110. The first file server 110 performs the file server requests to modify one or more primary mass storage devices 120 under its control. The first file server 110 also performs the file server requests to modify a set of mirror mass storage devices 120 under its control, but located distant from the primary mass storage devices 120. Thus, the mirror mass storage devices 120 will be a substantial copy of the primary mass storage devices 120.
[0059] The mirror set of mass storage devices 120 provide a resource in the event the entire primary set of mass storage devices 120 is to be recovered, such as if a disaster befalls the primary set of mass storage devices 120.
[0060] At a flow point 330, the first file server 110 in the file server system 100 fails.
[0061] At a step 331, the second file server 110 in the file server system 100 recognizes the failure of the first file server 110.
[0062] In a preferred embodiment, the second file server 110 performs the step 331 in the following manner:
[0063] Each file server 110 maintains two disks of its mass storage devices 120 (thus, there are a total of four such disks for two file servers 110) for recording state information about the file server 110. There are two such disks (called “mailbox disks”) so that one can be used as primary storage and one can be used as backup storage. If one of the two mailbox disks fails, the file server 110 using that mailbox disk designates another disk as one of its two mailbox disks.
[0064] Each file server 110 maintains at least one sector on each mailbox disk, on which the file server 110 periodically writes state information. Each file server 110 also sends its state information to the other file server 110 using the interconnect using remote memory access. The state information written to the mailbox disks by each file server 110 changes with each update.
[0065] Each file server 110 periodically reads the state information from at least one of the mailbox disks for the other file server 110. Each file server 110 also receives state information from the other file server 110 using the interconnect using remote memory access.
[0066] Each file server 110 recognizes if the other file server 110 has failed by noting that there has been no update to the state information on the mailbox disks for the other file server 110.
[0067] In a preferred embodiment, the second file server 110 determines whether failure of the first file server 110 is a hardware error or a software error, and only recognizes failure of the first file server 10 for hardware errors. In alternative embodiments, the second file server 110 may recognize failure of the first file server 110 for software errors as well.
[0068] At a step 332, the second file server 10 seizes control of all mass storage devices 120 previously assigned to the first file server 110. Due to the nature of the techniques shown in the WAFL Disclosures, the file system 121 defined over those mass storage devices 120 will be in an internally consistent state. All those file server requests 151 marked completed will have been processed and the results incorporated into storage blocks of the mass storage devices 120.
[0069] In normal operation, neither file server 110 places reservations on any of the mass storage devices 120. In the step 332 (only on failover), the second file server 110 seizes control of the mass storage devices 120 previously controlled by the first file server 110, and retains control of those mass storage devices 120 until it is satisfied that the first file server 110 has recovered.
[0070] When the first file server 110 recovers, it sends a recovery message to the second file server 110. In a preferred embodiment, the second file server 110 relinquishes control of the seized mass storage devices 120 by operator command. However, in alternative embodiments, the second file server 110 may recognize the recovery message from the first file server 110 and relinquish control of the seized mass storage devices 120 in response thereto.
[0071] At a step 333, the second file server 110 notes all file server requests 151 in the area of its server request memory 160 that were copied there by the first file server 110. Those file server requests 151 whose results were already incorporated into storage blocks of the storage devices 120 are discarded.
[0072] At a step 334, when the second file server 110 reaches its copy of each file server request 151, the second file server 110 processes the file server request 151 normally.
[0073] At a flow point 340, failover from the first file server 110 to the second file server 110 has been successfully handled.
[0074] Alternative Embodiments
[0075] Although preferred embodiments are disclosed herein, many variations are possible which remain within the concept, scope, and spirit of the invention, and these variations would become clear to those skilled in the art after perusal of this application.
Claims
What is claimed is:
1. A file server system including
a first file server including a file server change memory;
a second file server including a file server change memory;
a mass storage element;
said first file server and said second file server being coupled to said mass storage element;
means for copying a descriptor of a file system change to both said first and second file servers, whereby said first file server processes said file system change while said second file server maintains its copy of said descriptor in its file server change memory; and
means for said second file server to perform a file system change in its file server change memory in response to a service interruption by said first file server.
2. A system as in claim 1, including at least one said mass storage element for each said file server.
3. A system as in claim 1, wherein a first said file server is disposed for processing said file system changes atomically, whereby a second said file server can on failover process exactly those file system changes not already processed by said first file server.
4. A system as in claim 1, wherein a first said file server is disposed to respond identically to service interruptions for itself and for a second said file server.
5. A system as in claim 1, wherein at least one said file server is disposed to delay output to said mass storage element without delaying a response to file system changes.
6. A system as in claim 1, wherein at least one said file server responds to a file system change before committing a result of said file system change to mass storage.
7. A system as in claim 1, wherein
each one of said file servers is coupled to at least a portion of said file server change memory using local memory access; and
each one of said file servers is coupled to at least a portion of said file server change memory using remote memory access.
8. A system as in claim 1, wherein said descriptor includes a file server request.
9. A system as in claim 1, wherein said file server change memory includes a disk block.
10. A system as in claim 1, wherein said file server change memory includes a file server request.
11. A system as in claim 1, wherein said file server change memory is disposed to delay output to said mass storage element without delaying a response to file server requests.
12. A system as in claim 1, wherein
said mass storage element includes a file storage system;
each said file server is disposed for leaving said file storage system in an internally consistent state after processing file system changes;
said internally consistent state is associated with a set of completed file system changes;
said set of completed file system changes is identifiable by each said file server.
13. A system as in claim 1, wherein said mass storage element includes a file storage system and each said file server is disposed for leaving said file storage system in an internally consistent state after processing each said file system change.
14. A file server system as in claim 1, wherein
said mass storage element includes a primary mass storage element and a mirror mass storage element; and
said first file server processes said file system change for both said primary mass storage element and said mirror mass storage element.
15. A system as in claim 1, wherein said means for copying includes access to at least one of said first and second file server change memories using a NUMA network.
16. A system as in claim 1, wherein said means for copying includes remote memory access to at least one of said first and second file server change memories.
17. A system as in claim 1, wherein said means for said second file server to perform a file server request in its file server change memory is also operative in response to a service interruption by said second file server.
18. A file server system including
a first file server coupled to a first set of mass storage devices;
a second file server coupled to a second set of mass storage devices;
a server change memory;
said first file server disposed for receiving a file server request and in response thereto copying a descriptor of a file system change into said server change memory; and
said first file server disposed for processing said file system change for both said first set of mass storage devices and for at least one said mass storage device in said second set.
19. A system as in claim 18, wherein
said second file server is disposed for receiving a file server request and in response thereto copying a descriptor of a file system change into said server change memory; and
said second file server is disposed for processing said file system change for both said second set of mass storage devices and for at least one said mass storage device in said first set.
20. A system as in claim 18, wherein said server change memory includes a disk block.
21. A system as in claim 18, wherein said server change memory includes a file server request.
22. A system as in claim 18, wherein said server change memory includes a first portion disposed at said first file server and a second portion disposed at said second file server.
23. A system as in claim 18, wherein
said server change memory includes a first portion disposed at said first file server and a second portion disposed at said second file server; and
said first file server is disposed for copying said descriptor into both said first portion and said second portion.
24. A system as in claim 18, wherein
said server change memory includes a first portion disposed at said first file server and a second portion disposed at said second file server; and
said first file server and said second file server are each disposed for copying said descriptor into both said first portion and said second portion.
25. A system as in claim 18, wherein said server change memory is disposed to delay output to said mass storage element without delaying a response to file server requests.
26. A file server system including
a plurality of file servers, said plurality of file servers coupled to a mass storage element and at least one file server change memory;
each said file server disposed for receiving a file server request and in response thereto copying a descriptor of a file system change into said file server change memory; and
each said file server disposed for responding to a service interruption by performing a file system change in said file server change memory.
27. A system as in claim 26, including at least one said mass storage element for each said file server.
28. A system as in claim 26, including at least one said server change memory for each said file server.
29. A system as in claim 26, wherein a first said file server is disposed for processing said file system changes atomically, whereby a second said file server can on failover process exactly those file system changes not already processed by said first file server.
30. A system as in claim 26, wherein a first said file server is disposed to respond identically to service interruptions for itself and for a second said file server.
31. A system as in claim 26, wherein at least one said file server delays output to said mass storage element without delaying a response to file server requests.
32. A system as in claim 26, wherein at least one said file server responds to a file system change before committing a result of said file system change to mass storage.
33. A system as in claim 26, wherein
each one of said file servers is coupled to at least a portion of said file server change memory using local memory access; and
each one of said file servers is coupled to at least a portion of said file server change memory using remote memory access.
34. A system as in claim 26, wherein each said file server is disposed for copying said descriptors using a NUMA network.
35. A system as in claim 26, wherein each said file server is disposed for copying said descriptors using remote memory access.
36. A system as in claim 26, wherein said file server change memory includes a disk block.
37. A system as in claim 26, wherein said file server change memory includes a file server request.
38. A system as in claim 26, wherein said file server change memory is disposed to delay output to said mass storage element without delaying a response to file server requests.
39. A system as in claim 26, wherein said mass storage element includes a file storage system and each said file server is disposed for leaving said file storage system in an internally consistent state after processing each said file system change.
40. A system as in claim 26, wherein
said mass storage element includes a file storage system;
each said file server is disposed for leaving said file storage system in an internally consistent state after processing file system changes;
said internally consistent state is associated with a set of completed file system changes;
said set of completed file system changes is identifiable by each said file server.
41. A file server system as in claim 26, wherein
said mass storage element includes a primary mass storage element and a mirror mass storage element; and
said first file server processes said file system change for both said primary mass storage element and said mirror mass storage element.
42. A method of operating a file server system, said method including steps for
responding to an incoming file server request by copying a descriptor of a file system change to both a first file server and a second file server;
processing said file system change at said first file server while maintaining said descriptor copy at said second file server; and
performing, at said second file server, a file system change in response to a copied descriptor and a service interruption by said first file server.
43. A method as in claim 42, including steps for associating a first file server and a second file server with a mass storage element.
44. A method as in claim 42, including steps for delaying output by at least one said file server to said mass storage system without delaying a response to file system changes.
45. A method as in claim 42, wherein a first said file server is disposed for processing said file system changes atomically, whereby a second said file server can on failover process exactly those file system changes not already processed by said first file server.
46. A method as in claim 42, wherein a first said file server is disposed to respond identically to service interruptions for itself and for a second said file server.
47. A method as in claim 42, wherein at least one said file server responds to a file system change before committing a result of said file system change to mass storage.
48. A method as in claim 42, wherein
each said file server includes a file server change memory;
each one of said file servers is coupled to at least a portion of said file server change memory using local memory access; and
each one of said file servers is coupled to at least a portion of said file server request memory using remote memory access.
49. A method as in claim 42, wherein said file server change memory includes a disk block.
50. A method as in claim 42, wherein said file server change memory includes a file server request.
51. A method as in claim 42, wherein said file server change memory is disposed to delay output to said mass storage element without delaying a response to file server requests.
52. A method as in claim 42, wherein said mass storage element includes a file storage system and each said file server is disposed for leaving said file storage system in an internally consistent state after processing each said file system change.
53. A method as in claim 42, wherein said steps for performing a file system change in response to a copied descriptor are also operative in response to a service interruption by said second file server.
54. A method as in claim 42, wherein said steps for processing includes steps for processing said file system change at both a primary mass storage element and a mirror mass storage element.
55. A method of operating a file server system, said method including steps for
receiving a file server request at one of a plurality of file servers and in response thereto copying a descriptor of a file system change into a server change memory;
processing said file system change for both a first set of mass storage devices coupled to a first one said file server and for at least one said mass storage device in a second set of mass storage devices coupled to a second one said file server.
56. A method as in claim 55, wherein said descriptor includes a file server request.
57. A method as in claim 55, wherein said server change memory includes a disk block.
58. A method as in claim 55, wherein said server change memory includes a file server request.
59. A method as in claim 55, wherein said server change memory includes a first portion disposed at said first file server and a second portion disposed at said second file server.
60. A method as in claim 55, wherein said server change memory includes a first portion disposed at said first file server and a second portion disposed at said second file server; and wherein said steps for copying include steps for copying said descriptor into both said first portion and said second portion.
61. A method as in claim 55, wherein said server change memory includes a first portion disposed at said first file server and a second portion disposed at said second file server; and said steps for copying include steps for copying said descriptor into both said first portion and said second portion by either of said first file sever or said second file server.
62. A method as in claim 55, wherein said server change memory is disposed to delay output to said mass storage element without delaying a response to file server requests.
63. A method as in claim 55, wherein
said steps for receiving include receiving a file server request at either said first file server or said second file server, and said steps for copying said descriptor indude copying by either said first file server or said second file server; and including steps for
processing said file system change for both said second set of mass storage devices and for at least one said mass storage device in said first set.
64. A method of operating a file server system, said method including steps for
receiving a file server request at one of a plurality of file servers and in response thereto copying a descriptor of a file system change into a file server change memory; and
responding to a service interruption by performing a file system change in response to a descriptor in said file server change memory.
65. A method as in claim 64, including steps for associating a plurality of file servers with at least one mass storage element and at least one file server change memory.
66. A method as in claim 64, including steps for delaying output to a mass storage element without delaying a response to file server requests.
67. A method as in claim 64, including steps for leaving a file storage system on said mass storage element in an internally consistent state after processing each said file system change.
68. A method as in claim 64, including steps for
leaving a file storage system on said mass storage element in an internally consistent state after processing file system changes;
associating said internally consistent state with a set of completed file system changes; and
identifying said set of completed file system changes by at least one said file server.
69. A method as in claim 64, including steps for performing said received file server request at both a primary mass storage element and a mirror mass storage element.
70. A method as in claim 64, including steps for
processing said file system changes atomically at a first said file server; and
on failover processing exactly those file system changes not already processed by said first file server.
71. A method as in claim including steps for responding identically at a first said file server to service interruptions for itself and for a second said file server.
72. A method as in claim 64, wherein said file server change memory includes a disk block.
73. A method as in claim 64, wherein said file server change memory includes a file server request.
74. A method as in claim 64, wherein said file server change memory is disposed to delay output to said mass storage element without delaying a response to file server requests.
75. A method as in claim 64, including steps for responding to a file system change before committing a result of said file system change to mass storage at one said file server.
Patent Citations (196)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| USH1860 | 2000-09-01 | Asthana et al. | Applicant |
| US3813529 | 1974-05-01 | Bartlett | Applicant |
| US3893024 | 1975-07-01 | Reins et al. | Applicant |
| US4075691 | 1978-02-01 | Davis et al. | Applicant |
| US4075704 | 1978-02-01 | O'Leary | Applicant |
| US4156907 | 1979-05-01 | Rawlings | Applicant |
| US4333144 | 1982-06-01 | Whiteside | Applicant |
| US4351023 | 1982-09-01 | Richer | Applicant |
| US4377843 | 1983-03-01 | Garringer | Applicant |
| US4399503 | 1983-08-01 | Hawley | Applicant |
| US4456957 | 1984-06-01 | Schieltz | Applicant |
| US4459664 | 1984-07-01 | Pottier | Applicant |
| US4488231 | 1984-12-01 | Yu et al. | Applicant |
| US4494188 | 1985-01-01 | Nakane | Applicant |
| US4527232 | 1985-07-01 | Bechtolsheim | Applicant |
| US4550368 | 1985-10-01 | Bechtolsheim | Applicant |
| US4589067 | 1986-05-01 | Porter et al. | Applicant |
| US4620292 | 1986-10-01 | Hagiwara | Applicant |
| US4685125 | 1987-08-01 | Zave | Applicant |
| US4710868 | 1987-12-01 | Cocke et al. | Applicant |
| US4719569 | 1988-01-01 | Ludemann | Applicant |
| US4742447 | 1988-05-01 | Duvall et al. | Applicant |
| US4742450 | 1988-05-01 | Duvall et al. | Applicant |
| US4761737 | 1988-08-01 | Duvall et al. | Applicant |
| US4761785 | 1988-08-01 | Clark et al. | Applicant |
| US4766534 | 1988-08-01 | DeBenedicts | Applicant |
| US4780821 | 1988-10-01 | Crossley | Applicant |
| US4783730 | 1988-11-01 | Fischer | Applicant |
| US4803621 | 1989-02-01 | Kelly | Applicant |
| US4819159 | 1989-04-01 | Shipley et al. | Applicant |
| US4825354 | 1989-04-01 | Agrawal et al. | Applicant |
| US4827411 | 1989-05-01 | Arrowood | Applicant |
| US4845609 | 1989-07-01 | Lighthart et al. | Applicant |
| US4875159 | 1989-10-01 | Cary et al. | Applicant |
| US4887204 | 1989-12-01 | Johnson et al. | Applicant |
| US4897781 | 1990-01-01 | Chang et al. | Applicant |
| US4914583 | 1990-04-01 | Weisshaar | Applicant |
| US4965772 | 1990-10-01 | Daniel et al. | Applicant |
| US4969118 | 1990-11-01 | Montoye et al. | Applicant |
| US4984272 | 1991-01-01 | McIlroy et al. | Applicant |
| US5001628 | 1991-03-01 | Johnson et al. | Applicant |
| US5001712 | 1991-03-01 | Slpett et al. | Applicant |
| US5008786 | 1991-04-01 | Thattle | Applicant |
| US5018144 | 1991-05-01 | Corr et al. | Applicant |
| US5043871 | 1991-08-01 | Nishigaki | Applicant |
| US5043876 | 1991-08-01 | Terry | Applicant |
| US5049873 | 1991-09-01 | Robins et al. | Applicant |
| US5107500 | 1992-04-01 | Wakamoto | Applicant |
| US5113442 | 1992-05-01 | Moir | Applicant |
| US5134619 | 1992-07-01 | Henson et al. | Applicant |
| US5144659 | 1992-09-01 | Jones | Applicant |
| US5146588 | 1992-09-01 | Crater et al. | Applicant |
| US5155835 | 1992-10-01 | Belsan | Applicant |
| US5163131 | 1992-11-01 | Row et al. | Applicant |
| US5163148 | 1992-11-01 | Walls | Applicant |
| US5182805 | 1993-01-01 | Campbell | Applicant |
| US5195100 | 1993-03-01 | Katz et al. | Applicant |
| US5202983 | 1993-04-01 | Orita et al. | Applicant |
| US5208813 | 1993-05-01 | Stallmo | Applicant |
| US5218695 | 1993-06-01 | Noveck et al. | Applicant |
| US5218696 | 1993-06-01 | Baird et al. | Applicant |
| US5222217 | 1993-06-01 | Blount et al. | Applicant |
| US5235601 | 1993-08-01 | Stallmo et al. | Applicant |
| US5251308 | 1993-10-01 | Frank | Applicant |
| US5255270 | 1993-10-01 | Yanai et al. | Applicant |
| US5261044 | 1993-11-01 | Dev et al. | Applicant |
| US5261051 | 1993-11-01 | Masden et al. | Applicant |
| US5274799 | 1993-12-01 | Brant et al. | Applicant |
| US5274807 | 1993-12-01 | Hoshen et al. | Applicant |
| US5276840 | 1994-01-01 | Yu | Applicant |
| US5276867 | 1994-01-01 | Kenley et al. | Applicant |
| US5283830 | 1994-02-01 | Hinsley et al. | Applicant |
| US5297265 | 1994-03-01 | Frank et al. | Applicant |
| US5305326 | 1994-04-01 | Solomon et al. | Applicant |
| US5313626 | 1994-05-01 | Jones et al. | Applicant |
| US5313646 | 1994-05-01 | Hendricks | Applicant |
| US5313647 | 1994-05-01 | Kaufman | Applicant |
| US5315602 | 1994-05-01 | Noya et al. | Applicant |
| US5317731 | 1994-05-01 | Dias et al. | Applicant |
| US5333305 | 1994-07-01 | Neufeld | Applicant |
| US5335235 | 1994-08-01 | Arnott | Applicant |
| US5355453 | 1994-10-01 | Row et al. | Applicant |
| US5357509 | 1994-10-01 | Ohizumi | Applicant |
| US5357612 | 1994-10-01 | Alaiwan | Applicant |
| US5377196 | 1994-12-01 | Godlew et al. | Applicant |
| US5379417 | 1995-01-01 | Lui et al. | Applicant |
| US5430729 | 1995-07-01 | Rahnema | Applicant |
| US5454095 | 1995-09-01 | Kraemer et al. | Applicant |
| US5463642 | 1995-10-01 | Gibbs et al. | Applicant |
| US5485455 | 1996-01-01 | Dobbins et al. | Applicant |
| US5490248 | 1996-02-01 | Dan et al. | Applicant |
| US5497343 | 1996-03-01 | Rarick | Applicant |
| US5502836 | 1996-03-01 | Hale et al. | Applicant |
| US5504883 | 1996-04-01 | Coverston et al. | Applicant |
| US5519844 | 1996-05-01 | Stallmo | Applicant |
| US5535375 | 1996-07-01 | Eshel et al. | Applicant |
| US5555244 | 1996-09-01 | Gupta et al. | Applicant |
| US5572711 | 1996-11-01 | Hirsch et al. | Applicant |
| US5574843 | 1996-11-01 | Gerlach, Jr. | Applicant |
| US5604868 | 1997-02-01 | Komine et al. | Applicant |
| US5617568 | 1997-04-01 | Ault et al. | Applicant |
| US5621663 | 1997-04-01 | Skagerling | Applicant |
| US5627842 | 1997-05-01 | Brown et al. | Applicant |
| US5628005 | 1997-05-01 | Hurvig | Applicant |
| US5630060 | 1997-05-01 | Tang et al. | Applicant |
| US5634010 | 1997-05-01 | Ciscon et al. | Applicant |
| US5642501 | 1997-06-01 | Doshi et al. | Applicant |
| US5644718 | 1997-07-01 | Belove et al. | Applicant |
| US5649152 | 1997-07-01 | Ohran et al. | Examiner |
| US5649196 | 1997-07-01 | Woodhill et al. | Examiner |
| US5666353 | 1997-09-01 | Klausmeiser | Applicant |
| US5668958 | 1997-09-01 | Bendert et al. | Applicant |
| US5673265 | 1997-09-01 | Gupta et al. | Applicant |
| US5675782 | 1997-10-01 | Montague et al. | Applicant |
| US5678006 | 1997-10-01 | Valizadeh | Applicant |
| US5678007 | 1997-10-01 | Hurvig | Applicant |
| US5689701 | 1997-11-01 | Ault et al. | Applicant |
| US5694163 | 1997-12-01 | Harrison | Applicant |
| US5696486 | 1997-12-01 | Poliquin et al. | Applicant |
| US5720029 | 1998-02-01 | Kern et al. | Applicant |
| US5721916 | 1998-02-01 | Pardikar | Examiner |
| US5737523 | 1998-04-01 | Callaghan | Applicant |
| US5754851 | 1998-05-01 | Wissner | Applicant |
| US5761669 | 1998-06-01 | Montague | Applicant |
| US5819292 | 1998-10-01 | Hitz et al. | Applicant |
| US5825877 | 1998-10-01 | Dan et al. | Applicant |
| US5826102 | 1998-10-01 | Escobar et al. | Applicant |
| US5828839 | 1998-10-01 | Moncreiff | Applicant |
| US5854893 | 1998-12-01 | Ludwig et al. | Applicant |
| US5854903 | 1998-12-01 | Morrison et al. | Applicant |
| US5856981 | 1999-01-01 | Voelker | Applicant |
| US5876278 | 1999-03-01 | Cheng | Applicant |
| US5890959 | 1999-04-01 | Pettit et al. | Applicant |
| US5915087 | 1999-06-01 | Hammond | Applicant |
| US5931935 | 1999-08-01 | Cabrera | Applicant |
| US5950225 | 1999-09-01 | Kleiman | Applicant |
| US5956491 | 1999-09-01 | Marks | Applicant |
| US5956712 | 1999-09-01 | Bennett et al. | Applicant |
| US5957612 | 1999-09-01 | Bradley | Applicant |
| US5963962 | 1999-10-01 | Hitz et al. | Applicant |
| US5983364 | 1999-11-01 | Bortcosh et al. | Applicant |
| US5996086 | 1999-11-01 | Delaney et al. | Examiner |
| US5996106 | 1999-11-01 | Seyyedy | Applicant |
| US6000039 | 1999-12-01 | Tanaka et al. | Applicant |
| US6044214 | 2000-03-01 | Kimura et al. | Applicant |
| US6070008 | 2000-05-01 | Korenshtein | Applicant |
| US6073089 | 2000-06-01 | Baker et al. | Applicant |
| US6076148 | 2000-06-01 | Kedem | Applicant |
| US6101585 | 2000-08-01 | Brown et al. | Applicant |
| EP308/506A1 | 1987-03-01 | Applicant | |
| EP308056A2 | 1989-03-01 | Applicant | |
| EP306244A2 | 1989-03-01 | Applicant | |
| EP321723 | 1989-06-01 | Applicant | |
| EP359384B1 | 1990-03-01 | Applicant | |
| EP359384A3 | 1990-03-01 | Applicant | |
| EP359384A | 1990-03-01 | Applicant | |
| EP359384A2 | 1990-03-01 | Applicant | |
| EP410630A | 1991-01-01 | Applicant | |
| EP410630A3 | 1991-01-01 | Applicant | |
| EP453193A | 1991-10-01 | Applicant | |
| EP453193A3 | 1991-10-01 | Applicant | |
| EP462917B1 | 1991-12-01 | Applicant | |
| EP462917A2 | 1991-12-01 | Applicant | |
| EP462917A3 | 1991-12-01 | Applicant | |
| EP477039A | 1992-03-01 | Applicant | |
| EP477039A3 | 1992-03-01 | Applicant | |
| EP497067 | 1992-08-01 | Applicant | |
| EP497067A1 | 1992-08-01 | Applicant | |
| EP537198B1 | 1993-04-01 | Applicant | |
| EP552580A2 | 1993-07-01 | Applicant | |
| EP552580A3 | 1993-07-01 | Applicant | |
| EP566967A3 | 1993-10-01 | Applicant | |
| EP566967A | 1993-10-01 | Applicant | |
| EP569313 | 1993-11-01 | Applicant | |
| EP569313A2 | 1993-11-01 | Applicant | |
| EP629956A3 | 1994-12-01 | Applicant | |
| EP629956A2 | 1994-12-01 | Applicant | |
| EP747829A | 1996-12-01 | Applicant | |
| EP756235A | 1997-01-01 | Applicant | |
| EP760503A1 | 1997-03-01 | Applicant | |
| JP1273395 | 1989-11-01 | Applicant | |
| JP1-273395 | 1989-11-01 | Applicant | |
| WO89/03086 | 1989-04-01 | Applicant | |
| WO91/13404 | 1991-09-01 | Applicant | |
| WO92/00834 | 1992-01-01 | Applicant | |
| WO91/13475 | 1993-07-01 | Applicant | |
| WO94/29795 | 1994-12-01 | Applicant | |
| WO94/29796 | 1994-12-01 | Applicant | |
| WO94/29807 | 1994-12-01 | Applicant | |
| WO9821656A | 1998-05-01 | Applicant | |
| WO98/38576 | 1998-09-01 | Applicant | |
| WO99/30254 | 1999-06-01 | Applicant | |
| WO99/45456 | 1999-09-01 | Applicant | |
| WO99/66401 | 1999-12-01 | Applicant | |
| WO/07104 | 2000-02-01 | Applicant | |
| WO/11553 | 2000-03-01 | Applicant |
Non-Patent Literature (85)
- R. Reichel: “Inside Windows NT Security: Part 1” Windows/DOS Developers'Journal, vol. No. Lawrence, Ks. USA.. 4, Apr. 1993, pp. 6-19, XP002107445, Lawrence, Ks. USA.Applicant
- R. Nass: Connect Disk Arrays to Eisa or PCI Buses Electronic Design, vol. 41, No. 23, No. 1993, Cleveland, OH, USA pp. 152-154, XP000417908 see p. 152-p. 153, right-hand col., line 10.Applicant
- AT & T—UNIX System V Release 4 Programmer's Guide: Streams.Applicant
- AT & T Bell Laboratories Technical Journal. vol. 63 No. 08. Part 02. Dated: Oct. 1984.Applicant
- Bach, Maurice J. et al “The Design of the UNIX Operating System”.Applicant
- Beach, Richard J. “The Message is the Medium: Multiprocess Structuring of an Interactive Paint Program”. pp. 277-287.Applicant
- Borr, AJ “Secure Share: Safe Unix/Windows File Sharing Through Multiprotocal Locking”. USENIX Association. pp. 117-126.Applicant
- Britton, Diane E. & Mark E. Stockel. “An Interprocess Communication Facility for Distributed Applications”. IEEE. 1980. pp. 590-595.Applicant
- Carlson, et al “HP AdvanceNet: A growth-Oriented Computer Networking Architecture Strategy”. Hewlett-Packard Journal. Oct. 1986.Applicant
- Carr, Robert & Dan Shaffer. “The Power of Penpoint”.Applicant
- Cashin, P.M. “Inter-Process Communication”. May. 1980.Applicant
- Chao, Chia et al. “Mime: A High performance Storage Device With Strong Recovery Guarantees”. Dated: Mar. 18, 1992.Applicant
- Cheriton, David R. Multi-Process Structuring and the Thoth Operating System. 1979. pp. 1-64.Applicant
- Cheriton, David R. “The Thoth System: Multi-Process Structuring and Portability”.Applicant
- Cheriton, David R. et al “Thoth, A Portable real-Time Operating System”. pp. 105-115.Applicant
- Chutani, Sailesh et al “The Episode File System”, UNIX. Winter 1992. pp. 43-60.Applicant
- CIFS: Common Internet File System. UNIX Review. Feb. 1997.Applicant
- Cohen, Jacques. “Garbage Collection of Linked Data Strutures”. Computing Surveys. vol. 13. No. 03. Dated: Sep. 1981.Applicant
- Computer. IEEE Sep. 1988.Applicant
- De Jonge, Wiebren et al “The Logical Disk: A New Approach to Improving File Systems”. pp. 1-14.Applicant
- Dietal, Harvey M. “An Introduction to Operating System”.Applicant
- English, Robert M. & Alexander A Stepanov. “Loge: A Self-Organizing Disk Controller”. Dec. 1991. pp. 1-15.Applicant
- FLY-BY-XOR. Specification.Applicant
- Hammond, Richard A. “Experiences With A Series/1 Distributed System”. pp. 585-589.Applicant
- Hanson, per Brinch (Editor). RC 4000 Software Multiprogramming System. Apr. 1969.Applicant
- Hartman, John H. & John K. Ousterhout. “The Zebra Striped Network File System”.Applicant
- Hewlett-Packard Journals. vol. 37. No. 10. Oct. 1986.Applicant
- Hitz, David et al “Using UNIX as One Component of a Lightweight Distributed Kernal for Multiprocessor File Servers”.Applicant
- Hitz, David, James Lau & Michael Malcolm. “File System Design for an NFS File Server Appliance”. Dated: Jan. 19, 1994.Applicant
- Hitz, David. “A System Administrator's Performance Monitor for Tuning NFS Networks Servers”. Dated: May 1991.Applicant
- Hitz, David. “Technical Report TRO1: An NFS File Server Appliance”. Rev. A 8/93.Applicant
- IBM Technical Disclosure Bulletin. vol. 36 No. 3. Mar. 1993, “Parity Preservation for Redundant Array of Independent Direct Access Storage Device Data Loss Minimization and Repair”.Applicant
- Jone, Anita K. et al “StarOS, a Multiprocessor Operating System for the Support of Task Forces”.Applicant
- Kleiman. “Using NUMA Interconnects for a Highly Availabe Filers”. IEEE Micro. 1999. pp. 42-48.Applicant
- Lantz, Keith A. et al “Rochester's Intelligent Gateway”. IEEE. Oct. 1982.Applicant
- Leffler, Samuel J. et al “The Design and Implementation of the 4.3 BSD UNIX Operating System”.Applicant
- Lieberman, Henry & Carl Hewitt. “A Real-Time Garbage Collector Based on the Lifetime of Objects”. Communication of the ACM. vol. 26. No. 06. Dated: Jun. 1983.Applicant
- Malcolm, Michael A. “A Process and Its Application”. Dated: 1978.Applicant
- Montoye R.K. et al Microprocessors Session 3 WPM 3.4 “An 18ns 56-Bit Multiply-Adder Circuit”. IEEE . Feb. 14, 1990.Applicant
- Motorola, inc. “Microsystems Products Technical Data Sheet (1986), MicroMAP1-7, MicroMAP Manufacturing Automation Protocal Software”.Applicant
- Nelson. Bruce & Yu-Ping Cheng “The Myth of transfer Rate-How and Why SCSI is Beter than IPI for NFS”. Dated: Jul. 1992.Applicant
- Nelson, Bruce et al “The Myth of MIPS for I/O-An Overview of Functional Multiprocessing for NFS Network Servers”. Dated: Aug. 1992.Applicant
- Nelson, Bruce “Benchmark Methodolgy and Preliminary Performance Specifications for the Auspex NS 5000 Network Server”. Dated: Oct. 1989.Applicant
- Network Appliance-Data ONTAP Event management System. Aug. 10, 2000.Applicant
- Network Interfaces Programmer'Guide. Sun Microsystems, Inc. 1992.Applicant
- Optical Backplanes Driven By Sebring Rings Can Supply 40-160 Terabits/Sec. of Wire-Speed Routing By 2002.Applicant
- Optipat Document Delivery. Feb. 2, 2000. pp. 02.Applicant
- Osadzinski, Alex “The Network File System (NFS)”.Applicant
- Ousterhout, John & Fred Douglas “Beating the I/O Bottleneck: A Case for the Log-Structured File Systems”.Applicant
- Patterson, David A. et al. “A Case for Redundant Arrays of Inexpensive Disks (RAID)”.Applicant
- Plum, Thomas “Reliable Data Structures In C”.Applicant
- Rashid, Richard F. et al “Accent: A Communication Oriented Network Operating System Kernal”.Applicant
- Robertazzi, Thomas G. Computing Networks and Systems: Queuening Theory and performance Evaluatio.Applicant
- Row, John & Dvid Daugherty “Operating System Extensions Link Disparate Systems”, Computer Design. Dated: Jul. 1984.Applicant
- Row, John “Lan Software Links Diverse Mamchines, OS's” Mini-Micro Systems, Dated: Sep. 1985.Applicant
- Sandberg, Russel “The Sun Network File System: Design, Implementation and Experience”.Applicant
- Schroeder W. “Peace: The Distributed Suprenum Operating System”.Applicant
- Schwartz, Allan M., David Hitz, & William M. Pitts. “LFS-A Local File System for Multiprocessor NFS Network Servers”. Dated: Dec. 1989.Applicant
- Sebring Rings in Networking. Aug. 9, 1999.Applicant
- Sebring Theory of Ring Operation (STROP). Sep. 9, 1999.Applicant
- Seltzer, Margo Ilene File System Performance and Transaction Support. 1992.Applicant
- Session, Roger Class Construction in C and C++ Object-Oriented Programming Fundamentals. 1992.Applicant
- Silberschatz, Abraham & James L. Peterson Operating System Concepts. 1989.Applicant
- Sincoske, W. David & David J. Farber The Series/1 Distributed Operating System: Description and Comments.Applicant
- SRC 6466 External Architecture Specification Rev. 0.7. May 5, 1999.Applicant
- Src 6466 Protocol Specification, Rev. 0.9, Draft. Aug. 16, 1999.Applicant
- Stallings, William 5th Edition-Data and Computer Communications. 1997.Applicant
- Stern, Hal “Managing NFS and NIS”. O'Reilly & Associates, Inc. 1991.Applicant
- Tan, See-Mong, Harvard Holmes, & Craig Eades. SOS-Stan's Own Server-A NFS File Server for the IBM PC.Applicant
- Tanenbaum, Andrew S. Computer Networks 2nd Edition.Applicant
- Tanenbaum, Andrew S. Operating Systems-Design and Implementation. 1987.Applicant
- Tribby, David M. Network Services for HP Real-Time Computers. Hewlett-Packard Journal. Oct. 1996.Applicant
- TUX 2: Slashdot.com TUX 2: The File System That Woulf Be King. Dated: Oct. 17.Applicant
- Tweten, David Hiding Mass Storage Under UNIX: NASA's MSS-II Architecture. IEEE. 1990.Applicant
- UI-ATLAS-Distributed Computing Architecture: A Technical Overview. Oct. 1991.Applicant
- USENIX Association. Proceedings of the Winter 1992 USENIX Conference. San Francisco, CA. Jan. 20-24, 1992.Applicant
- VRTX C User's Guide. Jan. 1987.Applicant
- VRTX32/68020 Versatile Real-Time Executive for the MC68020 Microprocessor. Dated: Apr. 1987.Applicant
- Walton, Robert L. Rationale for a Queueable Object Distributed Interprocess Communication System. IEEE. 1982.Applicant
- Wood, B.J. et al. A Local-Area Network Architecture Based on message-Passing Operating System Concepts.Applicant
- “Mapping the VM text file to the AIX text files”, IBM Technical Disclousre Bulletin., vol. 33, No. 2, Jul. 1990 (1990-07, p. 341 XP000123641, IBM Corp. New York., US ISSN: 0018-8689—the whole document.Applicant
- “Migrated Data Backup Utility”, IBM Technical Disclosure Bulletin., vol. 37, No. 06B, Jun. 1994 (1994-06), pp. 505-507, XP000456079, IBM Corp. New York., US ISSN: 0018-8689.Applicant
- Borr A J: “SecureShare: safe UNIX/Windows file sharing through multiprotocol locking” Proceeding of the 2nd Usenix Windows NT Symposiom, proceeding of 2nd Usenix Windows NT Symposiom, Seattle, WA, USA, Aug. 3-5, 1998, pp. 117-126, XP002097387 ISBN 1-880446-95-2, 1998, Berkeley, CA, USA, Usenix Assoc. USA.Applicant
- Tanner J: “CIFS: Common Internet File System” Unix Review, vol. 31, Feb. 1997, pp. 31/32, 34, XPOOO783952 see whole document, relevant to claim No. 1-38.Applicant
- B. Srinivasan, et al.: “Recoverable file system for microprocessor systems” Microprocessors and Microsystems., vol. 9, No. May 1985, London, GB, pp. 179-183, XP002031805 see p. 181, left-hand col., line 12—p. 182, right-hand col., line 30.Applicant