Dynamic Resource Scheduling via Priority Level Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current resource scheduling methods, such as quantity-based and time-based allocation, fail to dynamically adjust resource allocation according to changing user requirements, leading to inefficiencies like idle resources and resource waste.
Innovation Solution
A resource scheduling method that considers the resource priority level (RPL) and quantity of required resources, allowing for dynamic re-allocation based on the total available resources and RPLs of all terminals in a scheduling domain, ensuring efficient allocation and minimizing waste.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If quantity-based resource allocation is used, then resource allocation is simple and static, but resource utilization is low and idle resources increase
Solution Approach 1:
The patent implements dynamic resource allocation by introducing a resource priority level (RPL) mechanism that allows resource quantities to be adjusted in real-time based on terminal needs and system status. The scheduler dynamically re-allocation resources according to RPL changes, transforming the static quantity-based allocation into a dynamic system that adapts to changing conditions, thereby improving resource utilization while maintaining manageable complexity.
Solution Approach 2:
The patent changes the allocation parameter from fixed quantity to flexible quantity based on RPL. By introducing RPL as a new parameter and allowing resource quantities to vary according to RPL levels and actual terminal needs, the system optimizes resource distribution without requiring complex structural changes, thus improving productivity while controlling device complexity.
2Ease of operation
If time-based resource allocation is used, then resource allocation boundaries are clear, but resource waste increases due to exclusive occupation
Solution Approach 1:
The patent combines the clear boundaries of time-based allocation with the flexibility of quantity-based allocation by implementing dynamic re-allocation within time slices. Resources are allocated based on RPL and actual needs rather than fixed time occupation, allowing terminals to release resources when not needed while maintaining clear scheduling boundaries. This dynamic approach reduces resource waste while preserving ease of management.
Solution Approach 2:
The patent ensures continuous useful action by allowing resources to be re-allocated to different terminals based on actual needs rather than remaining idle during allocated time slices. The scheduler continuously monitors and re-distributes resources according to RPL and current terminal requirements, eliminating periods of exclusive occupation without useful action and reducing overall resource waste.
3Device complexity
If static resource allocation is used, then allocation process is simple, but allocation proportion cannot be adjusted in real time to satisfy changing user requirements
Solution Approach 1:
The patent transforms static resource allocation into a dynamic system by introducing RPL and implementing real-time scheduling based on terminal requirements and system status. The scheduler dynamically adjusts resource allocation proportions according to RPL changes and actual needs, providing adaptability while maintaining a relatively simple scheduling process through standardized RPL-based decision rules.
Solution Approach 2:
The patent enables real-time adjustment of allocation proportions by changing the allocation parameter from fixed to variable based on RPL. The system monitors RPL and resource usage status, dynamically adjusting allocation proportions without requiring complex reconfiguration, thus achieving adaptability while controlling scheduling process complexity.
4Ease of operation
If resources are exclusively occupied within time slices, then resource allocation boundaries are defined, but more resources remain idle within some time slices
Solution Approach 1:
The patent implements dynamic resource sharing within time slices based on RPL and actual terminal needs. Instead of exclusive occupation, multiple terminals can share resources dynamically according to their RPL levels and current requirements. This dynamic sharing increases the quantity of actively used resources while maintaining clear scheduling control through the RPL-based allocation framework.
Solution Approach 2:
The patent enables resources to serve multiple terminals simultaneously based on RPL and needs, making resources universal rather than exclusive to a single terminal per time slice. The scheduler manages multiple allocations to different terminals according to their RPL levels, increasing resource utilization while maintaining ease of operation through standardized multi-terminal allocation rules.
Data Source
AI summary
A resource scheduling method is provided. The method includes receiving a resource application request sent by a first terminal, the resource application request including a quantity of required resources of the first terminal and a resource priority level (RPL) requested by the first terminal, and determining a quantity of initially configured resources of the first terminal according to the quantity of required resources. The method also includes performing resource scheduling and re-allocation according to a total quantity of available resources in a scheduling domain, quantities of initially configured resources of all terminals in the scheduling domain, and RPLs of all terminals in the scheduling domain, to obtain a quantity of re-configured resources of the first terminal, and allocating one or more resources to the first terminal according to the quantity of re-configured resources of the first terminal. The first terminal is a terminal in the scheduling domain.