Dynamic Slot Allocation for Fair Computing Resource Distribution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing resource allocation mechanisms in computing systems are inefficient, leading to unequal distribution of resources among users, where some users may dominate resources, causing under-served users to experience delays or insufficient processing capacity.
Innovation Solution
A computing system with dynamic resource allocation that categorizes users as under-served or adequately served based on requested and expected slots, allocating available and idle slots accordingly, and re-allocating slots from adequately served users to under-served users to ensure fair resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If round-robin mechanism is used to process requests from different users, then all users can access the system, but some users will consume more resource capacity than others and even dominate resources
Solution Approach 1:
The patent implements dynamic resource allocation by transitioning from static round-robin scheduling to a system that continuously monitors user consumption patterns and adjusts slot allocations in real-time. The resource allocation mechanism dynamically categorizes users as under-served or adequately-served based on current resource usage, and reallocates slots accordingly to prevent resource domination while ensuring fair access for all users.
Solution Approach 2:
The patent changes the parameter of resource allocation from equal-time round-robin scheduling to differential slot allocation based on user category. By introducing categories (under-served vs. adequately-served) and adjusting the number of slots allocated to each user based on their category and historical consumption patterns, the system transforms the resource distribution parameter to achieve fairness while preventing domination.
2Quantity of substance
If resources are allocated equally to all users, then fairness is maintained, but under-served users experience delays and insufficient processing capacity
Solution Approach 1:
The patent implements feedback mechanisms by continuously monitoring user resource consumption patterns and categorizing users based on their service level. The system tracks whether users are under-served or adequately-served, and uses this feedback to adjust slot allocations dynamically. This feedback loop ensures that under-served users receive additional resources when needed, reducing processing delays while maintaining overall system fairness.
Solution Approach 2:
The patent performs preliminary categorization of users into under-served and adequately-served groups based on their resource consumption history and current needs. By pre-establishing these categories and allocating slots accordingly before processing requests, the system proactively prevents delays for under-served users rather than reacting to them after they occur.
3Productivity
If more slots are allocated to some users to prevent under-served status, then processing capacity improves for those users, but resource domination occurs
Solution Approach 1:
The patent uses dynamic allocation where the number of slots allocated to each user changes based on their current category status. Users transition between under-served and adequately-served categories as their resource consumption varies, and the system adjusts slot allocations accordingly. This dynamic approach ensures that no user can permanently dominate resources while still providing increased capacity to under-served users when needed.
Solution Approach 2:
The patent implements feedback control by monitoring user resource consumption and adjusting slot allocations based on whether users are under-served or adequately-served. The system continuously evaluates resource distribution and modifies allocations to maintain balance, preventing any single user from dominating resources while ensuring adequate processing capacity for all users based on their actual needs.
Data Source
AI summary
An example method according to the disclosure can comprise receiving a requested number of slots from a user at a computing system. The computing system can be associated with a plurality of slots for processing one or more jobs. Each of the plurality of slots can be associated with a status (e.g., used, available, idle). A user can request a requested number of slots from the computing system. A quantity of slots can be allocated to the user based on the request, user category (e.g., under-served, adequately served), slot status and other factors. Only idle slots can be allocated to the adequately served user, whereas both available slots and idle slots can be allocated to the under-served user. One or more slots allocated to a user can be re-allocated to other users.