U.S. patent application number 13/275500 was filed with the patent office on 2013-04-18 for selected alert delivery in a distributed processing system.
This patent application is currently assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION. The applicant listed for this patent is Mark G. Atkins, James E. Carey, Philip J. Sanders. Invention is credited to Mark G. Atkins, James E. Carey, Philip J. Sanders.
Application Number | 20130097215 13/275500 |
Document ID | / |
Family ID | 48086715 |
Filed Date | 2013-04-18 |
United States Patent
Application |
20130097215 |
Kind Code |
A1 |
Atkins; Mark G. ; et
al. |
April 18, 2013 |
Selected Alert Delivery In A Distributed Processing System
Abstract
Methods, apparatuses, and computer program products for selected
alert delivery in a distributed processing system are provided.
Embodiments include receiving a plurality of events from one or
more event producing components of the distributed processing
system; creating, by an incident analyzer, in dependence upon the
events a truth space representing events that make one or more
conditional event processing rules true, the truth space including
a set of truth points, each truth point including a set of events
and a set of event locations; creating, by the incident analyzer,
in dependence upon the truth space one or more alerts including
assigning one of the locations of the truth space to one or more of
the alerts; and sending, by the incident analyzer, the alerts to at
least one component of the distributed processing system.
Inventors: |
Atkins; Mark G.; (Arvada,
CO) ; Carey; James E.; (Rochester, MN) ;
Sanders; Philip J.; (Rochester, MN) |
|
Applicant: |
Name |
City |
State |
Country |
Type |
Atkins; Mark G.
Carey; James E.
Sanders; Philip J. |
Arvada
Rochester
Rochester |
CO
MN
MN |
US
US
US |
|
|
Assignee: |
INTERNATIONAL BUSINESS MACHINES
CORPORATION
Armonk
NY
|
Family ID: |
48086715 |
Appl. No.: |
13/275500 |
Filed: |
October 18, 2011 |
Current U.S.
Class: |
709/201 |
Current CPC
Class: |
H04L 29/06891 20130101;
H04L 41/0618 20130101; G06F 11/0709 20130101; G06F 11/3006
20130101; G06F 11/0781 20130101; H04L 63/1416 20130101; G06F
11/0748 20130101; G06F 11/3058 20130101; G06F 11/3055 20130101;
G06F 11/3072 20130101 |
Class at
Publication: |
709/201 |
International
Class: |
G06F 15/16 20060101
G06F015/16 |
Goverment Interests
STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT
[0001] This invention was made with Government support under
Contract No. HR0011-07-9-0002 awarded by the Department of Defense.
The Government has certain rights in this invention.
Claims
1-6. (canceled)
7. An apparatus for selected alert delivery in a distributed
processing system, the system comprising a computer processor, a
computer memory operatively coupled to the computer processor, the
computer memory having disposed within it computer program
instructions capable, when executed by the computer processor, of
causing the apparatus to carry out the steps of: receiving a
plurality of events from one or more event producing components of
the distributed processing system; creating, by an incident
analyzer, in dependence upon the events a truth space representing
events that make one or more conditional event processing rules
true, the truth space including a set of truth points, each truth
point including a set of events and a set of event locations;
creating, by the incident analyzer, in dependence upon the truth
space one or more alerts including assigning one of the locations
of the truth space to one or more of the alerts; and sending, by
the incident analyzer, the alerts to at least one component of the
distributed processing system.
8. The apparatus of claim 7 wherein the location assigned to the
alert indicates a location that the alert occurred.
9. The apparatus of claim 7 wherein the location assigned to the
alert is assigned a random location selected from one of the event
locations of the event corresponding to the alert.
10. The apparatus of claim 7 wherein the location assigned to the
alert is assigned the first event location selected from one of the
event locations corresponding to the alert.
11. The apparatus of claim 7 wherein creating in dependence upon
the truth space one or more alerts further comprises scoping one or
more truth spaces.
12. The apparatus of claim 7 further comprising updating, by the
incident analyzer, the truth space.
13. A computer program product for selected alert delivery in a
distributed processing system, the computer program product
disposed upon a computer readable medium, the computer program
product comprising computer program instructions that when executed
by a processor cause the processor to carry out the steps of:
receiving a plurality of events from one or more event producing
components of the distributed processing system; creating, by an
incident analyzer, in dependence upon the events a truth space
representing events that make one or more conditional event
processing rules true, the truth space including a set of truth
points, each truth point including a set of events and a set of
event locations; creating, by the incident analyzer, in dependence
upon the truth space one or more alerts including assigning one of
the locations of the truth space to one or more of the alerts; and
sending, by the incident analyzer, the alerts to at least one
component of the distributed processing system.
14. The computer program product of claim 13 wherein the location
assigned to the alert indicates a location that the alert
occurred.
15. The computer program product of claim 13 wherein the location
assigned to the alert is assigned a random location selected from
one of the event locations of the event corresponding to the
alert.
16. The computer program product of claim 13 wherein the location
assigned to the alert is assigned the first event location selected
from one of the event locations corresponding to the alert.
17. The computer program product of claim 13 wherein creating in
dependence upon the truth space one or more alerts further
comprises scoping one or more truth spaces.
18. The computer program product of claim 13, wherein the computer
readable medium further comprises a computer readable signal
medium.
19. The computer program product of claim 13, wherein the computer
readable medium further comprises a computer readable storage
medium.
Description
BACKGROUND OF THE INVENTION
[0002] 1. Field of the Invention
[0003] The field of the invention is data processing, or, more
specifically, methods, apparatuses, and computer program products
for selected alert delivery in a distributed processing system.
[0004] 2. Description of Related Art
[0005] The development of the EDVAC computer system of 1948 is
often cited as the beginning of the computer era. Since that time,
computer systems have evolved into extremely complicated devices.
Today's computers are much more sophisticated than early systems
such as the EDVAC. Computer systems typically include a combination
of hardware and software components, application programs,
operating systems, processors, buses, memory, input/output devices,
and so on. As advances in semiconductor processing and computer
architecture push the performance of the computer higher and
higher, more sophisticated computer software has evolved to take
advantage of the higher performance of the hardware, resulting in
computer systems today that are much more powerful than just a few
years ago.
[0006] Modern distributed processing systems for intensive
computing may have millions of devices with many processes running
on each device all of which are capable of error and status
reporting for automated error recovery, reporting to a systems
administrator, and for other reasons. In many cases, in the case of
an error for example, the sheer number of such error reports and
status reports are so overwhelming that they cannot be handled in a
meaningful manner. For example, a systems administrator receiving a
hundred thousand error reports may be overwhelmed by the sheer
number of such reports and therefore in the aggregate those reports
become more and more unhelpful and irrelevant.
SUMMARY OF THE INVENTION
[0007] Methods, apparatuses, and computer program products for
selected alert delivery in a distributed processing system are
provided. Embodiments include receiving a plurality of events from
one or more event producing components of the distributed
processing system; creating, by an incident analyzer, in dependence
upon the events a truth space representing events that make one or
more conditional event processing rules true, the truth space
including a set of truth points, each truth point including a set
of events and a set of event locations; creating, by the incident
analyzer, in dependence upon the truth space one or more alerts
including assigning one of the locations of the truth space to one
or more of the alerts; and sending, by the incident analyzer, the
alerts to at least one component of the distributed processing
system.
[0008] The foregoing and other objects, features and advantages of
the invention will be apparent from the following more particular
descriptions of exemplary embodiments of the invention as
illustrated in the accompanying drawings wherein like reference
numbers generally represent like parts of exemplary embodiments of
the invention.
BRIEF DESCRIPTION OF THE DRAWINGS
[0009] FIG. 1 illustrates an exemplary system for selected alert
delivery in a distributed processing system according to
embodiments of the present invention.
[0010] FIG. 2 sets forth a block diagram of automated computing
machinery comprising an exemplary computer useful for selected
alert delivery in a distributed processing system according to
embodiments of the present invention.
[0011] FIG. 3 sets forth a block diagram of an exemplary system for
selected alert delivery in a distributed processing system
according to embodiments of the present invention.
[0012] FIG. 4 sets forth a diagram illustrating assigning events to
an event pool according to embodiments of the present
invention.
[0013] FIG. 5 sets forth a diagram illustrating assigning alerts to
an alert pool according to embodiments of the present
invention.
[0014] FIG. 6 sets forth a flow chart illustrating an example
method of selected alert delivery in a distributed processing
system according to embodiments of the present invention.
[0015] FIG. 7 sets forth a flow chart illustrating an exemplary
method of selected alert delivery in a distributed processing
system according to embodiments of the present invention.
[0016] FIG. 8 sets forth a flow chart illustrating another
exemplary method of selected alert delivery in a distributed
processing system according to embodiments of the present
invention.
DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS
[0017] Exemplary methods, systems, and computer program products
for selected alert delivery in a distributed processing system and
according to embodiments of the present invention are described
with reference to the accompanying drawings, beginning with FIG. 1.
FIG. 1 illustrates an exemplary system for selected alert delivery
in a distributed processing system according to embodiments of the
present invention. A distributed processing system is typically
implemented as multiple autonomous or semi-autonomous computers
that communicate through a computer network. In such example
distributed processing systems, the computers often interact with
each other in order to achieve a common goal. A computer program
that runs in such an example distributed system is typically called
a distributed program, and distributed programming is often used to
describe the process of writing such programs.
[0018] In the example of FIG. 1, the distributed processing system
(101) is implemented as a parallel computer (100), non-volatile
memory for the computer in the form of data storage device (118),
an output device for the computer in the form of printer (120), and
an input/output device for the computer in the form of computer
terminal (122). The parallel computer (100) in the example of FIG.
1 also includes a plurality of compute nodes (102). Each compute
node is an automated computing device composed of one or more
computer processors, its own computer memory, and its own
input/output functionality. The compute nodes (102) are coupled for
data communications by several independent data communications
networks including a high speed Ethernet network (174), a Joint
Test Action Group (`JTAG`) network (104), a tree network (106)
which is optimized for collective operations, and a torus network
(108) which is optimized for point to point operations. Tree
network (106) is a data communications network that includes data
communications links connected to the compute nodes so as to
organize the compute nodes as a tree. Each data communications
network is implemented with data communications links among the
compute nodes (102). The data communications links provide data
communications for parallel operations among the compute nodes of
the parallel computer.
[0019] In addition to compute nodes, computer (100) includes
input/output ('I/O') nodes (110, 114) coupled to compute nodes
(102) through one of the data communications networks (174). The
I/O nodes (110, 114) provide I/O services between compute nodes
(102) and I/O devices (118, 120, 122). I/O nodes (110, 114) are
connected for data communications through local area network (LAN')
(130). Computer (100) also includes a service node (116) coupled to
the compute nodes through one of the networks (104). Service node
(116) provides a service common to pluralities of compute nodes,
loading programs into the compute nodes, starting program execution
on the compute nodes, retrieving results of program operations on
the computer nodes, and so on. Service node (116) runs an event and
alert analysis module (124) and communicates with users (128)
through a service application interface (126) that runs on computer
terminal (122).
[0020] Many of the components of the distributed processing system
of FIG. 1, that is the devices of the distributed processing system
or processes running on the devices of the distributed processing
system of FIG. 1, are capable of some form of error or status
reporting through events and many of such components are also
capable of receiving alerts in response to one or more of such
events. Often in distributed processing systems useful according to
embodiments of the present invention hundreds of thousands or
millions of components may provide incidents, often in the form of
events or receive alerts.
[0021] An incident is a generic term used in this specification to
mean an identification or notification of a particular occurrence
on a component of a distributed processing system such as events
described below, a refined identification of an occurrence often
based on events such as an alert described below, or other
notifications as will occur to those of skill in the art.
[0022] Incidents are administered in pools for event and alert
analysis according to embodiments of the present invention. A pool
of incidents is a collection of incidents organized by the time of
either their occurrence, by the time they are logged in an incident
queue, included in the pool, or other time as will occur to those
of skill in the art.
[0023] The service node (116) of FIG. 1 has installed upon it an
event and alert analysis module (124) that includes at least two
incident analyzers implemented as events analyzers and alerts
analyzers capable of selected alert delivery in a distributed
processing system (101) according to embodiments of the present
invention. Selected alert delivery in a distributed processing
system according to embodiments of the present invention is a form
of alert delivery where selection of alerts is performed according
to a particular standard, such as relevancy. For example, selected
alert delivery in a distributed processing system according to
embodiments of the present invention includes relevant alert
delivery. Relevant alert delivery includes delivery of alerts based
on events received from event producing components. Although
relevancy is used as an example standard for selected alert
delivery, those of skill in the art understand that selected alert
delivery may be performed to other standards in accordance with
embodiments of the present invention.
[0024] The event and alert analysis module (124) is implemented as
automated computing machinery capable of receiving a plurality of
events from one or more event producing components of the
distributed processing system; and creating, by an incident
analyzer, in dependence upon the events a truth space representing
events that make one or more conditional event processing rules
true, the truth space including a set of truth points, each truth
point including a set of events and a set of event locations. A
truth space is a data structure that is the result of the
processing and analysis of events in accordance with a particular
set of conditional event processing rules. The truth space may be
applied to processing and analysis of alerts. Because the truth
space is created in accordance with the conditional event
processing rules, applying the truth space to alert processing may
increase the likelihood that the results are also in accordance
with any conditional alert processing rules. For example, a truth
space may be build specifying a location scope for a particular
event. The location scope specified in the truth space may then be
used to create an alert with the same location scope.
[0025] A truth point is a data structure containing a set of truth
events and a set of event locations. A truth event is a set of
events that make a particular condition true. An event location is
a set of locations that the truth events occur. A location may
refer to a software or hardware location within the distribution
processing system. A conditional event processing rule is a rule
indicating under what circumstances a condition is true.
[0026] The event and alert analysis module (124) is also capable
of: creating, by the incident analyzer, in dependence upon the
truth space one or more alerts including assigning one of the
locations of the truth space to one or more of the alerts; and
sending, by the incident analyzer, the alerts to at least one
component of the distributed processing system.
[0027] In some embodiments the unsuppressed alerts are transmitted
to one or more components of the distributed processing system. One
such component may be a terminal (122) for display to a systems
administrator. Other components may include a component that
generated an event, a component for error reporting, a component
for automated error recovery or any other component that will occur
to those of skill in the art.
[0028] The event and alert module (124) of FIG. 1 allows the number
of incidents occurring such as events received and alerts produced
at any given time to be less overwhelming to a systems
administrator (128) attempting to identify a problem or occurrence
in the distributed processing system. Selected alert delivery in a
distributed processing system according to embodiments of the
present invention provide alerts that are more meaningful to a user
in determining how to administer the functions and errors
associated with a distributed processing system.
[0029] The arrangement of nodes, networks, and I/O devices making
up the exemplary distributed processing system illustrated in FIG.
1 are for explanation only, not for limitation of the present
invention. Distributed data processing systems capable of selected
alert delivery according to embodiments of the present invention
may include additional nodes, networks, devices, and architectures,
not shown in FIG. 1, as will occur to those of skill in the art.
The parallel computer (100) in the example of FIG. 1 includes
sixteen compute nodes (102). Parallel computers capable of selected
alert delivery according to embodiments of the present invention
sometimes include thousands of compute nodes. In addition to
Ethernet and JTAG, networks in such data processing systems may
support many data communications protocols including for example
TCP (Transmission Control Protocol), IP (Internet Protocol), and
others as will occur to those of skill in the art. Various
embodiments of the present invention may be implemented on a
variety of hardware platforms in addition to those illustrated in
FIG. 1.
[0030] Selected alert delivery in a distributed processing system
in accordance with the present invention is generally implemented
with computers, that is, with automated computing machinery. In the
system of FIG. 1, for example, all the service nodes, I/O nodes,
compute nodes, of the parallel computer are implemented to some
extent at least as computers. For further explanation, therefore,
FIG. 2 sets forth a block diagram of automated computing machinery
comprising an exemplary computer (152) useful in selected alert
delivery according to embodiments of the present invention. The
computer (152) of FIG. 2 includes at least one computer processor
(156) or `CPU` as well as random access memory (168) (RAM') which
is connected through a high speed memory bus (166) and bus adapter
(158) to processor (156) and to other components of the computer
(152) and through an expansion bus to adapters for communications
with other components of a distributed processing system (101).
[0031] Stored in RAM (168) is an event and alert analysis module
(124), a module of automated computing machinery for selected alert
delivery according to embodiments of the present invention. The
event and alert analysis module (124) includes two incident
analyzers according to embodiments of the present invention. The
incident analyzers include an event analyzer (208) and an alert
analyzer (218). The event analyzer of FIG. 2 is a module of
automated computing machinery capable of identifying alerts in
dependence upon received events. That is, event analyzers typically
receive events and produce alerts. In many embodiments, a plurality
of event analyzers are implemented in parallel. Often such event
analyzers are assigned to a particular pool of events and may be
focused on events from a particular component or caused by a
particular occurrence to produce a more concise set of alerts.
[0032] The alert analyzer of FIG. 2 is a module of automated
computing machinery capable of identifying alerts for transmission
from events and other alerts, identifying additional alerts for
transmission, and suppressing unnecessary, irrelevant, or otherwise
unwanted alerts identified by the event analyzer. That is, alert
analyzers typically receive alerts and events and produce or
forward alerts in dependence upon those alerts and events. In many
embodiments, a plurality of alert analyzers are implemented in
parallel. Often such alert analyzers are assigned to a particular
pool of alerts and may be focused on alerts with particular
attributes to produce a more concise set of alerts.
[0033] The event analyzer (208) and the alert analyzer are each
capable of selected alert delivery in a distributed processing
system according to embodiments of the present invention. The event
analyzer administers pools of events according to embodiments of
the present invention by assigning, by an events analyzer, a
plurality of events to an events pool; determining, by an events
analyzer in dependence upon the event analysis rules, to
temporarily suppress events having particular attributes;
determining, by an events analyzer, a duration for the suppression
of the events; and suppressing, by an events analyzer, each event
assigned to the pool having the particular attributes for the
determined duration.
[0034] The event and alert analysis module (124) of FIG. 2 includes
computer program instructions for selected alert delivery in a
distributed processing system.
[0035] Specifically, the event and alert analysis module (124)
includes computer program instructions that when executed by the
processor (156) cause the processor computer (152) to carry out the
steps of: receiving a plurality of events from one or more event
producing components of the distributed processing system;
creating, by an incident analyzer, in dependence upon the events a
truth space representing events that make one or more conditional
event processing rules true, the truth space including a set of
truth points, each truth point including a set of events and a set
of event locations; creating, by the incident analyzer, in
dependence upon the truth space one or more alerts including
assigning one of the locations of the truth space to one or more of
the alerts; and sending, by the incident analyzer, the alerts to at
least one component of the distributed processing system.
[0036] Also stored in RAM (168) is an operating system (154).
Operating systems useful for selected alert delivery according to
embodiments of the present invention include UNIX.TM. Linux.TM.
Microsoft XP.TM. AIX.TM. IBM's i5/OS.TM. and others as will occur
to those of skill in the art. The operating system (154), event and
alert analysis module (124), the event analyzer (208), the alert
analyzer (218) in the example of FIG. 2 are shown in RAM (168), but
many components of such software typically are stored in
non-volatile memory also, such as, for example, on a disk drive
(170).
[0037] The computer (152) of FIG. 2 includes disk drive adapter
(172) coupled through expansion bus (160) and bus adapter (158) to
processor (156) and other components of the computer (152). Disk
drive adapter (172) connects non-volatile data storage to the
computer (152) in the form of disk drive (170). Disk drive adapters
useful in computers for selected alert delivery according to
embodiments of the present invention include Integrated Drive
Electronics (`IDE`) adapters, Small Computer System Interface
(`SCSI`) adapters, and others as will occur to those of skill in
the art. Non-volatile computer memory also may be implemented for
as an optical disk drive, electrically erasable programmable
read-only memory (so-called `EEPROM` or `Flash` memory), RAM
drives, and so on, as will occur to those of skill in the art.
[0038] The example computer (152) of FIG. 2 includes one or more
input/output (`I/O`) adapters (178). I/O adapters implement
user-oriented input/output through, for example, software drivers
and computer hardware for controlling output to display devices
such as computer display screens, as well as user input from user
input devices (181) such as keyboards and mice. The example
computer (152) of FIG. 2 includes a video adapter (209), which is
an example of an I/O adapter specially designed for graphic output
to a display device (180) such as a display screen or computer
monitor. Video adapter (209) is connected to processor (156)
through a high speed video bus (164), bus adapter (158), and the
front side bus (162), which is also a high speed bus.
[0039] The exemplary computer (152) of FIG. 2 includes a
communications adapter (167) for data communications with other
computers (182) and for data communications with a data
communications network (100). Such data communications may be
carried out serially through RS-232 connections, through external
buses such as a Universal Serial Bus (USW), through data
communications data communications networks such as IP data
communications networks, and in other ways as will occur to those
of skill in the art. Communications adapters implement the hardware
level of data communications through which one computer sends data
communications to another computer, directly or through a data
communications network. Examples of communications adapters useful
for selected alert delivery according to embodiments of the present
invention include modems for wired dial-up communications, Ethernet
(IEEE 802.3) adapters for wired data communications network
communications, and 802.11 adapters for wireless data
communications network communications.
[0040] For further explanation, FIG. 3 sets forth a block diagram
of an exemplary system for selected alert delivery in a distributed
processing system (102) according to embodiments of the present
invention. The system of FIG. 3 includes an event and alert
analysis module (124). The event and alert analysis module (124) of
FIG. 3 receives in an event queue (206) a plurality of events (202)
from one or more components of a distributed processing system
(102). A component of a distributed processing system according to
embodiments of the present invention may be a device of the
distributed processing system or a process running on a device of
the distributed processing. Such components are often capable of
some form event transmission, often for error or status
reporting.
[0041] An event according to embodiments of the present invention
is a notification of a particular occurrence in or on a component
of the distributed processing system. Such events are sent from the
component upon which the occurrence occurred or another reporting
component to an event and alert analysis module according to the
present invention. Often events are notifications of errors
occurring in a component of the data processing system. Events are
often implemented as messages either sent through a data
communications network or shared memory. Typical events for event
and alert analysis according to embodiments of the present
invention an occurred time, a logged time, an event type, an event
ID, a reporting component, and a source component, and other
attributes. An occurred time is the time at which the event
occurred on the component. A logged time is the time the event was
included in the event queue (206) and is typically inserted into
the event by the monitor (204) in the example of FIG. 3. An event
type is a generic type of event such as for example, power error,
link failure error, errors related to not receiving messages or
dropping packets and so on as will occur to those of skill in the
art. An event ID is a unique identification of the event. A
reporting component is an identification of the component that
reported the event. A source component is an identification of the
component upon which the event occurred. In many cases, but not
all, the reporting component and source component are the same
component of the distributed processing system.
[0042] In the example of FIG. 3, the event and alert analysis
module (124) includes a monitor (204) that receives events from
components of the distributed processing system and puts the
received events (202) in the event queue (206). The monitor (204)
of FIG. 3 may receive events from components of the distributed
processing system on their motion, may periodically poll one or
more of the components of the distributed processing system, or
receive events from components in other ways as will occur to those
of skill in the art.
[0043] The system of FIG. 3 includes an event analyzer (208). The
event analyzer (208) of FIG. 3 is a module of automated computing
machinery capable of identifying alerts in dependence upon received
events. That is, event analyzers typically receive events and
produce alerts. In many embodiments, a plurality of event analyzers
are implemented in parallel. Often event analyzers are assigned to
a particular pool of events and may be focused on events from a
particular component or caused by a particular occurrence to
produce a more concise set of alerts.
[0044] The event analyzer (208) of FIG. 3 assigns each received
event (202) to an events pool (212). An events pool (212) is a
collection of events organized by the time of either their
occurrence, by the time they are logged in the event queue,
included in the events pool, or other time as will occur to those
of skill in the art. That is, event pools are a collection of
events organized by time. Such events pools often provide the
ability to analyze a group of time related events identify alerts
in dependence upon them. Often such event pools are useful in
identifying fewer and more relevant alerts in dependence upon
multiple related events.
[0045] The events pool (212) is administered by the event analyzer
(208) according to embodiments of the present invention. The event
analyzer administers pools of events according to embodiments of
the present invention by receiving, by the event analyzer from the
event queue, a plurality of events from one or more components of
the distributed processing system; creating, by the event analyzer,
a pool of events, the pool having a predetermined initial period of
time; assigning, by the event analyzer, each received event to the
pool; assigning, by the event analyzer, to each event a
predetermined minimum time for inclusion in a pool; extending, by
the event analyzer, for one or more of the events the predetermined
initial period of time of the pool by a particular period of time
assigned to the event; determining, by the event analyzer, whether
conditions have been met to close the pool; and if conditions have
been met to close the pool, determining for each event in the pool
whether the event has been in the pool for its predetermined
minimum time for inclusion in a pool; and if the event has been in
the pool for us predetermined minimum time, including the event in
the closed pool; and if the event has not been in the pool for its
predetermined minimum time, evicting the event from the closed pool
and including the event in a next pool.
[0046] As mentioned an events pool according to the method of FIG.
3 has a predetermined initial period of time and in the example of
FIG. 3 assigning by the event analyzer each received event to an
events pool includes extending for each event assigned to the
events pool the predetermined initial period of time by a
particular period of time assigned to the event. In this manner,
the pool is extended with each received event until a collection of
events that may be usefully used to identify alerts is assigned to
the events pool.
[0047] As mentioned above, in some embodiments of the present
invention, more than one event analyzer may operate in parallel. As
such, each event analyzer may maintain one or more event pools for
selected alert delivery according to embodiments of the present
invention. Assigning by the event analyzer the events to an events
pool may therefore include selecting only events from one or more
particular components. In such embodiments, particular components
may be selected for a particular events pool to provide events
associated with a particular period of time from a particular set
of one or more components.
[0048] Assigning by the event analyzer the events to an events pool
may also be carried out by selecting only events of a particular
event type. In such embodiments, particular events may be selected
for a particular events pool to provide events associated with a
particular period of time from a particular set of event types.
[0049] Event analyzer (208) in the example of FIG. 3 identifies in
dependence upon the event analysis rules (210) and the events
assigned to the events pool one or more alerts (214). Event
analyses rules (210) are a collection of predetermined rules for
meaningfully parsing received events to identify relevant alerts in
dependence upon the events.
[0050] The event analysis rules (210) of FIG. 3 include event
arrival rules (230), events pool operation rules (232), event
suppression rules (234), and events pool closure rules (236). Event
arrival rules (230) are configurable predetermined rules for
identifying alerts in dependence upon events in real time as those
events are assigned to the events pool. That is, event arrival
rules (230) identify alerts in dependence upon events before
closing the events pool. Such rules are typically predetermined to
identify particular alerts in dependence upon attributes of those
events. Event arrival rules may for example dictate identifying a
particular predetermined alert for transmission to a systems
administrator in dependence upon a particular event type or
component type for the event or other attribute of that event. Such
rules are flexible and may be tailored to a particular distributed
computing system and its functions.
[0051] An alert according to embodiments of the present invention
is refined identification of an occurrence--such and an
error--based upon more than one event and therefore provides an
identification of the occurrence in the context of its operation in
the distributed processing system. Often an alert may be a
notification of a particular error type of occurrence that is
identified in dependence upon the plurality of events received from
one or more components of the data processing system, such as, for
example, a link failure among a plurality of devices each of which
are producing many events based upon the single link failure, or a
power failure provoking thousands of events, and so on.
[0052] Alerts are often implemented as messages to be sent through
a data communications network or shared memory. Typical alerts
according to embodiments of the present invention have attributes
attached to them based upon the attributes of the events received
from which they are identified.
[0053] Events pool operation rules (232) are configurable
predetermined rules for controlling the operations of the events
pool. Such rules includes rules identifying the initial
predetermined period of time for each events pool, rules dictating
the length of time extended to the pool upon the assignment of each
new event to the pool, rules dictating the minimum time an event
must be in a pool before that event is included in a collection of
events when the pool is closed, rules governing the closing of an
events pool, and others as will occur to those of skill in the art.
Such rules are flexible and may be tailored to a particular
distributed computing system and its functions.
[0054] Event suppression rules (234) are configurable predetermined
rules for suppressing one or more events in a closed pool of events
used in identifying alerts. That is, often events in the closed
events pool may be duplicate events, redundant events, or otherwise
unnecessary or unhelpful events in identifying alerts. Such
suppression rules are typically predetermined to delete, drop, or
otherwise ignore those suppressed events. Event suppression rules
may for example dictate that more than a threshold number of events
of a particular event type or component type are to be suppressed.
Such rules are also flexible and may be tailored to a particular
distributed computing system and its functions.
[0055] Events pool closure rules (236) are configurable
predetermined rules for identifying alerts in dependence upon
unsuppressed events in the closed events pool and alerts identified
by the event arrival rules. That is, events pool closure rules
identify new alerts in dependence upon one or more or even all of
the unsuppressed events in the closed events pool. The events pool
closure rules also identify alerts in dependence upon the alerts
identified by the event arrival rules (230) or a combination of the
alerts identified by the event arrival rules (230) and one or more
of the unsuppressed events in the closed events pool.
[0056] Event analyzer (208) in the example of FIG. 3 sends all the
alerts (214) identified by the event analyzer (208) to an alert
analyzer (218). The alert analyzer of FIG. 3 is a module of
automated computing machinery capable of identifying alerts for
transmission from events and other alerts, identifying additional
alerts for transmission, and suppressing unnecessary, irrelevant,
or otherwise unwanted or unhelpful alerts identified by the event
analyzer. That is, alert analyzers typically receive alerts and
events and produce or forward alerts in dependence upon those
alerts and events. In many embodiments, a plurality of alert
analyzers are implemented in parallel. The alerts (216) in the
example of FIG. 3 are sent from event analyzer (208) to an alert
analyzer (218) through an alerts queue (216).
[0057] The alert analyzer (218) of FIG. 3 assigns each of the
identified alerts (214) to an alerts pool (224). An alerts pool
(224) is a collection of alerts organized by the time of one or
more the events causing the alert to be identified, the time the
alert is identified, or other time as will occur to those of skill
in the art. That is, alerts pools are a collection of alerts
organized by time. Such alerts pools often provide the ability to
analyze a group of alerts identified and included in the alerts
pool according to some time. Often such alerts pools are useful in
identifying fewer and more relevant alerts in dependence upon
multiple related events and multiple related alerts.
[0058] The alert analyzer administers pools of alerts according to
embodiments of the present invention by receiving, by an alert
analyzer from an alert queue, a plurality of alerts from one or
more components of the distributed processing system; creating, by
the alert analyzer, a pool of alerts, the pool having a
predetermined initial period of time; assigning, by the alert
analyzer, each received alert to the pool; assigning, by the alert
analyzer, to each alert a predetermined minimum time for inclusion
in a pool; extending, by the alert analyzer, for one or more of the
alerts the predetermined initial period of time of the pool by a
particular period of time assigned to the alert; determining, by
the alert analyzer, whether conditions have been met to close the
pool; and if conditions have been met to close the pool,
determining for each alert in the pool whether the alert has been
in the pool for its predetermined minimum time for inclusion in a
pool; and if the alert has been in the pool for us predetermined
minimum time, including the alert in the closed pool; and if the
alert has not been in the pool for its predetermined minimum time,
evicting the alert from the closed pool and including the alert in
a next pool.
[0059] The alert analyzer may assign the identified alerts to an
alerts pool (224) in dependence upon attributes of the alerts or
attributes of the events from which those alerts were identified.
For example, the alert analyzer of FIG. 3 may assign alerts to the
alerts pool (224) by selecting alerts generated from events from
one or more particular components, alerts associated with a
particular alert type and so on as will occur to those of skill in
the art.
[0060] The alert analyzer (218) of FIG. 3 determines in dependence
upon alert analysis rules (222) and the alerts in the alert pool
whether to suppress any alerts. Suppressing an alert is typically
carried out by dropping the alert, deleting the alert or otherwise
ignoring or not transmitting the suppressed alert to a component of
the distributed processing system.
[0061] Alert analyses rules (222) are a collection of rules for
suppressing one or more alerts to provide a more relevant set of
alerts for transmission to a component of the distributed
processing system, such as for example, for display to a systems
administrator and to identify additional alerts for transmission to
one or more components of the distributed processing system. Alert
analysis rules for example may dictate that duplicate alerts are to
be suppressed, alerts of a particular type for transmission to a
particular component are to be suppressed, alerts of a particular
type be transmitted to a particular component are to be suppressed
and so on as will occur to those of skill in the art. Such alerts
may be more meaningful to a component of the distributed processing
system for automated error recovery or for a systems administrator
who may otherwise be less informed by a number of raw unanalyzed
alerts.
[0062] The alert analyzer (218) of FIG. 3 also has access to the
events queue (206). The alert analyzer (218) of FIG. 3 in
dependence upon the alert analysis rules may, in some embodiments
select events from the events queue and determine whether to
suppress any alerts in dependence upon the selected events. That
is, alert analysis rules may also take into account events and
their attributes for suppressing alerts and for identifying
additional alerts for transmission to one or more components. Such
events may be related to the alerts in the alerts pool or
independent from such alerts.
[0063] The alert analyzer (218) of FIG. 3 transmits the
unsuppressed alerts to one or more components of the distributed
processing system. The alert analyzer may transmit the unsuppressed
alerts to one or more components of the distributed processing
system by sending the alert as a message across a data
communications network, through shared memory, or in other ways as
will occur to those of skill in the art. In the example of FIG. 3,
the unsuppressed alerts (220) are transmitted to a terminal (122)
for display to a systems administrator (128).
[0064] The alert analyzer (218) of FIG. 3 is also capable of
identifying in dependence upon alert analysis rules (222), the
alerts in the alert pool (224), and selected events (206) one or
more additional alerts and transmitting the one or more components
of the distributed processing system. The additional alerts may
include one or more alerts not identified by the event analyzer.
Such additional alerts may provide additional information to a
component of the distributed processing system of a systems
administrator.
[0065] As mentioned above, selected alert delivery according to the
present invention includes assigning events to an event pool and
those pools are administered according to embodiments of the
present invention. For further explanation, FIG. 4 sets forth a
diagram illustrating assigning events to an event pool according to
embodiments of the present invention. An events pool (212) is a
collection of events organized by the time of either their
occurrence, by the time they are logged in the event queue,
included in the events pool, or other time as will occur to those
of skill in the art. That is, event pools are a collection of
events organized by time. Such events pools often provide the
ability to analyze a group of time related events and to identify
alerts in dependence upon them. Often such event pools are useful
in identifying fewer and more relevant alerts in dependence upon
multiple related events.
[0066] Events pools according to embodiments of the present
invention are typically operated according to events pool operation
rules which are themselves often included in event analysis rules.
Such events pool operation rules are configurable predetermined
rules for controlling the operations of the events pool. Such rules
includes rules identifying the initial predetermined period of time
for each events pool, rules dictating the length of time extended
to the pool upon the assignment of each new event to the pool,
rules dictating the minimum time an event must be in a pool before
that event is included in a collection of events when the pool is
closed, rules governing the closing of an events pool, and others
as will occur to those of skill in the art. Such rules are flexible
and may be tailored to a particular distributed computing system
and its functions.
[0067] Events are often assigned to an events pool according to
their logged time. That is, events are typically inserted into the
events pool in the order that they are received in the event queue.
In the example of FIG. 4, the timing of the events pool (212) is
initiated when the first event `Event 0` (400) is assigned to the
events pool (212) at time t.sub.0. The events pool of FIG. 4 is
initiated for a predetermined initial period of time from t.sub.1
to t.sub.f. That is, upon receiving the first event `Event 0` (400)
the events pool of FIG. 4 has a predetermined initial period of
time beginning at t.sub.1 and ending at t.sub.f. The predetermined
initial period of time may be configured in dependence upon a
number of factors as will occur to those of skill in the art such
as, the number of components in the distributed processing system,
the frequency of receiving events, the types of events typically
received and so on as will occur to those of skill in the art.
[0068] In the example FIG. 4, the initial period of time is
extended for each new event assigned to the events pool during the
predetermined initial period from t.sub.1 to t.sub.f by a
particular period of time assigned to the event. In the example of
FIG. 4 upon assigning `Event 1` (402) to the events pool (212) the
predetermined initial period of time t.sub.0-t.sub.f is extended by
`Extension l` (406) having a time of e1 thereby creating a new time
for closing the events pool (212) at t.sub.f+e1 if no other events
are assigned to the pool before t.sub.f+e1. Similarly, in the
example of FIG. 4 upon assigning `Event 2` (404) to the events pool
having a time of e2, the now extended period of time from
t.sub.0-t.sub.f+e1 is extended again by extension 2 (406) thereby
establishing a new time for closing the pool at time t.sub.f+e1+e2
if no other events are assigned to the pool before t.sub.f+e1+e2 or
before some maximum time for the events pool has expired. In this
manner, the event pool is extended with each received event until a
collection of events that may be usefully used to identify alerts
is assigned to the events pool.
[0069] In typical embodiments of the present invention, event pools
may have a maximum duration that can no longer be extended. In such
cases, a requirement may exist that an event that has not resided
in the event pool for a threshold period of time be moved to a next
events pool. In some embodiments, the attributes of such an event
that is moved to the next events pool are used for selected alert
delivery according to embodiments of the present invention with the
initial events pool and in other embodiments, the attributes of
such an event are used for selected alert delivery with the next
events pool to which that event is moved.
[0070] In the example of FIG. 4, when conditions are met to close
the pool an events analyzer determines for each event (400, 402,
404) in the pool (212) whether the event has been in the pool for
its predetermined minimum time for inclusion in a pool. If the
event has been in the pool for its predetermined minimum time, the
event is included in the closed pool for event analysis for
selected alert delivery according to embodiments of the present
invention. If the event has not been in the pool for its
predetermined minimum time, the event is evicted from the closed
pool and included a next pool for event analysis for selected alert
delivery according to embodiments of the present invention.
[0071] In many embodiments, a plurality of events pools may be used
in parallel and one or more of such events pools are assigned to a
particular events analyzer. In such embodiments, events analyzers
may be directed to events in events pools having particular
attributes.
[0072] As mentioned above, selected alert delivery according to the
present invention also includes assigning alerts to an alerts pool.
For further explanation, FIG. 5 sets forth a diagram illustrating
assigning alerts to an alert pool according to embodiments of the
present invention. The alerts pool (224) of FIG. 5 operates in a
manner similar to the events pool of FIG. 4. That is, the alerts
pool according to the example of FIG. 5 includes alerts and the
timing of the alerts pool begins with the first alert `Alert 0`
(500) at time t.sub.o and is configured to have a predetermined
initial period of time t.sub.0-tf. In the example of FIG. 5, the
initial period of time is extended for each new alert assigned to
the alerts pool in the predetermined initial period from t.sub.1 to
t.sub.f by a particular period of time assigned to the alert. In
the example of FIG. 5, upon assigning `Alert 1` (502) to the alerts
pool (224) the predetermined initial period of time t.sub.0-t.sub.f
is extended by `Extension 1` (506) having a time of e1 thereby
creating a new time for closing the alerts pool (224) at t.sub.f+e1
if no other alerts are assigned to the pool before t.sub.f+e1.
Similarly, in the example of FIG. 4 upon assigning `Alert 2` (504)
to the alerts pool having a time of e2, the now extended period of
time from t.sub.0-t.sub.f+e1 is extended again by `Extension 2`
(406) thereby establishing a new time for closing the pool at time
t.sub.f+e1+e2 if no other alerts are assigned to the pool before
t.sub.f+e1+e2 or before some maximum time for the alerts pool has
expired.
[0073] In typical embodiments of the present invention, alerts
pools may have a maximum duration that can no longer be extended.
In such cases, a requirement may exist that an alert that has not
resided in the alert pool for a threshold period of time be moved
to a next alerts pool. In some embodiments, the attributes of such
an alert that is moved to the next alerts pool are used for
selected alert delivery according to embodiments of the present
invention with the initial alerts pool and in other embodiments,
the attributes of such an alert are used for selected alert
delivery with the next alerts pool to which that alert is
moved.
[0074] In the example of FIG. 5, when conditions are met to close
the pool an alerts analyzer determines for each alert (500, 502,
504) in the pool (224) whether the alert has been in the pool for
its predetermined minimum time for inclusion in a pool. If the
alert has been in the pool for its predetermined minimum time, the
alert is included in the closed pool for alert analysis for
selected alert delivery according to embodiments of the present
invention. If the alert has not been in the pool for its
predetermined minimum time, the alert is evicted from the closed
pool and included a next pool for alert analysis for selected alert
delivery according to embodiments of the present invention.
[0075] In many embodiments, a plurality of alerts pools may be used
in parallel and one or more of such alerts pools are assigned to a
particular alerts analyzer. In such embodiments, alerts analyzers
may be directed to alerts in alerts pools having particular
attributes.
[0076] For further explanation, FIG. 6 sets forth a flow chart
illustrating an example method of selected alert delivery in a
distributed processing system according to embodiments of the
present invention. The method of FIG. 6 includes receiving (402) in
an event queue a plurality of events (202) from one or more
components of a distributed processing system. Events useful in
selected alert delivery with event and alert suppression according
to embodiments of the present invention may include an occurred
time, a logged time, an event type, an event ID, a reporting
component, and a source component.
[0077] Receiving (402) in an event queue a plurality of events
(202) from one or more components of a distributed processing
system may be carried out by receiving an event initiated by one or
more components of the data processing system and storing the event
in the event queue according to the time in which the event
occurred or according to the time the event was received. Receiving
(402) in an event queue a plurality of events (202) from one or
more components of a distributed processing system also may be
carried out by polling a component for status and receiving in
response an event and storing the event in the event queue
according to the time in which the event occurred or according to
the time the event was received.
[0078] The method of FIG. 6 also includes assigning (404) by an
event analyzer each received event to an events pool (212). In some
embodiments of the present invention, assigning (404) by an event
analyzer each received event (202) to an events pool (212) may be
carried out by assigning events to the event pool according to the
logged time. Assigning (404) by an event analyzer each received
event (202) to an events pool (212) may also be carried out in
dependence upon attributes of the event. Such attributes may
include an identification or type of the component upon which an
occurrence occurred to create the event, the reporting component of
the event, the event ID, the event type, and so on as will occur to
those of skill in the art.
[0079] An events pool according to the method of FIG. 6 includes
events occurring during a predetermined initial period of time and
in the example of FIG. 6 assigning (404) by the event analyzer each
received event to an events pool includes extending (426) for each
event assigned to the events pool the predetermined initial period
of time by a particular period of time assigned to the event.
[0080] The event analyzer includes event analysis rules (210)
including, event arrival rules, events pool operation rules, event
suppression rules, and events pool closure rules. Event arrival
rules are configurable predetermined rules for identifying alerts
in dependence upon events in real time as those events are assigned
to the events pool. That is, event arrival rules identify alerts in
dependence upon events before closing the events pool. Such rules
are flexible and may be tailored to a particular distributed
computing system and its functions.
[0081] An alert according to embodiments of the present invention
is refined identification of an occurrence--such and an
error--based upon more than one event and therefore provides an
identification of the occurrence in the context of its operation in
the distributed processing system. Often an alert may be a
notification of a particular error type of occurrence that is
identified in dependence upon the plurality of events received from
one or more components of the data processing system, such as, for
example, a link failure among a plurality of devices each of which
are producing many events based upon the single link failure, or a
power failure provoking thousands of events, and so on.
[0082] Alerts are often implemented as messages to be sent through
a data communications network or shared memory. Typical alerts
according to embodiments of the present invention have attributes
attached to them based upon the attributes of the events received
from which they are identified.
[0083] Events pool operation rules are configurable predetermined
rules for controlling the operations of the events pool. Such rules
includes rules identifying the initial predetermined period of time
for each events pool, rules dictating the length of time extended
to the pool upon the assignment of each new event to the pool,
rules dictating the minimum time an event must be in a pool before
that event is included in a collection of events when the pool is
closed, rules governing the closing of an events pool, and others
as will occur to those of skill in the art. Such rules are flexible
and may be tailored to a particular distributed computing system
and its functions.
[0084] Event suppression rules are configurable predetermined rules
for suppressing one or more events in a closed pool of events used
in identifying alerts. That is, often events in the closed events
pool may be duplicate events, redundant events, or otherwise
unnecessary or unhelpful events in identifying alerts. Such
suppression rules are typically predetermined to delete, drop, or
otherwise ignore those suppressed events. Event suppression rules
may for example dictate that more than a threshold number of events
of a particular event type or component type are to be suppressed.
Such rules are also flexible and may be tailored to a particular
distributed computing system and its functions.
[0085] Events pool closure rules are configurable predetermined
rules for identifying alerts in dependence upon unsuppressed events
in the closed events pool and alerts identified by the event
arrival rules. That is, events pool closure rules identify new
alerts in dependence upon one or more or even all of the
unsuppressed events in the closed events pool. The events pool
closure rules also identify alerts in dependence upon the alerts
identified by the event arrival rules or a combination of the
alerts identified by the event arrival rules and one or more of the
unsuppressed events in the closed events pool.
[0086] The method of FIG. 6 also includes identifying (410) by the
event analyzer in dependence upon the event arrival rules and the
events assigned to the events pool one or more alerts (214).
Identifying (410) by the event analyzer in dependence upon the
event arrival rules and the events assigned to the events pool one
or more alerts (214) may be carried out by identifying alerts in
dependence upon one or more attributes of the events as that event
is assigned to the events pool. Identifying (410) by the event
analyzer in dependence upon the event arrival rules and the events
assigned to the events pool one or more alerts (214) may be carried
by comparing the attributes of the events to the event arrival
rules and identifying as a result of the comparison one or more
alerts. Such attributes may include the type of component from
which the event was received, the type of component creating the
event, the identification of the component creating the event, the
time the event was created or received, an error reported in the
event, and many others as will occur to those of skill in the
art.
[0087] The method of FIG. 6 also includes closing (412), by the
event analyzer in dependence upon the events pool operation rules,
the events pool (212). Closing (412), by the event analyzer in
dependence upon the events pool operation rules, the events pool
(212) may be carried out by determining that conditions dictated by
the events pool operation rules have been met to stop assigning new
events to the events pool and identifying in dependence upon those
events pool operation rules the particular events that are included
in the closed pool of events.
[0088] Closing the events pool may be carried out by determining
that the initial period of time for the events pool and any
particular periods of time for events received in the events pool
extended to the initial period of time have expired. In such cases,
if no new events are received prior to the expiration of the
initial period of time for the events pool and any particular
periods of time for events received in the events pool extended to
the initial period of time the pool is closed.
[0089] Closing the events pool may also be carried out by
determining that a maximum duration for the events pool has
expired. In such cases, regardless of the number of new events
being received after a maximum duration for the events pool has
expired the pool is closed. In such embodiments, a maximum duration
for the events pool prevents the events pool from including more
events than are useful for selected alert delivery according to
embodiments of the present invention.
[0090] The method of FIG. 6 also includes determining (414), by the
events analyzer in dependence upon the event suppression rules,
whether to suppress one or more events in the closed events pool
(212). Determining (414), by the events analyzer in dependence upon
the event suppression rules, whether to suppress one or more events
in the closed events pool (212) may be carried out by determining
in dependence upon the attributes of one or more events in the
closed pool whether to delete, drop, or otherwise ignore one or
more of the events in the closed pool.
[0091] The method of FIG. 6 includes identifying (416) by the event
analyzer in dependence upon the events pool closure rules and any
unsuppressed events assigned to the events pool, one or more
additional alerts (417). Identifying (416) by the event analyzer in
dependence upon the events pool closure rules and any unsuppressed
events assigned to the events pool, one or more additional alerts
(417) may be carried out by identifying alerts in dependence upon
one or more attributes of the events as that event is assigned to
the events pool. Identifying (416) by the event analyzer in
dependence upon the events pool closure rules and any unsuppressed
events assigned to the events pool, one or more additional alerts
(417) may be carried out by selecting the unsuppressed events for
the events pool, comparing the attributes of the unsuppressed
events of the events pool to the pool closure rules, and
identifying as a result of the comparison one or more additional
alerts. Such attributes may include the type of component from
which one or more of the unsuppressed events are received, the type
of components creating the unsuppressed events, the identification
of the component creating the unsuppressed events, the time the
events were created or received, one or more errors reported by the
events event, the number of events in the pool, and many others as
will occur to those of skill in the art.
[0092] The method of FIG. 6 includes sending (418) by the event
analyzer to an alert analyzer all the alerts identified by the
event analyzer. Sending (418) by the event analyzer to an alert
analyzer all the alerts (214) identified by the event analyzer may
be carried out by sending a message containing the alerts from the
event analyzer to the alert analyzer. Such a message may be sent
from the event analyzer to the alert analyzer across a network,
through shared memory, or in other ways as will occur to those of
skill in the art.
[0093] The method of FIG. 6 includes assigning (420) by the alert
analyzer the identified alerts to an alerts pool (224). An alerts
pool according to the method of FIG. 6 has a predetermined initial
period of time and in the example of FIG. 6 assigning (420) by the
alert analyzer the identified alerts to an alerts pool (224)
includes extending for each alert assigned to the alerts pool the
predetermined initial period of time by a particular period of time
assigned to the alert. Assigning (420) by the alert analyzer the
identified alerts to an alerts pool (224) also may be carried out
in dependence upon attributes of the alerts. Such attributes may
include an identification or type of the component upon which an
occurrence occurred to create the event that was used to identify
the alert, the alert ID, the alert type, and so on as will occur to
those of skill in the art.
[0094] The method of FIG. 6 includes determining (422) by the alert
analyzer in dependence upon alert analysis rules (222) and the
alerts in the alert pool whether to suppress any alerts.
Determining (422) by the alert analyzer in dependence upon alert
analysis rules (222) and the alerts in the alert pool whether to
suppress any alerts may be carried out in dependence upon one or
more attributes of the alerts. Such attributes may include an
identification or type of the component upon which an occurrence
occurred to create the event that was used to identify the alert,
the alert ID, the alert type, and so on as will occur to those of
skill in the art. In such embodiments, determining (422) by the
alert analyzer in dependence upon alert analysis rules (222) and
the alerts in the alert pool whether to suppress any alerts may be
carried out by comparing the attributes of the alerts in the alerts
pool to the alert analysis rules and identifying as a result of the
comparison one or more alerts for suppression according to the
event analysis rules.
[0095] The method of FIG. 6 includes transmitting (420) the
unsuppressed alerts to one or more components of the distributed
processing system. Transmitting (420) the unsuppressed alerts to
one or more components of the distributed processing system may be
carried out by sending a message containing the alert to one or
more components of the distributed processing system. In many
cases, an alert may be sent as a message to a systems administrator
advising the systems administrator of one or more occurrences
within the distributed processing system.
[0096] As mentioned above, alert analysis rules may select
additional alerts or suppress alerts in dependence upon events. In
such embodiments, determining whether to suppress any alerts
includes selecting events and determining whether to suppress any
alerts in dependence upon the selected events. The method of FIG. 6
therefore also includes identifying (426) by the alert analyzer in
dependence upon alert analysis rules (222), the alerts in the alert
pool (224), and any selected events one or more additional alerts
and in the method of FIG. 6, transmitting (428) the unsuppressed
alerts also includes transmitting (430) any additional alerts to
one or more components of the distributed processing system.
[0097] As mentioned above, selected alert delivery according to
embodiments of the present invention includes the administration of
one or more pools of incidents such as events, alerts or other
incidents as will occur to those of skill in the art. For further
explanation, FIG. 7 sets forth a flow chart illustrating an
exemplary method of selected alert delivery in a distributed
processing system according to embodiments of the present
invention. The method of FIG. 7 includes receiving (702) a
plurality of events (202) from one or more event producing
components (752) of the distributed processing system (102).
Receiving (702) a plurality of events (202) from one or more event
producing components (752) of the distributed processing system
(102) may be carried out by retrieving the events from an event
queue.
[0098] The method of FIG. 7 also includes creating (704), by an
incident analyzer (701), in dependence upon the events (202) a
truth space (790) representing truth events (793) that make one or
more conditional event processing rules (799) true. A truth space
is a data structure containing a set of truth points. A truth point
is a data structure containing a set of truth events and a set of
event locations. A truth event is a set of events that make a
particular condition true. An event location is a set of locations
that the truth events occur. A location may refer to a software or
hardware location within the distribution processing system. A
conditional event processing rule is a rule indicating under what
circumstances a condition is true. Creating (704) in dependence
upon the events (202) a truth space (790) representing events (793)
that make one or more conditional event processing rules (799) true
may be carried out by determining which occurrences of events make
a particular condition true; storing the determined events as truth
events; determining the location of the event producing components
that can generate the determined truth events; determining the
scope of the location; and storing a set of determined truth events
and event locations as a truth point; and storing a plurality of
truth points as a truth space.
[0099] The method of FIG. 7 also includes creating (706), by the
incident analyzer (701), in dependence upon the truth space (790)
one or more alerts (795). Creating (706) in dependence upon the
truth space (790) one or more alerts (795) may be carried out by
determining a particular alert that corresponds with the truth
space; and determining a location to send the alert based on the
scope of the event location within the truth space. In the method
of FIG. 7, creating (706), by the incident analyzer (701), in
dependence upon the truth space (790) one or more alerts (795)
includes assigning (707) one of the locations of the truth space to
one or more of the alerts (795). Assigning (707) one of the
locations of the truth space to one or more of the alerts (795) may
be carried out by determining which locations correspond to an
event; determining which alerts corresponds to the event; for each
alert, selecting one of the determined event locations; and storing
the location within the alert. The assigned location is used in the
alert to indicate a location that the alert occurred. The location
that is assigned to the alert may be randomly selected from the
determined locations or may particularly assigned. That is, the
assigned location is selected from one of the event locations of
the event corresponding to the alert. For example, the location
assigned to the alert may be the first event location selected from
one of the event locations of the event corresponding to the
alert.
[0100] The method of FIG. 7 includes sending (708), by the incident
analyzer (701), the alerts (795) to at least one component of the
distributed processing system (102). Sending (708) the alerts (795)
to at least one component of the distributed processing system
(102) may be carried out by transmitting the alert to an
administrator at a terminal or to one or more components of the
distributed processing system in accordance with the truth
space.
[0101] For further explanation, FIG. 8 sets forth a flow chart
illustrating an additional method of selected alert delivery in a
distributed processing system according to embodiments of the
present invention. The method of FIG. 8 is similar to the method of
FIG. 7 in that the method of FIG. 8 also includes: receiving (702)
a plurality of events (202) from one or more event producing
components (752) of the distributed processing system (102);
creating (704) in dependence upon the events (202) a truth space
(790) representing events (793) that make one or more conditional
event processing rules (799) true; creating (706), by the incident
analyzer (701), in dependence upon the truth space (790) one or
more alerts (795); and sending (708), by the incident analyzer
(701), the alerts (795) to at least one component of the
distributed processing system (102).
[0102] In the method of FIG. 8, creating (704) in dependence upon
the events (202) a truth space (790) representing events (793) that
make one or more conditional event processing rules true (799) also
includes scoping (808) one or more truth spaces.
[0103] Location scope may indicate whether the resource should be
treated as hardware or software for the purpose of performing event
analysis. The location scope may also indicate which components of
the distributed processing system the event analysis rule applies.
For example, incident analysis rules may be used to control the
location used for consolidation. Either the full location can be
used, a location scoped to the same level as the conditions, or
either of those can be scoped to a new specified level. For
example, the conditions causing the alert could be on different
ports but the alert analysis rules can specify that the
consolidation should be done at the hub level.
[0104] Scoping (808) one or more truth spaces may be carried out by
determining one or more locations to limit the operation of the
truth space. For example, a truth space may be scoped by collapsing
events corresponding to ports into a location indicating a
particular hub.
[0105] The method of FIG. 8 also includes updating (810), by the
incident analyzer (701), the truth space (790). Updating (810) the
truth space (790) may be carried out by removing suppressed truth
events from the truth space; saving a truth space created from
truth events that were moved from a closed pool to a next pool
because the pool closed and those events did not reside in the pool
for a predetermined minimum duration; allowing new events to be
received; creating a new truth space from the new events and the
primed events; and subtracting the saved truth space from the new
truth space.
[0106] As will be appreciated by one skilled in the art, aspects of
the present invention may be embodied as a system, method or
computer program product. Accordingly, aspects of the present
invention may take the form of an entirely hardware embodiment, an
entirely software embodiment (including firmware, resident
software, micro-code, etc.) or an embodiment combining software and
hardware aspects that may all generally be referred to herein as a
"circuit," "module" or "system." Furthermore, aspects of the
present invention may take the form of a computer program product
embodied in one or more computer readable medium(s) having computer
readable program code embodied thereon.
[0107] Any combination of one or more computer readable medium(s)
may be utilized. The computer readable medium may be a computer
readable signal medium or a computer readable storage medium. A
computer readable storage medium may be, for example, but not
limited to, an electronic, magnetic, optical, electromagnetic,
infrared, or semiconductor system, apparatus, or device, or any
suitable combination of the foregoing. More specific examples (a
non-exhaustive list) of the computer readable storage medium would
include the following: an electrical connection having one or more
wires, a portable computer diskette, a hard disk, a random access
memory (RAM), a read-only memory (ROM), an erasable programmable
read-only memory (EPROM or Flash memory), an optical fiber, a
portable compact disc read-only memory (CD-ROM), an optical storage
device, a magnetic storage device, or any suitable combination of
the foregoing. In the context of this document, a computer readable
storage medium may be any tangible medium that can contain, or
store a program for use by or in connection with an instruction
execution system, apparatus, or device.
[0108] A computer readable signal medium may include a propagated
data signal with computer readable program code embodied therein,
for example, in baseband or as part of a carrier wave. Such a
propagated signal may take any of a variety of forms, including,
but not limited to, electro-magnetic, optical, or any suitable
combination thereof. A computer readable signal medium may be any
computer readable medium that is not a computer readable storage
medium and that can communicate, propagate, or transport a program
for use by or in connection with an instruction execution system,
apparatus, or device.
[0109] Program code embodied on a computer readable medium may be
transmitted using any appropriate medium, including but not limited
to wireless, wireline, optical fiber cable, RF, etc., or any
suitable combination of the foregoing.
[0110] Computer program code for carrying out operations for
aspects of the present invention may be written in any combination
of one or more programming languages, including an object oriented
programming language such as Java, Smalltalk, C++ or the like and
conventional procedural programming languages, such as the "C"
programming language or similar programming languages. The program
code may execute entirely on the user's computer, partly on the
user's computer, as a stand-alone software package, partly on the
user's computer and partly on a remote computer or entirely on the
remote computer or server. In the latter scenario, the remote
computer may be connected to the user's computer through any type
of network, including a local area network (LAN) or a wide area
network (WAN), or the connection may be made to an external
computer (for example, through the Internet using an Internet
Service Provider).
[0111] Aspects of the present invention are described below with
reference to flowchart illustrations and/or block diagrams of
methods, apparatus (systems) and computer program products
according to embodiments of the invention. It will be understood
that each block of the flowchart illustrations and/or block
diagrams, and combinations of blocks in the flowchart illustrations
and/or block diagrams, can be implemented by computer program
instructions. These computer program instructions may be provided
to a processor of a general purpose computer, special purpose
computer, or other programmable data processing apparatus to
produce a machine, such that the instructions, which execute via
the processor of the computer or other programmable data processing
apparatus, create means for implementing the functions/acts
specified in the flowchart and/or block diagram block or
blocks.
[0112] These computer program instructions may also be stored in a
computer readable medium that can direct a computer, other
programmable data processing apparatus, or other devices to
function in a particular manner, such that the instructions stored
in the computer readable medium produce an article of manufacture
including instructions which implement the function/act specified
in the flowchart and/or block diagram block or blocks.
[0113] The computer program instructions may also be loaded onto a
computer, other programmable data processing apparatus, or other
devices to cause a series of operational steps to be performed on
the computer, other programmable apparatus or other devices to
produce a computer implemented process such that the instructions
which execute on the computer or other programmable apparatus
provide processes for implementing the functions/acts specified in
the flowchart and/or block diagram block or blocks.
[0114] The flowchart and block diagrams in the figures illustrate
the architecture, functionality, and operation of possible
implementations of systems, methods and computer program products
according to various embodiments of the present invention. In this
regard, each block in the flowchart or block diagrams may represent
a module, segment, or portion of code, which comprises one or more
executable instructions for implementing the specified logical
function(s). It should also be noted that, in some alternative
implementations, the functions noted in the block may occur out of
the order noted in the figures. For example, two blocks shown in
succession may, in fact, be executed substantially concurrently, or
the blocks may sometimes be executed in the reverse order,
depending upon the functionality involved. It will also be noted
that each block of the block diagrams and/or flowchart
illustration, and combinations of blocks in the block diagrams
and/or flowchart illustration, can be implemented by special
purpose hardware-based systems that perform the specified functions
or acts, or combinations of special purpose hardware and computer
instructions.
[0115] It will be understood from the foregoing description that
modifications and changes may be made in various embodiments of the
present invention without departing from its true spirit. The
descriptions in this specification are for purposes of illustration
only and are not to be construed in a limiting sense. The scope of
the present invention is limited only by the language of the
following claims.
* * * * *