shadow/shadow — Issue #36: Min-heap for Event Queues
Author: robgjansen
Created: 2012-01-18 05:35:29+00:00
State: open
Labels: feature

Analysis of the GAsyncQueue reveals that its implemented with two GList structures. This means inserts are O(n). Results from gprof confirm: close to 90% of the time is spent managing the queue.

This is the single most important part of the simulator in terms of efficiency.

We should be using min-heap backed event priority queues for O(log(n)).