Credit Scheduler for Ordering the Execution of Tasks

A method comprising:

• receiving at a queue:
• (i) at time t1 a first task T1 for execution on a processor, wherein the first task T1 has a first estimated execution time Δ1 and a first preferred wait time Γ1,
• (ii) at time t2 a second task T2 for execution on the processor, wherein time t1 is before time t2, and wherein the second task T2 has a second estimated execution time Δ2 and a second preferred wait time Γ2;
• and
• executing the second task T2 on the processor before executing the first task T1 when Γ2<Δ1.

A method comprising:

• receiving at a queue for execution on a processor a first task Ti, wherein the first task Ti has a first estimated execution time Δi and a first preferred wait time Γi and wherein the queue comprises at least one other task with a position j and an estimated execution time Δj;
• inserting the first task Ti into the queue at a position k, wherein j≦k, such that:
• Γ
• i
• ≥
• ∑
• j
• =
• 1
• k
• -
• 1
• 
• Δ
• j
• and
• Γ
• i
• <
• ∑
• j
• =
• 1
• k
• 
• Δ
• j
• ,
• wherein j=1 represents the position at the head of the queue;
• and
• executing the first task Ti on the processor before executing a second task Tn when Γi<Δn,
• wherein the first task Ti was received at the queue after the second task Tn, and wherein the second task Tn has a second estimated execution time Δn.