An efficient method to maintain resource availability information for scheduling applications

The author gives a mathematical description of resource availability. He defines a naive algorithm for computing availability, and then describes method to maintain availability information as new reservations/assignments are made. An approach for using for storing resource availability information is presented. It is shown that availability queries are then efficient and that updates can be done in time logarithmic in the size of the availability information. An algorithm is given for calculating the availability of sets of resources which is linear in the number of previously schedule operations. It is shown that this algorithm is optimal.<>