×

System and method for priority scheduling of plurality of message types with serialization constraints and dynamic class switching

  • US 8,428,076 B2
  • Filed: 03/30/2011
  • Issued: 04/23/2013
  • Est. Priority Date: 09/13/2010
  • Status: Active Grant
First Claim
Patent Images

1. A preemptive priority scheduling system providing serialization by dynamic switching of a plurality of messages of a plurality of classes in an intersystem communication, the system comprising of:

  • an intersystem communication comprising a front office to handle a plurality of predefined first set of business operations and a back office to handle plurality of second set of business operations, the back office receiving a plurality of messages from the front office in a serialized sequence;

    a plurality of inbound messages, each message assigned to a pre-identified class, comprising at least one highest priority message, at least one medium priority message and at least one lowest priority message stored in a cache memory of the front office system, wherein each message is assigned with a unique messageid and a class of messages corresponding to at least one pre-identified business activity is assigned a unique baseid;

    an input message queue to index the queue with messageid and baseid of at least one message residing therein the cache memory of the front office system;

    a plurality of output server processes running on at least one message output server identified by an assigned serverid thereof, wherein each output server process invokes a synchronous service call to fetch at least one message from the cache memory corresponding to the indexed messageid in the input message queue and sending messages in first come first serve order to at least one back office system;

    at least one serialization constraint, pre-identified for priority based message scheduling, comprising of fully restrictive, partially restrictive and non restrictive constraints, each constraint allowing to identify priority of each class of the inbound message and subsequent processing thereof by a scheduling system;

    a pending list comprising indexed messageid of a pre-identified at least one class of messages having medium priority messages with serialization conflict with the highest priority messages and one or more other priority message classes, wherein the conflicting messageid is fetched from the input message queue in response to the service call from at least one output server process;

    a restrictive message list comprising indexed baseid of at least one class of messages having lowest priority messages with serialization conflict with the highest priority messages and one or more other priority message classes, wherein the baseid is linked to a linked list pointer thereof;

    a dispatcher, communicatively coupled with the cache memory of the front office system, dynamically configurable to adapt to at least one serialization constraint, wherein the dispatcher assigns at least one message of at least one class, indexed in the input message queue, to at least one output server process according to predetermined priority thereof for priority based preemptive message transmission to at least one back office node in confirmation with at least one selected message serialization constraint; and

    a service over queue, communicatively connected to the dispatcher, to assign at least one message to at least one output server process and updating a server process completion flag accessible by the dispatcher, enabling the dispatcher to resume dispatching of at least one new message from the input message queue to at least one output server process.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×