Batch Processing Scheduling via Subscriber Usage Patterns
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Oversubscribed batch processing systems face challenges in meeting the computational capacity demands due to increasing user requests, leading to delayed task completion, particularly affecting active subscribers with frequent usage patterns.
Innovation Solution
Implementing a scheduling method that prioritizes batch processing based on subscriber usage patterns by utilizing multiple priority queues, including an overdue queue, a recently used queue, and a low priority queue, allowing active subscribers to receive timely processing while infrequent users are not negatively impacted.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If batch processing capacity is increased to handle all subscriber requests, then task completion time is improved, but system cost and complexity increase
Solution Approach 1:
The patent applies local quality by differentiating service levels for different subscribers based on their usage patterns. Active subscribers receive higher priority processing while inactive subscribers receive lower priority, allowing the system to optimize resource allocation locally for each subscriber group rather than treating all requests equally. This resolves the contradiction by providing timely completion for critical users without proportionally increasing overall system capacity.
Solution Approach 2:
The patent changes the parameter of processing priority dynamically based on subscriber activity status. By monitoring whether subscribers are active or inactive and adjusting their queue priority accordingly, the system can meet task completion requirements for active users without maintaining high capacity for all users at all times, thus avoiding unnecessary system complexity and cost.
2Reliability
If batch processing prioritizes active subscribers, then service quality for frequent users is improved, but inactive subscribers experience delayed processing
Solution Approach 1:
The patent segments the subscriber base into active and inactive groups based on usage patterns, and creates separate priority queues for each segment. This segmentation allows the system to provide reliable service guarantees to active subscribers by processing their requests first, while accepting that inactive subscribers will experience delays. The segmentation resolves the contradiction by making the trade-off explicit and manageable through separate processing channels.
Solution Approach 2:
The system automatically monitors subscriber activity status and dynamically adjusts processing priority without manual intervention. By self-monitoring usage patterns and self-adjusting queue priorities, the system can respond to changing conditions in real-time, ensuring active subscribers receive timely service while minimizing delays for inactive subscribers through automated resource reallocation.
3Productivity
If multiple priority queues are implemented, then batch processing efficiency is improved, but system complexity increases
Solution Approach 1:
The patent implements multiple priority queues segmented by subscriber activity status (active vs. inactive). This segmentation improves batch processing efficiency by ensuring that requests from active subscribers are processed first, preventing their tasks from being delayed by inactive users' requests. The segmented queue structure provides a simple yet effective mechanism to achieve productivity gains without requiring complex scheduling algorithms.
Data Source
AI summary
Some embodiments include a method of scheduling batch processing of a batch processing system based on subscriber usage patterns. The method includes steps of recording a last job commencement event for a subscriber when the batch processing system starts processing a batch process for the subscriber; recording a last usage event for the subscriber when the subscriber uses the batch processing system; in an event that a time period elapsed since the last usage event for the subscriber is less than a time period elapsed since the last job commencement event for the subscriber, placing a next batch process of the subscriber into a recently used queue; identifying the next batch process of the subscriber as the oldest batch process from the recently used queue; and start processing the identified batch process for the subscriber.