Re: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]

On Sat, 14 Apr 2007, Davide Libenzi wrote:

> Haven't looked at the scheduler code yet, but for a similar problem I use 
> a time ring. The ring has Ns (2 power is better) slots (where tasks are 
> queued - in my case they were som sort of timers), and it has a current 
> base index (Ib), a current base time (Tb) and a time granularity (Tg). It 
> also has a bitmap with bits telling you which slots contains queued tasks. 
> An item (task) that has to be scheduled at time T, will be queued in the slot:
> 
> S = Ib + min((T - Tb) / Tg, Ns - 1);

... mod Ns, of course ;)


- Davide


-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

---

• References:
  • [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]
    • From: Ingo Molnar <[email protected]>
  • Re: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]
    • From: William Lee Irwin III <[email protected]>
  • Re: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]
    • From: Davide Libenzi <[email protected]>

• Prev by Date: NFS: Fix an Oops in nfs_setattr()
• Next by Date: {Spam?} [PATCH] NET: Remove obsolete traffic shaper code.
• Previous by thread: Re: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]
• Next by thread: Re: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]
• Index(es):
  • Date
  • Thread

[Index of Archives]     [Kernel Newbies]     [Netfilter]     [Bugtraq]     [Photo]     [Stuff]     [Gimp]     [Yosemite News]     [MIPS Linux]     [ARM Linux]     [Linux Security]     [Linux RAID]     [Video 4 Linux]     [Linux for the blind]     [Linux Resources]