Patents by Inventor Graeme Stanley Chambers
Graeme Stanley Chambers 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: 8533318Abstract: An approach is provided that receives a set of tracking data from a monitored activity. The set of tracking data includes name-value pairs. The received set name-value pairs are compared with context masks. Each context mask include one or more name-filter pairs. One of the sets of context masks is selected in response to determining that the incoming name-value pairs matches the mask name-filter pairs of the selected context mask. Name-value pairs are selected based upon the selected context mask. The selected name-value pairs are then stored in an aggregate data store. If the received set of tracking data fails to match at least one of the name-filter pairs then the received set of tracking data is disregarded and none of the name-value pairs are stored in the aggregate data store.Type: GrantFiled: October 6, 2009Date of Patent: September 10, 2013Assignee: International Business Machines CorporationInventors: Graeme Stanley Chambers, Robert Ching Kong Cheung, Ashley Neil Clementi, Luke Rowan McKenna, Andrew Wilkins, Tee Yen Ng
-
Patent number: 8346922Abstract: An approach is provided that transmits a load balance request from a first peer node to other peer nodes. Some of the peer nodes have assigned transaction tracking responsibilities. The transmitting is performed in response to identifying that the first peer node is performing at a non-optimal level. The first peer node receives responses from the other peer nodes. A determination is made as to whether to handover one or more of the first peer node's transaction tracking responsibilities. If a second peer node is identified to take some of the first peer node's responsibilities, then a handover message is sent from the first peer node to the second peer node that assigns at least one of the first peer node's assigned transaction responsibilities to the second peer node.Type: GrantFiled: March 8, 2012Date of Patent: January 1, 2013Assignee: International Business Machines CorporationInventors: Graeme Stanley Chambers, Simon Tevery Huband, Luke Rowan McKenna
-
Patent number: 8341263Abstract: An approach is provided that transmits a load balance request from a first peer node to other peer nodes. Some of the peer nodes have assigned transaction tracking responsibilities. The transmitting is performed in response to identifying that the first peer node is performing at a non-optimal level. The first peer node receives responses from the other peer nodes. A determination is made as to whether to handover one or more of the first peer node's transaction tracking responsibilities. If a second peer node is identified to take some of the first peer node's responsibilities, then a handover message is sent from the first peer node to the second peer node that assigns at least one of the first peer node's assigned transaction responsibilities to the second peer node.Type: GrantFiled: April 20, 2010Date of Patent: December 25, 2012Assignee: International Business Machines CorporationInventors: Graeme Stanley Chambers, Simon Tevery Huband, Luke Rowan McKenna
-
Publication number: 20120166640Abstract: An approach is provided that transmits a load balance request from a first peer node to other peer nodes. Some of the peer nodes have assigned transaction tracking responsibilities. The transmitting is performed in response to identifying that the first peer node is performing at a non-optimal level. The first peer node receives responses from the other peer nodes. A determination is made as to whether to handover one or more of the first peer node's transaction tracking responsibilities. If a second peer node is identified to take some of the first peer node's responsibilities, then a handover message is sent from the first peer node to the second peer node that assigns at least one of the first peer node's assigned transaction responsibilities to the second peer node.Type: ApplicationFiled: March 8, 2012Publication date: June 28, 2012Applicant: International Business Machines CorporationInventors: Graeme Stanley Chambers, Simon Tevery Huband, Luke Rowan McKenna
-
Patent number: 8134935Abstract: Determining a transaction topology of a network through generating and solving an adjacency matrix. A transaction is performed in a network and a list of statistics generated by the transaction is collected. The statistics provide a calculation of the number of inbound transactions and the number of outbound transactions for each node. A matrix structure is composed with the statistic. Constraints are applied to the matrix structure and a solution set of topology structures for the network is determined. The solution set of topology structures may be refined as needed with application of additional constraints.Type: GrantFiled: May 22, 2009Date of Patent: March 13, 2012Assignee: International Business Machines CorporationInventor: Graeme Stanley Chambers
-
Publication number: 20110258309Abstract: An approach is provided that transmits a load balance request from a first peer node to other peer nodes. Some of the peer nodes have assigned transaction tracking responsibilities. The transmitting is performed in response to identifying that the first peer node is performing at a non-optimal level. The first peer node receives responses from the other peer nodes. A determination is made as to whether to handover one or more of the first peer node's transaction tracking responsibilities. If a second peer node is identified to take some of the first peer node's responsibilities, then a handover message is sent from the first peer node to the second peer node that assigns at least one of the first peer node's assigned transaction responsibilities to the second peer node.Type: ApplicationFiled: April 20, 2010Publication date: October 20, 2011Applicant: International Business Machines CorporationInventors: Graeme Stanley Chambers, Simon Tevery Huband, Luke Rowan McKenna
-
Publication number: 20110082927Abstract: An approach is provided that receives a set of tracking data from a monitored activity. The set of tracking data includes name-value pairs. The received set name-value pairs are compared with context masks. Each context mask include one or more name-filter pairs. One of the sets of context masks is selected in response to determining that the incoming name-value pairs matches the mask name-filter pairs of the selected context mask. Name-value pairs are selected based upon the selected context mask. The selected name-value pairs are then stored in an aggregate data store. If the received set of tracking data fails to match at least one of the name-filter pairs then the received set of tracking data is disregarded and none of the name-value pairs are stored in the aggregate data store.Type: ApplicationFiled: October 6, 2009Publication date: April 7, 2011Applicant: International Business Machines CorporationInventors: Graeme Stanley Chambers, Robert Ching Kong Cheung, Ashley Neil Clementi, Luke Rowan McKenna, Andrew Wilkins, Tee Yen Ng
-
Publication number: 20100296411Abstract: Determining a transaction topology of a network through generating and solving an adjacency matrix. A transaction is performed in a network and a list of statistics generated by the transaction is collected. The statistics provide a calculation of the number of inbound transactions and the number of outbound transactions for each node. A matrix structure is composed with the statistic. Constraints are applied to the matrix structure and a solution set of topology structures for the network is determined. The solution set of topology structures may be refined as needed with application of additional constraints.Type: ApplicationFiled: May 22, 2009Publication date: November 25, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Graeme Stanley Chambers