Patent Grant
8688769
1. Field of the Invention
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.
2. Description of Related Art
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.
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.
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.
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.
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
In the example of
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).
Many of the components of the distributed processing system of
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.
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.
The service node (116) of
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.
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.
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.
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.
The event and alert module (124) of
The arrangement of nodes, networks, and I/O devices making up the exemplary distributed processing system illustrated in
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
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
The alert analyzer of
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.
The event and alert analysis module (124) of
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™, Linux™, Microsoft XP™, AIX™, IBM's i5/OS™, 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
The computer (152) of
The example computer (152) of
The exemplary computer (152) of
For further explanation,
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
In the example of
The system of
The event analyzer (208) of
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.
As mentioned an events pool according to the method of
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.
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.
Event analyzer (208) in the example of
The event analysis rules (210) of
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.
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.
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.
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.
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.
Event analyzer (208) in the example of
The alert analyzer (218) of
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.
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
The alert analyzer (218) of
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.
The alert analyzer (218) of
The alert analyzer (218) of
The alert analyzer (218) of
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,
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.
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
In the example
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.
In the example of
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.
As mentioned above, selected alert delivery according to the present invention also includes assigning alerts to an alerts pool. For further explanation,
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.
In the example of
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.
For further explanation,
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.
The method of
An events pool according to the method of
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.
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.
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.
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.
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.
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.
The method of
The method of
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.
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.
The method of
The method of
The method of
The method of
The method of
The method of
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
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,
The method of
The method of
The method of
For further explanation,
In the method of
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.
The method of
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.
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.
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.
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.
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).
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.
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.
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.
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.
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.
This application is a continuation application of and claims priority from U.S. patent application Ser. No. 13/275,500, filed on Oct. 18, 2011.
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.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4812852 | Bent et al. | Mar 1989 | A |
| 4823261 | Bank et al. | Apr 1989 | A |
| 5276861 | Howarth | Jan 1994 | A |
| 5777549 | Arrowsmith et al. | Jul 1998 | A |
| 6094681 | Shaffer et al. | Jul 2000 | A |
| 6255943 | Lewis et al. | Jul 2001 | B1 |
| 6314533 | Novik et al. | Nov 2001 | B1 |
| 6373383 | Arrowsmith et al. | Apr 2002 | B1 |
| 6405250 | Lin et al. | Jun 2002 | B1 |
| 6446136 | Pohlmann et al. | Sep 2002 | B1 |
| 6594786 | Connelly et al. | Jul 2003 | B1 |
| 6606610 | Gray et al. | Aug 2003 | B1 |
| 6704874 | Porras et al. | Mar 2004 | B1 |
| 6801927 | Smith et al. | Oct 2004 | B1 |
| 6915285 | Gray et al. | Jul 2005 | B2 |
| 6925586 | Perrella et al. | Aug 2005 | B1 |
| 6988208 | Hrabik et al. | Jan 2006 | B2 |
| 6990601 | Tsuneya et al. | Jan 2006 | B1 |
| 7043659 | Klein et al. | May 2006 | B1 |
| 7213179 | Song et al | May 2007 | B2 |
| 7251826 | Gardos et al. | Jul 2007 | B1 |
| 7257829 | Bao | Aug 2007 | B2 |
| 7289988 | Joseph | Oct 2007 | B2 |
| 7299152 | Moritz | Nov 2007 | B1 |
| 7430692 | White et al. | Sep 2008 | B2 |
| 7457805 | Deen et al. | Nov 2008 | B2 |
| 7469239 | Musman | Dec 2008 | B2 |
| 7599359 | Croak et al. | Oct 2009 | B1 |
| 7603711 | Scheidell | Oct 2009 | B2 |
| 7687066 | Fujino et al. | Mar 2010 | B2 |
| 7702782 | Pai | Apr 2010 | B1 |
| 7756053 | Thomas et al. | Jul 2010 | B2 |
| 7792042 | Golla et al. | Sep 2010 | B2 |
| 7815103 | Timmis et al. | Oct 2010 | B2 |
| 7822848 | Muller et al. | Oct 2010 | B2 |
| 7904319 | Whear et al. | Mar 2011 | B1 |
| 7954159 | Hrabik et al. | May 2011 | B2 |
| 7979355 | Shah et al. | Jul 2011 | B2 |
| 7984452 | Chakravarty et al. | Jul 2011 | B2 |
| 7996046 | Vargas et al. | Aug 2011 | B2 |
| 8020045 | Morimura et al. | Sep 2011 | B2 |
| 8041799 | Usery et al. | Oct 2011 | B1 |
| 8135863 | Nekovee et al. | Mar 2012 | B2 |
| 8350681 | Bells | Jan 2013 | B2 |
| 8364813 | Atkins et al. | Jan 2013 | B2 |
| 8380838 | Bose et al. | Feb 2013 | B2 |
| 8386602 | Carey et al. | Feb 2013 | B2 |
| 8495661 | Carey et al. | Jul 2013 | B2 |
| 20010055963 | Cloutier | Dec 2001 | A1 |
| 20020016871 | Graf | Feb 2002 | A1 |
| 20020077836 | Elnozahy et al. | Jun 2002 | A1 |
| 20020095595 | Christopherson et al. | Jul 2002 | A1 |
| 20030026525 | Alvarez | Feb 2003 | A1 |
| 20030061514 | Bardsley et al. | Mar 2003 | A1 |
| 20030200187 | Gray et al. | Oct 2003 | A1 |
| 20040153693 | Fisher et al. | Aug 2004 | A1 |
| 20040181294 | Deitz et al. | Sep 2004 | A1 |
| 20040221025 | Johnson et al. | Nov 2004 | A1 |
| 20040243905 | Merritt | Dec 2004 | A1 |
| 20050010545 | Joseph | Jan 2005 | A1 |
| 20050034134 | Lieblich et al. | Feb 2005 | A1 |
| 20050183093 | Pope et al. | Aug 2005 | A1 |
| 20050193285 | Jeon | Sep 2005 | A1 |
| 20050210331 | Connelly et al. | Sep 2005 | A1 |
| 20050240547 | Gray et al. | Oct 2005 | A1 |
| 20050246288 | Kimura et al. | Nov 2005 | A1 |
| 20060015608 | Becker et al. | Jan 2006 | A1 |
| 20060020942 | Ly et al. | Jan 2006 | A1 |
| 20060085724 | Merritt | Apr 2006 | A1 |
| 20060129947 | Hamzy et al. | Jun 2006 | A1 |
| 20060168185 | McCall et al. | Jul 2006 | A1 |
| 20060174251 | Pope et al. | Aug 2006 | A1 |
| 20060282419 | Sen et al. | Dec 2006 | A1 |
| 20070002736 | Gade et al. | Jan 2007 | A1 |
| 20070033594 | Allen et al. | Feb 2007 | A1 |
| 20070088755 | Nesbitt et al. | Apr 2007 | A1 |
| 20070100959 | Eichstaedt et al. | May 2007 | A1 |
| 20070100960 | Eichstaedt et al. | May 2007 | A1 |
| 20070124437 | Chervets | May 2007 | A1 |
| 20070174768 | Sen et al. | Jul 2007 | A1 |
| 20070180103 | Atkins et al. | Aug 2007 | A1 |
| 20070222576 | Miller et al. | Sep 2007 | A1 |
| 20070294399 | Grossner et al. | Dec 2007 | A1 |
| 20080071403 | Conway et al. | Mar 2008 | A1 |
| 20080080384 | Atkins et al. | Apr 2008 | A1 |
| 20080109683 | Erwin et al. | May 2008 | A1 |
| 20080196044 | Stanley | Aug 2008 | A1 |
| 20080228787 | Merritt | Sep 2008 | A1 |
| 20080235365 | Bansal et al. | Sep 2008 | A1 |
| 20080284581 | Sheleheda et al. | Nov 2008 | A1 |
| 20090006883 | Zhang et al. | Jan 2009 | A1 |
| 20090077224 | Appleton | Mar 2009 | A1 |
| 20090094649 | Patel | Apr 2009 | A1 |
| 20090216881 | Lovy et al. | Aug 2009 | A1 |
| 20090275807 | Sitzman et al. | Nov 2009 | A1 |
| 20090292948 | Cinato et al. | Nov 2009 | A1 |
| 20090327429 | Hughes et al. | Dec 2009 | A1 |
| 20090328044 | Bergheaud et al. | Dec 2009 | A1 |
| 20100019894 | Okada | Jan 2010 | A1 |
| 20100031354 | Hudis et al. | Feb 2010 | A1 |
| 20100042632 | Johnson et al. | Feb 2010 | A1 |
| 20100180150 | Jeddedloh | Jul 2010 | A1 |
| 20100192163 | Pope et al. | Jul 2010 | A1 |
| 20100211192 | Stluka et al. | Aug 2010 | A1 |
| 20100211952 | Kasravi et al. | Aug 2010 | A1 |
| 20100332918 | Harnois | Dec 2010 | A1 |
| 20110078519 | Yordanov et al. | Mar 2011 | A1 |
| 20110106941 | Franklin | May 2011 | A1 |
| 20110119372 | Rodrigues et al. | May 2011 | A1 |
| 20110122773 | Kung et al. | May 2011 | A1 |
| 20110145659 | Ikeyama | Jun 2011 | A1 |
| 20110161130 | Whalin et al. | Jun 2011 | A1 |
| 20110167112 | Mazzucco et al. | Jul 2011 | A1 |
| 20110200304 | Rutledge | Aug 2011 | A1 |
| 20110275356 | Best et al. | Nov 2011 | A1 |
| 20110289433 | Whalin et al. | Nov 2011 | A1 |
| 20120084432 | Soprovich et al. | Apr 2012 | A1 |
| 20120110153 | Atkins et al. | May 2012 | A1 |
| 20120110161 | Carey et al. | May 2012 | A1 |
| 20120110600 | Carey et al. | May 2012 | A1 |
| 20120143875 | Sarma et al. | Jun 2012 | A1 |
| 20120144020 | Carey et al. | Jun 2012 | A1 |
| 20120144021 | Carey et al. | Jun 2012 | A1 |
| 20120144243 | Carey et al. | Jun 2012 | A1 |
| 20120144251 | Carey et al. | Jun 2012 | A1 |
| 20120275456 | Ammireddy | Nov 2012 | A1 |
| 20120303815 | Atkins et al. | Nov 2012 | A1 |
| 20120304013 | Atkins et al. | Nov 2012 | A1 |
| 20120304022 | Carey et al. | Nov 2012 | A1 |
| 20120330918 | Carey et al. | Dec 2012 | A1 |
| 20120331332 | Carey et al. | Dec 2012 | A1 |
| 20120331347 | Carey et al. | Dec 2012 | A1 |
| 20120331485 | Carey et al. | Dec 2012 | A1 |
| 20130097215 | Atkins et al. | Apr 2013 | A1 |
| 20130097619 | Carey et al. | Apr 2013 | A1 |
| Number | Date | Country |
|---|---|---|
| 2007094997 | Apr 2007 | JP |
| Entry |
|---|
| Office Action, U.S. Appl. No. 12/960,990, Mar. 20, 2013. |
| Final Office Action, U.S. Appl. No. 12/962,217, Apr. 11, 2013. |
| Notice of Allowance, U.S. Appl. No. 12/938,052, Mar. 28, 2013. |
| Office Action, U.S. Appl. No. 13/117,371, Apr. 9, 2013. |
| Office Action, U.S. Appl. No. 13/114,463, Mar. 21, 2013. |
| Office Action, U.S. Appl. No. 13/16,470, Mar. 27, 2013. |
| Office Action, U.S. Appl. No. 13/275,467, Jan. 16, 2013. |
| Office Action, U.S. Appl. No. 13/275,530, Mar. 21, 2013. |
| Office Action, U.S. Appl. No. 13/661,930, Mar. 20, 2013. |
| Office Action, U.S. Appl. No. 13/672,966, Feb. 6, 2013. |
| Office Action, U.S. Appl. No. 13/688,603, Apr. 4, 2013. |
| Notice of Allowance, U.S. Appl. No. 13/679,219, Apr. 4, 2013. |
| Office Action, U.S. Appl. No. 13/706,574, Feb. 25, 2013. |
| Office Action, U.S. Appl. No. 13/708,061, Mar. 21, 2013. |
| Cottrell,et al., “Distributed Computing Environment Monitoring and User Expectations,”, CHEP95 Conference, Sep. 1995, pp. 1-29, SLAC, Rio de Janeiro. |
| Sundstrom,et al., “SNA: Current Requirements and Direction,” IBM Systems Journal, vol. 26, No. 1 1987, pp. 13-36, IBM Communication Products Division, Research Triangle Park, North Carolina USA. |
| Carey et al., “A Toolkit for Event Analysis and Logging”, SC'11, Nov. 12, 2011, pp. 1-7, ACM, Seattle, Washington. |
| Zhao, et al., “Dynamic Memory Optimization Using Pool Allocation and Prefetching”, Dec. 2005, SIGARCH Computer Architecture News, pp. 27-32, vol. 33, Issue 5, ACM, USA. |
| Office Action, U.S. Appl. No. 13/275,500, May 1, 2013. |
| Notice of Allowance, U.S. Appl. No. 13/275,500, Aug. 7, 2013. |
| Office Action, U.S. Appl. No. 13/166,013, Jun. 29, 2012. |
| Office Action, U.S. Appl. No. 12/961,687, Nov. 8, 2012. |
| Office Action, U.S. Appl. No. 12/962,217, Oct. 10, 2012. |
| Office Action, U.S. Appl. No. 12/938,052, Oct. 15, 2012. |
| Notice of Allowance, U.S. Appl. No. 12/938/084, Oct. 23, 2012. |
| Office Action, U.S. Appl. No. 13/117,341, Dec. 12, 2012. |
| Notice of Allowance, U.S. Appl. No. 13/166,013, Oct. 29, 2012. |
| Zhao, Q., et al., “Dynamic Memory Optimization using Pool Allocation and Prefetching”, ACM SIGARCH Computer Architecture News , Dec. 2005, pp. 27-32, vol. 33, No. 5, ACM, New York, NY, USA. |
| Notice of Allowance, U.S. Appl. No. 12/960,990, Aug. 26, 2013, pp. 1-9. |
| Office Action, U.S. Appl. No. 12/962,265, Sep. 20, 2013, pp. 1-18. |
| Final Office Action, U.S. Appl. No. 12/961,687, Oct. 7, 2013, pp. 1-17. |
| Office Action, U.S. Appl. No. 13/117,371, Sep. 27, 2013, pp. 1-18. |
| Notice of Allowance, U.S. Appl. No. 13/114,463, Oct. 10, 2013, pp. 1-15. |
| Final Office Action, U.S. Appl. No. 13/117,341, Jul. 16, 2013, pp. 1-16. |
| Notice of Allowance, U.S. Appl. No. 13/117,341, Oct. 25, 2013, pp. 1-10. |
| Final Office Action, U.S. Appl. No. 13/166,470, Oct. 16, 2013, pp. 1-22. |
| Final Office Action, U.S. Appl. No. 13/166,027, Sep. 26, 2013, pp. 1-17. |
| Office Action, U.S. Appl. No. 13/166,027, May 3, 2013, pp. 1-15. |
| Office Action, U.S. Appl. No. 13/166,397, Jul. 2, 2013, pp. 1-19. |
| Notice of Allowance, U.S. Appl. No. 13/116,382, Sep. 16, 2013, pp. 1-9. |
| Office Action, U.S. Appl. No. 13/116,382, May 9, 2013, pp. 1-15. |
| Office Action, U.S. Appl. No. 13/282,995, Jul. 17, 2013, pp. 1-16. |
| Notice of Allowance, U.S. Appl. No. 13/275,467, Aug. 23, 2013, pp. 1-14. |
| Office Action, U.S. Appl. No. 13/275,487, Aug. 16, 2013, pp. 1-39. |
| Notice of Allowance, U.S. Appl. No. 13/275,500, Aug. 7, 2013, pp. 1-14. |
| Office Action, U.S. Appl. No. 13/275,500, May 1, 2013, pp. 1-10. |
| Final Office Action, U.S. Appl. No. 13/275,530, Jul. 25, 2013, pp. 1-19. |
| Office Action, U.S. Appl. No. 13/663,031, Sep. 20, 2013, pp. 1-17. |
| Notice of Allowance, U.S. Appl. No. 16/661,930, Aug. 27, 2013, pp. 1-11. |
| Office Action, U.S. Appl. No. 13/676,405, Aug. 30, 2013, pp. 1-29. |
| Notice of Allowance, U.S. Appl. No. 13/672,966, Oct. 1, 2013, pp. 1-12. |
| Office Action, U.S. Appl. No. 13/688,603, Sep. 27, 2013, pp. 1-13. |
| Final Office Action, U.S. Appl. No. 13/677,970, Aug. 16, 2013, pp. 1-15. |
| Office Action, U.S. Appl. No. 13/672,044, Jul. 5, 2013, pp. 1-17. |
| Notice of Allowance, U.S. Appl. No. 13/706,574, Jun. 4, 2013, pp. 1-8. |
| Notice of Allowance, U.S. Appl. No. 13/742,325, Aug. 28, 2013, pp. 1-10. |
| Office Action, U.S. Appl. No. 13/742,325, Apr. 25, 2013, pp. 1-12. |
| Office Action, U.S. Appl. No. 13/710,523, Aug. 20, 2013, pp. 1-29. |
| Notice of Allowance, U.S. Appl. No. 13/738,043, Oct. 28, 2013, pp. 1-11. |
| Office Action, U.S. Appl. No. 13/738,043, Sep. 5, 2013, pp. 1-10. |
| Final Office Action, U.S. Appl. No. 13/708,061, Jul. 25, 2013, pp. 1-26. |
| Office Action, U.S. Appl. No. 13/747,895, Oct. 11, 2013, pp. 1-14. |
| Office Action, U.S. Appl. No. 13/776,823, Oct. 11, 2013, pp. 1-12. |
| Number | Date | Country | |
|---|---|---|---|
| 20130144932 A1 | Jun 2013 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13275500 | Oct 2011 | US |
| Child | 13738043 | US |
