WO1998022890A1 - Systeme de suivi de donnees - Google Patents

Systeme de suivi de donnees Download PDF

Info

Publication number
WO1998022890A1
WO1998022890A1 PCT/US1997/021458 US9721458W WO9822890A1 WO 1998022890 A1 WO1998022890 A1 WO 1998022890A1 US 9721458 W US9721458 W US 9721458W WO 9822890 A1 WO9822890 A1 WO 9822890A1
Authority
WO
WIPO (PCT)
Prior art keywords
file
data
directory
memory
file system
Prior art date
Application number
PCT/US1997/021458
Other languages
English (en)
Inventor
John B. Carter
Scott H. Davis
Steven J. Frank
Gerald R. Plouffe
Hsin H. Lee
Original Assignee
Mangosoft Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US08/754,481 external-priority patent/US6148377A/en
Application filed by Mangosoft Corporation filed Critical Mangosoft Corporation
Priority to AU54549/98A priority Critical patent/AU5454998A/en
Publication of WO1998022890A1 publication Critical patent/WO1998022890A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/957—Browsing optimisation, e.g. caching or content distillation
    • G06F16/9574—Browsing optimisation, e.g. caching or content distillation of access to content, e.g. by caching
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/329—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]

Definitions

  • the present invention relates in general to structured storage systems (e.g., file systems, database systems, and systems for storing, sharing, and delivering data objects, JAVA applets, and Web pages). More specifically, the invention relates to systems and methods that track one or more pieces of data within a structured store of data.
  • structured storage systems e.g., file systems, database systems, and systems for storing, sharing, and delivering data objects, JAVA applets, and Web pages. More specifically, the invention relates to systems and methods that track one or more pieces of data within a structured store of data.
  • Computer based structured storage systems such as computer file systems and database systems, have been remarkably successful at providing users with quick and facile access to enormous amounts of data.
  • the importance of these structured storage systems in today's commerce is difficult to exaggerate.
  • structured storage systems have allowed businesses to generate and maintain enormous stores of persistent data that the company can modify and update over the course of years.
  • This persistent data is a valuable capital asset that is employed each day to perform the company's core operations.
  • the data can be, for example, computer files (e.g., source code, word-processing documents, etc.), database records and information (e.g., information on employees, customers, and/or products), and/or Web pages.
  • HTML files provide an ability to link to other HTML files by embedding specific tags within a first HTML file.
  • a user executing a browser application displaying the first HTML file clicks on such an embedded tag, the linked-to HTML file is displayed on the user's screen.
  • a common problem with these links is that the target of the links changes location, or is deleted, and the link is no longer valid. This problem is especially acute for large, dynamic Web sites with many links that may change daily.
  • link provides the user with access to data files or applications wherever they exist on the system. Typically this is done by providing the user with an icon or some other symbol that represents the desired data file or application. To access the file or application, the user simply accesses the icon or symbol; the user's access is automatically redirected to the actual file or application.
  • These types of links are known as "shortcuts" or
  • aliases Shortcuts and aliases are also subject to breaking if the target data file or application is moved or renamed.
  • the system of the present invention provides links to data elements resident in the system that span multiple filesets and machines.
  • the links are resilient, which means that they do not "break" when the target datum is moved or renamed. Additionally, the system described herein provides data links that are removed if the target datum is deleted. Further, link maintenance is transparent to the user and links between files can be resolved more quickly than traditional links if both files are stored within a structured file system that is globally addressable.
  • the present invention relates to a method for creating and maintaining links to data contained in a globally addressable storage system that begins by providing a plurality of nodes interconnected by a network.
  • a control program is stored on each of the nodes that manipulates the globally addressable storage system and provides multiple, distributed instances of the control program within the network.
  • Each instance of the control program is interfaced to the globally addressable storage system to provide addressable, persistent storage of data.
  • Each instance of the control program employs the globally addressable storage system to store data.
  • An index is generated identifying each target of a link by at least a unique identification code.
  • the present invention relates to a method for creating and maintaining links between files contained in a structured file system that begins by providing a plurality of nodes interconnected by a network.
  • a control program is stored on each of the nodes which manipulates a structured file system and provides multiple, distributed instances of the file system control program within the network.
  • Each instance of the file system control program is interfaced to a globally addressable store of memory that provides addressable, persistent storage of data.
  • Each instance of the file system control program employs the globally addressable memory store to store the structured file system.
  • An index is generated that monitors the target of each link created between files contained in the structured file system.
  • the present invention relates to a data object for creating and maintaining links between files contained in a structured file system.
  • the data object includes a file identification entry that is stored in a memory element.
  • the file identification entry is a unique identifier for the target of each link that is created between files.
  • the data object also includes a handle for each link's target and a file path name identifier which stores in a memory element the address of the targeted file.
  • FIG. 1 is a conceptual block diagram of a distributed addressable shared memory structured data storage system according to the invention.
  • FIG. 2 is a diagram of one possible embodiment of the system of FIG. 1, namely a distributed addressable shared memory file system providing storage for computer files such as source code files, word-processing documents files, etc.
  • FIG. 3 is a graphical representation of the organization of directory entries and associated file descriptors (also known as "Inodes”), suitable for use with the file system of FIG. 2.
  • FIG. 4 is a diagram of an Inode suitable for use with the file system of FIG. 2.
  • FIG. 5 illustrates a distributed shared memory computer network.
  • FIG. 6 is a functional block diagram that illustrates in more detail one distributed shared memory computer network of the type shown in FIG. 5.
  • FIG. 7 illustrates in more detail a shared memory subsystem suitable for practice with the network illustrated in FIG. 6.
  • FIG. 8 is a functional block diagram of one shared memory subsystem according to the invention.
  • FIG. 9 illustrates a directory page that can be provided by a shared memory subsystem of the type depicted in FIG. 8.
  • FIG. 10 illustrates a directory that can be distributed within a shared memory and formed of directory pages of the type illustrated in FIG. 9.
  • FIG. 11 illustrates in functional block diagram form a system that employs a directory according to FIG. 10 for tracking portions of a distributed shared memory.
  • a network system 10 includes a plurality of network nodes that access a memory space storing a structured store of data, such as a structured file system or a database.
  • Each of the nodes includes at least a data control program which accesses and manages the structured store of data.
  • the structured store of data may be stored in an addressable shared memory or the structured store may be stored in a more traditional fashion.
  • each node may be responsible for storing a particular element or elements of the structured store of data.
  • the data control program can access a desired portion of the structured store using a globally unique identifier.
  • the underlying system would translate the identifier into one or more commands for accessing the desired data, including network transfer commands.
  • the structured store of data is stored in an addressable shared memory space, which allows the nodes to transparently access portions of the structured store using standard memory access commands.
  • the system 10 can be a file system, a database system, a Web server, an object repository system, or any other structured storage system that maintains an organized set of data.
  • Web server means any processor which transmits data objects (such as Active X objects), applications (such as JAVA applets), or files (such as HTML files), to a requester via Web protocols (e.g., http or ftp).
  • the system 10 is a file system that maintains various computer files.
  • This is just one embodiment of the invention that is provided for illustrative purposes.
  • the invention can be employed to provide any one of a plurality of structured storage systems (e.g., database system, Web page system, Intranet, etc.). The invention is not to be limited to the file system or other particular embodiments described herein.
  • a network system 10 includes a plurality of network nodes 12a-12d and an addressable shared memory space 20 that has a portion 22 for storing a structured store of data 28.
  • Each of the nodes 12a-12d can include several sub- elements.
  • node 12a includes a processor 30a, a data control program 32a, and a shared memory subsystem 34a.
  • two of the nodes, 12a and 12c include monitors that provide displays 40 and 42 graphically depicting the structured store of data 28 within the addressable shared memory space 20.
  • the addressable shared memory space 20 interconnects each of the network nodes 12a-12d and provides each node 12a-12d with access to the structured store of data 28 contained within the addressable shared memory space 20.
  • a system 10 can provide, among other things, each network node 12a-12d with shared control over the structured store of data 28 and, therefore, the system 10 can distribute control of the data store across the nodes of the network.
  • each node of the system 10 such as node 12a, includes a data control program 32a that interfaces to a shared memory subsystem 34a.
  • the data control program 32a can operate as a structured storage system, such as a file system, that is adapted to maintain a structured store of data and to employ the shared memory system as an addressable memory device that can store a structured store of data.
  • the shared memory subsystem 34a can access and store data within the addressable shared memory space 20.
  • the invention can provide computer networks with distributively controlled and readily scaled file systems, database systems, Web page systems, object repositories, data caching systems, or any other structured storage system.
  • the system 10 of the invention maintains within the addressable shared memory space 20 a structured store of data 28.
  • Each of the nodes 12a-12d can access the addressable shared memory space 20 through the shared memory subsystems 34a-34d.
  • Each of the shared memory subsystems 34a-34d provides its node with access to the addressable shared memory space 20.
  • the shared memory subsystems 34a-34d coordinate each of the respective node's memory access operations to provide access to the desired data and maintain data coherency within the addressable shared memory space 20. This allows the interconnected nodes 12a-12d to employ the addressable shared memory space 20 as a space for storing and retrieving data.
  • FIG. 1 illustrates that systems of the invention have shared memory subsystems providing the network nodes with access to an addressable shared memory space, wherein at least a portion of that space is assigned to at least a portion of one or more of the persistent storage memory devices (e.g., hard disks) to allow the nodes addressably to store and retrieve data to and from the one or more persistent storage memory devices.
  • the persistent storage memory devices e.g., hard disks
  • each of the nodes 12a-12d can employ its respective shared memory subsystem as a memory device that provides persistent data storage.
  • Each of the data control programs 32a-32d is a software module that couples to the respective shared memory subsystem 34a-34d in a way that operates similarly to an interface between a conventional data storage program and a local memory device.
  • the data control program 32a can stream data to, and collect data from, the shared memory subsystem 34a. Because the shared memory subsystems coordinate the memory accesses to the addressable shared memory space 20, each of the data control programs is relieved from having to manage and coordinate its activities with the other data control programs on the network or from having to manage and coordinate its activities with one or more central servers.
  • each of the data control programs 32a-32d can be a peer incarnation (i.e., an instance) residing on a different one of the network nodes 12a-12d and can treat the respective shared memory subsystem 34a-34d as a local memory device such as a local hard disk.
  • One or more of the data control programs 32a-32d can provide a graphical user interface 42 that graphically depicts the structured store of data 28 contained within the addressable shared memory space 20.
  • the graphical user interface 42 allows a user at a node, for example at node 12a, to insert data objects graphically within the structured store of data 28.
  • the data control program 32a can generate a set of commands that will present a stream of data to the shared memory subsystem 34a and the shared memory subsystem 34a will employ the data stream to store an object within the structured store of data 28.
  • the other shared memory subsystems 34b-34d can provide information to their respective nodes that is indicative of this change to the structured store of data 28. Accordingly, as shown depicted in FIG.
  • node 12c which includes a graphical user interface 40
  • the graphical user interface 40 of the node 12c can depict to a user that an object is being placed within the structured store of data 28.
  • the addressable shared memory space 20 also contains the data objects 50a-50c which can be placed within the structured data store 28 to become part of that structured data store.
  • a system user at node 12a can direct object 50a to be inserted at a set location within the data store 28.
  • the data control program 32a then directs the shared memory subsystem 34a to place the object 50a within the data store 28 at the proper location.
  • a structured file system 60 is a particular embodiment according to the invention that employs the properties of the addressable shared memory space 20 to implement what looks to all network nodes like a coherent, single file system when in fact it spans all network nodes coupled to the addressable shared memory space 20.
  • the file system 60 of FIG. 2 differs from known physical and distributed file systems in a variety of ways.
  • the file system 60 manages the mapping of a directory and file structure onto a distributed addressable shared memory system 20 which has at least a portion of its addressable space mapped or assigned to at least a portion of one or more persistent storage devices (e.g., hard disks) on the network.
  • the file system 60 of the invention employs peer nodes, each of which have an incarnation or instance of the same data control program.
  • the file system 60 of the invention maintains data coherence among network nodes; automatically replicates data for redundancy and fault tolerance; automatically and dynamically migrates data to account for varying network usage and traffic patterns; and provides a variety of other advantages and advances, some of which are disclosed in the commonly-owned U.S. patent application serial number 08/754,481 filed November 22, 1996, and inco ⁇ orated by reference above.
  • the file system 60 resides in part within the addressable shared memory space 20, and includes a structured store of data 62, a super root 64, file sets 66-74, directory entry 80, and file or document 82.
  • Two network nodes 84 and 86 are shown accessing the addressable shared memory space 20 (in the manner described previously with reference to FIG. 1) via the logical drives 90 and 94.
  • Application programs 92 and 96 executing on the nodes interact with the data control programs (not shown in FIG. 2 but shown in FIG. 1 as 32a- 32d) and cause the data control programs in the nodes to access the logical drives 90 and 94.
  • the logical drives are DOS devices that "connect to" the fileset directories via Installable File System drivers associated with the file system 60.
  • the file system 60 supports one global file system per addressable shared memory space 20 shared by all of the network nodes. This global file system is organized into one or more independent collections of files, depicted as the filesets 66-74.
  • a fileset can be thought as logically equivalent to a traditional file system partition. It is a collection of files organized hierarchically as a directory tree structure rooted in a root directory. The non-leaf nodes in the tree are the directories 80, and the leaves in the tree are regular files 82 or empty directories. Sub-directory trees within a fileset can overlap by linking a file to multiple directories.
  • a benefit of breaking up the file system 60 into filesets 66-74 is that it provides more flexible file system management for users of the system 60.
  • the file system 60 grows into very large sizes (e.g., hundreds of nodes with thousands of gigabits of storage), it is desirable to have the files organized into groups of management entities such that management actions can be independently applied to individual groups without affecting the operation of the others.
  • the filesets in the addressable shared memory space 20 are described and enumerated in a common structure, the root 64 of which provides the starting point to locate the filesets in the addressable shared memory space 20.
  • the root 64 can be stored in a static and well-known memory location in the addressable shared memory space 20, and it can be accessed via a distributed shared memory system program interface.
  • a node When a node is accessing a fileset for the first time, it first looks up the root 64 to determine the identifier associated with the fileset, e.g., the shared memory address used to access the fileset. Once it has determined the identifier, the node can access the root directory of the fileset. From the root directory, it then can traverse the entire fileset directory tree to locate the desired file.
  • Filesets used by the file system 60 are described in greater detail below under the heading "Fileset.”
  • a directory 126 (such as the directory 80 of FIG. 2) is accessed by starting at a directory Inode or descriptor 128 containing an address that points to a directory entries stream descriptor 130.
  • This descriptor 130 is a pointer to a block of data containing directory entries for files File 1 through File 3.
  • the directory entry for File 1 has a number of entries; one of the entries is a string containing the name of the file and another entry is the address of the Inodes and stream descriptors 132.
  • the stream descriptors for File 1 are used to locate and retrieve the various 4 kilobyte pages in the addressable shared memory space 20 that constitute File 1.
  • a file 98 (such as the file 82 of FIG. 2) is represented by one or more shared pages of data 100, 102, 104, 106, and 108 in the addressable shared memory space 20.
  • Each file 98 has a file Inode or descriptor 110 that includes various file attributes 112.
  • the file descriptor 110 contains an address that points to a data stream descriptor 114, and the data stream itself includes one or more addresses 116, 118, 120, 122, and 124 that point to particular pages in the identifiable shared memory space 20.
  • a page is the atomic unit in the addressable shared memory space 20, and it contains up to 4 kilobytes of data. Even if the entire 4 kbytes is not needed, an entire page is used. This is illustrated by the page 108 that only contains about 2 kbytes of data.
  • the files used by the file system 60 are described in greater detail below under the heading "Files.”
  • the filesets are the basic unit for the file system 60. Each fileset is identified with a name having up to 255 characters.
  • the file system 60 exports a set of fileset level operations that allow an administrator to manage the filesets through the following type of actions.
  • This operation creates a new fileset.
  • the fileset is initially created with one file, the empty root directory.
  • a default fileset is created automatically at the initialization of the addressable shared memory space 20.
  • This operation deletes a fileset. All files in the fileset are removed, and all shared memory space allocated to the files in the fileset is discarded and the backing physical storage freed for new storage.
  • the file system 60 will only allow deletion of a fileset until there are no open handles to file data stream in the fileset. In order to ready a fileset for deletion, the fileset must be "shutdown" by putting it off-line.
  • This operation performs fileset level control routines such as setting fileset attributes.
  • Directory are attached to local devices, i.e. "mounted” using parameters stored in the Windows NT registry, or some other similar central storage area for such information.
  • the data control program 60 accesses the central storage and determines which filesets should be mounted.
  • the data control program creates a file object representing each fileset identified by the entries in the central storage.
  • an API may be provided which allows the data control program 60 to dynamically mount and unmount filesets by making appropriate API calls.
  • the users of the file system 60 are not aware of the shared memory "logical volume,” but rather view each fileset as a volume (or partition in the sense of a traditional physical file system).
  • the Win32 GetVolumelnformation is used to get information on the fileset (more precisely, on the logical device on which the fileset is attached to). Because all the filesets share the same pool of the storage in the addressable shared memory space 20, the total volume size returned to the user for each fileset is the current aggregate storage capacity in the addressable shared memory space 20. The same approach is taken for the total free space information, and the aggregate value of the addressable shared memory space 20 is returned for each fileset.
  • Directory entry scanning is one of the most frequently performed operations by user applications. It is also may be the most visible operation in terms of performance. Consequently, much attention is directed to making the directory scan efficient and the WindowsNT File System (NTFS) duplicates sufficient file Inode information in the directory entry such that a read directory operation can be satisfied by scanning and reading the directory entries without going out to read the information from the file Inodes.
  • NTFS WindowsNT File System
  • the problem with this scheme is that the doubly stored file metadata, such as the file time stamps and file size, can be updated quite frequently, making the metadata update more expensive. However, this overhead is considered acceptable in face of the performance gained in directory scan operations.
  • the file system 60 adopts the same philosophy of providing efficient directory scanning by duplicating file Inode information in directory entries. Each directory entry contains sufficient information to satisfy the Win32 query file information requests.
  • the file Inode is stored with the file stream descriptors on a separate page. The Inode is located via a pointer in the directory entry.
  • the file system's directory entries are stored in the directory file's directory entry data stream. To maximize space utilization, each directory entry is allocated on the first available free space in a page that can hold the entire entry. The length of the entry varies depending on the length of the file's primary name. The following information is part of the directory entry: creation time; change time; last write time; last accessed time; pointers to stream descriptor; pointer to parent directory Inode; MS-DOS type file attributes; and MS-DOS style file name (8.3 naming convention). For average file name lengths, a page contains up to about 30 entries. All the file information in the directory entry is also contained in the file Inode, except for the file primary name and MS-DOS file name. The file primary names and associated short names are only stored in the directory entries. This makes the Inode size fixed.
  • the Inode When a file information is modified (except for file names), the Inode is updated in the context of the update transaction and therefore always contains the most up-to-date information.
  • the associated directory entry change is lazily flushed to reduce the cost of double updating. This means the Inode updates are either flushed or recoverable, but not the corresponding directory entry updates. If the directory entry gets out of synch with the Inode (when the Inode change is successfully flushed but not the directory change), the entry is updated the next time the Inode is updated.
  • the directory entries Inodes
  • FIG. 3 illustrates the organization of directory entries and associated Inodes.
  • a file of the file system 60 comprises streams of data and the file system metadata to describe the file.
  • Files are described in the file system 60 by objects called Inodes.
  • the Inode is a data structure that stores the file metadata. It represents the file in the file system 60.
  • a data stream is a logically contiguous stream of bytes. It can be the data stored by applications or the internal information stored by the file system 60.
  • the data streams are mapped onto pages allocated from the addressable shared memory space 20 for storage.
  • the file system 60 segments a data stream into a sequence of 4 kilobyte segments, each segment corresponding to a page.
  • the file system 60 maintains two pieces of size information per data stream: the number of bytes in the data stream; and the allocation size in number of pages.
  • the byte-stream to segment/page mapping information is part of the file metadata and is stored in a structure called data stream descriptor. See FIG. 4.
  • Users' requests for data are specified in terms of range of bytes and the position of the starting byte measured by its offset from the beginning of the data stream, byte position zero.
  • the file system 60 maps the offset into the page containing the starting byte and the intra-page offset from the beginning of the page.
  • Every file of the file system 60 has at least two data streams: the default data stream; and the Access Control List (ACL) stream. Each file may optionally have other data streams.
  • the ACL stream is used to store the security Access Control Lists set on the file.
  • Each data stream is individually named so that the user can create or open access to a specific data stream.
  • the name of the default data stream is assumed to be the primary name of the file.
  • To access a data stream, the user of the file system 60 must first open a file handle to the desired data stream by name. If the file name is used then the handle to the default data stream is opened. This open file handle represents the data stream in all the file system services that operates on the data stream.
  • the file system 60 exports a set of services to operate at the file level.
  • the input to the services are the file object handle (Inode) or the data stream object handle, and the operation specific parameters, including the desired portions of the data stream in byte positions.
  • Open files are represented by data stream objects (or just file objects). Users access files using these file objects, identified to the users through file handles.
  • a file handle is a 32-bit entity representing an instance of an open file stream. For example, WindowsNT creates the file object and returns a file handle to the users in response to the user request for file creation or file open.
  • the file system 60 initializes a pointer to a file control block. Multiple file objects point to the same file control block and each file control block maintains separate stream objects for each open context. Externally, the file handle is opaque to the users. Multiple opens can be issued against the same file. When the user closes a file, the file object and the associated file handle is removed.
  • the file system 60 maps file streams into sequences of segments which become progressively larger; each segment corresponds to one or more pages.
  • the file system 60 attempts to reserve contiguous pages for data streams but only allocates real backing storage on an as needed basis, usually as a result of a file extension requested by writing beyond the data stream allocation size.
  • the file system 60 rounds the extension size in number of bytes up to a multiple of 4 kilobytes to make it an integer number of pages, and requests pages for actual allocation.
  • the number of 4 kilobyte pages allocated by the file system depends on the number of file extension requests made.
  • the file system 60 allocate one 4 kilobyte page for the first extension request, two 4 kilobyte pages for the second request, four 4 kilobyte pages for the third extension request, and so on.
  • the newly allocated pages are zero filled.
  • the file system 60 can reduce the amount of bookkeeping information on the byte offset to page mapping.
  • the file system 60 reserves
  • a 4 kilobyte segment also maps naturally to a page, simplifying the data stream segment to page mapping.
  • an analogy could be made with the NTFS's allocation policy of 4 kilobyte clusters (segment) size for large disks to speed up allocation and reduce fragmentation, such analogy is not completely valid because the actual on-disk allocation segment size depends greatly on the local disk size and the physical file systems.
  • the file system 60 Similar to the NTFS, which controls the allocation of each disk partition and therefore can quickly determine the free volume space available for allocation, the file system 60 requests the total available space information and uses this information to quickly determine whether to proceed with the allocation processing. If the total available space is less than the required allocation size, the request is denied immediately. Otherwise, the file system 60 will proceed to allocate the pages to satisfy the request. The fact that the file system 60 can proceed with the allocation does not guarantee that the allocation will succeed, because the actual total available space may change constantly.
  • the file system 60 takes advantage of the page level replication capability of the underlying distributed addressable shared memory system 20 disclosed in the U.S. patent application incorporated by reference above.
  • Page level replication allows the system to provide file replication.
  • the data streams of a replicated file are backed by pages, which are themselves replicated. In this way, data streams are replicated automatically without intervention of the file system 60.
  • the extra space consumed by the multiple replicas is not reflected in the file (data stream) sizes.
  • the stream allocation size still reports the total allocation size in pages required for one replica.
  • the pages backing temporary files, however, are not replicated.
  • the shared memory provides the distribution mechanism for resource sharing among peer nodes running the file system 60 software.
  • Each instance of the file system 60 on each network node views the shared memory resources (i.e., pages) as being shared with other local or remote threads.
  • the file system 60 needs a way to implement high level, file system locks to provide consistent resource sharing. Any concurrency control structure can be used to implement locks, such as lock objects or semaphores. In database applications, locking may also be achieved by implementing concurrency control structures associated with database indices or keys. In file system applications access to files or directories may be controlled. Another example of file system locks is Byte Range Locking, which provides the users the ability to coordinate shared access to files.
  • a byte range lock is a lock set on a range of bytes of a file.
  • Coordinated shared access to a file can be accomplished by taking locks on the desired byte ranges.
  • the high level file system lock works in the following fashion: (a) a file system resource is to be shared by each file system 60 instance, and the access to the resource is coordinated by a locking protocol using a lock object data structure that represents the high level lock to coordinate the shared resource, and it is the value of the data structure that represents the current state of the lock; (b) to access the resource, the instance at each node must be able to look at the state (or value) of the lock data structure, and if it is "free,” modify it so that it becomes “busy,” but if it is "busy,” then it has to wait to become “free,” and there could be intermediate states between “free” and “busy” (i.e., more than two lock states), but in any event, in this byte range locking example, a lock is a description of a certain byte range being shared/exclusively locked by some thread of the file system 60, and a conflicting new byte range
  • the engine can also be used to coordinate access to resources, but in the case of complex high level resource locking such as Byte Range Locking, using the engine's locking features and capabilities directly to provide locks may be too costly for the following reasons: (a) each byte range lock would require a page representing the lock, and since the number of byte range locks can be large, the cost in terms of page consumption may be too high; and (b) the engine locks only provide two lock states (i.e., shared and exclusive), and high level file system locks may require more lock states.
  • the file system 60 of the invention implements the file system locking using the engine locking as a primitive to provide serialization to access and update the lock data structures.
  • the file system 60 takes a shared lock on the data structure's page using the engine locking features and capabilities before it reads the page to prevent the data structure being modified.
  • To modify the lock structure it sets a exclusive lock on the page. The page lock is taken and released as soon as the lock structure value is read or modified.
  • the file system 60 implements the high level locks in the following way: (a) to take a file system lock (FS lock), the file system 60 sets a shared lock on the FS lock page and reads the page and then examines the lock structure; (b) if the lock structure indicates the resource is unlocked or locked in compatible lock mode, then the file system 60 requests to exclusively lock the page, and this guarantees only one file system 60 node instance can modify the lock data structure, and if the request succeeds then the file system 60 write maps the lock page and then changes the lock structure to set the lock and unlocks the page and sets page access to none; and (c) if the resource is locked in incompatible lock mode, the file system 60 unlocks the page but retains the page read mapped, and it then puts itself (the current thread) in a queue and waits for a system event notifying that the lock value has changed, and when the lock value does change then the file system 60 thread gets notified and repeats the step (a) above.
  • FS lock file system lock
  • the file system 60 sets a
  • the file system 60 implements the notification using a signal primitive.
  • the file system 60 threads waiting for a lock are blocked on a system event.
  • a signal is sent to each blocked file system 60 thread.
  • Each blocked file system 60 threads then wakes up and repeats step (a).
  • FS locks are stored in volatile pages.
  • Byte Range Locking is a file system locking service exported to the users through the Win32 LockFile() and LockFileEx() API. It allows simultaneous access to different non- overlapping regions of a file data stream by multiple users. To access the data stream, the user locks the region (byte range) of the file to gain exclusive or shared read access to the region.
  • the file system 60 supports byte range locking for each individual data stream of the file.
  • Win32-style byte range locking behavior is supported: (a) locking a region of a file is used to acquire shared or exclusive access to the specified region of the file, and the file system 60 will track byte range locks by file handle, therefore file handles provide a way to identify uniquely the owner of the lock; (b) locking a region that goes beyond the current end- of-file position is not an error; (c) locking a portion of a file for exclusive access denies all other processes both read and write access to the specified region of the file, and locking a portion of a file for shared access denies all other processes write access to the specified region of the file but allows other processes to read the locked region, and this means that the file system 60 must check byte range locks set on the data stream not only for lock requests but for every read or write access; (d) if an exclusive lock is requested for a region that is already locked either shared or exclusively by other threads, the request blocks or fails immediately depending on the calling option specified.; and (e) locks may not overlap an existing locked region of the file.
  • the file system 60 For each byte range lock, the file system 60 creates a byte range lock record to represent the lock.
  • the record contains the following information: (a) byte range; (b) lock mode (shared or exclusive); (c) process identification; and (d) a Win32 lock key value.
  • the file system 60 regards the file byte ranges as resources with controlled access.
  • the file system 60 For each byte range lock record, the file system 60 creates a file system lock (as discussed above) to coordinate the access to the byte range "resource.”
  • a compatible byte range lock request (share lock) translates into taking read lock on the file system lock associated with the byte range record.
  • An exclusive byte range lock request is mapped to taking write lock on the file system lock.
  • lock requests waiting on the page containing the desired byte range will be notified when the page content changes.
  • the addressable shared memory system disclosed in the U.S. patent application inco ⁇ orated by reference is an "engine" that can create and manage a virtual memory space that can be shared by each computer on a network and can span the storage space of each memory device connected to the network. Accordingly, all data stored on the network can be stored within the virtual memory space and the actual physical location of the data can be in any of the memory devices connected to the network.
  • the engine or system can create or receive, a global address signal that represents a portion, for example 4k bytes, of the virtual memory space.
  • the global address signal can be decoupled from, i.e. unrelated to, the physical and identifier spaces of the underlying computer hardware, to provide support for a memory space large enough to span each volatile and persistent memory device connected to the system.
  • systems of the invention can operate on 32-bit computers, but can employ global address signals that can be
  • the virtual memory space spans 2 bytes, which is much larger than the 2 address space supported by the underlying computer hardware.
  • Such an address space can be large enough to provide a separate address for every byte of data storage on the network, including all RAM, disk and tape storage.
  • the system includes a directory manager that tracks those portions of the virtual memory space that are in use.
  • the system provides physical memory storage for each portion of the virtual memory space in use by mapping each such portion to a physical memory device, such as a RAM memory or a hard-drive.
  • the mapping includes a level of indirection that facilitates data migration, fault-tolerant operation, and load balancing.
  • each computer can share the memory space. This allows the networked computers to appear to have a single memory, and therefore can allow application programs running on different computers to communicate using techniques currently employed to communicate between applications running on the same machine.
  • the invention of the above-identified, inco ⁇ orated-by-reference U.S. patent application can be understood to include computer systems having a addressable shared memory space.
  • the systems can comprise a data network that carries data signals representative of computer readable information a persistent memory device that couples to the data network and that provides persistent data storage, and plural computers that each have an interface that couples to the data network, for accessing the data network to exchange data signals therewith.
  • each of the computers can include a shared memory subsystem for mapping a portion of the addressable memory space to a portion of the persistent storage to provide addressable persistent storage for data signals.
  • the persistent memory device will be understood to include a plurality of local persistent memory devices that each couple to a respective one of the plural computers.
  • the system can also include a distributor for mapping portions of the addressable memory space across the plurality of local persistent memory devices and a disk directory manager for tracking the mapped portions of the addressable memory space to provide information representative of the local persistent memory device that stores that portion of the addressable memory space mapped thereon.
  • the systems can also include a cache system for operating one of the local persistent memory devices as a cache memory for cache storing data signals associated with recently accessed portions of the addressable memory space.
  • the system can include a migration controller for selectively moving portions of the addressable memory space between the local persistent memory devices of the plural computers.
  • the migration controller can determine and respond to data access patterns, resource demands or any other criteria or heuristic suitable for practice with the invention. Accordingly, the migration controller can balance the loads on the network, and move data to nodes from which it is commonly accessed.
  • the cache controller can be a software program running on a host computer to provide a software managed RAM and disk cache.
  • the RAM can be any volatile memory including SRAM, DRAM or any other volatile memory.
  • the disk can be any persistent memory including any disk, RAID, tape or other device that provides persistent data storage.
  • the systems can also include a coherent replication controller for generating a copy, or select number of copies, of a portion of the addressable memory space maintained in the local persistent memory device of a first computer and for storing the copy in the local persistent memory device of a second computer.
  • the coherent replication controller can maintain the coherency of the copies to provide coherent data replication.
  • the systems can also be understood to provide integrated control of data stored in volatile memory and in persistent memory.
  • a volatile memory device has volatile storage for data signals
  • the shared memory subsystem includes an element, typically a software module, for mapping a portion of the addressable memory space to a portion of the volatile storage.
  • the volatile memory device can be comprised of a plurality of local volatile memory devices each coupled to a respective one of the plural computers
  • the persistent memory device can be comprised of a plurality of local persistent memory devices each coupled to a respective one of the plural computers.
  • a directory manager can track the mapped portions of the addressable memory space, and can include two sub-components; a disk directory manager for tracking portions of the addressable memory space mapped to the local persistent memory devices, and a RAM directory manager for tracking portions of the addressable memory space mapped to the local volatile memory devices.
  • a RAM cache system can operate one of the local volatile memory devices as a cache memory for cache storing data signals associated with recently accessed portions of the addressable memory space.
  • the systems can include additional elements including a paging element for remapping a portion of the addressable memory space between one of the local volatile memory devices and one of the local persistent memory devices; a policy controller for determining a resource available signal representative of storage available on each of the plural computers and, a paging element that remaps the portion of addressable memory space from a memory device of a first computer to a memory device of a second computer, responsive to the resource available signal; and a migration controller for moving portions of addressable memory space between the local volatile memory devices of the plural computers.
  • a paging element for remapping a portion of the addressable memory space between one of the local volatile memory devices and one of the local persistent memory devices
  • a policy controller for determining a resource available signal representative of storage available on each of the plural computers and, a paging element that remaps the portion of addressable memory space from a memory device of a first computer to a memory device of a second computer, responsive to the resource available signal
  • the systems can include a hierarchy manager for organizing the plural computers into a set of hierarchical groups wherein each group includes at least one of the plural computers.
  • Each the group can include a group memory manager for migrating portions of addressable memory space as a function of the hierarchical groups.
  • the system can maintain coherency between copied portions of the memory space by including a coherent replication controller for generating a coherent copy of a portion of addressable memory space.
  • the system can generate or receive global address signals.
  • the systems can include an address generator for generating a global address signal representative of a portion of addressable memory space.
  • the address generator can include a spanning unit for generating global address signals as a function of a storage capacity associated with the persistent memory devices, to provide global address signals capable of logically addressing the storage capacity of the persistent memory devices.
  • the directory manager can be a distributed directory manager for storing within the distributed memory space, a directory signal representative of a storage location of a portion of the addressable memory space.
  • the distributed directory manager can include a directory page generator for allocating a portion of the addressable memory space and for storing therein an entry signal representative of a portion of the directory signal.
  • the directory page generator optionally includes a range generator for generating a range signal representative of a portion of the addressable memory space, and for generating the entry signal responsive to the range signal, to provide an entry signal representative of a portion of the directory signal that corresponds to the portion of the addressable memory space.
  • the distributed directory manager can include a linking system for linking the directory pages to form a hierarchical data structure of the linked directory pages as well as a range linking system for linking the directory pages, as a function of the range signal, to form a hierarchical data structure of linked directory pages.
  • a computer system can include a directory page generator that has a node selector for generating a responsible node signal representative of a select one of the plural computers having location information for a portion of the shared address space. This provides a level of indirection that decouples the directory from the physical storage location of the data. Accordingly, the directory needs only to identify the node, or other device, that tracks the physical location of the data. This way, each time data migrates between physical storage locations, the directory does not have to be updated, since the node tracking the location of the data has not changed and still provides the physical location information.
  • the system can include page generators that generate directory pages that carry information representative of a location monitor, such as a responsible computer node, that tracks a data storage location, to provide a directory structure for tracking homeless data.
  • a location monitor such as a responsible computer node
  • the directory itself can be stored as pages within the virtual memory space. Therefore, the data storage location can store information representative of a directory page, to store the directory structure as pages of homeless data.
  • the invention of the above-identified, inco ⁇ orated-by-reference U.S. patent application can be understood as methods for providing a computer system having a addressable shared memory space.
  • the method can include the steps of providing a network for carrying data signals representative of computer readable information, providing a hard-disk, coupled to the network, and having persistent storage for data signals, providing plural computers, each having an interface, coupled to the data network, for exchanging data signals between the plural computers, and assigning a portion of the addressable memory space to a portion of the persistent storage of the hard disk to provide addressable persistent storage for data signals.
  • FIG. 5 illustrates a computer network 10 that provides a shared memory that spans the memory space of each node of the depicted computer network 210.
  • FIG. 5 illustrates a computer network 210 that includes a plurality of nodes 212a-212c, each having a CPU 214, an operating system 216, an optional private memory device 218, and a shared memory subsystem 220.
  • each node 212a-212c connects via the shared memory subsystem 220 to a virtual shared memory 222.
  • the computer network 210 enables network nodes 212a-212c to communicate and share functionality using the same techniques employed by applications when communicating between applications running on the same machine. These techniques can employ object linking and embedding, dynamic link libraries, class registering, and other such techniques.
  • the nodes 212 can employ the virtual shared memory 222 to exchange data and objects between application programs running on the different nodes 212 of the network 210.
  • each node 212 can be a conventional computer system such as a commercially available IBM PC compatible computer system.
  • the processor 214 can be any processor unit suitable for performing the data processing for that computer system.
  • the operating system 216 can be any commercially available or proprietary operating system that includes, or can access, functions for accessing the local memory of the computer system and networking.
  • the private memory device 218 can be any computer memory device suitable for storing data signals representative of computer readable information.
  • the private memory provides the node with local storage that can be kept inaccessible to the other nodes on the network.
  • the private memory device 218 includes a RAM, or a portion of a RAM memory, for temporarily storing data and application programs and for providing the processor 214 with memory storage for executing programs.
  • the private memory device 18 can also include persistent memory storage, typically a hard disk unit or a portion of a hard disk unit, for the persistent storage of data.
  • the shared memory subsystem 220 depicted in FIG. 5 is an embodiment of the invention that couples between the operating system 216 and the virtual shared memory 222 and forms an interface between the operating system 216 and the virtual shared memory to allow the operating system 216 to access the virtual shared memory 222.
  • the depicted shared memory subsystem 220 is a software module that operates as a stand-alone distributed shared memory engine.
  • the depicted system is illustrative and other systems of the invention can be realized as shared memory subsystems that can be embedded into an application program, or be implemented as an embedded code of a hardware device. Other such applications can be practiced without departing from the scope of the invention.
  • the depicted virtual shared memory 222 illustrates a virtual shared memory that is accessible by each of the nodes 212a-212c via the shared memory subsystem 220.
  • the virtual shared memory 222 can map to devices that provide physical storage for computer readable data, depicted in FIG. 5 as a plurality of pages 224a-224d.
  • the pages form portions of the shared memory space and divide the address space of the shared memory into page addressable memory spaces.
  • the address space can be paged into 4K byte sections.
  • alternative granularity can be employed to manager the shared memory space.
  • Each node 212a-212c through the shared memory subsystem 220 can access each page 224a-224d stored in the virtual shared memory 222.
  • Each page 224a-224d represents a unique entry of computer data stored within the virtual shared memory 222.
  • Each page 224a- 224d is accessible to each one of the nodes 212a-212c, and alternatively, each node can store additional pages of data within the virtual shared memory 222. Each newly stored page of data can be accessible to each of the other nodes 212a-212c.
  • the virtual shared memory 222 provides a system for sharing and communicating data between each node 212 of the computer network 210.
  • FIG. 6 illustrates in functional block diagram form a computer network 230 that has a distributed shared memory.
  • each node 212a-212c has a memory subsystem 232 thaCconnects between the operating system 216 and the two local memory devices, the RAM 234 and the disk 236, and that further couples to a network 238 that couples to each of the depicted nodes 212a, 212b and 212c and to a network memory device 226.
  • FIG. 6 illustrates a distributed shared memory network 30 that includes a plurality of nodes 212a-212c, each including a processing unit 214, an operating system 216, a memory subsystem 232, a RAM 234, and a disk 236.
  • FIG. 6 further depicts a computer network system 38 that connects between the nodes 212a-212c and the network memory device 226.
  • the network 238 provides a network communication system across these elements.
  • the illustrated memory subsystems 232a-232c that connect between the operating system 216a-216c, the memory elements 234a-234c, 236a-236c, and the network 238, encapsulate the local memories of each of the nodes to provide an abstraction of a shared virtual memory system that spans across each of the nodes 212a-212c on the network 238.
  • the memory subsystems 232a-232c can be software modules that act as distributors to map portions of the addressable memory space across the depicted memory devices.
  • the memory subsystems further track the data stored in the local memory of each node 212 and further operate network connections with network 238 for transferring data between the nodes 212a-212c.
  • the memory subsystems 232a-232c access and control each memory element on the network 238 to perform memory access operations that are transparent to the operating system 216. Accordingly, the operating system 216 interfaces with the memory subsystem 232 as an interface to a global memory space that spans each node 212a-212c on the network 238.
  • FIG. 6 further depicts that the system 230 provides a distributed shared memory that includes persistent storage for portions of the distributed memory.
  • the depicted embodiment includes a memory subsystem, such as subsystem 232a, that interfaces to a persistent memory device, depicted as the disk 236a.
  • the subsystem 232a can operate the persistent memory device to provide persistent storage for portions of the distributed shared memory space.
  • each persistent memory device 236 depicted in FIG. 6 has a portion of the addressable memory space mapped onto it.
  • device 236a has the portions of the addressable memory space, C 0 , C d , C g , mapped onto it, and provides persistent storage for data signals stored in those ranges of addresses.
  • the subsystem 232a can provide integrated control of persistent storage devices and electronic memory to allow the distributed shared memory space to span across both types of storage devices, and to allow portions of the distributed shared memory to move between persistent and electronic memory depending on predetermined conditions, such as recent usage.
  • the nodes of the network are organized into a hierarchy of groups.
  • the memory subsystems 232a-232c can include a hierarchy manager that provides hierarchical control for the distribution of data. This includes controlling the migration controller, and policy controller, which are discussed in detail below, to perform hierarchical data migration and load balancing, such that data migrates primarily between computers of the same group, and passes to other groups in hierarchical order. Resource distribution is similarly managed.
  • FIG. 7 illustrates in more detail one shared memory subsystem 240 according to the invention.
  • FIG. 7 depicts a shared memory subsystem 240, that includes an interface 242, a DSM directory manager 244, a memory controller 246, a local disk cache controller 248, and a local RAM cache controller 250.
  • FIG. 7 further depicts the network 254, an optional consumer of the DSM system, depicted as the service 258, the operating system 216, a disk driver 260, a disk element 262 and a RAM element 264.
  • the shared memory subsystem 240 depicted in FIG. 7 can encapsulate the memory management operations of the network node 212 to provide a virtual shared memory that can span across each node that connects into the network 254. Accordingly, each local node 212 views the network as a set of nodes that are each connected to a large shared computer memory.
  • the depicted interface 242 provides an entry point for the local node to access the shared memory space of the computer network.
  • the interface 242 can couple directly to the operating system 216, to a distributed service utility such as the depicted DSM file system 258, to a distributed user-level service utility, or alternatively to any combination thereof.
  • the depicted interface 242 provides an API that is a memory oriented API.
  • the illustrated interface 242 can export a set of interfaces that provide low-level control of the distributed memory.
  • the interface 242 exports the API to the operating system 216 or to the optional DSM service 258.
  • the operating system 216 or the service employs the interface 242 to request standard memory management techniques, such as reading and writing from portions of the memory space.
  • These portions of the memory space can be the pages as described above which can be 4K byte portions of the shared memory space, or other units of memory, such as objects or segments.
  • Each page can be located within the shared memory space which is designated by a global address signal for that page of memory.
  • the system can receive address signals from an application program or, optionally, can include a global address generator that generates the address signals.
  • the address generator can include a spanning module that generates address signals for a memory space that spans the storage capacity of the network.
  • the interface 242 receives requests to manipulate pages of the shared memory space.
  • the interface 242 can comprise a software module that includes a library of functions that can be called by services, the OS 216, or other caller, or device.
  • the function calls provide the OS 216 with an API of high level memory oriented services, such as read data, write data, and allocate memory.
  • the implementation of the functions can include a set of calls to controls that operate the directory manager 244, and the local memory controller 246.
  • the interface 242 can be a set of high level memory function calls to interface to the low-level functional elements of shared memory subsystem 240.
  • FIG. 7 further depicts a DSM directory manager 244 that couples to the interface 242.
  • the interface 242 passes request signals that represent requests to implement memory operations such as allocating a portion of memory, locking a portion of memory, mapping a portion of memory, or some other such memory function.
  • the directory manager 244 manages a directory that can include mappings than can span across each memory device connected to the network 238 depicted in FIG. 6, including each RAM and disk element accessible by the network.
  • the directory manager 244 stores a global directory structure that provides a map of the global address space. In one embodiment as will be explained in greater detail hereinafter, the directory manager 244 provides a global directory that maps between global address signals and responsible nodes on the network.
  • a responsible node stores information regarding the location and attributes of data associated with a respective global address, and optionally stores a copy of that page's data. Consequently, the directory manager 244 tracks information for accessing any address location within the identifier space.
  • the control of the distributed shared memory can be coordinated by the directory manager 244 and the memory controller 246.
  • the directory manager 244 maintains a directory structure that can operate on a global address received from the interface 242 and identify, for that address, a node on the network that is responsible for maintaining the page associated with that address of the shared memory space.
  • the directory manager 244 can identify a node that stores information for locating a copy of the page, and make the call to the memory controller 246 of that node and pass to that node's memory controller the memory request provided by the memory interface 242. Accordingly, the depicted directory manager 244 is responsible for managing a directory structure that identifies for each page of the shared memory space a responsible node that tracks the physical location of the data stored in the respective page. Thus, the directory, rather than directly providing the location of the page, can optionally identify a responsible node, or other device, that tracks the location of the page. This indirection facilitates maintenance of the directory as pages migrate between nodes.
  • the memory controller 246 performs the low level memory access functions that physically store data within the memory elements connected to the network.
  • the directory manager 244 of a first node can pass a memory access request through the interface 242, to the network module of the OS 216, and across the network 254 to a second node that the directory manager 244 identifies as the responsible node for the given address.
  • the directory manager 244 can then query the responsible node to determine the attributes and the current owner node of the memory page that is associated with the respective global address.
  • the owner of the respective page is the network node that has control over the memory storage element on which the data of the associated page is stored.
  • the memory controller 246 of the owner can access, through the OS 216 of that node or through any interface, the memory of the owner node to access the data of the page that is physically stored on that owner node.
  • the directory manager 244 couples to the network module 252 which couples to the network 254.
  • the directory manager can transmit to the network module 252 a command and associated data that directs the network interface 252 to pass a data signal to the owner node.
  • the owner node receives the memory request across network 254 and through network module 252 that passes the memory request to the interface 242 of that owner node.
  • the interface 242 couples to the memory controller 246 and can pass the memory request to the local memory controller of that owner node for operating the local storage elements, such as the disk or RAM elements, to perform the requested memory operation.
  • the memory subsystem 240 of the owner node can then transfer the page of data, or a copy of the page of data, via the network 254 to the node that originally requested access to that portion of the shared memory.
  • the page of data is transferred via the network 254 to the network module 252 of the requesting node and the shared memory subsystem 240 operates the memory controller 246 to store in the local memory of the requesting node a copy of the accessed data.
  • the directory manager 244 identifies a node that has a copy of the data stored in that page and moves a copy of that data into the local memory of the requesting node.
  • the local memory storage, both volatile and persistent, of the requesting node therefore becomes a cache for pages that have been requested by that local node.
  • FIG. 7 depicts a memory controller that has a local disk cache controller 248 and a local RAM cache controller 250. Both of these local cache controllers can provide to the operating system 216, or other consumer pages of the shared memory space that are cache stored in the local memory of the node, including local persistent memory and local volatile memory.
  • the shared memory subsystem can include a coherent replication controller that maintains coherency between cached pages by employing a coherence through invalidation process, a coherence through migration process or other coherence process suitable for practice with the present invention.
  • the coherent replication controller can automatically generate a copy of the data stored in each page and can store the copy in a memory device that is separate from the memory device of the original copy. This provides for fault tolerant operation, as the failure of any one memory device will not result in the loss of data.
  • the coherent replication controller can be a software model that monitors all copies of pages kept in volatile memory and made available for writing.
  • the controller can employ any of the coherency techniques named above, and can store tables of location information that identifies the location information for all generated copies.
  • FIG. 8 illustrates in greater detail one embodiment of a shared memory subsystem according to the invention.
  • the shared memory subsystem 270 depicted in FIG. 8 includes a remote operations element 274, a local RAM cache 276, a RAM copyset 278, a global RAM directory 280, a disk copyset 282, a global disk directory 284, a configuration manager 288, a policy element 290, and a local disk cache 94.
  • FIG. 8 further depicts a network element 304, a physical memory 300, shared data element 302, a physical file system 298, which is part of the operating system 216, a configuration service 308, a diagnostic service 310, and a memory access request 312.
  • the depicted subsystem 270 can be a computer program that couples to the physical memory, file system, and network system of the host node, or can be electrical circuit card assemblies that interface to the host node, or can be a combination of programs and circuit card assemblies.
  • the flow scheduler 272 depicted in FIG. 8 can orchestrate the controls provided by an API of the subsystem 270.
  • the flow scheduler 272 can be a state machine that monitors and responds to the requests 312 and remote requests through network 304 which can be instructions for memory operations and which can include signals representative of the global addresses being operated on.
  • These memory operation requests 312 can act as op-codes for primitive operations on one or more global addresses. They can be read and write requests, or other memory operations.
  • the flow scheduler 272 can be a program, such as an inte ⁇ reter, that provides an execution environment and can map these op-codes into control flow programs called applets.
  • the applets can be independent executable programs that employ both environment services, such as threading, synchronization, and buffer management, and the elements depicted in FIG. 8.
  • the API is capable of being called from both external clients, like a distributed shared memory file system, as well as recursively by the applets and the other elements 274-294 of the subsystem 270.
  • Each element can provide a level of encapsulation to the management of a particular resource or aspect of the system.
  • each element can export an API consisting of functions to be employed by the applets. This structure is illustrated in FIG. 8. Accordingly, the flow scheduler 272 can provide an environment to load and execute applets.
  • the applets are dispatched by the flow scheduler 272 on a per op-code basis and can perform the control flow for sequential or parallel execution of an element to implement the op- code on the specified global address, such as a read or write operation.
  • the flow scheduler 272 can include an element to change dynamically the applet at run time as well as execute applets in parallel and in inte ⁇ reted mode.
  • the depicted shared memory subsystem 270 includes a bifurcated directory manager that includes the global RAM directory 280 and the global disk directory 284.
  • the global RAM directory 280 is a directory manager that tracks information that can provide the location of pages that are stored in the volatile memory, typically RAM, of the network nodes.
  • the global disk directory 284 is a global disk directory manager that manages a directory structure that tracks information that can provide the location of pages that are stored on persistent memory devices. Together, the global RAM directory 280 and the global disk directory 284 provide the shared memory subsystem 270 with integrated directory management for pages that are stored in persistent storage and volatile memory.
  • a paging element can operate the RAM and disk directory managers to remap portions of the addressable memory space between one of the volatile memories and one of the persistent memories.
  • this allows the paging element to remap pages from the volatile memory of one node to a disk memory of another node.
  • the RAM directory manager passes control of that page to the disk directory manager which can then treat the page as any other page of data. This allows for improved load balancing, by removing data from RAM memory, and storing it in the disk devices, under the control of the disk directory manager.
  • the local memory controller of the subsystem 270 is provided by the local RAM cache 276 and the local disk cache 294.
  • the local RAM cache 276 which couples to the physical memory 300 of the local node can access, as described above, the virtual memory space of the local node to access data that is physically stored within the RAM memory 300.
  • the local disk cache 294 couples to the persistent storage device 298 and can access a physical location that maintains in the local persistent storage data of the distributed shared memory.
  • FIG. 8 also depicts a remote operations element 274 that couples between the network 304 and the flow scheduler 272.
  • the remote operations element 274 negotiates the transfer of data across the network 304 for moving portions of the data stored in the shared memory space between the nodes of the network.
  • the remote operations element 274 can also request services from remote peers, i.e. invalidate to help maintain coherency or for other reasons.
  • FIG. 8 also depicts a policy element 290 that can be a software module that acts as a controller to determine the availability of resources, such as printer capabilities, hard-disk space, available RAM and other such resources.
  • the policy controller can employ any of the suitable heuristics to direct the elements, such as the paging controller, disk directory manager, and other elements to dynamically distribute the available resources.
  • FIG. 8 further depicts a memory subsystem 270 that includes a RAM copyset 278 and a disk copyset 282.
  • the disk copyset 282 can maintain information on copies of pages that are stored in the local disk cache, which can be the local persistent memory.
  • the RAM copyset 278 can maintain information on copies of pages that are stored in the local RAM cache which can be the local RAM.
  • These copysets encapsulate indexing and storage of copyset data that can be employed by applets or other executing code for pu ⁇ oses of maintaining the coherency of data stored in the shared memory space.
  • the copyset elements can maintain copyset data that identifies the pages cached by the host node.
  • the copyset can identify the other nodes on the network that maintain a copy of that page, and can further identify for each page which of these nodes is the owner node, wherein the owner node can be a node which has write privileges to the page being accessed.
  • the copysets themselves can be stored in pages of the distributed shared memory space.
  • the local RAM cache 276 provides storage for memory pages and their attributes.
  • the local RAM cache 276 provides a global address index for accessing the cached pages of the distributed memory and the attributes based on that page.
  • the local ram cache 276 provides the index by storing in memory a list of each global address cached in the local RAM. With each listed global address, the index provides a pointer into a buffer memory and to the location of the page data.
  • the index can further provide attribute information including a version tag representative of the version of the data, a dirty bit representative of whether the RAM cached data is a copy of the data held on disk, or whether the RAM cached data has been modified but not yet flushed to disk, a volatile bit to indicate if the page is backed by backing store in persistent memory, and other such attribute information useful for managing the coherency of the stored data.
  • attribute information including a version tag representative of the version of the data, a dirty bit representative of whether the RAM cached data is a copy of the data held on disk, or whether the RAM cached data has been modified but not yet flushed to disk, a volatile bit to indicate if the page is backed by backing store in persistent memory, and other such attribute information useful for managing the coherency of the stored data.
  • the memory subsystem 270 provides the node access to the distributed memory space by the coordinated operation of the directory manager that includes the global RAM directory 280 and the global disk directory 284, the cache controller that includes the local RAM cache and the local disk cache elements 276 and 294, and the copyset elements which include the RAM copyset 278 and the disk copyset 282.
  • the directory manager provides a directory structure that indexes the shared address space. Continuing with the example of a paged shared address space, the directory manager of the subsystem 270 allows the host node to access, by global addresses, pages of the shared memory space.
  • FIGS. 9 and 10 illustrate one example of a directory structure that provides access to the shared memory space.
  • FIG. 9 depicts a directory page 320 that includes a page header 322, directory entries 324 and 326, wherein each directory entry includes a range field 330, a responsible node field 332, and an address field 334.
  • the directory pages can be generated by a directory page generator that can be a software module controlled by the directory manager. It will be understood that the directory manager can generate multiple directories, including one for the Global disk and one for the Global RAM directories.
  • the depicted directory page 320 can be a page of the global address space, such as a 4K byte portion of the shared address space. Therefore, the directory page can be stored in the distributed shared memory space just as the other pages to which the directory pages provide access.
  • each directory page 120 includes a page header 322 that includes attribute information for that page header, which is typically metadata for the directory page, and further includes directory entries such as the depicted directory entries, 324 and 326, which provide an index into a portion of the shared address space wherein that portion can be one or more pages, including all the pages of the distributed shared memory space.
  • the depicted directory page 320 includes directory entries that index a selected range of global addresses of the shared memory space.
  • the directory generator can include a range generator so that each directory entry can include a range field 330 that describes the start of a range of addresses that that entry locates.
  • each directory page 320 can include a plurality of directory entries, such as entries 324 and 326, that can subdivide the address space into a subset of address ranges.
  • the depicted directory page 320 includes two directory entries 324 and 326.
  • the directory entries 324 and 326 can, for example, subdivide the address space into two sub- portions.
  • the start address range of the directory entry 324 could be the base address of the address space
  • the start address range of the directory entry 326 could be the address for the upper half of the memory space.
  • the directory entry 324 provides an index for pages stored in the address space between the base address and up to the mid-point of the memory space and, in complement thereto, the directory entry 326 provides an index to pages stored in the address space that ranges from the mid-point of the address space to the highest address.
  • FIG. 9 further depicts a directory page 320 that includes, in each directory entry, a responsible node field 332 and the child page global address field 334. These fields 332, 334 provide further location information for the data stored in pages within the address range identified in field 330.
  • FIG. 10 depicts a directory 340 formed from directory pages similar to those depicted in FIG. 9.
  • FIG. 10 depicts that the directory 340 includes directory pages 342, 350-354, and 360- 366.
  • FIG. 10 further depicts that the directory 340 provides location information to the pages of the distributed shared memory space depicted in FIG. 10 as pages 370-384.
  • the directory page 342 depicted in FIG. 10 acts like a root directory page and can be located at a static address that is known to each node coupled to the distributed address space.
  • the root directory page 342 includes three directory entries 344, 346, and 348.
  • Each directory entry depicted in FIG. 10 has directory entries similar to those depicted in FIG. 9.
  • directory entry 344 includes a variable Co which represents the address range field 330, a variable Nj representative of the field 332, and a variable Cs representative of the field 334.
  • the depicted root directory page 342 subdivides the address space into three ranges illustrated as an address range that extends between the address Co and Cd, a second address range that extends between the address Cd and Cg, and a third address range that extends between Cg and the highest memory location of the address space.
  • each directory entry 344, 346, and 348 points to a subordinate directory page, depicted as directory pages 350, 352, and 354, each of which further subdivides the address range index by the associated directory entry of the root directory 342.
  • this subdivision process continues as each of the directory pages 350, 352, and 354 each again have directory entries that locate subordinate directory pages including the depicted examples of directory pages 360, 362, 364, and 366.
  • the depicted example of directory pages 360, 362, 364, and 366 are each leaf entries.
  • the leaf entries contain directory entries such as the directory entries 356 and 358 of the leaf entry 360, that store a range field 330 and the responsible node field 332. These leaf entries identify an address and a responsible node for the page in the distributed memory space that is being accessed, such as the depicted pages 370-384.
  • the leaf entry 356 points to the page 370 that corresponds to the range field 330 of the leaf entry 356, which for a leaf entry is the page being accessed.
  • the directory structure 340 provides location information for pages stored in the distributed address space.
  • a node selector can select a responsible node for each page, as described above, so that the leaf entry 356 provides information of the address and responsible node of the page being located. Accordingly, this directory tracks ownership and responsibility for data, to provide a level of indirection between the directory and the physical location of the data.
  • the memory subsystem 270 passes to the responsible node indicated in the leaf entry 356 the address of the page being accessed.
  • the shared memory subsystem of that node can identify a node that stores a copy of the page being accessed, including the owner node. This identification of a node having a copy can be performed by the RAM copyset or disk copyset of the responsible node.
  • the node having a copy stored in its local physical memory can employ its local cache elements, including the local RAM cache and local disk cache to the identify from the global address signal a physical location of the data stored in the page being accessed.
  • the cache element can employ the operating system of the owner node to access the memory device that maintains that physical location in order that the data stored in the page can be accessed.
  • the data read from the physical memory of the owner node can be passed via the network to the memory subsystem of the node requesting the read and subsequently stored into the virtual memory space of the requesting node for use by that node.
  • the depicted directory structure 340 comprises a hierarchical structure.
  • the directory structure 340 provides a structure that continually subdivides the memory space into smaller and smaller sections. Further, each section is represented by directory pages of the same structure, but indexes address spaces of different sizes.
  • a linker inserts or deletes the pages from the directory.
  • the linker is a software module for linking data structures. The linker can operate responsive to the address ranges to provide the depicted hierarchical structure. Accordingly, the depicted directory 340 provides a scaleable directory for the shared address space.
  • the directory pages are stored in the distributed address space and maintained by the distributed shared memory system.
  • a root for the directory can be stored in known locations to allow for bootstrap of the system. Consequently, commonly used pages are copied and distributed, and rarely used pages are shuffled off to disk. Similarly, directory pages will migrate to those nodes that access them most, providing a degree of self-organization that reduces network traffic.
  • FIG. 11 depicts the directory of FIG. 10 being employed by a system according to the invention.
  • FIG. 11 depicts a system 400 that includes two nodes, 406a and 406b, a directory structure 340, and a pair of local memories having volatile memory devices 264a and 264b, and persistent memory devices 262a and 262b.
  • Depicted node 406a includes an address consumer 408a, a global address 410a, and interface 242a, a directory manager 244a and a memory controller 246a.
  • Node 406b has corresponding elements.
  • the nodes are connected by the network 254.
  • the directory 340 has a root page, directory pages A-F, and pages 1-5.
  • Each node 406a and 406b operates as discussed above.
  • the depicted address consumers 408a and 408b can be an application program, file system, hardware device or any other such element that requests access to the virtual memory.
  • the address consumers 408a and 408b request an address, or range of addresses, and the directory manager can include a global address generator that provides the consumer with the requested address, or a pointer to the requested address.
  • the respective directory managers 244a and 244b generate directory pages and store the pages in the directory structure 340.
  • the directory structure 340 tracks the portions of the address space being employed by the system 400, and physical storage for each page is provided within the local memories.
  • the data associated with the directory pages are distributively stored across the two local memories and duplicate copies can exist.
  • the data can move between different local memories and also move, or page, between volatile and persistent storage.
  • the data movement can be responsive to data requests made by memory users like application programs, or by operation of the migration controller described above.
  • the movement of data between different memory locations can occur without requiring changes to the directory 340. This is achieved by providing a directory 340 that is decoupled from the physical location of the data by employing a pointer to a responsible node that tracks the data storage location. Accordingly, although the data storage location can change, the responsible node can remain constant, thereby avoiding any need to change the directory 340.
  • the structured file system 60 described above may be used in a similar fashion to a traditional structured file system.
  • links may be created between files stored in the structured file system 60, such as links between HTML files.
  • links between files in a structured file system may be equally applicable to tracking any quantum of data present in the system, such as a database record or application.
  • a highly resilient set of links between files is provided by creating and maintaining a
  • the LTDB consists of at least two pieces of information for each file that is identified as a link target: (1) the original full file path name; and (2) a globally unique identifier associated with the target file.
  • the globally unique identifier should be invariant for the lifetime of the target file.
  • the file's Inode address within the structured file system 60 is used as the globally unique identifier.
  • the LTDB may be implemented as a hidden directory within the structured file system 60 described above.
  • the directory would contain zero-length files named in such a way to indicate the LTDB entry information.
  • an LTDB entry could be represented by the following zero-length file: /dir/target.doc- ⁇ globally unique identifier>.clk
  • the name of the file (/dir/target.doc) is associated with the file's globally unique identifier.
  • the file's globally unique identifier may be, as discussed above, target.doc's Inode address within the structured file system 60.
  • Entries in the LTDB may be made by the user, that is, when the user makes a file the target of a link the user may add the target file's name and globally unique identifier to the LTDB. In some embodiments, this is accomplished by adding an attribute to each file in the structured file system 60 which, when set, identifies that the file has been identified as the target of a link.
  • a user mode utility may be provided that scans HTML files, documents, short-cut files, and other types of files for links that target files contained in the structured file system 60. When such files are located, the user mode utility sets the attribute associated with those files that indicates the files are a target of a link.
  • the application program creating the link (such as an HTML file construction program) may make the appropriate entry in the LTDB.
  • the LTDB may provide interface routines so that users may create and maintain links between files. These routines allow users or applications to: (1) add a new link entry to the LTDB; and (2) remove a link entry from the LTDB.
  • the routine to add an entry to the LTDB would be called each time a file is identified as the target of a link.
  • the routine accepts as parameters a link target directory handle and a path. It may also accept a link target file handle as a parameter.
  • the routine uses the passed parameters to create an entry in the LTDB by appending the link directory handle and the path to the LTDB.
  • the routine to remove link entries from the LTDB would be called whenever an original link target is deleted or whenever a renamed or moved target is deleted. In addition, this routine would be called when the user resets a file's link target status. In short, this routine attempts to delete all LTDB entries corresponding to the globally unique identifier of the file that is marked for deletion. It accepts the address of the Inode of the file marked for deletion as a parameter. The routine may return an indication that it has succeeded or failed to the user.
  • a "shadow" file of minimum length is stored that indicates the new file name or the file's new location. Since the newly moved or renamed file is the target of the shadow file's link, a corresponding entry is made in the LTDB to track the link. The shadow file bears the original filename and is stored in the original location. Therefore, file open requests that reference the original file name will be resolved by accessing the shadow file. Accessing the shadow file results in the redirection of the file open request to the file in its new location or under its new name.
  • the structured file system 60 When the user indicates that a file should be deleted, the structured file system 60 will check the file's attributes to determine if the attribute. indicating that the file is a target of a link is set. If this attribute is not set, the structured file system 60 deletes the file in a normal fashion. However, if the attribute indicating the file is a target of a link is set, in addition to deleting the file, the structured file system 60 must look up the corresponding link tracking information using the globally unique identifier and remove all entries matching the identifier as well as removing all shadow files which exist for the file. This is accomplished by searching the LTDB for all entries having a globally unique identifier matching the globally unique identifier of the file to be deleted.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Computer Security & Cryptography (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Cette invention se rapporte à un système de suivi de données contenues dans un système de stockage structuré, qui comporte une pluralité de noeuds interconnectés par un réseau. Un programme de commande du système de fichiers, qui est stocké au niveau de chacun des noeuds, manipule un système de fichiers structuré. Chaque instance du programme de commande du système de fichiers est mise en relation avec une mémoire adressable de manière globale qui sert à stocker des données de manière permanente et adressable. Chaque instance du programme de commande des fichiers est utilisée pour permettre l'utilisation de la mémoire adressable de manière globale en tant que dispositif de mémorisation servant à stocker le système de fichier structuré. Un index, qui est généré pour chaque lien créé entre les fichiers contenus dans le système de fichiers structuré, comprend un identificateur de fichier unique.
PCT/US1997/021458 1996-11-22 1997-11-21 Systeme de suivi de donnees WO1998022890A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU54549/98A AU5454998A (en) 1996-11-22 1997-11-21 System for tracking data

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US08/754,481 US6148377A (en) 1996-11-22 1996-11-22 Shared memory computer networks
US08/754,481 1996-11-22
US08/827,534 1997-03-28
US08/827,534 US5918229A (en) 1996-11-22 1997-03-28 Structured data storage using globally addressable memory
US84897097A 1997-05-02 1997-05-02
US08/848,970 1997-05-02

Publications (1)

Publication Number Publication Date
WO1998022890A1 true WO1998022890A1 (fr) 1998-05-28

Family

ID=27419463

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1997/021458 WO1998022890A1 (fr) 1996-11-22 1997-11-21 Systeme de suivi de donnees

Country Status (2)

Country Link
AU (1) AU5454998A (fr)
WO (1) WO1998022890A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002084527A1 (fr) * 2001-04-12 2002-10-24 Fifth Web Limited Systeme et procede facilitant des transformations d'informations
WO2010045879A1 (fr) * 2008-10-23 2010-04-29 华为技术有限公司 Procédé et appareil pour la réalisation de partage de contenu
CN110018998A (zh) * 2019-04-12 2019-07-16 深信服科技股份有限公司 一种文件管理方法、系统及电子设备和存储介质

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2257273A (en) * 1991-06-27 1993-01-06 Digital Equipment Corp Data storage system with device independent file directories
WO1996023268A1 (fr) * 1995-01-23 1996-08-01 Tandem Computers Incorporated Reconstruction des noms d'acces d'un repertoire a partir des indicateurs de fichier dans un systeme informatique

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2257273A (en) * 1991-06-27 1993-01-06 Digital Equipment Corp Data storage system with device independent file directories
WO1996023268A1 (fr) * 1995-01-23 1996-08-01 Tandem Computers Incorporated Reconstruction des noms d'acces d'un repertoire a partir des indicateurs de fichier dans un systeme informatique

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ANDERSON T E ET AL: "SERVERLESS NETWORK FILE SYSTEMS", OPERATING SYSTEMS REVIEW (SIGOPS), vol. 29, no. 5, 1 December 1995 (1995-12-01), pages 109 - 126, XP000584821 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002084527A1 (fr) * 2001-04-12 2002-10-24 Fifth Web Limited Systeme et procede facilitant des transformations d'informations
WO2010045879A1 (fr) * 2008-10-23 2010-04-29 华为技术有限公司 Procédé et appareil pour la réalisation de partage de contenu
US8332423B2 (en) 2008-10-23 2012-12-11 Huawei Technologies, Co., Ltd. Method and apparatus for content sharing
CN101729442B (zh) * 2008-10-23 2013-03-20 华为技术有限公司 一种实现内容共享的方法和装置
EP3255567A1 (fr) * 2008-10-23 2017-12-13 Huawei Technologies Co., Ltd. Procédé et appareil de partage de contenu
CN110018998A (zh) * 2019-04-12 2019-07-16 深信服科技股份有限公司 一种文件管理方法、系统及电子设备和存储介质
CN110018998B (zh) * 2019-04-12 2023-05-12 深信服科技股份有限公司 一种文件管理方法、系统及电子设备和存储介质

Also Published As

Publication number Publication date
AU5454998A (en) 1998-06-10

Similar Documents

Publication Publication Date Title
US6026474A (en) Shared client-side web caching using globally addressable memory
US5918229A (en) Structured data storage using globally addressable memory
EP1008047B1 (fr) Systeme permettant d'effectuer une mise en memoire de donnees tres accessibles grace a une memoire universellement adressable
US5987506A (en) Remote access and geographically distributed computers in a globally addressable storage environment
US6029168A (en) Decentralized file mapping in a striped network file system in a distributed computing environment
WO1998022881A9 (fr) Acces a distance dans un environnement de stockage adressable
EP0976065B1 (fr) Service de repertoire dynamique
Gifford et al. The Cedar file system
US7103616B1 (en) Cookie-based directory name lookup cache for a cluster file system
US6678700B1 (en) System of and method for transparent management of data objects in containers across distributed heterogenous resources
TWI232382B (en) A distributed storage system for data-sharing among client computers running different operating system types
US5504857A (en) Highly available fault tolerant relocation of storage with atomicity
Carter et al. Khazana: An infrastructure for building distributed services
Roy Unix File Access and Caching in a Multicomputer Environment1
WO1998022890A1 (fr) Systeme de suivi de donnees
Dechamboux et al. The Arias distributed shared memory: An overview
Khalidi et al. Spring File System, The
BRIEF I. THE PATENTS-IN-SUIT
Panadiwal High Performance and Reliable Disk and Basic File Services for a Distributed Environment
Scott An FFS-based object store supporting class fragmentation
Dyade The Arias Distributed Shared Memory: an Overview
Yih et al. Persistent immutable shared abstractions
Khalidi et al. Experience Building a File System on a Highly Modular Operating System
Khalidi et al. For more information about USENIX Association contact
Darragh An Extensible, High-Performance, Distributed Persistent Store for Amadeus

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH HU ID IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG UZ VN YU ZW AM AZ BY KG KZ MD RU TJ TM

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH KE LS MW SD SZ UG ZW AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA