Expandable Resource Reservations in Tree Hierarchies
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional resource reservation schemes in virtualized computing environments are inefficient, as they require pre-allocating resources for potential future demands, leading to static partitioning and inefficient use of resources, especially in complex tree hierarchies where rearrangements and admission control become challenging, and resources are reserved but not always utilized.
Innovation Solution
Implementing expandable resource reservations that allow consumers to start with a minimum guarantee and dynamically increase up to a maximum limit, allowing reservations to expand as needed, with a nested approach where child nodes seek to expand their reservations if their parents have sufficient resources, and recursively adjusting parent reservations if necessary.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional resource reservation schemes pre-allocate resources for potential future demands, then resource guarantees are maintained, but resource utilization efficiency deteriorates due to static partitioning and reserved but unused resources
Solution Approach 1:
The patent implements dynamic resource reservations that allow consumers to start with a minimum guarantee and expand up to a maximum limit as resources become available. This transforms the static reservation model into a dynamic one where reservation amounts adjust based on current system conditions and availability, resolving the contradiction between maintaining guarantees and improving utilization efficiency
Solution Approach 2:
The system changes the parameter of reservation amount from a fixed pre-allocated value to a variable range (minimum to maximum limit). This parameter change enables the system to maintain reliability through minimum guarantees while improving productivity by allowing expansion to maximum limits when resources are available, eliminating the waste of reserved but unused resources
2Ease of operation
If resources are pre-allocated in a tree hierarchy structure, then resource management control is established, but system flexibility deteriorates due to challenges in rearrangements and admission control
Solution Approach 1:
The patent introduces dynamic expandable reservations within the tree hierarchy that allow nodes to expand their reservations up to maximum limits as resources become available. This dynamic capability enables rearrangements and admissions without requiring rigid pre-allocation, thus maintaining operational control while significantly improving system flexibility
Solution Approach 2:
The patent implements a nested approach where child nodes can seek to expand their reservations if their parents have sufficient resources. This nested structure allows for hierarchical resource management control while enabling flexible expansion at multiple levels of the hierarchy, resolving the contradiction between control and adaptability
3Reliability
If minimum resource reservations are defined for consumers, then resource guarantees are provided, but resource efficiency deteriorates as resources are reserved but not always utilized
Solution Approach 1:
The patent transforms static minimum reservations into dynamic expandable reservations where consumers can utilize up to a maximum limit when resources are available. This eliminates the waste of reserved but unused resources while maintaining the reliability of minimum guarantees through the expandable mechanism
Solution Approach 2:
The system allows consumers to automatically expand their reservations up to maximum limits as resources become available without requiring manual intervention. This self-service mechanism ensures that reserved resources are actively utilized when available, eliminating waste while maintaining guarantees
Data Source
AI summary
Described herein are approaches to managing expandable resource reservations. In one approach, a method is described in which an attempt is made to change a resource reservation from a first amount to a second amount. The second amount is examined to determine whether it exceeds a reservation limit. The second amount is compared with available resources, and reserved.