Multiple Quota Trees for Cloud Resource Scheduling Granularity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing resource scheduling systems are limited by their ability to utilize only a single quota tree, which restricts the granularity of resource quota configuration and examination, leading to inadequate resource management in cloud computing environments.
Innovation Solution
Implementing systems, methods, and computer program products that facilitate the use of multiple quota trees in resource scheduling, allowing for the evaluation of job requests based on scope properties and mapping requests to applicable quota trees, thereby enabling finer-grained resource allocation and management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If a single quota tree is used in resource scheduling, then the system structure remains simple, but the resource quota configuration granularity is restricted and resource management becomes inadequate
Solution Approach 1:
The patent divides the single quota tree into multiple quota trees, each representing different resource hierarchies (e.g., user-level, project-level, resource-type level). This segmentation allows independent configuration and management of quotas at different granularities, resolving the contradiction by enabling fine-grained control while maintaining manageable complexity through modular structure
Solution Approach 2:
The patent introduces an additional dimension of hierarchy by implementing multi-level quota trees with scope properties (global, organizational, project, resource). This dimensional expansion allows the system to evaluate job requests against multiple hierarchical levels simultaneously, achieving fine-grained resource management without proportionally increasing system complexity
2Measurement precision
If multiple quota trees are implemented, then resource allocation precision improves, but system complexity increases
Solution Approach 1:
The patent pre-establishes multiple quota trees with defined scope properties and hierarchical relationships before resource scheduling occurs. Job requests are pre-mapped to relevant quota trees based on their attributes, so that during actual scheduling, the system only needs to evaluate against pre-identified relevant trees rather than all possible trees, maintaining precision while controlling complexity
Solution Approach 2:
The patent introduces scope properties as intermediaries that bridge job requests and appropriate quota trees. These scope properties (global, organizational, project, resource) act as classification keys that automatically route job requests to the relevant subset of quota trees, enabling precise admissibility evaluation without requiring the system to manually manage complexity of all quota trees
3Reliability
If multiple hierarchies are considered in admissibility evaluation, then resource management effectiveness improves, but processing time increases
Solution Approach 1:
The patent applies local quality by making scope properties specific to different hierarchical levels (global scope, organizational scope, project scope, resource scope). Each quota tree is configured with its own scope property, allowing the system to efficiently identify and evaluate only the relevant subset of trees for each job request based on its local characteristics, rather than uniformly evaluating all trees, thus improving effectiveness while reducing processing time
Data Source
AI summary
Systems, computer-implemented methods, and computer program products to facilitate using multiple quota trees in resource scheduling are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components comprise an evaluation component that executes admissibility of a job request based on a scope property of one or more quota trees that apply to the job request.