Asynchronous and Parallel Application Processing

A computerized method, comprising:

• receiving an on-leveling request along with a proposed factor-rate and a period of time;
• retrieving policy records from a database associated with the period of time;
• creating, by one or more computer processors, a queue comprising entries, each entry having a policy identifier associated with a unique one of the policy records;
• asynchronously processing workers on servers in parallel;
• wherein each worker performs processing comprising:
• obtaining a unique policy identifier from a unique entry of the queue;
• flagging that unique entry as having been addressed;
• obtaining a corresponding policy record that corresponds to the unique policy identifier;
• calculating a premium for the corresponding policy record based on the proposed factor-rate and producing a modified premium;
• recording the unique policy identifier and the modified premium in a shared table that is shared between the workers;
• and
• iterating back to the obtaining until each unique entry in the queue is flagged;
• and
• providing a reference to the shared table as on-level results that satisfy the on-leveling request.

A system, comprising:

• a first server comprising a first processor and a first non-transitory computer-readable storage medium having executable instructions representing an application manager;
• a plurality of second servers, each second server comprise a second processor and a second non-transitory computer-readable storage medium having executable instructions representing a thread;
• the application manager when executed by the first processor from the first non-transitory computer-readable storage medium causes the first processor to perform operations comprising:
• receiving an application request to process an application with input parameters;
• obtaining input records from a database based on the request;
• referencing each input record as an entry in a queue;
• determining a total thread number for the threads and a total second server number for the second servers;
• determining groupings for the threads for each of the second servers, each grouping including a same number of the threads or a different number of the threads;
• assigning each grouping to a particular one of the second servers;
• instantiating each thread within each grouping on each of the second servers to process asynchronously and in parallel with one another;
• dynamically adjusting each grouping, the total thread number, and the total server number as the threads process on the second servers based at least on processor loads or memory loads associated with the second servers;
• and
• returning a reference to a shared data store representing application results for processing an application associated with the threads once each entry of the queue is processed by the threads to satisfy the application request;
• each thread when executed by the corresponding second processor from the corresponding second non-transitory computer-readable storage medium on the corresponding second server causes the corresponding second processor to perform operations comprising:
• obtaining an entry from the queue;
• flagging the entry within the queue as having been addressed;
• obtaining an input record corresponding to the entry;
• processing the input record using the input parameters producing entry results for the entry;
• recording the entry results in the shared data store;
• and
• iterating back to obtain a next entry from the queue as the entry until each entry of the queue is flagged as having been addressed.