ORDERING REPEATING ELEMENTS WITHIN A MESSAGE

• US 20170068566A1
• Filed: 09/08/2015
• Published: 03/09/2017
• Est. Priority Date: 09/08/2015
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hosie, John, Ross, Martin A., Stirling, Craig H., Storey, Dominic J.
• Granted Patent: US 9,940,163 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

A queue of transactions is managed. A sort order for the queue of transaction is determined. A first batch of transactions is sorted according to the determined sort order and a further batch of transactions is also sorted according to the determined sort order. A notifying is performed that the first batch of transactions is ready for processing and that the further batch of transactions is ready for processing. The sorting and notifying for further batches of the transactions continues until all the transactions in the queue have been sorted and notified as ready for processing.

Claims

1. A computer system for managing a queue of transactions for processing, the computer system comprising:

a memory; and

a processing device in communication with the memory, wherein the computer system is configured to perform a method, said method comprising;

determining a sort order for the queue of transactions;

sorting a first batch of transactions in the queue according to the determined sort order;

notifying that the transactions in the first batch of transactions are ready for processing;

sorting a further batch of transactions in the queue according to the determined sort order;

notifying that the transactions in the further batch are ready for processing; and

continuing to sort and notify for further batches of the transactions in the queue until the transactions in the queue have been sorted and the notifying is performed.

2. The computer system according to claim 1, wherein a synchronization point is defined to mark a sorted batch of transactions and remaining unsorted transactions in the queue.

3. The computer system according to claim 1, wherein the method further comprises processing transactions in the transaction queue that are ready for processing.

4. The computer system according to claim 1, wherein the sorting of at least one of the first batch of transactions or the further batch of transactions comprises scoring each transaction in a batch of transactions, and processing transactions in the queue that are ready for processing in order of score.

5. The computer system according to claim 4, wherein the scoring each transaction comprises uses a scoring definition based on one of more values from each transaction.

6. The computer system according to claim 4, wherein the scoring each transaction comprises requesting a score for each transaction from an external score analysis service.

7. The computer system according to claim 1, wherein the method further comprises modifying a batch size to optimize batch sorting and processing.

8. The computer system according to claim 1, wherein the first batch is a part of the further batch and the further batch is part of a subsequent further batch.

9. The computer system according to claim 1, wherein the first batch and further batches are adjacent and do not overlap.

10. The computer system according to claim 1, wherein each batch is a single message and each transaction is an element within that single message.

11. A method of managing a queue of transactions for processing, the method comprising:

determining a sort order for the queue of transactions;

sorting a first batch of transactions in the queue according to the determined sort order;

notifying that the transactions in the first batch of transactions are ready for processing;

sorting a further batch of transactions in the queue according to the determined sort order;

notifying that the transactions in the further batch are ready for processing; and

continuing to sort and notify for further batches of the transactions in the queue until the transactions in the queue have been sorted and the notifying is performed.

12. The method according to claim 11, wherein a synchronization point is defined to mark a sorted batch of transactions and remaining unsorted transactions in the queue.

13. The method according to claim 11, further comprising processing transactions in the transaction queue that are ready for processing.

14. The method according to claim 11, wherein the sorting of at least one of the first batch of transactions or the further batch of transactions comprises scoring each transaction in a batch of transactions, and processing transactions in the queue that are ready for processing in order of score.

15. The method according to claim 14, wherein the scoring each transaction comprises uses a scoring definition based on one or more values from each transaction.

16. A computer program product for managing a queue of transactions for processing, the computer program product comprising:

a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising;

determining a sort order for the queue of transactions;

sorting a first batch of transactions in the queue according to the determined sort order;

notifying that the transactions in the first batch of transactions are ready for processing;

sorting a further batch of transactions in the queue according to the determined sort order;

notifying that the transactions in the further batch are ready for processing; and

continuing to sort and notify for further batches of the transactions in the queue until the transactions in the queue have been sorted and the notifying is performed.

17. The computer program product according to claim 16, wherein a synchronization point is defined to mark a sorted batch of transactions and remaining unsorted transactions in the queue.

18. The computer program product according to claim 16, wherein the method further comprises processing transactions in the transaction queue that are ready for processing.

19. The computer program product according to claim 16, wherein the sorting of at least one of the first batch of transactions or the further batch of transactions comprises scoring each transaction in a batch of transactions, and processing transactions in the queue that are ready for processing in order of score.

20. The computer program product according to claim 19, wherein the scoring each transaction comprises using a scoring definition based on one or more values from each transaction.