[MUD-Dev] Event Scheduling

Miroslav Silovic silovic at zesoi.fer.hr
Tue Feb 8 18:13:06 New Zealand Daylight Time 2000

Hans-Henrik Staerfeldt <hhs at cbs.dtu.dk> writes:

> 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?

This sounds VERY interesting. Do you have any specific pointers?

How to eff the ineffable?

MUD-Dev maillist  -  MUD-Dev at kanga.nu

More information about the MUD-Dev mailing list