Access Control Scheme for Fair Resource Sharing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current access control schemes for computing resources, such as memory, fail to ensure fair sharing among competing components, leading to situations where faster requesters overwhelm the system and cause slower requesters' requests to be repeatedly rejected.
Innovation Solution
Implementing an access control scheme that tracks requesters' progress and enforces a fair sharing policy by maintaining a queue with a 'request detected' and 'request serviced' bit for each requester, ensuring that all eligible requesters have an opportunity to access the resource, and using age-based criteria to manage request prioritization and retry mechanisms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If faster requesters continuously send requests without limitation, then request throughput increases, but fair sharing among requesters deteriorates and slower requesters' requests are repeatedly rejected
Solution Approach 1:
The system implements feedback by tracking the number of requests serviced for each requester and using this information to control future request acceptance. When a requester has been serviced a certain number of times, the system adjusts its behavior to ensure fair sharing, preventing any single requester from continuously overwhelming the resource while still allowing high throughput through coordinated request processing.
2Reliability
If access control scheme is implemented to ensure fair sharing, then request fairness improves, but system complexity increases due to tracking and management overhead
Solution Approach 1:
The system changes the parameter of request tracking by maintaining counters for the number of requests serviced for each requester. This parameter change enables fair sharing without complex control logic, as the system simply compares request counts and adjusts acceptance accordingly, reducing management overhead while ensuring fairness.
3Speed
If request queue size is limited to prevent rejection, then system responsiveness improves, but request loss increases when queue is full
Solution Approach 1:
The system ensures continuity of useful action by implementing a request servicing mechanism that continues to process requests from different requesters in a coordinated manner. Rather than simply blocking when the queue is full, the system uses the tracking mechanism to ensure that requests are serviced continuously and fairly, reducing both request loss and waiting time.
Data Source
AI summary
Systems and methods are provided to manage access to computing resources. More specifically, certain embodiments are described in which a resource or resource consumer can engage access controls or request that access controls be engaged if the age of a request exceeds one or more thresholds. For example, a requester may, after the age of a request meets or exceeds a threshold, indicate to a destination that a control should be engaged.