Methods and systems for coordinated transactions

A data processing system for handling requests, comprising:

• a memory;
• and
• a processor coupled to the memory and configured to:
• provide a plurality of individual requests, wherein each individual request has a type;
• provide a plurality of queues comprising at least one queue for each type of request, wherein each queue specifies an order for processing individual requests of the type corresponding to the queue which are placed on the queue;
• receive a compound request comprising a plurality of individual requests of different types;
• select at least one individual request of the compound request, wherein the at least one selected individual request has a lower probability of being able to execute than individual requests of said compound requests not selected;
• place the at least one selected individual request of said compound request on a respective queue that corresponds to the type of the at least one selected individual request, wherein at least one individual request of said compound request is not selected and not placed on the plurality of queues;
• and
• after the at least one selected individual request has reached the front of the respective queue,
• determine if the at least one selected individual request of said compound request can execute;
• and
• reject said compound request, if it is determined that the at least one selected individual request of said compound request cannot execute.

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

• providing a plurality of individual requests, wherein each individual request has a type;
• providing a plurality of queues comprising at least one queue for each type of request, wherein each queue specifies an order for processing individual requests of the type corresponding to the queue which are placed on the queue;
• receiving a compound request comprising a plurality of individual requests of different types;
• selecting at least one individual request of the compound request, wherein the at least one selected individual request has a lower probability of being able to execute than individual requests of said compound requests not selected;
• placing the at least one selected individual request of said compound request on a respective queue that corresponds to the type of the at least one selected individual request, wherein at least one individual request of said compound request is not selected and not placed on the plurality of queues;
• and
• after the at least one selected individual request has reached the front of the respective queue,
• determining if the at least one selected individual request of said compound request can execute;
• and
• rejecting said compound request, if it is determined that the at least one selected individual request of said compound request cannot execute.