DYNAMIC PRIORITY QUEUE

摘要

The present disclosure relates to dynamic queue placement. In one embodiment, a method includes receiving a plurality of items for processing by a computing device, wherein each item received by the computing device is associated with a priority type. The method also includes determining a computed code for the plurality of items to assign a processing order in a queue for each of the plurality of items. The computed code is based on a timeout period for a lowest priority item of the plurality of items, and a safety margin interval of each of the plurality of items, the safety margin level including a time period for processing an item. The method may also include placing the plurality of items into the queue based on the computed code of each item.

主权项

1. A method for dynamic queue placement for a processor of a computing device, the method comprising:
receiving, by a computing device, a plurality of items for processing by the computing device, wherein each item received by the computing device is associated with a priority type;
determining a computed code, by the computing device, for the plurality of items, wherein the computed code is determined to assign a processing order in a queue for each of the plurality of items wherein the computed code is based on
a timeout period for a lowest priority item of the plurality of items, anda safety margin interval of each of the plurality of items, the safety margin interval including a time period for processing an item; andplacing the plurality of items into the queue, by the computing device, based on the computed code of each item determined by the computing device.