A system and method for scheduling resources utilizes a data structure
that supports quick sorting to find a highest priority eligibility key.
The data structure provides for guaranteed storage efficiency, supports
insertion and deletion, and assures that the worst-case operation to
maintain its properties after assertion is O(log N) where N is the number
of active keys.