Re: [MUD-Dev] Event Scheduling

[Hans-Henrik Staerfeldt <hhs#cbs,dtu.dk>]

On Mon, 7 Feb 2000, Phillip Lenhardt wrote:

> For those of you who have heavy-use event schedulers, what algorithms are
> you using? I have implemented my event scheduler in Python using a binary
> heap and it can schedule and run somewhere between 100 and 1000 events per
> second without falling more than a second behind on a p2 233 machine
> running openbsd. I was wondering if anyone was getting significantly
> better performance from their scheduler. Examples in Python would be more
> relevant to me, but anything would be appreciated.
> 
> And if anyone wants to see the code to my scheduler, it is available in
> the Moebius distribution availble at http://www.bofh.net.au/mud (which
> seems to be down at the moment, *sigh*).
> 

I once saw a lecture covering an eventqueue algorithm running O(log(log(n)))
for insertions and O(1) for deletions. My guess would be that it is the
implementation of the actual events that will take the time, even if you
use a O(log(n)) time event queue, or are my notions wrong?

Hans Henrik Stærfeldt   |    bombman#diku,dk    | work:  hhs#cbs,dtu.dk      |
address:                |___  +45 40383492    __|__       +45 45252425     __|
 Dybendalsvej 74 2. th, | Scientific programmer at Center for Biological     |
 2720 Vanløse, Danmark. |  Sequence Analysis, Technical University of Denmark|




_______________________________________________
MUD-Dev maillist  -  MUD-Dev#kanga,nu
http://www.kanga.nu/lists/listinfo/mud-dev