Real-Time Scheduling/Dispatching

The problem is to schedule events, that is, procedure calls, at some time in the future
by storing information in some data structure. When the time arrives, the record is
removed from the structure and the procedure is called. A straight-forward implementation
is a sorted list, which has O(N) insertion time, but these papers show how to do much
better.