Please download the dossier by clicking on the dossier button x
×

DYNAMIC PRIORITY QUEUING

  • US 20110246996A1
  • Filed: 04/05/2010
  • Published: 10/06/2011
  • Est. Priority Date: 04/05/2010
  • Status: Active Grant
First Claim
Patent Images

1. A method for scheduling operations, comprising:

  • maintaining a queue of to-be-executed operations, wherein the to-be-executed operations are executed in an order based on relative positions of the to-be-executed operations within the queue;

    receiving, from an operation requester, one or more first requests for execution of a plurality of operations;

    wherein each operation of the plurality of operations has an initial priority designation specified by the operation requester in the one or more first requests;

    in response to the one or more first requests, placing the plurality of operations in a corresponding first plurality of positions within the queue;

    wherein the first plurality of positions are selected based at least in part on the initial priority designations of the corresponding operations;

    after the plurality of operations have been placed in the queue and before the plurality of operations have been executed, receiving, from the operation requester, one or more priority-change messages for the plurality of operations;

    wherein each operation of the plurality of operations has a second priority designation specified by the operation requester in the one or more priority-change messages;

    wherein, for at least one operation of the plurality of operations, the second priority designation is different than the initial priority designation;

    in response to the one or more priority-change messages that indicate a different priority for the at least one operation, changing the position, within the queue, of said least one operation;

    wherein the method is performed by one or more computing devices.

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