US20140330781A1

US20140330781A1 - Parallel Filesystem Traversal For Transparent Mirroring of Directories and Files

Info

Publication number: US20140330781A1
Application number: US14/335,932
Authority: US
Inventors: Chi Ming Wong; Anand Iyengar; Panagiotis Tsirigotis; Thomas K. Wong; Tadd Ottman; Gaurav Gupta; Lalitha Krishnan; Richard A. Simpkins
Original assignee: Cisco Technology Inc; Cisco Systems Inc
Current assignee: Cisco Technology Inc
Priority date: 2005-06-29
Filing date: 2014-07-20
Publication date: 2014-11-06
Also published as: US20070024919A1; US8832697B2; WO2007002855A3; EP1900189A2; EP1900189A4; WO2007002855A2; EP1900189B1

Abstract

A system and method for parallel file system traversal using multiple job executors is disclosed. The system includes a pool of job executors, a job queue, and a trigger tracker. An object, representative of a node in the filesystem, is added (i.e., pushed) to the job queue for processing by an job executor. The job queue assigns (i.e., pops) objects to job executors in accordance to a LIFO (Last In First Out) ordering. Then the job executor performs an action such as copy. In one embodiment, the trigger tracker follows the processing of a child nodes to a particular child node. Thus, the filesystem is being traversed by several job executors at the same time.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims the benefit of U.S. patent application Ser. No. 11/478,998, filed on Jun. 29, 2006, and also claims priority under 35 USC 119(e) to U.S. Provisional Patent Application No. 60/695,559 filed on Jun. 29, 2005; and is related to U.S. patent applications Ser. No. 10/831,376, filed on Apr. 23, 2004 and U.S. patent applications Ser. No. 10/831,701, filed on Apr. 23, 2004, the contents of each being hereby incorporated by reference.

TECHNICAL FIELD

The present invention relates generally to traversals of filesystems, and more specifically, to using multiple job executors for filesystem traversal.

BACKGROUND

Filesystems are directories that organize and manage access to sub-directories and files stored on a computing device such as a server. For example, a file server can have a filesystem that allows clients to access stored sub-directories and files. In a mirroring operation, a filesystem is copied from one file server to another file server for purposes such as file migration and file replication. To copy the filesystem, a mirroring application traverses the filesystem by visiting each node and performing a copy operation.
However, minor operations performed over a network can be slow due to, for example, idle time experienced while waiting for the results of a command. More particularly, a command such as read sub-directory can be sent to the filesystem being mirrored. The command is packed according to a network protocol and travels across the network before being unpacked. The receiving device process the command and returns results through the network. During this time, the file traversal process is idle.
What is needed is a system and method for parallel file traversal using multiple job executors.

SUMMARY

To meet the above need, a system and method for parallel file system traversal using multiple job executors is disclosed. The system includes a pool of job executors (e.g., threads), a job queue, and a trigger tracker. An object, representative of a node in the filesystem, is added (i.e., pushed) to the job queue for processing by an job executor. The job queue assigns (i.e., pops) objects to job executors in accordance to a LIFO (Last In First Out) ordering. Then the job executor performs an action such as copy. In one embodiment, the trigger tracker follows the processing of a child nodes to a particular child node. Thus, the filesystem is being traversed by several job executors at the same time.
In one embodiment, a bather can be added to the job queue to control the parallel processing. For example, in a debugging operations, a program may want only a certain part of a filesystem to be processed.
In another embodiment, the job queue controls parallel processing by adding sets of objects generated by after all of the job executors have returned. In still another embodiment, the job queue controls parallel processing by assigning objects to the job executors without accepting any adds until assignments are completed.
Advantageously, parallel processing increases the speed, and reduces downtime, or the amount of time a file system is subject to mirroring.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating a system for parallel traversal of a file system according to one embodiment of the present invention.

FIG. 2 is a more detailed block diagram of a file switch of FIG. 1 according to one embodiment of the present invention.

FIG. 3 is a more detailed block diagram of a file traversal module of FIG. 2 according to one embodiment of the present invention.

FIG. 4 is a flow diagram of a method for mirroring using parallel file traversal according to one embodiment of the present invention.

FIG. 5 is a flow diagram of a method for parallel traversal of a filing system according to one embodiment of the present invention.

FIG. 6 is a flow diagram of a method for performing parallel processing according to one embodiment of the present invention.

FIG. 7 is a flow diagram of a method for performing a processing action on an object according to one embodiment of the present invention.

FIGS. 8A-H are schematic diagrams illustrating an example of parallel file traversal according to one embodiment of the present invention.

One skilled in the art will recognize that these Figures are merely examples of the operation of the invention according to one embodiment and that other configurations and modes of operation can be used without departing from the essential characteristics of the invention.

DETAILED DESCRIPTION

A system and method for parallel traversal of a file system are disclosed. For example, during mirroring operations in applications such as file migration, file replication, or snapshot, multiple job executors (e.g., threads) can be used for parallel file system traversal. Generally, traversal of a filesystem (or directory tree) is a process of visiting each directory and file in the filesystem, and performing some action. The system according to some embodiments of the present invention is set forth in FIGS. 1-3, and methods operating therein, according to some embodiments of the present invention, are set forth in FIGS. 4-8.
FIG. 1 is a block diagram illustrating a system 100 for parallel traversal of a file system according to one embodiment of the present invention. System 200 includes a clients 105A-C, a file switch 110, and file servers 120A-C. The components can be implemented with a personal computer or other processing device capable of communication over a network. Each of the components can be coupled in communication through the network such as a TCP/IP (Transmission Control Protocol/Internet Protocol) data network or a telephone network. In one embodiment, the components of system 100 communicate using NAS (Network Attached Storage) protocols or another decentralized protocol for storage networks. The NAS can be implemented with, for example, CIFS or NFS. At a high-level, file switch 110 provides a transparency for clients 105A-C accessing file servers 120A-C. In providing transparency, file switch 110 allows clients to use a switch file handle, which is persistent, to continuously refer to a file, even though the file may change physical locations on file servers 130A-C.
In one embodiment, clients 105A-C use switch file handles issued by file switch 110 to access files stored on file servers 120A-C. Thus, clients 105A-C are unaware of changes to file locations on the back-end. In one embodiment, file switch 110 tracks changes to file locations using a file handle location table as described below with respect to FIG. 2. An original export share stored in the file handle location table from file servers 120A-C contain NAS file handles that are representative of a file location on corresponding file systems. In turn, the switch file handles are associated with NAS file handles and are issued to clients 105A-C. When a file changes locations on the storage network due to, for example, a file migration operations, the NAS switch handle is updated in the file handle location table. In other embodiments, file switch 110 can provide additional services such as authentication to file servers 120A-C on behalf of clients 105A-C. File servers 120A-C include filesystems, the contents of which are tracked and managed by file switch 110.
FIG. 2 is a more detailed block diagram of file switch 110 of FIG. 1 according to one embodiment of the present invention. File switch 110 includes a client module 210, a filesystem traversal module 220, a mirror module 230, and a file server module 240.
Client module 210 manages communications with clients 105A-C while file server module 240 manages communications with file servers 120A-C. Minor module 230 can provide mirroring services to replicate a filesystem from a source file server to a destination file server. In one embodiment, filesystem traversal module 220 manages filesystem traversals during mirroring operations using multiple job executors as described in more detail below with respect to FIG. 3. Because file switch 110 can maintain the availability of the storage network during mirroring, faster processing from multiple job executors reduces the possibility of interruptions to mirroring caused by commands from clients 105A-C.
FIG. 3 is a more detailed block diagram of filesystem traversal module 220 of FIG. 2 according to one embodiment of the present invention. Filesystem traversal module 220 includes a job executor pool 310, a job queue 320, and a trigger tracker 330. Job executor pool 310 is just one embodiment of multiple job executors. An alternative embodiment can be implemented with, for example, a thread pool or a process pool.
Job executor pool 320 includes several job executors 315A-D. Although four job executors 315A-D are shown in the present embodiment, other embodiments can be implemented with, for example, 2, 8 or 64 job executors. Job executors 315A-D can be, for example, hardware logic (e.g., processors or execution units) and/or software instructions. In one embodiment, job executors 315A-D can pop objects from job queue 320. Based on whether the object is a directory, a file, or a trigger, various pre-processing and post-processing actions can be performed. For example, actions can include copying a directory from a source filesystem to a destination filesystem. Pre-processing can be performed before all of the child nodes have been visited, and post-processing can be performed after all of the child nodes have been visited. Specificactions can vary depending on the application making use of filesystem traversals. Moreover, job executors 315A-D can generate objects representative of nodes in a filesystem, and push the objects to job queue 320. In one embodiment, job executors 315A-D operate in parallel since several threads can be operating on several jobs (e.g., one job per thread) at the same time. A single thread can experience latency, due in part to network performance and processing on the file server, while multiple threads can overlap such that the traversal process experiences less idle time. In one embodiment, parallel processing can be enhanced with multiple processor cores, multi-threaded operating systems, and/or inter-process communication.
Job queue 320 can be, for example, a volatile or non-volatile memory device such as a LIFO (Last In First Out) device. Generally, the LIFO device sends out an entry that was most recently added. Job queue 320 can be thread-safe to allow access by multiple threads while remaining consistent. In one embodiment, job queue 320 manages how objects are stored and an order in which objects are dispatched. During push operations, job queue 320 receives and stores objects that represent nodes of the filesystem that need to be processed by job executors 315A-D. In the LIFO embodiment, job queue 320 pops the object from the last set of objects that were pushed. In some embodiments, job queue 320 can be implemented with techniques to control parallel processing with further granularity. For example, a barrier can be added between objects to add a requirement that all objects on one side of the barrier be processed prior to releasing the barrier. In another example, job queue 320 can control pushing and/or pop operations such that job executors 315A-D can only do so once during each round. In other words, an job executor 315A-D that finishes quickly would have to wait until each of the other job executors 315A-D are likewise prepared to push and/or pop.
Trigger tracker 330 can be, for example, a table stored in a memory device. The table can include a list of objects that have triggers, and a count associated with the triggers. Generally, a trigger is created when a particular node in the filesystem has child nodes, and a count is set to the number of child nodes. The parent node is associated with each of the child nodes so that whenever a child node is processed, the count decrements. Once the count reaches zero, the trigger fires, and is added to job queue 320 so that it may be processed. An example of trigger operations is described below in association with FIGS. 8A-H.
FIG. 4 is a flow diagram of a method 400 for mirroring using parallel file traversal according to one embodiment of the present invention. Method 400 can be implemented, for example, in system 100 of FIG. 1. Generally, mirroring is a process in which a filesystem is copied from a source filesystem to a destination filesystem. Applications such as file migration, file replication, and snapshot use mirroring. In one embodiment, as shown in FIG. 4, mirroring is a two step process in which the namespace is copies separately from the data content as described more fully in related U.S. patent applications Ser. Nos. 10/831,376 and 10/831,701. The two step process can be transparent to the user since the filesystems remain online during mirroring.
More specifically, system 100 uses 410 parallel traversal to copy a namespsace, or the directory structure, from an origin export to a destination export. If no changes have occurred to the namespace during the copying process (e.g., creation or deletion of a sub-directory), then it is committed. Next, system 100 uses 420 parallel traversal to copy data content in the namespace from the origin export to the destination export. Again, if no changes have occurred during copying the data content is committed.
FIG. 5 is a flow diagram of a method 500 for parallel traversal of a filing system according to one embodiment of the present invention. Method 500 can be implemented by, for example, filesystem traversal module 220.
Filesystem traversal module 220 adds 510 a root object to job queue 320 as its first entry for processing. Job queue 320 assigns 520 objects to a plurality of threads. Because job queue 320 can be thread-safe, it is able to track which threads have been assigned particular objects.
Job executors 315A-D perform 530 parallel processing on the assigned objects as described further below with respect to FIG. 6. Once the job queue 320 is empty and no job executors 315A-D are processing 540, filesystem traversal has been completed. If the mirroring application is performing transparent mirror, as described above, the process will return to method 400. Referring again to FIG. 4, if the filesystem traversal has just finished the first step shown in step 410 proceeds to again perform filesystem traversal as shown in step 410. If step 420 has finished, the process is complete.
In one embodiment, job queue 320 optionally adds control to step 510 and/or step 520. Accordingly, when assigning 520 objects from storage, job queue 320 can wait until all threads are ready and waiting. Alternatively, when performing 520 parallel processing, job queue 320 can wait until all threads have returned before adding. Furthermore, job queue 320 may add objects from threads in a particular order.
FIG. 6 is a flow diagram of method 530 for performing parallel processing according to one embodiment of the present invention. If the object popped from job queue 320 represents a directory 610 that has child nodes yet to be visited, job executor 315A-D performs 620 a pre-processing action on the object. One embodiment of pre-processing is described below with respect to FIG. 7. In the mirroring application, a sub-directory or file can be copied. If the object popped from job queue 320 represents a trigger 630, then the child nodes have already been visited, and job executor 315A-D optionally performs 640 a post-processing action on the object. Note that in the mirroring process, there is no post-processing action once a copy has been made. However, there may be post processing actions for other processes that should occur after the entire directory has been walked. If the object represents 650 a stop command, the process returns to method 500.
In one embodiment, rather than a stop command, an alternative command can be implemented to control the behavior or parallel filesystem traversal. For example, a barrier can be inserted as a command or object, or command embedded within an object. The barrier can be used to contain processing within a certain portion of the filesystem in an application such as debugging.
FIG. 7 is a flow diagram of method 620 for performing a processing action on an object according to one embodiment of the present invention. Method 620 can be implemented by, for example, job executors 315A-D.
An job executor 315A-D requests 710 an object from job queue 320. A request is sent across the network to an appropriate file server. For example, a read operation for a directory reveals child nodes of a parent node. From the child nodes, job executor 315A-D can generate a set of objects for adding job queue 320, and a trigger with associations for adding to trigger tracker 330. The set of objects is sent 740 to job queue 320, and if needed, to trigger tracker 330.
FIGS. 8A-H are schematic diagrams illustrating an example of parallel file traversal according to one embodiment of the present invention. In FIG. 8A, job queue 320 starts with root node A being the only object. In FIG. 8B, an job executor 315A-D pops node A from job queue 320 and invokes a pre-processing action on the node. A trigger for A, At, corresponding to nodes B and C and having a reference count of two, is added to trigger tracker 330 and objects representing nodes B and C are added to job queue 320.
In FIG. 8C, a first job executor 315A-D pops object C from job queue 320 and processes. At the same time, a second job executor 315A-D pops object B from job queue 320 and processes it in parallel with object C. In this example, the second job executor 315A-D finished processing before the first job executor 315A-D, and pushes objects F and G in to job queue 320 first. In FIG. 8D, the second job executor 315A-D pops object G and processes it while the first job executor 315A-D is finishing object B. Once finished, the first job executor 315A-D pops object E, while the second job executor 315A-D processes object Gin parallel. Since objects G and E do not have any sub-directories in this example, the first and second job executors 315A-D invoke the post-processing actions on them.
In FIG. 8E, objects D and F are popped and processed in parallel. Object D is completed first. In FIG. 8F, trigger Bt's reference count drops to zero as soon as object D is completed. Then, object B itself is added to job queue 320 for dispatch. The free job executor 315A-D gets object B and invokes a post-processing action. Then nodes F and B are completed.
In FIG. 8G, when F is finished, trigger Ct's count drops to zero and node C is added to job queue 320. One of the job executors 315A-D completes C, after which trigger At fires, and node A is added to job queue 320. Finally, in FIG. 8H, node A has a post-processing action performed on it, and the traversal is complete.
In the above description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the invention. It will be apparent, however, to one skilled in the art that the invention can be practiced without these specific details. In other instances, structures and devices are shown in block diagram form in order to avoid obscuring the invention.
Reference in the specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.
Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, pridcipally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
The present invention also relates to an apparatus for performing the operations herein. This apparatus can be specially constructed for the required purposes, or it can be a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program can be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
The algorithms and modules presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems can be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatuses to perform the method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages can be used to implement the teachings of the invention as described herein. Furthermore, as will be apparent to one of ordinary skill in the relevant art, the modules, features, attributes, methodologies, and other aspects of the invention can be implemented as software, hardware, firmware or any combination of the three. Of course, wherever a component of the present invention is implemented as software, the component can be implemented as a standalone program, as part of a larger program, as a plurality of separate programs, as a statically or dynamically linked library, as a kernel loadable module, as a device driver, and/or in every and any other way known now or in the future to those of skill in the art of computer programming Additionally, the present invention is in no way limited to implementation in any specific operating system or environment.
It will be understood by those skilled in the relevant art that the above-described implementations are merely exemplary, and many changes can be made without departing from the true spirit and scope of the present invention. Therefore, it is intended by the appended claims to cover all such changes and modifications that come within the true spirit and scope of this invention.

Claims

What is claimed is:

1. A method comprising:

selecting one or more sets of objects, each object in a set being representative of a child node stemming from at least one of one or more common parent nodes in the file system;

assigning one or more objects from the one of the one or more sets of objects to a plurality of job executors, wherein assignment of an object is prevented before completing operations on each object positioned in relation to a barrier; and

performing parallel actions on the assigned objects, wherein parallel actions include at least one of replication and migration of data characterizing an object,

wherein the plurality of job executors are configured to perform pre-processing on an assigned object when the assigned object has child nodes that have not yet been processed, and to perform post-processing on an assigned object when the assigned object has child nodes that have already been processed.

2. The method of claim 1, further comprising:

adding the selected one or more sets of objects to a job queue; and

incrementing a respective one of one or more counts associated with an object in accordance with a number of child nodes associated with a corresponding one of the one or more common parent nodes represented by the object.

3. The method of claim 2, further comprising inserting a barrier between the objects in the job queue, the barrier preventing assignment of an object before the barrier prior to completing operations on each object after the barrier.

4. The method of claim 1, wherein completing operations on an object in the job queue comprises performing parallel actions on objects representative of child nodes stemming from another object.

5. The method of claim 1, wherein assigning objects comprises:

detecting that each of the plurality of job executors is awaiting an assignment from the job queue; and

assigning the objects from the job queue to the plurality of job executors before adding additional sets of objects to the job queue.

6. The method of claim 1, wherein assigning objects comprises:

detecting that each of the plurality of job executors has a set of objects to add to the job queue; and

adding each set to the job queue before assigning additional objects.

7. The method of claim 1, further comprising requesting information for generating a set of objects.

8. The method of claim 1, wherein the parallel actions are part of one of a namespace replication or a namespace migration.

9. The method of claim 1, wherein the parallel actions are part of at least one of a snapshot application and a data replication.

10. The method of claim 1, wherein the plurality of job executors comprises a plurality of threads.

11. A system for parallel traversal of a file system with a plurality of job executors, the system comprising:

a processor;

a non-transitory memory storing instructions that when executed by a processor cause a system to operate to:

select one or more sets of objects, each object in a set being representative of a child node stemming from at least one of one or more common parent nodes in the file system;

assign one or more objects from the one of the one or more sets of objects to a plurality of job executors, wherein assignment of an object is prevented before completing operations on each object positioned in relation to a barrier; and

perform parallel actions on the assigned objects, wherein parallel actions include at least one of replication and migration of data characterizing an object,

wherein the plurality of job executors are configured to perform pre-processing on an assigned object when the assigned object has child nodes that have not yet been processed, and to perform post-processing on an assigned object when the assigned object has child nodes that have already been processed

12. The system of claim 11, wherein the non-transitory memory further comprises instructions when executed by the processor cause the system to operate to:

add the selected one or more sets of objects to a job queue; and

increment a respective one of one or more counts associated with an object in accordance with a number of child nodes associated with a corresponding one of the one or more common parent nodes represented by the object.

13. The system of claim 12, wherein the non-transitory memory further comprises instructions when executed by the processor cause the system to operate to insert a barrier between the objects in the job queue, the barrier preventing assignment of an object before the barrier prior to completing operations on each object after the barrier.

14. The system of claim 11, wherein completing operations on an object in the job queue comprises performing parallel actions on objects representative of child nodes stemming from another object.

15. The system of claim 11, wherein assigning objects comprises:

assigning the objects from the job queue to the plurality of job executors before adding additional sets of objects to the job queue

16. The system of claim 11, wherein assigning objects comprises:

adding each set to the job queue before assigning additional objects.

17. The system of claim 11, wherein the non-transitory memory further comprises instructions when executed by the processor cause the system to operate to request information for generating a set of objects.

18. The system of claim 11, wherein the parallel actions are part of one of a namespace replication or a namespace migration.

19. The system of claim 11, wherein the plurality of job executors comprises a plurality of threads.

20. The system of claim 11, wherein the parallel actions are part of at least one of a snapshot application and a data replication