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.

 
Web www.patentalert.com

< Movement of data in a distributed database system to a storage location closest to a center of activity for the data

> Counter updating system using an update mechanism and different counter utilization mechanism

~ 00496