WO2016121083A1 - 計算機システム、分散オブジェクト共有方法、エッジノード - Google Patents
計算機システム、分散オブジェクト共有方法、エッジノード Download PDFInfo
- Publication number
- WO2016121083A1 WO2016121083A1 PCT/JP2015/052622 JP2015052622W WO2016121083A1 WO 2016121083 A1 WO2016121083 A1 WO 2016121083A1 JP 2015052622 W JP2015052622 W JP 2015052622W WO 2016121083 A1 WO2016121083 A1 WO 2016121083A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- namespace
- directory
- local
- collision
- node
- Prior art date
Links
Images
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/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/176—Support for shared access to files; File sharing support
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
- G06F16/1824—Distributed file systems implemented using Network-attached Storage [NAS] architecture
- G06F16/1827—Management specifically adapted to NAS
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/1873—Versioning file systems, temporal file systems, e.g. file system supporting different historic versions of files
-
- 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]
Definitions
- the present invention generally relates to distributed object sharing.
- a computer system in which an edge server is arranged at each of a plurality of bases, and a core server communicable with each edge server is arranged at a data center away from the plurality of bases (for example, Patent Document 1).
- the edge node provides a name space (hereinafter referred to as a local name space) like a file system to the client, and the client updates the local name space (for example, an object (directory in the local name space). Or a file) (for example, create, update, delete, rename, or copy).
- An update of the local namespace provided by any of the edge nodes is reflected in a namespace managed by the core node (hereinafter referred to as a center namespace) (migration).
- the update of the center namespace managed by the core node is reflected in the local namespace provided by another edge node (synchronization). In this way, a plurality of edge nodes share a name space.
- Patent Document 1 solves the collision by moving the collision file to the special directory for saving.
- Non-Patent Document 1 solves a collision by either a method of moving a conflict file to a special directory for saving or a method of overwriting a file according to another change operation on the conflict file.
- the method of overwriting (hereinafter referred to as the first method) is simply adopted, the contents of the previously updated object will be lost. If the method of moving the conflict file to the special directory for saving (hereinafter referred to as the second method) is simply adopted, a large number of objects may exist under the special directory for saving, and the management may be complicated. .
- the center node or the second edge node (A) and (B) are performed for objects that differ from the name space. Specifically, it is determined whether the center node or the second edge node corresponds to any one of a plurality of defined collision cases (A), and (B) (A) If the result of the determination is affirmative, processing according to the conflict resolution policy corresponding to the corresponding conflict case is executed.
- At least one of convenience and flexibility is high compared to always performing only one of the first and second methods.
- FIG. 1 shows an overview of a computer system according to an embodiment.
- the structure of NAS is shown.
- the structure of CAS is shown.
- An example of policy information is shown.
- An example of the structure of a special directory is shown.
- An example of the state before and after the migration process from NAS to CAS at the site A is shown.
- An example of the state before and after the synchronous process from CAS to NAS of base B is shown.
- An example of the local site update list is shown below. It is a flowchart of the migration process from NAS to CAS. It is a flowchart of the synchronous process from CAS to NAS. It is a flowchart of a namespace reflection process.
- 2 shows an example of a first UI.
- An example of the second UI is shown.
- xxx list information may be described using the expression “xxx list”, but the information may be expressed in any data structure. That is, in order to show that information does not depend on the data structure, “xxx list” can be called “xxx information”.
- ID or name is used as element identification information, but other types of identification information may be used instead or in addition.
- a reference number or a common number in the reference number is used, and when a description is made by distinguishing the same type of element, the reference number of the element is used.
- an ID assigned to the element may be used instead of the reference code.
- the “storage unit” may be one or more storage devices including a memory.
- the storage unit may be at least a main storage device of a main storage device (typically a volatile memory) and an auxiliary storage device (typically a nonvolatile storage device).
- the storage unit may include at least one of a cache area (for example, a cache memory or a partial area thereof) and a buffer area (for example, a buffer memory or a partial area thereof).
- PDEV indicates a physical storage device, and may typically be a nonvolatile storage device (for example, an auxiliary storage device).
- the PDEV may be, for example, an HDD (Hard Disk Drive) or an SSD (Solid State Drive).
- RAID is an abbreviation for Redundant Array of Independent (or Inexpensive) Disks.
- the RAID group is composed of a plurality of PDEVs, and stores data according to the RAID level associated with the RAID group.
- the RAID group may be referred to as a parity group.
- the parity group may be, for example, a RAID group that stores parity.
- the process may be described with “program” as the subject, but the program is executed by a processor (for example, a CPU (Central Processing Unit)) so that a predetermined process can be appropriately performed. Since the processing is performed using a storage unit (for example, a memory) and / or an interface device (for example, a communication port), the subject of processing may be a processor.
- the processing described with the program as the subject may be processing performed by a processor or an apparatus or system having the processor.
- the processor may include a hardware circuit that performs a part or all of the processing.
- the program may be installed in a computer-like device from a program source.
- the program source may be, for example, a storage medium (for example, a portable storage medium) that can be read by a program distribution server or a computer.
- the program distribution server may include a processor (for example, a CPU) and a storage unit, and the storage unit may further store a distribution program and a program to be distributed. Then, the processor of the program distribution server executes the distribution program, so that the processor of the program distribution server may distribute the distribution target program to other computers.
- two or more programs may be realized as one program, or one program may be realized as two or more programs.
- the management node may be composed of one or more computers. Specifically, for example, when the management computer displays information (specifically, for example, the management computer displays information on its own display device, or the management computer displays display information in a remote display computer)
- the management computer is the management node.
- the plurality of computers (which may include a display computer when the display computer performs display) are management nodes.
- the management computer may include an interface device connected to an I / O system including a display system, a storage unit (for example, a memory), and a processor connected to the interface device and the storage unit.
- the display system may be a display device included in the management computer or a display computer connected to the management computer.
- the I / O system may be an I / O device (for example, a keyboard and a pointing device or a touch panel) included in the management computer, a display computer connected to the management computer, or another computer.
- “Displaying display information” by the management computer means displaying the display information on the display system, which may be displaying the display information on a display device included in the management computer.
- the management computer may transmit display information to the display computer (in the latter case, the display information is displayed by the display computer).
- the management computer inputting / outputting information may be inputting / outputting information to / from an I / O device of the management computer, or a remote computer connected to the management computer (for example, a display) Information may be input / output to / from the computer.
- the information output may be a display of information.
- NAS Network Attached Storage
- CAS Content Addressed Storage
- a conflict resolution policy that prioritizes the center namespace (in other words, the previously updated local namespace) over the local namespace of the reflection destination is adopted. Is done. However, any namespace may be prioritized. For example, the priority of a local namespace in one NAS may be higher than the priority of the center namespace, and the priority of another NAS local namespace may be lower than the priority of the center namespace.
- the conflict resolution policy may be provided in any of the NAS, CAS, and the management node connected to at least one of the CAS and the plurality of NAS.
- reflection from NAS to CAS reflection of local name space update to center name space
- reflection from CAS to NAS center name space update local name Reflection in space
- the computer system may have a plurality of clients and a NAS instead of a plurality of NAS and a CAS. That is, an example of an edge node may be a client, and an example of a core node may be a NAS.
- file system is adopted as an example of the name space.
- the file system is sometimes called “FS”.
- an object closer to the root node than a certain object may be referred to as a “higher object”, and among them, an object closest to the certain object may be referred to as a “parent object”. is there.
- an object farther from the root node than a certain object may be referred to as a “subordinate object”, and among these objects, an object closest to the certain object may be referred to as a “child object”.
- the object is, for example, a directory or a file.
- FIG. 1 shows an outline of a computer system according to the embodiment.
- a plurality of bases 100 exist for one data center 120.
- the base A (100A) and the base B (100B) are two bases, that is, the base A (100A) and the base B (100B), as the plurality of bases 100, but the number of bases 100 may be more than two.
- “A” is added to the end of the reference symbol for the elements in the site A
- “B” is added to the end of the reference symbol for the elements in the site B. May be explained.
- neither “A” nor “B” may be added to the end of the reference sign.
- one of the base A and the base B will be described as an example, and the description of the other may be omitted, in order to avoid redundancy (duplication) of the description.
- the base A and the base B have the same function.
- the site A (100A) includes a client 101A and a NAS 102A that provides the client 101A with a local FS 104A via a communication network 103A (for example, a LAN (Local Area Network)).
- the base B (100B) includes a client 101B and a NAS 102B that provides the client 101B with a local FS 104B via a communication network 103B (for example, a LAN).
- the client 101 is a computer that uses a file sharing service provided by the NAS 102.
- the client 101 uses a file sharing service provided by the NAS 102 via the network 103 using a file sharing protocol such as NFS (Network File System) or CIFS (Common Internet File System).
- NFS Network File System
- CIFS Common Internet File System
- the data center 120 has a CAS 121 that provides a center FS 122.
- NASs 102A and 102B are connected to the CAS 121 via communication networks 105A and 105B (for example, WAN (Wide Area Network)).
- Communication networks 105A and 105B may be integrated, or may be separate communication networks.
- a management node 124 is connected to the CAS 121 via a communication network 123 (for example, a LAN).
- the administrator (operator of the management node 124) manages the CAS 121 (and NAS 102) from the management node 124. Examples of management include starting operation of the CAS 121 (and NAS 102), stopping the CAS 121 (and NAS 102), managing the account of the client 101, and the like.
- the management node 124 may be communicably connected to at least one NAS, or may be provided with at least one NAS management node separately from the management node 124.
- Data read / written by the client 101A is stored as a file in the local FS 104A.
- data read and written by the client 101B is stored as a file in the local FS 104B.
- the local FSs 104A and 104B and the center FS 122 have the same name space.
- the NAS 102 transmits a file stored in the local FS 104 to the data center 120 at a certain opportunity (predetermined or arbitrary timing), and the transmitted file is stored in the center FS 122 (migration). Further, the NAS 102 reflects the update of the center FS 122 to the local FS 104 (synchronization) at a certain opportunity (predetermined or arbitrary timing).
- each NAS 102 holds the policy information 400.
- the policy information 400 includes a plurality of conflict resolution policies respectively corresponding to a plurality of defined collision cases.
- Each NAS 102 refers to the policy information 400 in synchronization, and any one of a plurality of defined collision cases for different objects between the center FS 122 (reflection source) and the local FS 104 (reflection destination). It is judged whether it corresponds to. If the result of the determination is affirmative, the NAS 102 executes processing according to the conflict resolution policy corresponding to the corresponding conflict case for the different object.
- the NAS 102A has updated the local FS 104A in response to a write request from the client 101A. It is assumed that the update is performed on the file X which is one of the child objects of the directory A in the local FS 104A.
- the update of the file X is an update of the contents or the file name of the file X.
- the file X updated in the NAS 102A is referred to as “file X1”.
- the NAS 102B updates the local FS 104B in response to a write request from the client 101B before the local FS 104A is updated or before the update is reflected.
- the update is performed on the same file following the same file path, that is, the file X that is one of the child objects of the directory A.
- the update is also an update of the contents or file name of the file X, but is an update different from the update in the NAS 102A.
- the file X updated in the NAS 102B is referred to as “file X2”.
- File X1 and file X2 collide.
- the NAS 102A communicates with the CAS 121 first. Accordingly, it is assumed that the NAS 102A specifies that the file X1 does not collide with the file in the center FS 122. It is assumed that migration is performed between the NAS 102A and the CAS 121. That is, it is assumed that the update of the local FS 104A is reflected in the center FS 122. Accordingly, in the center FS 122, the file X in the directory A is updated to the file X1.
- the NAS 102B communicates with the CAS 121.
- the NAS 102B specifies that the file X2 collides with the file X1 in the center FS122.
- the NAS 102B specifies a conflict resolution policy corresponding to the collision case from the policy information 400, and executes processing according to the identified conflict resolution policy.
- the processing is as follows. That is, the NAS 102B creates a save directory (not shown) in the local FS 104B below the special directory 702B (“.conflict”).
- the special directory 702B is a predetermined directory that is a creation destination of the save directory.
- the NAS 102B is a file path that is a path in the local FS 104B and a path to the collision file X2 (the collision file X2 and a higher level object existing in the path between the collision file X2 and the root node). Group) is saved in a save directory created under the special directory 702B. Further, as indicated by reference numeral 155, the NAS 102B is a path within the center FS 122 and a path to the file X1 (a group of file X1 and upper objects existing in the path between the file X1 and the root node). ) Is reflected in the local FS 104B. Note that the group to be saved to the save directory and the group to be reflected to the local FS 104 may be only the conflict file and its parent object.
- each NAS 102 holds the policy information 400, but the policy information 400 is connected to at least one of the CAS 121 and the CAS 121 and the NAS 102 as indicated by a broken line instead of or in addition to the NAS 102. May be held by at least one of the management nodes 124 to be managed.
- communication such as notification (or inquiry) may be required between the NAS 102 and the node, but each NAS 102 holds the policy information 400 as in this embodiment. If so, such communication is not necessary.
- an edge node such as NAS 102 is a node that first accepts a change operation on a file (for example, a request for creation, update, or rename), so that such a node has policy information 400 (and follows a conflict resolution policy).
- the significance of executing the process is considered to be greater than that of other types of nodes having the policy information 400.
- the collision case may be specified by either the CAS 121 or the management node 124 instead of the NAS 102.
- the processing according to the conflict resolution policy is performed by the NAS 102, but the processing may be performed according to an instruction from the CAS 121 or the management node 124 that specifies the conflict resolution policy. For example, a save directory may be created in the center FS 122, and the collision file may be saved in the save directory.
- a plurality of collision cases and a plurality of collision resolution policies respectively corresponding to the plurality of collision cases are defined, and processing according to the collision resolution policy corresponding to the corresponding collision case is executed. Accordingly, at least one of convenience and flexibility is higher than always performing only one of the method of overwriting and the method of saving the conflict file in the saving directory. Specifically, for example, it can be expected to maintain the name space of the structure intended by the user.
- FIG. 2 shows the configuration of the NAS 102.
- the interface device is abbreviated as “I / F”.
- the NAS 102 includes a storage device 220 and a NAS controller 200 connected to the storage device 220.
- the storage apparatus 220 includes an I / F 223 connected to the NAS controller 200, a memory 221, a plurality of PDEVs 224, and a CPU 222 connected thereto.
- the plurality of PDEVs 224 may be one or more RAID groups.
- the CPU 222 may provide one or more logical volumes to the NAS controller 200, and a storage space based on at least a part of the one or more logical volumes may be provided to the client 101 as the local FS 104 by the NAS controller 200.
- File data stored in the local FS 104 is stored in one or more PDEVs 224.
- the NAS controller 200 may be a so-called NAS head.
- the NAS controller 200 includes a memory (an example of a storage unit) 201 for storing programs and information, an external network I / F 203 connected to the client 101 via the network 103, and an internal connected to the CAS 121 via the network 105. It has a network I / F 204, an I / F 205 connected to the storage apparatus 220, and a CPU (an example of a processor) 202 connected to them.
- Each of the I / Fs 203 to 205 is an example of an I / F, and two or more of the I / Fs 203 to 205 may be the same I / F.
- the CPU 202 executes a program in the memory 201.
- the memory 201 stores a file sharing server program 206, a file sharing client program 207, an FS program 208, an update list generation program 209, a synchronization program 211, a migration program 212, a local site update list 213, and synchronized version information 214. . At least a part of these programs and information stored in the memory 201 may be read from the storage device 220 to the memory 201 by the CPU 202.
- the file sharing server program 206 is a program that accepts operations on objects (for example, files or directories) in the local FS 104 from the client 101.
- the file sharing client program 207 is a program for performing operations on files stored in the center FS 122.
- the FS program 208 is a program that provides the local FS 104.
- the update list generation program 209 is a program that generates the local site update list 213.
- the synchronization program 211 is a program that performs synchronization from the center FS 122 to the local FS 104.
- the synchronization program 211 holds the policy information 400 described above.
- the policy information 400 may be held so that other programs in addition to the synchronization program 211 can be accessed.
- the migration program 212 is a program for performing migration from the local FS 104 to the center FS 122.
- the local site update list 213 is a list of information related to the update of the local FS 104.
- the update of the local FS 104 may be detected by an OS (Operating System) monitoring function (not shown), and the update list generation program 209 receives a notification that an update of the local FS 104 has been detected, 213 may be generated.
- An example of the local site update list 213 is shown in FIG.
- the own site update list 213 includes SYSTEM_ID 806 that is the ID of the site where the local FS 104 has been updated, CURRENT SYNC VERSION 807 that is information indicating the latest version of synchronization from the CAS 121, and the type of object updated by the client 101 (for example, MIGTYPE 808 that is information indicating a file or directory) and update content 809 that is information indicating update content.
- Reference numeral 213A-1 shows an example of the local site update list when the file X in the site A is edited (when the contents of the file X are updated).
- the update content 809 in the list 231A-1 indicates the file path name of the edited file.
- Reference numeral 213B-2 shows an example of the local site update list when the file X in the site B is edited.
- Reference numeral 213A-3 shows an example of the local site update list when the directory “dir001” in the site A is renamed to “dir004”.
- the update content 809 in the list 213A-3 indicates the name of the rename source and the rename destination, and the name of the parent directory.
- Reference numeral 213A-4 shows an example of the local site update list when the child directory “dir002” is created in the directory “dir001” in the site A.
- the update contents 809 in the list 213A-4 indicate the created directory and its parent directory.
- Reference numeral 213A-5 shows an example of the local site update list when the directory “dir001” in the site A is deleted.
- the update content 809 in the list 213A-5 indicates the deleted directory.
- Such a local site update list 213 is transmitted to the CAS 121. Updates according to the local site update list 213 are reflected on the local FS 104 of another NAS 102 through the CAS 121, so that FS synchronization is possible between the sites.
- the synchronized version information 214 is the latest version of the local site update list 213 reflected in the NAS 102 of the local site among the set of local site update lists 213 (one or more local site update lists 213) held in the CAS 121. Contains information representing. Thus, at the next synchronization, it is possible to select and reflect a list that has not yet been reflected in the local site from the set of local site update lists 213 in the CAS 121.
- FIG. 3 shows the configuration of the CAS 121.
- the CAS 121 includes a storage device 320 and a CAS controller 300 connected to the storage device 320.
- the configuration of the storage device 320 may be the same as the configuration of the storage device 220. That is, the storage apparatus 320 also includes an I / F 323 connected to the CAS controller 300, a memory 321, a plurality of PDEVs 324, and a CPU 322 connected to them.
- the CAS controller 300 is connected to a management node 124 via a memory (an example of a storage unit) 301 for storing programs and information, a front-end network I / F 303 connected to the NAS 102 via the network 105, and a network 123.
- Each of the I / Fs 303 to 305 is an example of an I / F, and two or more of the I / Fs 303 to 305 may be the same I / F.
- the CPU 322 executes a program in the memory 301.
- the memory 301 stores a file sharing server program 306, an FS program 307, an update list 309, and update list version information 310. At least a part of these programs and information stored in the memory 301 may be read from the storage device 320 to the memory 301 by the CPU 302.
- the file sharing server program 306 is a program that receives an operation on an object (for example, a file or a directory) in the center FS 122 from each NAS 102.
- the FS program 307 provides the center FS 122.
- the update list 309 is a local site update list received from each NAS 102 during migration or the like.
- the update list version information 310 is information including the version (for example, version ID (number)) of each update list 309 received from each NAS 102.
- FIG. 4 shows an example of the policy information 400.
- Policy information 400 is held by each of the plurality of NASs 102.
- the policy information 400 may be the same in a plurality of NAS 102 or may be different in at least one NAS 102.
- the policy information 400 includes one or more entries, and information held by each entry includes a policy name 401, a collision case 402, and a collision resolution policy 403.
- the policy name 401 indicates the name of the policy.
- a collision case 402 indicates a defined collision case.
- the conflict resolution policy 403 indicates the contents of defined processing for resolving the corresponding conflict case.
- the updates of both the own base and the other base are merged. Specifically, when different paths under the same directory are created, deleted, or renamed at the other site and the own site, the operations of the own site and the other site are merged. This is because, according to the collision case 402 of the first entry 404, there is substantially no collision.
- the directory has priority over the file. Specifically, if a file with the same name as a directory created or renamed at another site is created at the local site, the directory created at the other site is retained at the local site, and the file created at the local site is saved. Is moved to the directory.
- the earliest migration is prioritized. Specifically, if a file path with the same name as a file path created, updated, deleted or renamed at another site has been created, updated / deleted / renamed at its own site, Operation) is reflected at your site. The file path created, updated or renamed at the local site is moved to the save directory.
- the object deletion at the other site is prioritized. Specifically, when the file path to any object below the directory deleted at the other site has been updated at the own site, the operation at the other site is reflected. At that time, the file updated at the local site is deleted and not moved to the backup directory.
- Such a policy information 400 can be updated by a target node that is at least one of the plurality of NASs 102, the CAS 121, and the management node 124.
- a policy update program (not shown) stored in the memory in the target node and executed by the CPU in the target node (or the policy update function of any program) creates an entry.
- At least one of updating and deleting can be performed.
- the policy update program may automatically update the policy information 400 in response to a configuration change of the computer system (for example, addition of NAS 102 (base 100), reduction of NAS 102 due to failure of NAS 102, etc.).
- the target node provides a user interface (hereinafter referred to as UI) that accepts input of information from the user or administrator, and updates at least a part of the entry according to the information input through the UI, Entries may be added or deleted.
- UI user interface
- GUI Graphic User Interface
- the UI is displayed on, for example, the display system (for example, display device) of the client 101 or the display system (for example, display device or display computer) of the management node 124.
- FIG. 12 shows an example of the first UI.
- the first UI is a UI for manually creating (adding), updating or deleting entries.
- the user or administrator can define at least one of the policy name, the conflict case, and the conflict resolution policy in the computer system through the first UI.
- the target node adds an entry to the policy information 400, deletes an entry from the policy information 400, or updates at least a part of the entries in the policy information 400 according to information input through the first UI. (In the illustrated example, the modification of the existing policy is selected, and the second entry is selected as the modification target).
- a user or an administrator can specify a collision case, a priority order and a reference thereof (for example, which one of the base 100 and the data center 120 has priority, which base 100 has priority, a directory, At least one of a policy name, a conflict case, and a conflict resolution policy can be created, updated, or deleted based on which of the files has priority. That is, it is easy to define the most desirable conflict resolution policy for the user or administrator for each conflict case.
- FIG. 13 shows an example of the second UI.
- the second UI is a UI that accepts input of priority for each of two or more of a plurality of bases (NAS) and data centers (CAS) (and the second UI is a directory and a directory as shown in the figure). You may accept the priority of each file).
- the target node (policy update program) has a plurality of defined collision cases and a plurality of defined collision cases according to the input priorities of each of two or more nodes (and according to the priorities of directories and files). For example, at least one of the plurality of conflict resolution policies corresponding to each may be automatically updated.
- the target node (policy update program) automatically changes the “other site” illustrated in FIG.
- the “own site” illustrated in FIG. 4 may be automatically changed to “another site”.
- FIGS. 12 and 13 are examples, and FIGS. 12 and 13 are schematic diagrams.
- the UI for updating the policy information 400 can be configured in consideration of the knowledge level or operation skill of the user or administrator.
- the target node includes the set information and the time detected by the timer. Based on the above, the policy information 400 may be updated automatically.
- employees may change between bases 100.
- base A corresponds to the accounting department
- base B corresponds to the technical department
- a specific employee moves between the bases
- the priority order of base A and base B may be reversed. It may be desirable. In the present embodiment, such a situation can be flexibly dealt with.
- a computer system having a plurality of NASs 102 and a CAS 121 common to the plurality of NASs 102, it is common to define a plurality of collision cases and a plurality of collision resolution policies respectively corresponding to the plurality of collision cases. It is not a substituting or diverting of control.
- user behavior is restricted (for example, prohibition of access to a specific directory, prohibition of downloading of an executable file, etc.).
- a process for conflict resolution suitable for the collision case and the priority order of the base is performed for each collision case. This solves a problem peculiar to the computer system according to the present embodiment, and cannot be derived only by replacing or diverting general control using a policy.
- FIG. 5 shows an example of the structure of the special directory.
- the time information is positioned higher than the user ID, but the user ID may be positioned higher.
- the file path 505 (file X) is moved to the special directory 702B in the synchronization process.
- the ID of the user who last updated the file X is “User_D”, and the update time is expressed as “year / month / day hour: minute: second”. 2014/07/07 13:45:00 ".
- the synchronization program 211B creates a save directory composed of the directories 501B and 502B below the special directory 702B.
- the synchronization program 211B creates a directory 501B having a name including the upper part “20140707” of the information indicating the update time as a directory name as a child directory of the special directory 702B.
- the synchronization program 211B creates a directory 502B having a name including the user ID “User_D” as a directory name as a child directory of the directory 501.
- the synchronization program 211B moves the file path 505 to the directory 502B.
- the moved file path includes all objects in the file X and the path between the file X and the root node (or includes the file X and its parent directory).
- the file path 505 includes a file X and its parent directory.
- the highest directory (the parent directory of the file X) in the file path 505 becomes one child directory of the directory 502.
- the synchronization program 211B includes the lower part “134500” of the information indicated by the update time in the file name of the file X in the directory 502.
- the objects are classified based on the update time and the user ID in the special directory 702B. For this reason, for example, it can be expected that the saved file can be easily searched, and it is possible to easily determine the correction solution policy of the conflict file.
- the NAS 102B for example, the FS program 208B
- the file and the save directories are transferred to the special directory. You may delete from 702B.
- the NAS 102B (file sharing server program 206B) restricts the change operation for at least one object in the special directory 702B to the client 101B. Specifically, for example, the NAS 102B (file sharing server program 206B) associates the created save object with read-only (reference is permitted but writing is prohibited) as an access restriction. Thereby, it is possible to prevent the structure in the special directory 702B from being destroyed.
- FIG. 6 shows an example of a state before and after the migration process from the NAS 102A at the site A to the CAS 121.
- the update list version information 310 of the CAS 121 includes version IDs “1” to “99”. This means that the center FS 122 has been updated a total of 99 times from the plurality of NASs 102.
- An update list 309 corresponding to version IDs “1” to “99” is stored in the CAS 121.
- the update list 309 up to the version ID “99” is reflected in the local FS 104A (synchronized). Therefore, the version ID “99” is registered in the synchronized version information 214A. Thereafter, it is assumed that the file X is edited to the file X1 by the client 101A.
- a local site update list 213A corresponding to the update (editing) is generated. That is, the latest state of the CAS 121 when it is synchronized from the CAS 121 to the NAS 102A is indicated by reference numeral 603, and thereafter, the latest state of the NAS 102A when the file X is edited by the client 101A is indicated by reference numeral 601. It is in a state to be. The above is the state before migration.
- the migration program 212A executes a synchronization process. This is because the latest state of the CAS 121 is reflected to the local site A and only the difference is transmitted to the CAS 121. However, this processing is not necessary when no version ID is added to the update list version information 310 of the CAS 121 since the last synchronization.
- the synchronized version information 214 of the NAS 102A (601) at the site A indicates “99”
- the update list version information 310 of the CAS 121 (603) indicates “1, 2,. . Since there is no change in the CAS 121 from the version “99” that the NAS 102A (601) of the base A last synchronized, this processing is unnecessary.
- the migration program 212A performs data migration.
- the update from the synchronized version is reflected on the CAS 121.
- it is reflected including the parent directory of the updated part.
- the file path 609 including the file X and its parent directory A is the center FS122. It is reflected in.
- reference numeral 604 indicates. That is, the content of the file X is “X1”.
- the migration program 212A transmits its own site update list 213 to the CAS 121.
- the local site update list 213A-1 (see FIG. 8) corresponding to the update of the file X is transmitted.
- the migration program 212A updates the update list version information 310.
- a value obtained by incrementing the last entry value of the update list version information 310 by one is added to the end of the update list version information 310.
- the value of the last entry of the update list version information 310 is “99”. Therefore, the migration program 212A adds “100” obtained by adding 1 to the update list version information 310. Therefore, the update list version information 310 includes “1, 2,... 99, 100” (reference numeral 604).
- FIG. 7 shows an example of a state before and after the synchronization processing from the CAS 121 to the NAS 102B of the base B.
- the CAS 121 is in a state indicated by reference numeral 604. That is, “1” to “100” are registered in the update list version information 310, and the update list corresponding to the update list version “100” is the list 213A-1 (see FIG. 8).
- the synchronized version information of the NAS 102B indicates “99”, and then the file X is edited by the client 101B and the content becomes “X2”.
- a list 213B-2 (see FIG. 8) is generated as a local site update list of the NAS 102B.
- the above is the description of the state before the synchronization process.
- the synchronization program 211B refers to the update list version information 310 of the CAS 121.
- update list version information 310 including “1, 2,..., 100” is referred to.
- the synchronization program 211B determines whether synchronization is necessary. If the determination result is affirmative (S1002: Yes), the process proceeds to S1003. If the determination result is negative (S1002: No), the process ends. In this step, the synchronization program 211B determines whether or not the center FS 122 has been updated from the state in which the synchronization from the CAS 121 to the NAS 102B was performed last time. If the determination result is affirmative, S1002: Yes, and if the determination result is negative, S1002: No. In the present embodiment, the determination is performed using the synchronized version information 214 and the update list version information 310. In the example of FIG.
- the synchronization program 211B acquires from the CAS 121 the update list created after the previous synchronization.
- the update list 309 (213A-1) corresponding to the update list version “100” is acquired.
- the synchronization program 211B determines whether there is an unprocessed update list 309 or not. If the determination result is affirmative (S1004: Yes), the process proceeds to S1005. If the determination result is negative (S1004: No), the process ends. In the example of FIG. 7, since there is an unprocessed update list 309 (213A-1) acquired in S1003, the process proceeds to S1005.
- the synchronization program 211B executes name space reflection processing.
- the center FS 122 (name space of CAS 121) is reflected in the NAS 102B.
- This step includes one feature of this embodiment, and details of this step are shown in FIG. Therefore, before describing S1006, S1005 will be described with reference to FIG.
- FIG. 11 is a flowchart of the namespace reflection process.
- the synchronization program 211B refers to the policy information 400, and for any object (here, file X) that differs between the name space of the reflection source and the name space of the reflection destination, any of the collision cases that require file saving It is determined whether or not it matches.
- object here, file X
- (C-1) The CAS 121 file has been updated and a file with the same file name has been newly created or updated at the local site 100B (policy name “First-Mig-Win”)
- (C-2) A file having the same name as the directory created or renamed in CAS 121 was created at own site B (policy “Directory-Win”)
- a determination result is obtained that matches any of the collision cases that require file evacuation.
- the update list 309 acquired in S1003 may be compared with the local site update list 213.
- the synchronization program 211B creates a save directory under the special directory (directory “.conflict”) 702B.
- directory “.conflict” 702B the directory “.conflict” 702B.
- the synchronization program 211B changes the name of the collision file and places it in the lower level of the save destination directory.
- the conflict file is moved to the lower level of the directory created in S1102.
- the synchronization program 211 ⁇ / b> B moves the file path 703 including the conflict file to a lower level of “.conflict” 702 ⁇ / b> B as indicated by reference numeral 701.
- the file path 703 includes a directory 501 having a directory name including the date in the file path 703 and a directory 502 having a directory name including the user ID in the file path 703. Moved down.
- the synchronization program 211B includes the lower part of the time information (hour, minute, second) in the file name of the moved file (“fileX_134500”).
- the synchronization program 211B assigns read-only as the access control attribute of the file moved to the save directory in S1103, thereby prohibiting the client 101B from updating the file in the save directory. As a result, it is expected that update of the conflict file and change of the directory hierarchy are avoided, and the subsequent searchability is maintained.
- the synchronization program 211B reflects the update of the center FS 122 to the local FS 104B, and ends the process.
- a file path 705 including a file X whose content is “X1” is added to the root node.
- the synchronization program 211B updates the NAS synchronized version information 214.
- “99” of the synchronized version information 214 before synchronization (reference numeral 602) is updated to “100”. (Reference numeral 701).
- S1005 and S1006 are repeated while the unprocessed update list 309 acquired in S1003 exists.
- the process ends.
- the update list 309 acquired in S1003 is only one corresponding to the version “100”, and no other unprocessed update list 309 exists, so the processing ends.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
(a)そのオブジェクトが作成、アップデート又はリネームされた最新の時刻を表す時刻情報、
(b)そのオブジェクトを使用するユーザのユーザID、
が含まれる。ファイルパスでは、ユーザIDより時刻情報が上位に位置するが、ユーザIDが上位に位置してもよい。図5の例によれば、同期処理において、ファイルパス505(ファイルX)が、特殊ディレクトリ702Bに移動された。具体的には、参照符号504に示す通り、ファイルXを最後にアップデートしたユーザのIDは「User_D」であり、アップデート時刻は、「年/月/日 時:分:秒」で表現すると、「2014/07/07 13:45:00」である。この場合、同期プログラム211Bは、特殊ディレクトリ702Bの下位に、ディレクトリ501B及び502Bで構成された退避用ディレクトリを作成する。具体的には、同期プログラム211Bは、特殊ディレクトリ702Bの子ディレクトリとして、アップデート時刻を示す情報のうちの上位部分「20140707」を含んだ名前をディレクトリ名として有するディレクトリ501Bを作成する。また、同期プログラム211Bは、ディレクトリ501の子ディレクトリとして、ユーザID「User_D」を含んだ名前をディレクトリ名として有するディレクトリ502Bを作成する。同期プログラム211Bは、ディレクトリ502Bに、ファイルパス505を移動する。移動されるファイルパスは、ファイルXと、ファイルXとルートノード間のパスにおける全てのオブジェクトを含む(または、ファイルXとその親ディレクトリを含む)。図5の例では、ファイルパス505は、ファイルX及びそれの親ディレクトリで構成されている。ファイルパス505がディレクトリ502に移動されることにより、ファイルパス505内の最上位ディレクトリ(ファイルXの親ディレクトリ)が、ディレクトリ502の1つの子ディレクトリとなる。更に、同期プログラム211Bは、ディレクトリ502内のファイルXのファイル名に、アップデート時刻が示す情報のうちの下位部分「134500」を含める。
(c-1)CAS121のファイルにアップデートがあり、且つ、同じファイル名のファイルを自拠点100Bで新規作成又はアップデートしていた(ポリシー名「First-Mig-Win」)
(c-2)CAS121で作成又はリネームされたディレクトリと同名のファイルを自拠点Bで作成していた(ポリシー「Directory-Win」)
ファイル退避が必要ないずれかの衝突ケースに合致するとの判断結果が得られる。また、(c-1)及び(c-2)のいずれかに該当するか否かを判断するためには、S1003で取得したアップデートリスト309と自拠点アップデートリスト213とを比較すればよい。
Claims (13)
- 複数のローカル名前空間をそれぞれ提供する複数のエッジノードと、
前記複数のエッジノードに接続され前記複数のローカル名前空間に対応したセンタ名前空間を提供するセンタノードと
を有し、
第1のエッジノードが提供する第1のローカル名前空間のアップデートをセンタ名前空間に反映することであるマイグレーションにおいて、又は、前記センタ名前空間のアップデートを第2のエッジノードが提供する第2のローカル名前空間に反映することである同期において、前記センタノード又は前記第2のエッジノードが、反映元の名前空間と反映先の名前空間との間において異なるオブジェクトについて、
(A)定義された複数の衝突ケースのうちのいずれかの衝突ケースに該当するか否かを判断し、
(B)(A)の判断の結果が肯定の場合に、該当する衝突ケースに対応した衝突解決ポリシーに従う処理を実行し、
前記第1のエッジノードは、いずれかのエッジノードであり、
前記第2のエッジノードは、前記第1のエッジノード以外のいずれかのエッジノードである、
計算機システム。 - 前記複数のエッジノードと、前記センタノードと、前記複数のエッジノード及び前記センタノードとのうちの少なくとも1つに接続された管理ノードとのうちの少なくとも1つである対象ノードが、
ユーザ又は管理者から情報の入力を受け付けるユーザインターフェースを提供し、
前記ユーザインターフェースを通じて入力された情報に従い、前記定義された複数の衝突ケースと、前記定義された複数の衝突ケースにそれぞれ対応した複数の衝突解決ポリシーとのうちの少なくとも1つをアップデート又は削除する、又は、衝突ケースと衝突解決ポリシーとの組を新たに追加する、
請求項1記載の計算機システム。 - 前記対象ノードが、
前記ユーザインターフェースを通じて、前記複数のエッジノードと前記センタノードのうちの2以上のノードの各々についての優先順位の入力を受け、
前記2以上のノードの各々の入力された優先順位に従い、前記定義された複数の衝突ケースと、前記定義された複数の衝突ケースにそれぞれ対応した複数の衝突解決ポリシーとのうちの少なくとも1つをアップデートする、
請求項2記載の計算機システム。 - 前記複数のエッジノードの各々が、前記定義された複数の衝突ケースと、前記定義された複数の衝突ケースにそれぞれ対応した複数の衝突解決ポリシーとを表す情報を記憶し、
前記複数のエッジノードの各々が、前記センタ名前空間のアップデートをそのエッジノードが提供するローカル名前空間に反映することである同期において、前記センタ名前空間内の複数のオブジェクトのうち変更された1以上のオブジェクトの各々について、(A)及び(B)を実行する、
請求項1記載の計算機システム。 - 前記該当する衝突ケースに対応した衝突解決ポリシーが、前記第2のローカル名前空間における衝突オブジェクトの退避を必要とする場合、前記第2のエッジノードが、(B)において、その衝突オブジェクトの退避先とする退避用ディレクトリを、前記第2のローカル名前空間に作成し、作成した退避用ディレクトリに、その衝突オブジェクトを移動する、
請求項1記載の計算機システム。 - 該当する衝突ケースが、反映元の名前空間において作成又はリネームされたディレクトリと同名のファイルが反映先の名前空間において作成されているというケースであり、
前記該当する衝突ケースに対応した衝突解決ポリシーは、ファイルよりディレクトリを優先することに従うポリシーであり、
(B)において、該当する衝突ケースに対応した衝突解決ポリシーに従う処理として、
前記第2のローカル名前空間に、前記作成又はリネームされたディレクトリが格納され、
前記同名のファイルが、前記第2のローカル名前空間に作成された退避用ディレクトリに移動される、
請求項5記載の計算機システム。 - 該当する衝突ケースが、反映元の名前空間において作成、アップデート、削除又はリネームされたファイルパスと同名のファイルパスが反映先の名前空間において作成、アップデート、削除又はリネームされているというケースであり、
前記該当する衝突ケースに対応した衝突解決ポリシーは、最先のマイグレーションを優先することに従うポリシーであり、
(B)において、該当する衝突ケースに対応した衝突解決ポリシーに従う処理として、
前記第2のローカル名前空間に、反映元の名前空間における作成、アップデート、削除又はリネームの結果が反映され、
前記第2のローカル名前空間において作成、アップデート、削除又はリネームされたファイルパスに属するファイルが、前記第2のローカル名前空間に作成された退避用ディレクトリに移動される、
請求項5記載の計算機システム。 - 該当する衝突ケースが、反映元の名前空間において削除されたディレクトリと同一ディレクトリ内のオブジェクトが反映先の名前空間においてアップデートされているというケースであり、
前記該当する衝突ケースに対応した衝突解決ポリシーは、ディレクトリ削除を優先することに従うポリシーであり、
(B)において、該当する衝突ケースに対応した衝突解決ポリシーに従う処理として、前記第2のローカル名前空間における前記同一のディレクトリが、退避されること無しに削除される、
請求項5記載の計算機システム。 - 前記第2のエッジノードが、前記第2のエッジノードのユーザからの前記退避用ディレクトリへの書き込みを禁止する、
請求項5記載の計算機システム。 - 前記退避用ディレクトリへのファイルパスに、前記第2のエッジノードにより、移動されるオブジェクトの使用に関する情報として、以下のうちの少なくとも1つが含まれる、
(a)そのオブジェクトが作成、アップデート又はリネームされた最新の時刻を表す時刻情報、
(b)そのオブジェクトを使用するユーザのユーザID、
請求項5記載の計算機システム。 - 前記第2のローカル名前空間に、退避用ディレクトリの上位ディレクトリとなる特殊ディレクトリがあり、
前記第2のエッジノードが、退避用ディレクトリの作成として、
前記特殊ディレクトリの子ディレクトリとして、前記時刻情報の上位部分とユーザIDとのうちの一方を含んだ名前をディレクトリ名として有する第1のディレクトリを作成し、
前記第1のディレクトリの子ディレクトリとして、前記時刻情報の上位部分とユーザIDとのうちの他方を含んだ名前をディレクトリ名として有する第2のディレクトリを作成し、
前記第2のエッジノードが、
前記第2のディレクトリにオブジェクトを移動し、
前記第2のディレクトリに移動されるオブジェクトの名前に、前記時刻情報の下位部分を含める、
請求項10記載の計算機システム。 - 複数のローカル名前空間をそれぞれ提供する複数のエッジノードと、前記複数のエッジノードに接続され前記複数のローカル名前空間に対応したセンタ名前空間を提供するセンタノードとを有する計算機システムにおいて行われる分散オブジェクト共有方法であって、
第1のエッジノードが提供する第1のローカル名前空間のアップデートをセンタ名前空間に反映することであるマイグレーションにおいて、又は、前記センタ名前空間のアップデートを第2のエッジノードが提供する第2のローカル名前空間に反映することである同期において、前記センタノード又は前記第2のエッジノードにより、反映元の名前空間と反映先の名前空間との間において異なるオブジェクトについて、
(A)定義された複数の衝突ケースのうちのいずれかの衝突ケースに該当するか否かを判断し、
(B)(A)の判断の結果が肯定の場合に、該当する衝突ケースに対応した衝突解決ポリシーに従う処理を実行し、
前記第1のエッジノードは、いずれかのエッジノードであり、
前記第2のエッジノードは、前記第1のエッジノード以外のいずれかのエッジノードである、
分散オブジェクト共有方法。 - 別のエッジノードに接続されたセンタノードに接続されたインターフェースデバイスと、
前記インターフェースデバイスに接続されローカル名前空間を提供するプロセッサと
を有し、
前記センタノードは、センタ名前空間を提供し、
前記センタ名前空間は、前記別のエッジノードが提供する別のローカル名前空間のアップデートが反映されることによりアップデートされ、
前記センタ名前空間のアップデートを前記ローカル名前空間に反映することである同期において、前記プロセッサが、反映元の名前空間と反映先の名前空間との間において異なるオブジェクトについて、
(A)定義された複数の衝突ケースのうちのいずれかの衝突ケースに該当するか否かを判断し、
(B)(A)の判断の結果が肯定の場合に、該当する衝突ケースに対応した衝突解決ポリシーに従う処理を実行する、
エッジノード。
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2015/052622 WO2016121083A1 (ja) | 2015-01-30 | 2015-01-30 | 計算機システム、分散オブジェクト共有方法、エッジノード |
JP2016571623A JP6298903B2 (ja) | 2015-01-30 | 2015-01-30 | 計算機システム、分散オブジェクト共有方法、エッジノード |
US15/540,045 US10412163B2 (en) | 2015-01-30 | 2015-01-30 | Computer system, distributed object sharing method, and edge node |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2015/052622 WO2016121083A1 (ja) | 2015-01-30 | 2015-01-30 | 計算機システム、分散オブジェクト共有方法、エッジノード |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2016121083A1 true WO2016121083A1 (ja) | 2016-08-04 |
Family
ID=56542734
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2015/052622 WO2016121083A1 (ja) | 2015-01-30 | 2015-01-30 | 計算機システム、分散オブジェクト共有方法、エッジノード |
Country Status (3)
Country | Link |
---|---|
US (1) | US10412163B2 (ja) |
JP (1) | JP6298903B2 (ja) |
WO (1) | WO2016121083A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2019086866A (ja) * | 2017-11-02 | 2019-06-06 | 富士ゼロックス株式会社 | 情報処理装置及びプログラム |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10015249B2 (en) * | 2015-11-04 | 2018-07-03 | Dropbox, Inc. | Namespace translation |
JP6805196B2 (ja) * | 2018-02-23 | 2020-12-23 | 日本電信電話株式会社 | ポリシー競合解消システム及びポリシー競合解消方法 |
CN112231296A (zh) * | 2020-09-30 | 2021-01-15 | 北京金山云网络技术有限公司 | 一种分布式日志处理方法、装置、系统、设备及介质 |
US20230105587A1 (en) * | 2021-10-04 | 2023-04-06 | EMC IP Holding Company LLC | Destination file copying |
US11599506B1 (en) * | 2021-10-28 | 2023-03-07 | EMC IP Holding Company LLC | Source namespace and file copying |
CN115174603B (zh) * | 2022-07-06 | 2023-08-22 | 中国联合网络通信集团有限公司 | Nas服务系统、实现方法、电子设备及存储介质 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070282914A1 (en) * | 2006-05-31 | 2007-12-06 | Microsoft Corporation | Resolving update-delete conflicts |
JP2013529810A (ja) * | 2010-06-23 | 2013-07-22 | マイクロソフト コーポレーション | 共有データコレクション |
WO2014128819A1 (ja) * | 2013-02-19 | 2014-08-28 | 株式会社 日立製作所 | 情報処理システム及びそのデータ同期制御方式 |
JP2014524621A (ja) * | 2011-12-13 | 2014-09-22 | 華為技術有限公司 | ファイル同期方法及び装置 |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7778963B2 (en) * | 2005-04-26 | 2010-08-17 | Microsoft Corporation | Constraint-based conflict handling for synchronization |
EP2784300B1 (en) | 2013-03-28 | 2016-05-18 | Continental Automotive GmbH | Valve assembly for a fluid injection valve and fluid injection valve |
EP3149606B1 (en) * | 2014-05-30 | 2019-05-08 | Hitachi Vantara Corporation | Metadata favored replication in active topologies |
-
2015
- 2015-01-30 US US15/540,045 patent/US10412163B2/en active Active
- 2015-01-30 WO PCT/JP2015/052622 patent/WO2016121083A1/ja active Application Filing
- 2015-01-30 JP JP2016571623A patent/JP6298903B2/ja not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070282914A1 (en) * | 2006-05-31 | 2007-12-06 | Microsoft Corporation | Resolving update-delete conflicts |
JP2013529810A (ja) * | 2010-06-23 | 2013-07-22 | マイクロソフト コーポレーション | 共有データコレクション |
JP2014524621A (ja) * | 2011-12-13 | 2014-09-22 | 華為技術有限公司 | ファイル同期方法及び装置 |
WO2014128819A1 (ja) * | 2013-02-19 | 2014-08-28 | 株式会社 日立製作所 | 情報処理システム及びそのデータ同期制御方式 |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2019086866A (ja) * | 2017-11-02 | 2019-06-06 | 富士ゼロックス株式会社 | 情報処理装置及びプログラム |
JP7119340B2 (ja) | 2017-11-02 | 2022-08-17 | 富士フイルムビジネスイノベーション株式会社 | 情報処理装置及びプログラム |
Also Published As
Publication number | Publication date |
---|---|
US20180109611A1 (en) | 2018-04-19 |
US10412163B2 (en) | 2019-09-10 |
JPWO2016121083A1 (ja) | 2017-08-24 |
JP6298903B2 (ja) | 2018-03-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP6298903B2 (ja) | 計算機システム、分散オブジェクト共有方法、エッジノード | |
US11698885B2 (en) | System and method for content synchronization | |
US8762344B2 (en) | Method for managing information processing system and data management computer system | |
US10936547B2 (en) | Filesystem replication using a minimal filesystem metadata changelog | |
JP5775177B2 (ja) | クローンファイル作成方法と、それを用いたファイルシステム | |
US8266176B2 (en) | Storage system and file access determination method of the same | |
JP6430499B2 (ja) | Posix互換なファイル・システム、ファイル・リストを生成する方法および記憶デバイス | |
JP5082310B2 (ja) | データ移行装置及びプログラム | |
US9116913B2 (en) | File storage system and file cloning method | |
US8060711B2 (en) | Storage system | |
US9031906B2 (en) | Method of managing data in asymmetric cluster file system | |
JP2019204278A (ja) | 情報処理システム、情報処理装置およびプログラム | |
WO2016079629A1 (en) | Optimizing database deduplication | |
US20090198704A1 (en) | Method for automated network file and directory virtualization | |
EP3314469B1 (en) | Cloud-native documents integrated with legacy tools | |
JP4937863B2 (ja) | 計算機システム、管理計算機及びデータ管理方法 | |
US7730351B2 (en) | Per file dirty region logging | |
US10489353B2 (en) | Computer system and data management method | |
US20100250634A1 (en) | File server system and file management method | |
US9286318B2 (en) | Edge server and storage control method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 15879980 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2016571623 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 15540045 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 15879980 Country of ref document: EP Kind code of ref document: A1 |