Ordering repeating elements within a message

• US 9,940,163 B2
• Filed: 09/08/2015
• Issued: 04/10/2018
• 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.
• Primary Examiner(s): Sough, Hyung S.
• Assistant Examiner(s): Jordan, Kimberly L
• Application Number:
  US14/847,603
• Publication Number:
  US 20170068566A1
• Time in Patent Office: 945 Days
• Field of Search: 719314
• 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, wherein the queue comprises a plurality of transactions;

sorting a first batch of transactions, wherein the first batch of transactions comprises a first group of transactions of the plurality of transactions in the queue, wherein the sorting is according to the determined sort order, and wherein the sorting comprising defining a first synchronization point in the queue to differentiate the sorted first batch of transactions from transactions of the plurality of transaction not in the first batch;

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

commencing processing, in the determined sort order, the first group of transactions in the first batch;

concurrent to the commencing processing, sorting a further batch of transactions in the queue according to the determined sort order, wherein the further batch of transactions comprises a second group of transactions of the plurality of transactions, and wherein the second group of transactions comprises unprocessed transactions in the first group of transactions, and wherein the sorting comprising defining a further synchronization point in the queue to differentiate the sorted further batch of transactions from transactions of the plurality of transaction not in the in the first batch or in the further batch;

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

commencing processing, in the determined sort order, the second group of transactions in the further batch; and

concurrent to the commencing processing of the further batch, continuing to sort, notify, and commence processing for further batches of the transactions in the queue until the plurality of transactions in the queue have been sorted and the notifying is performed.

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

3. 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 the processing transactions in the queue comprises processing transactions in order of score.

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

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

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

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

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

determining a sort order for the queue of transactions, wherein the queue comprises a plurality of transactions;

sorting a first batch of transactions, wherein the first batch of transactions comprises a first group of transactions of the plurality of transactions in the queue, wherein the sorting is according to the determined sort order, and wherein the sorting comprising defining a first synchronization point in the queue to differentiate the sorted first batch of transactions from transactions of the plurality of transaction not in the first batch;

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

commencing processing, in the determined sort order, the first group of transactions in the first batch;

concurrent to the commencing processing, sorting a further batch of transactions in the queue according to the determined sort order, wherein the further batch of transactions comprises a second group of transactions of the plurality of transactions, and wherein the second group of transactions comprises unprocessed transactions in the first group of transactions, and wherein the sorting comprising defining a further synchronization point in the queue to differentiate the sorted further batch of transactions from transactions of the plurality of transaction not in the in the first batch or in the further batch;

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

commencing processing, in the determined sort order, the second group of transactions in the further batch; and

concurrent to the commencing processing of the further batch, continuing to sort, notify, and commence processing for further batches of the transactions in the queue until the plurality of transactions in the queue have been sorted and the notifying is performed.

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

10. The method according to claim 8, 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 the processing transactions in the queue comprises processing transactions in order of score.

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

12. 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, wherein the queue comprises a plurality of transactions;

sorting a first batch of transactions, wherein the first batch of transactions comprises a first group of transactions of the plurality of transactions in the queue, wherein the sorting is according to the determined sort order, and wherein the sorting comprising defining a first synchronization point in the queue to differentiate the sorted first batch of transactions from transactions of the plurality of transaction not in the first batch;

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

commencing processing, in the determined sort order, the first group of transactions in the first batch;

concurrent to the commencing processing, sorting a further batch of transactions in the queue according to the determined sort order, wherein the further batch of transactions comprises a second group of transactions of the plurality of transactions, and wherein the second group of transactions comprises unprocessed transactions in the first group of transactions, and wherein the sorting comprising defining a further synchronization point in the queue to differentiate the sorted further batch of transactions from transactions of the plurality of transaction not in the in the first batch or in the further batch;

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

commencing processing, in the determined sort order, the second group of transactions in the further batch; and

concurrent to the commencing processing of the further batch, continuing to sort, notify, and commence processing for further batches of the transactions in the queue until the plurality of transactions in the queue have been sorted and the notifying is performed.

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

14. The computer program product according to claim 12, 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 the processing transactions in the queue comprises processing transactions in order of score.

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