METHODS AND SYSTEMS FOR COORDINATED TRANSACTIONS IN DISTRIBUTED AND PARALLEL ENVIRONMENTS

• US 20140122320A1
• Filed: 01/08/2014
• Published: 05/01/2014
• Est. Priority Date: 07/30/2007
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dantzig, Paul M., Iyengar, Arun K., Parr, Francis N., Su, Gong
• Granted Patent: US 9,870,264 B2
• Time in Patent Office: Days
• US Class Current: 705/37
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/5044 considering hardware capabilities
• CPC Class Codes: G06Q 40/04 Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Abstract

Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Claims

1. A method for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node, the method comprising the steps of:

receiving compound requests, each compound request comprising a plurality of individual requests, wherein one or more compound requests include individual requests of different request types;

maintaining information about frequencies of compound requests received and the request types of the individual requests comprising said compound requests; and

for a plurality of different request types of individual requests which frequently occur in a compound request, associating said plurality of different request types to a same node.

2. The method of claim 1, further comprising:

modifying said association between request types and nodes based on new information about frequencies of compound requests and individual requests comprising said compound requests.

3. The method of claim 2, further comprising:

in response to communication overhead exceeding a threshold, modifying said association between request types and nodes while the system continues to handle requests.

4. The method of claim 1, wherein said maintaining step further comprises maintaining relative frequencies with which pairs of request types occur in compound requests.

5. The method of claim 4, wherein said associating step further comprises, for a pair of request types t1 and t2 which frequently occurs in compound requests, associating both request types t1 and t2 to a same node.

6. The method of claim 4, wherein request types are associated to nodes by examining said relative frequencies in decreasing order.

7. The method of claim 6, wherein a pair of request types i and j which occurs frequently in compound requests is handled as follows:

if neither request types i nor j has been assigned to a node, both are assigned to a same node if a node with sufficient capacity can be found;

if only one of request types i or j has been assigned to a node, then the other request type is assigned to the node if the node is estimated to have sufficient capacity to accommodate requests corresponding to said other request type.

8. The method of claim 1, wherein an individual request comprises an order to buy or sell a stock or commodity and the type of said request comprises the type of said stock or commodity.

9. An article of manufacture for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node, the article comprising a computer readable storage medium containing one or more computer programs which, when executed by a computer, implement the steps of claim 1.

10. An apparatus for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node, the apparatus comprising:

a memory; and

at least one processor coupled to the memory and configured to;

receive compound requests, each compound request comprising a plurality of individual requests, wherein one or more compound requests include individual requests of different request types;

maintain information about frequencies of compound requests received and the request types of the individual requests comprising said compound requests; and

for a plurality of different request types of individual requests which frequently occur in a compound request, associating said plurality of different request types to a same node.

11. The apparatus of claim 10, wherein the at least one processor is further configured to modify said association between request types and nodes based on new information about frequencies of compound requests and individual requests comprising said compound requests.

12. The apparatus of claim 11, wherein the at least one processor is further configured to, in response to communication overhead exceeding a threshold, modify said association between request types and nodes while the system continues to handle requests.

13. The apparatus of claim 10, wherein the at least one processor is further configured to maintain relative frequencies with which pairs of request types occur in compound requests.

14. The apparatus of claim 13, wherein the at least one processor is further configured to, for a pair of request types t1 and t2 which frequently occurs in compound requests, associate both request types t1 and t2 to a same node.

15. The apparatus of claim 13, wherein request types are associated to nodes by examining said relative frequencies in decreasing order.

16. The apparatus of claim 15, wherein a pair of request types i and j which occurs frequently in compound requests is handled as follows:

if neither request types i nor j has been assigned to a node, both are assigned to a same node if a node with sufficient capacity can be found;

if only one of request types i or j has been assigned to a node, then the other request type is assigned to the node if the node is estimated to have sufficient capacity to accommodate requests corresponding to said other request type.

17. The apparatus of claim 10, wherein an individual request comprises an order to buy or sell a stock or commodity and the type of said request comprises the type of said stock or commodity.