Patents by Inventor Matthew W Markland
Matthew W Markland has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8436720Abstract: In a distributed computing system including a nodes organized for collective operations: initiating, by a root node through an active message to all other nodes, a collective operation, the active message including an instruction to each node to store operating parameter data in each node's send buffer; and, responsive to the active message: storing, by each node, the node's operating parameter data in the node's send buffer and returning, by the node, the operating parameter data as a result of the collective operation.Type: GrantFiled: April 29, 2010Date of Patent: May 7, 2013Assignee: International Business Machines CorporationInventors: Charles J. Archer, James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Patent number: 8392385Abstract: Methods, systems, and computer program products for flexible event data content management for relevant event and alert analysis within a distributed processing system are provided.Type: GrantFiled: June 22, 2011Date of Patent: March 5, 2013Assignee: International Business Machines CorporationInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Patent number: 8386602Abstract: Methods, systems and products are provided relevant alert delivery including assigning by an event analyzer each received event to an events pool; determining by the event analyzer in dependence upon event analysis rules and the events assigned to the events pool whether to suppress one or more of the events; identifying by the event analyzer in dependence upon event analysis rules and the events assigned to the events pool one or more alerts; sending by the event analyzer to an alert analyzer all the alerts identified by the event analyzer; assigning by the alert analyzer the identified alerts to an alerts pool; determining by the alert analyzer in dependence upon alert analysis rules and the alerts in the alert pool whether to suppress any alerts; and transmitting the unsuppressed alerts to one or more components of the distributed processing system.Type: GrantFiled: November 2, 2010Date of Patent: February 26, 2013Assignee: International Business Machines CorporationInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Patent number: 8364813Abstract: Administering incident pools including creating a pool of incidents, the pool having a predetermined initial period of time; assigning each received incident to the pool; assigning, by the incident analyzer, to each incident a predetermined minimum time for inclusion in a pool; extending for one or more of the incidents the predetermined initial period of time of the pool by a particular period of time assigned to the incident; determining whether conditions have been met to close the pool; and if conditions have been met to close the pool determining for each incident in the pool whether the incident has been in the pool for its predetermined minimum time for inclusion in a pool; and if the incident has not been in the pool for its predetermined minimum time, evicting the incident from the closed pool and including the incident in a next pool.Type: GrantFiled: November 2, 2010Date of Patent: January 29, 2013Assignee: International Business Machines CorporationInventors: Mark G. Atkins, James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20130024866Abstract: Topology mapping in a distributed processing system, the distributed processing system including a plurality of compute nodes, each compute node having a plurality of tasks, each task assigned a unique rank, including: assigning each task to a geometry defining the resources available to the task; selecting, from a list of possible data communications algorithms, one or more algorithms configured for the assigned geometry; and identifying, by each task to all other tasks, the selected data communications algorithms of each task in a single collective operation.Type: ApplicationFiled: July 19, 2011Publication date: January 24, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Charles J. Archer, James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20130018947Abstract: Methods, apparatuses, and computer program products for performing collective operations on a hybrid distributed processing system are provided. The hybrid distributed processing system includes a plurality of compute nodes where each compute node has a plurality of tasks, each task is assigned a unique rank, and each compute node is coupled for data communications by at least one data communications network implementing at least two different networking topologies. At least one of the two networking topologies is a tiered tree topology having a root task and at least two child tasks and the at least two child tasks are peers of one another in the same tier. Embodiments include for each task, sending at least a portion of data corresponding to the task to all child tasks of the task through the tree topology; and sending at least a portion of the data corresponding to the task to all peers of the task at the same tier in the tree topology through the second topology.Type: ApplicationFiled: July 13, 2011Publication date: January 17, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Charles J. Archer, James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20130018935Abstract: Methods, apparatuses, and computer program products for performing collective operations on a hybrid distributed processing system are provided. The hybrid distributed processing system includes a plurality of compute nodes, each compute node having a plurality of tasks, each task assigned a unique rank, each compute node coupled for data communications by at least one data communications network implementing at least two different networking topologies. A first networking topology includes a tiered tree topology having a root task, and at least two child tasks, where the two child tasks are peers of one another in the same tier.Type: ApplicationFiled: July 13, 2011Publication date: January 17, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Charles J. ARCHER, James E. CAREY, Matthew W. MARKLAND, Philip J. SANDERS
-
Publication number: 20120331485Abstract: Methods, systems, and computer program products for flexible event data content management for relevant event and alert analysis within a distributed processing system are provided. Embodiments include capturing, by an interface connector, an event from a resource of the distributed processing system; inserting, by the interface connector, the event into an event database; receiving from the interface connector, by a notifier, a notification of insertion of the event into the event database; based on the received notification, tracking, by the notifier, the number of events indicated as inserted into the event database; receiving from the notifier, by a monitor, a cumulative notification indicating the number of events that have been inserted into the event database; in response to receiving the cumulative notification, retrieving, by the monitor, from the event database, events inserted into the event database; and processing, by the monitor, the retrieved events.Type: ApplicationFiled: June 22, 2011Publication date: December 27, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120330918Abstract: Methods, systems, and computer program products for flexible event data content management for relevant event and alert analysis within a distributed processing system are provided.Type: ApplicationFiled: June 22, 2011Publication date: December 27, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120331347Abstract: Methods, systems, and computer program products for restarting event and alert analysis after a shutdown in a distributed processing system are provided.Type: ApplicationFiled: June 22, 2011Publication date: December 27, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120331332Abstract: Methods, systems, and computer program products for restarting event and alert analysis after a shutdown in a distributed processing system are provided.Type: ApplicationFiled: June 22, 2011Publication date: December 27, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120331270Abstract: Compressing result data for a compute node in a parallel computer, the parallel computer including a collection of compute nodes organized as a tree, including: initiating a collective gather operation by a logical root of the collection of compute nodes, including adding result data of the logical root to a gather buffer; for each compute node in the collection of compute nodes, determining whether result data of the compute node is already written in the gather buffer; and if the result data of the compute node is already written in the gather buffer, incrementing a counter assigned to that result data already written in the gather buffer; and if the result data of the compute node is not already written in the gather buffer, writing the result data of the compute node as new result data in the gather buffer, incrementing a counter assigned to that new result data, and writing in the gather buffer a node ID.Type: ApplicationFiled: June 22, 2011Publication date: December 27, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Charles J. Archer, James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120191920Abstract: Reducing remote reads of memory in a hybrid computing environment by maintaining remote memory values locally, the hybrid computing environment including a host computer and a plurality of accelerators, the host computer and the accelerators each having local memory shared remotely with the other, including writing to the shared memory of the host computer packets of data representing changes in accelerator memory values, incrementing, in local memory and in remote shared memory on the host computer, a counter value representing the total number of packets written to the host computer, reading by the host computer from the shared memory in the host computer the written data packets, moving the read data to application memory, and incrementing, in both local memory and in remote shared memory on the accelerator, a counter value representing the total number of packets read by the host computer.Type: ApplicationFiled: March 9, 2012Publication date: July 26, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael E. Aho, Charles J. Archer, James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120144021Abstract: Methods, systems and products are provided for administering event reporting rules in a distributed processing system that includes identifying that one or more nodes of the distributed processing system is idle; for each identified idle node, collecting by the idle node any suppressed events and logged data from the node; sending the suppressed events and logged data to a database of events; and changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data.Type: ApplicationFiled: December 7, 2010Publication date: June 7, 2012Applicant: International Business Machines CorporationInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120144251Abstract: Relevant alert delivery including determining, by an events listener associated with an event queue, whether one or more events in an events queue have not been assigned to any events pool by any event analyzer; and if one or more events in the events queue have not been assigned to any events pool, identifying by the events listener in dependence upon the event analysis rules one or more alerts; sending by the event listener to an alerts queue all the alerts identified by the event listener; the alerts queue having an associated alerts listener; determining whether one or more alerts in the alerts queue have not been assigned to any alert pool; if one or more alerts in the alerts queue have not been assigned to any alerts pool, and determining in dependence upon alert analysis rules whether to suppress the alerts; and transmitting the unsuppressed alerts.Type: ApplicationFiled: December 7, 2010Publication date: June 7, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120144020Abstract: Dynamic administration of event pools for relevant event and alert analysis during event storms including receiving, by an events analyzer from an events queue, a plurality of events from one or more components of the distributed processing system, each event including an occurred time and a logged time; creating, by the event analyzer, an events pool; determining whether an arrival rate of the events from the components of the distributed processing system is greater than a predetermined threshold; if the arrival rate is greater than the predetermined threshold, assigning, by the events analyzer, a plurality of events to the events pool in dependence upon their occurred time; and if the arrival rate is not greater than the predetermined threshold, assigning, by the events analyzer, a plurality of events to the events pool in dependence upon their logged time.Type: ApplicationFiled: December 7, 2010Publication date: June 7, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120144243Abstract: Methods, systems and products are provided for dynamic administration of component event reporting in a distributed processing system including receiving, by an events analyzer from an events queue, a plurality of events from one or more components of the distributed processing system; determining, by the events analyzer in dependence upon the received events and one or more event analysis rules, to change the event reporting rules of one or more components; and instructing, by the events analyzer, the one or more components to change the event reporting rules.Type: ApplicationFiled: December 6, 2010Publication date: June 7, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Patent number: 8180972Abstract: Reducing remote reads of memory in a hybrid computing environment by maintaining remote memory values locally, the hybrid computing environment including a host computer and a plurality of accelerators, the host computer and the accelerators each having local memory shared remotely with the other, including writing to the shared memory of the host computer packets of data representing changes in accelerator memory values, incrementing, in local memory and in remote shared memory on the host computer, a counter value representing the total number of packets written to the host computer, reading by the host computer from the shared memory in the host computer the written data packets, moving the read data to application memory, and incrementing, in both local memory and in remote shared memory on the accelerator, a counter value representing the total number of packets read by the host computer.Type: GrantFiled: August 7, 2009Date of Patent: May 15, 2012Assignee: International Business Machines CorporationInventors: Michael E. Aho, Charles J. Archer, James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120110161Abstract: Methods, systems and products are provided relevant alert delivery including assigning by an event analyzer each received event to an events pool; determining by the event analyzer in dependence upon event analysis rules and the events assigned to the events pool whether to suppress one or more of the events; identifying by the event analyzer in dependence upon event analysis rules and the events assigned to the events pool one or more alerts; sending by the event analyzer to an alert analyzer all the alerts identified by the event analyzer; assigning by the alert analyzer the identified alerts to an alerts pool; determining by the alert analyzer in dependence upon alert analysis rules and the alerts in the alert pool whether to suppress any alerts; and transmitting the unsuppressed alerts to one or more components of the distributed processing system.Type: ApplicationFiled: November 2, 2010Publication date: May 3, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James E. Carey, Matthew W. Markland, Philip J. Sanders
-
Publication number: 20120110153Abstract: Administering incident pools including creating a pool of incidents, the pool having a predetermined initial period of time; assigning each received incident to the pool; assigning, by the incident analyzer, to each incident a predetermined minimum time for inclusion in a pool; extending for one or more of the incidents the predetermined initial period of time of the pool by a particular period of time assigned to the incident; determining whether conditions have been met to close the pool; and if conditions have been met to close the pool determining for each incident in the pool whether the incident has been in the pool for its predetermined minimum time for inclusion in a pool; and if the incident has not been in the pool for its predetermined minimum time, evicting the incident from the closed pool and including the incident in a next pool.Type: ApplicationFiled: November 2, 2010Publication date: May 3, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mark G. Atkins, James E. Carey, Matthew W. Markland, Philip J. Sanders