METHODS AND SYSTEMS FOR COORDINATED TRANSACTIONS

• US 20090037913A1
• Filed: 07/30/2007
• Published: 02/05/2009
• Est. Priority Date: 07/30/2007
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Iyengar, Arun Kwangil, Dantzig, Paul M., Su, Gong, Parr, Francis Nicholas
• Granted Patent: US 8,898,669 B2
• Time in Patent Office: Days
• US Class Current: 718/101
• CPC Class Codes: G06F 2209/484 Precedence
• CPC Class Codes: G06F 2209/485 Resource constraint
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

Automated techniques are disclosed for coordinating request or transaction processing in a data processing system. For example, a technique for handling requests in a data processing system comprises the following steps. A compound request comprising at least two individual requests of different types is received. An individual request r1 of the compound request is placed on a queue for requests of type t1, wherein t1 is the request type of r1. After r1 has reached the front of the queue, it is determined if at least one individual request of said compound request can execute. The compound request is executed if it is determined that all individual requests of the compound request can execute.

Claims

1. A method for handling requests in a data processing system, comprising the steps of:

receiving a compound request comprising at least two individual requests of different types;

placing an individual request r1 of said compound request on a queue for requests of type t1, wherein t1 is the request type of r1;

after r1 has reached the front of said queue, determining if at least one individual request of said compound request can execute; and

executing said compound request, if it is determined that all individual requests of the compound request can execute.

2. The method of claim 1, further comprising:

rejecting said compound request, if it is determined that an individual request of said compound request can not execute.

3. The method of claim 1, further comprising:

in response to said compound request executing, sending information to a client indicating that the compound request has executed.

4. The method of claim 1, wherein said compound request executing further comprises storing information in persistent storage allowing system state to be consistently reconstructed if a failure occurs.

5. The method of claim 1, further comprising:

placing at least one individual request, other than r1, of said compound request on a queue corresponding to its request type; and

performing said determining step after r1 and the at least one individual request, other than r1, of said compound request have reached the front of their respective queues.

6. The method of claim 1, further comprising:

periodically re-determining if an individual request of said compound request can execute, if an individual request of said compound request can not execute.

7. The method of claim 1, wherein r1 is selected because it has a lower probability of being able to execute than at least one other individual request of said compound request and said determining step comprises determining if r1 can execute, further comprising rejecting said compound request in response to r1 not being able to execute.

8. The method of claim 1, further comprising:

in response to said determining step determining that at least one individual request r of said compound request can execute, reserving at least one resource to allow said request r to execute in the future; and

in response to another request not being executable, releasing said resource reserved for said request r and rejecting said compound request.

9. The method of claim 2, further comprising:

in response to said compound request being rejected, sending information to a client indicating that the compound request has been rejected.

10. The method of claim 1, further comprising:

executing at least one individual request of said compound request which can execute, if it is determined that an individual request of said compound request can not execute.

11. The method of claim 10, further comprising:

sending information to a client identifying the at least one individual request of said compound request which has executed.

12. The method of claim 1, further comprising:

considering exactly one individual request as the next request to be tested for executability, when determining if all individual requests of said compound request can execute.

13. The method of claim 1, wherein individual requests having a low probability of being executable are tested for executability before other individual requests.

14. The method of claim 4, wherein said information in persistent storage comprises information about individual requests in persistent logs corresponding to types of said individual requests.

15. 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.

16. A data processing system for handling requests, comprising:

a memory; and

a processor coupled to the memory and configured to;

(i) receive a compound request comprising at least two individual requests of different types;

(ii) place an individual request r1 of said compound request on a queue for requests of type t1, wherein t1 is the request type of r1;

(iii) after r1 has reached the front of said queue, determine if at least one individual request of said compound request can execute; and

(iv) execute said compound request, if it is determined that all individual requests of the compound request can execute.

17. The data processing system of claim 16, wherein the processor is further configured to reject said compound request, if it is determined that an individual request of said compound request can not execute.

18. The data processing system of claim 16, wherein the processor is further configured to, in response to said compound request executing, send information to a client indicating that the compound request has executed.

19. The data processing system of claim 16, wherein said compound request executing further comprises the processor storing information in persistent storage of the memory allowing system state to be consistently reconstructed if a failure occurs.

20. An article of manufacture for handling requests in a data processing system, the article comprising a computer readable storage medium containing one or more computer programs which, when executed by a computer, implement the steps of:

receiving a compound request comprising at least two individual requests of different types;

placing an individual request r1 of said compound request on a queue for requests of type t1, wherein t1 is the request type of r1;

after r1 has reached the front of said queue, determining if at least one individual request of said compound request can execute; and

executing said compound request, if it is determined that all individual requests of the compound request can execute.