Database Workload Management Subsystem Priority Indicators
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Database systems face challenges in efficiently managing operational and management tasks due to increased size and complexity, particularly with concurrency limits and delay queue scheduling techniques that fail to consider resource sharing and service level goals effectively.
Innovation Solution
A workload management subsystem with a dynamic queuing mechanism that calculates priority indicators based on delay times and predefined priority levels to optimize request execution, allowing for more intelligent scheduling and resource sharing across different workload groups.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If requests are executed in first-come-first-served order in a delay queue, then simplicity of scheduling is maintained, but service level goals cannot be met and resource utilization is poor
Solution Approach 1:
The patent applies parameter changes by introducing a priority indicator parameter that combines delay time and predefined priority level. This parameter transformation enables the system to dynamically adjust request execution order based on multiple factors, resolving the contradiction between simple FIFO scheduling and service level goal achievement by quantifying and weighting different scheduling criteria.
Solution Approach 2:
The patent implements dynamics by making the queue scheduling mechanism adaptive rather than static. The priority indicator calculation dynamically updates based on current delay time and request characteristics, allowing the system to respond to changing conditions and optimize resource allocation in real-time, thus improving service level goal achievement while maintaining operational simplicity.
2Reliability
If concurrency limits are enforced strictly, then resource overload is prevented, but request throughput decreases and delay queue length increases
Solution Approach 1:
The patent uses parameter changes by introducing weighted priority indicators that allow flexible adjustment of request processing. By calculating priority based on delay time and predefined levels, the system can dynamically adjust which requests to process first, preventing resource overload while maintaining higher throughput through intelligent request selection rather than rigid concurrency limits.
Solution Approach 2:
The patent implements feedback mechanisms by continuously monitoring delay times and request characteristics to calculate priority indicators. This feedback loop allows the system to adapt to current workload conditions, adjusting request processing order to prevent resource overload while maximizing throughput by prioritizing requests that are waiting longest or have highest priority levels.
3Ease of operation
If all requests are treated equally in the delay queue, then fairness is maintained, but resource utilization is inefficient and service level goals are not met
Solution Approach 1:
The patent applies local quality by differentiating request treatment based on their specific characteristics rather than uniform treatment. By calculating individual priority indicators for each request based on its delay time and predefined priority level, the system provides differentiated scheduling that maintains fairness for similar requests while optimizing resource utilization by prioritizing requests that need faster processing.
Solution Approach 2:
The patent uses parameter changes to transform the scheduling approach from equal treatment to differentiated treatment based on quantified criteria. The priority indicator parameter combines delay time and priority level to create a comprehensive ranking metric, allowing the system to maintain fairness through transparent criteria while improving resource utilization by processing high-priority and long-waiting requests first.
Data Source
AI summary
Requests to be executed in the database system are received, where a plurality of the requests are provided in a queue for later execution. Priority indicators are calculated for assignment to corresponding ones of the plurality of requests in the queue, where the priority indicators are calculated based on delay times and predefined priority levels of the requests. The requests in the queue are executed in order according to the calculated priority indicators.