next up previous contents index
Next: 4.2.2 the heap scheduler Up: 4.2 Schedulers and Events Previous: 4.2 Schedulers and Events

4.2.1 The List Scheduler

The list scheduler (Scheduler/List../ns-2/ implements the scheduler using a simple linked-list structure. The list is kept in time-order (earliest to latest), so event insertion and deletion require scanning the list to find the appropriate entry. Choosing the next event for execution requires trimming the first entry off the head of the list. This implementation preserves event execution in a FIFO manner for simultaneous events.