Systems and methods for notifying listeners of events

• US 7,756,898 B2
• Filed: 03/31/2006
• Issued: 07/13/2010
• Est. Priority Date: 03/31/2006
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: Isilon Systems Incorporated (Dell Technologies Inc.)
• Inventors: Passey, Aaron J., Fachan, Neal T.
• Primary Examiner(s): Cottingham; John R.
• Assistant Examiner(s): Allen; Nicholas E
• Application Number:
  US11/396,282
• Publication Number:
  US 20070233710A1
• Time in Patent Office: 1,565 Days
• Field of Search: None
• US Class Current: 707/793
• CPC Class Codes: G06F 16/1734 Details of monitoring file system events, e.g. by the use of hooks, filter drivers, logs
• CPC Class Codes: G06F 16/182 Distributed file systems
• CPC Class Codes: G06F 9/542 Event management; Broadcasting; Multicasting; Notifications

Abstract

In one embodiment, systems and methods are provided for tracking events wherein an event system monitors certain areas of a system. When an event occurs in one area of the system, the event system notifies the processes listening to that area of the system of the event.

Claims

1. A system for listening for events on a distributed file system, the system comprising:

a plurality of nodes in communication via a network each node comprising a processor and a memory;

a plurality of files that are logically organized in a tree and each file distributed over the network so as to be stored, in parts, across the memories of two or more of the plurality of nodes;

a plurality of metadata blocks stored in the memories among the plurality of nodes, each metadata block associated with one of the plurality of files and comprising location information for one or more content data blocks of the one of the plurality of files; and

a participant data structure stored in the memories of the plurality of nodes, the participant data structure comprising;

a plurality of file structures, each file structure related to one of the plurality of files and comprising;

data identifying nodes that have one or more processes that are listening for events from the plurality of nodes that affect the corresponding file; and

an indication of the currentness of the file structure;

an initiator data structure stored in the memories of the plurality of nodes, the initiator data structure comprising;

a plurality of file structures, each file structure related to one of the plurality of files and comprising data identifying processes running on the corresponding node that are listening for events that affect the corresponding file;

a first message module running on the processor of a first node of the plurality of nodes and configured to, after an event affecting a first file of the plurality of files occurs, search the participant data structure of the first node to identify at least a second node of the plurality of nodes that is listening for events that affect the first file and send an event message to the second node; and

a second message module running on the processor of the second node and configured to receive the event message and search the initiator data structure of the second node to identify processes running on the second node that are listening for events that affect the first file.

2. The system of claim 1 wherein the indication of the currentness of the participant data structure is a generation number.

3. The system of claim 1, further comprising:

an update module stored in the memory of one or more of the nodes and configured to update the file structures of the participant data structure that correspond to a subset of the plurality of files that represent one branch of the tree.

4. The system of claim 3, wherein the update module is further configured:

to begin with the file structure that corresponds to the leaf node file of the one branch;

to climb the one branch, reviewing the corresponding file structure of the file at each climbed level in the one branch, until reaching a file structure whose indication indicates that the file structure is current; and

from that level, to traverse down the one branch to the leaf node file updating the corresponding file structure of the file at each traversed level in the one branch.

5. The system of claim 4, wherein the update module is further configured:

to update the corresponding file structure of the file at each traversed level in the one branch using the corresponding file structure of the file'"'"'s parent.

11. The system of claim 1 wherein each of the file structures of the participant data structure is stored in the memory of each of the plurality of nodes.

12. The system of claim 1 wherein the data of the plurality of file structures of the participant data structure includes at least one of a process identifier, an indication of listening scope, and an indication of the listened-for events.

6. A method for listening for events in a distributed file system, the method comprising:

logically organizing a plurality of files in a tree and storing each of the plurality of files so that the files are distributed over a network, in parts, across one or more subsets of a plurality of nodes in communication via the network and, for each of the plurality of files,

storing a plurality of metadata blocks in the memories among the plurality of nodes, each metadata block associated with one of the plurality of files and comprising location information for one or more content data blocks of the one of the plurality of files; and

storing a participant data structure corresponding to each file, the participant data structure comprising;

information identifying nodes that have processes that are listening for events from the plurality of nodes that affect the corresponding file; and

an indication of the currentness of the data structure;

storing an initiator data structure corresponding to each node, the initiator data structure comprising;

information related to each of the plurality of files and comprising data identifying processes running on the corresponding node that are listening for events that affect the corresponding file;

searching the participant data structure of a first node of the plurality of nodes after an event affecting a first file of the plurality of files occurs to identify at least a second node of the plurality of nodes that is listening for events that affect the first file;

sending an event message to the second node;

receiving the event message at the second node; and

searching the initiator data structure of the second node to identify processes running on the second node that are listening for events that affect the first file.

7. The method of claim 6 further comprising:

updating the participant data structures that correspond to a subset of the plurality of files that represent one branch of the tree.

8. The method of claim 7 further comprising

starting with the participant data structure that corresponds to the leaf node file of the one branch;

climbing the one branch;

reviewing the corresponding participant data structure of the file at each climbed level in the one branch, until reaching a data structure whose information indicates that the data structure is current; and

from that level, traversing down the one branch to the leaf node file and updating the corresponding participant data structure of the file at each traversed level in the one branch.

9. The event listening method of claim 8 further comprising:

updating the corresponding participant data structure of the file at each traversed level in the one branch using the corresponding data structure of the file'"'"'s parent.

10. A storage medium having a computer program stored thereon for causing a suitably programmed system to process the computer program by performing the method of claim 6 when such computer program is executed on the system.

13. The method of claim 6 wherein the information of the participant data structure includes at least one of a process identifier, an indication of listening scope, and an indication of the listened-for events.

14. The system of claim 6 wherein each of the participant data structures and each of the initiator data structures is stored in the memory of each of the plurality of nodes.