Method and system for event distribution

[0001] 1. Field of the Invention

[0002] The present invention relates in general to a method and system for data processing and in particular to a method and system for distributing events in a data processing system.

[0003] 2. Description of Related Art

[0004] Software applications have traditionally included processes which receive and generate events between processes. Events can relate to an action to be performed. For example, an event can be an alarm which when received, invokes a predetermined action.

[0005] U.S. Pat. No. 5,751,914 describes a system for correlating a plurality of Single Network Management Protocol (SNMP) events within a data processing system by evaluating the events with respect to a predetermined rule in order to determine an action to be performed. A rule network is provided which includes a number of objects arranged in a tree structure having a least one parent object logically linked to a plurality of child objects by passing an input event received by the parent object to the child object. At least one of the objects within the rule network invokes an action in response to receipt of a particular input event. In response to receipt of a series of events, the series of events is evaluated through the tree structure rule network. In response to the evaluation, an action is invoked at one of the number of objects. This patent has the limitation of coordinating a rule to be used with multiple events of a known software application.

[0006] Often new processes will need to respond to events that have been generated by predecessor processes. The predecessor processes never have reliable knowledge of future processes. Therefore a mechanism is needed to generate events and receive events without new processes impacting the operation or design of predecessor processes.

[0007] The present invention relates to a method and system for distributing events in a data processing system using a scaleable hierarchical architecture. Recipient processes desirous of receiving events are registered with a distribution process. Thereafter, when an event is received at the distribution process, it is determined if one or more recipients are registered to receive the event. The event is forwarded to one or more recipients determined to be registered to receive the event. If no recipients are registered to receive the event, the event is dropped.

[0008] A linked list tree can be used to register the events. An event linked list logically links the event entries. One or more process linked lists branch off the event linked list. The one or more process linked lists logically link recipient processes desirous of receiving the associated event. The linked list tree can be dynamically updated to add new event entries or new recipient process entries. The linked list tree provides scalability. The invention allows known and future processes, such as processes of new software versions, to receive events by registering with the distribution process.

[0009] The invention will be more fully described by reference to the following drawings.

[0010] FIG. 1 is a schematic diagram of a system for event distribution in accordance with the teachings of the present invention.

[0011] FIG. 2 is a flow diagram of an implementation of a distribution process.

[0012] FIG. 3 is a schematic diagram of an implementation of a linked list tree for registering events for the distribution process including logical links between event codes and logical links between recipients.

[0013] FIG. 4 is a schematic diagram of an architecture for an implementation of a linked list tree.

[0014] Reference will now be made in greater detail to a preferred embodiment of the invention, an example of which is illustrated in the accompanying drawings. Wherever possible, the same reference numerals will be used throughout the drawings and the description to refer to the same or like parts.

[0015] FIG. 1 is a schematic diagram of a system for event distribution 10 according to the present invention. Processes 12a-12n generate events 13. Events 13 comprise information such as event states, event conditions, and alarms. Events 13 can include a predetermined fixed amount of information. Distribution process 14 receives events 13 from processes 12a-12n in event queue 15. Distribution process 14 determines distribution of events 13 to recipient queues 17a-17n associated with respective recipient processes 16a-16n.

[0016] Processes 12a-12n, distribution process 14, and recipient processes 16a-16n can be implemented on an individual computer. As is common, the computer includes at least an operating system, memory, input/output device may be coupled to a storage device and printer. Additional devices as appreciated by those skilled in the art as are used in a data processing system can be included. Alternatively, processes 12a-12n, distribution process 14, recipient processes 16a-16n can be implemented on one or more computers coupled to one or more networks using respective communications links and communications controller. As will be understood by those skilled in the art a data processing can include gateways, gateway servers, routers, bridges, protocols and various other network hardware and software utilized to interconnect segments of the data processing system.

[0017] FIG. 2 is a flow diagram of an implementation of distribution process 14. In entry block 20, distribution process 14 is initiated. During initiation, each of recipient processes 16a-16n register with distribution process 14 which events are desired to be received from distribution process 14. The events can be registered by establishing a linked list tree of logical links between events and logical links between recipient processes desirous of receiving the same event, as described in detail below. Alternatively, the events can be registered by establishing a two-dimensional table of events and recipient processes desirous of receiving one or more of the events. In decision block 21, it is determined if an event has been received by distribution process 14. If an event has not been received in decision block 21, distribution process 14 returns to decision block 21 to determine if a subsequent event has been received. If an event has been received, it is determined if the event is registered with distribution process 14, in decision block 22. If the event has not been registered, the event is dropped in drop block 23 and no further processing of the event occurs and distribution process 14 returns to decision block 21. If the event has been registered, decision block 24 is performed.

[0018] In decision block 24, it is determined if the list of logical links between the registered recipient processes is at an end. If the list of logical links to registered recipient processes is not at an end, the event is sent to the registered recipient process associated with the current pointer for the list of logical links to registered recipient processes, in send block 25. In increment block 26, the list of logical links to registered recipient processes is updated to point to the next registered recipient process in the list of logical links of registered recipient processes. After the current pointer for the list of logical links is updated, distribution process 14 returns to decision block 24. If the list of logical links of events is at an end in decision block 24, distribution process 14 returns to decision block 21.

[0019] Registration of recipient processes 16a-16n with distribution process 14 can be performed using a linked list tree. An example of a linked list tree of logical links for events and logical links for registered recipient processes is shown in FIG. 3. Linked list tree 30 comprises a plurality of linked lists of distribution process components. Linked list tree 30 is coupled to distribution process 14 or integral with distribution process 14. For example, distribution process components can comprise event code 32 and recipient process identification 33. Event code 32 is an identification assigned to each type of event 13. Recipient process identification 33 is an identification assigned to each of recipient processes 16a-16n. Event linked list 35 links a plurality of event entries 31a-31 n. Each of event entries 31a-31n include a respective event code 32a-32n. A null (0) element at the end of event linked list 35 indicates the end of event linked list 35 and that there are no additional event entries 31 to be parsed.

[0020] Process linked lists 36a-36n link recipient process entries 37a-37n of one or more recipient processes 16a-16n. Each of recipient process entries 37a-37n include a respective recipient process identification 33. A null (0) element at the end of each of process linked lists 36a-36n indicates the end of the respective process linked list 36a-36n and that there are no more recipient process entries 37a-37n to be parsed.

[0021] In the example linked list tree 30 shown in FIG. 3, process linked list 36a comprises recipient process entries 37a, 37b and 37c. Process linked list 36b comprises recipient process entry 37a. Process linked list 36n comprises recipient process entries 37a and 37b. It will be appreciated that linked list tree 30 can have numerous variations depending on determined registration of events 13 and recipients processes 16a-16n.

[0022] FIG. 4 is a schematic diagram of an implementation of a detailed architecture of linked list tree 30. Event entries 31a-31n comprises event code 32, event count 40, next event pointer 41 and attach process link list pointer 42.

[0023] Event count 40 indicates the amount of times each event 13 issues from processes 12a-12n. Event count 13 can be used as a statistic for monitoring processes 12a-12n. Distribution process 14 can monitor event count 40 to determine if an emergency condition exists. For example, if event count 40 is updated over a threshold amount in a predetermined time interval, it could indicate process 12a-12n was rapidly switching states. Rapid switching of states could indicate a possible emergency such as a temperature sensor of a PC board causing fans to rapidly go on and off and rapidly sending events.

[0024] Next event pointer 41 points to the respective next event entry 31b-31n of event linked list 35. Attach process link list pointer 42 points to a respective one of process linked lists 36a-36n. Event entry 31n comprises a 0 zero end flag for next event pointer 41 indicating the end of event linked list 35 and a 0 zero end flag for attach process link pointer 42 indicating no process linked lists 36 are attached to event entry 31n.

[0025] Recipient process entries 37a-37n comprise a respective recipient process identification 33, recipient process queue number 43, event control 44 and next process pointer 45. Recipient process queue number 43 identifies an address of a respective queue 17 of recipient processes 16a-16n for receiving a distributed event. Event control 44 includes information directed to an action to be taken upon receipt of event 13. Next process pointer 45 points to the next recipient process entry 37b-37n. Recipient process entry 37n comprises a 0 zero end flag for next process pointer 45 indicating the end of the respective process linked list 36a-36n.

[0026] Events 13 which were received in event message queue 15 of distribution process 14, are matched to event code 32 by determining event code 32 for event 13 received in message queue 15 and comparing the determined event code 32 with one or more event codes 32 stored in event linked list 35. Upon a match of event code 32 of received event 13 with event code 32 stored in event linked list 35, respective one or more recipient process identifications 33 in association with one of process linked lists 36a-36n are located for the matched event code 32. If one or more recipient process identifications 33 are identified, event 13 is copied from event message queue 15 to each corresponding recipient message queue 17a-17n identified by a respective recipient process queue number 43.

[0027] Linked list tree 30 can be dynamically updated to add new recipient process entries 37 as recipient processes 16a-16n are updated or new recipient processes 16 are invoked. New event code entries 31 can be added at any location in event linked list 35 by appropriately updating next event pointer 41 before the added entry. New recipient process entries 37 can be added at any location in process linked list 36 by appropriately updated next process pointer 45 before the added entry.

[0028] Recipient processes 16a-16n can discontinue receiving previously registered events without removal of the registered recipient process entry 37 from linked list tree 30 by setting event control 44. Event control 44 can include an identified number of bits with each bit or combination representing features of distribution process 14. For example, event control 44 can include 16 bits with a least significant bit being used to enable or disable sending event 13 to a determined registered recipient process 16a-16n. In one implementation if the least significant bit is a 1, a received event 13 is sent to the determined registered recipient processes 16a-16n and if the least significant bit is a 0, event 13 is not sent.

[0029] It is to be understood that the above-described embodiments are illustrative of only a few of the many possible specific embodiments which can represent applications of the principles of the invention. Numerous and varied other arrangements can be readily devised in accordance with these principles by those skilled in the art without departing from the spirit and scope of the invention.