Date: Wed, 17 Jul 2002 11:25:56 -0700 From: Terry Lambert <tlambert2@mindspring.com> To: Lars Eggert <larse@ISI.EDU> Cc: Luigi Rizzo <rizzo@icir.org>, arch@FreeBSD.ORG Subject: Re: proposed changes to kern_switch.c and kern_synch.c Message-ID: <3D35B6B4.1333B46C@mindspring.com> References: <20020716235216.B6785@iguana.icir.org> <3D351B99.311431F@mindspring.com> <20020717004244.B7218@iguana.icir.org> <3D36072C.3080908@isi.edu> <20020717015748.B7719@iguana.icir.org> <3D36312D.1010606@isi.edu>
next in thread | previous in thread | raw e-mail | index | archive | help
Lars Eggert wrote: > > i don't know much on the lottery scheduler, but it looks like it > > is probabilistic as opposed to deterministic. The paper on lottery > > scheduling claims to have the same O(log N) complexity as WF2Q+ > > (though i haven't looked at the implementation issues). > > Ah, so it's more like Waldspurger's later stride scheduler than his > lottery scheduler. Just a "head's up": The thing you are comparing to the stride scheduler is Luigi's first impression of the lottery scheduler, not his weighted scheduler. Luigi's comment was directed to the lottery scheduler you referenced, not to the weighted scheduler. His comparative perspective is based on his own work, not on the work you are referencing. Next time you ask someone to "compare A and B", you may want to be careful to make sure that they are telling you how A differs from B, rather than how B differs from A. ;^). -- Terry To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-arch" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?3D35B6B4.1333B46C>