Abstract: A system for managing computational tasks in a queuing dataset includes at least one processor and a scheduler executed by the at least one processor. The scheduler is configured to simultaneously and circularly change an association of each of a plurality of computational task bins with a respective one of a plurality of time based priorities ordered in a fixed ascending order; receive a plurality of computational tasks; and allocate each of the plurality of computational tasks to one of the plurality of computational task bins according to a respective time constraint of the respective computational task and a current association of the plurality of computational task bins with the plurality of time based priorities. The scheduler is further configured to empty the computational task bin currently associated with the highest time based priority by sequentially outputting the computational tasks thereof.

Abstract: A system for managing computational tasks in a queuing dataset, comprising: at least one processor; a scheduler, executed by the at least one processor for: simultaneously and circularly changing an association of each of a plurality of computational task bins with a respective one of a plurality of time based priorities ordered in a fixed ascending order; receiving a plurality of computational tasks; allocating each of the plurality of computational tasks to one of the plurality of computational task bins according to a respective time constraint of the respective computational task and a current association of the plurality of computational task bins with the plurality of time based priorities; emptying the computational task bin currently associated with the highest time based priority by sequentially outputting the computational tasks thereof; wherein the association, the reception and the emptying are independent from one another and are each performed in an uninterruptible manner.