Resource scheduling methods using positive and negative caching, and resource manager implementing the methods

Abstract

Resource scheduling methods and a resource manager define leaf buckets, each of which have coordinates in corresponding dimensions in a coordinate space. Nodes having resource values in the corresponding dimensions are mapped on the leaf buckets. A task request identifies candidate nodes and requested resources that relate to the coordinate space dimensions. The leaf buckets are scanned to find a fittable node among the list of candidates. A result of the scan is stored in a positive or a negative cache entry. When a next task request of a same task group is received, scanning of the leaf buckets is performed using information from the positive or negative cache entry. For a positive cache entry, the scanning is initiated from a point where the previous scanning has ended. For a negative cache entry, the scanning ignores nodes that were found not to contain the requested resources in the previous scanning.