Attribute-Based Workload Queue Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing workload management systems face inefficiencies in selecting units of work to process due to the need to search through large amounts of queued data and unpredictable results from combining algorithms for 'best candidate' and duration-based selection criteria.
Innovation Solution
Implementing a system where units of work are queued based on attribute values, allowing a workload manager to cycle through multiple queues for different attribute types and values, ensuring balanced processing by adding records to each relevant queue and selecting units from any queue they are located in.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a single work queue is used with best candidate algorithm, then selection fairness is improved, but searching time through queued data increases
Solution Approach 1:
The patent divides a single large work queue into multiple smaller queues, each organized by specific attribute values (e.g., queue type, priority, resource requirements). This segmentation reduces the search space for the best candidate algorithm, as it only needs to search within relevant queues rather than through all queued data, thereby reducing searching time while maintaining fairness through systematic selection across queues.
Solution Approach 2:
The patent introduces an additional organizational dimension by creating queues based on attribute values rather than a single flat queue structure. Units of work are distributed across multiple queues based on their attributes, adding a dimensional organization that enables faster retrieval by the best candidate algorithm while preserving fairness through multi-queue selection.
2Adaptability or versatility
If multiple algorithms are combined for selection, then selection comprehensiveness is improved, but selection predictability worsens
Solution Approach 1:
The patent segments the selection process by organizing queues according to different attribute types (e.g., queue type, priority, resources). Each queue represents a specific attribute category, allowing the system to comprehensively consider multiple attributes while maintaining predictability through structured, attribute-based selection rather than unpredictable algorithmic combinations.
Solution Approach 2:
The patent changes the selection approach by using attribute-based queue organization instead of combining multiple selection algorithms. This parameter change transforms the selection mechanism from algorithmic complexity to structured organizational complexity, improving comprehensiveness through attribute coverage while enhancing predictability through consistent queue-based selection rules.
3Productivity
If queues are organized by attribute values, then workload balancing is improved, but queue management complexity increases
Solution Approach 1:
The patent segments the workload management system into multiple attribute-based queues, improving workload balancing by distributing units of work across queues with similar characteristics. The increased complexity is managed through systematic organization where each queue represents a specific attribute category, making the complexity structured and manageable rather than chaotic.
Solution Approach 2:
The patent creates a universal queue management framework where queues can be organized by multiple attribute types (queue type, priority, resources, etc.). This multi-functional queue system handles diverse workload characteristics through a single standardized approach, improving workload balancing while keeping management complexity manageable through consistent rules applied across all attribute categories.
Data Source
AI summary
Provided are a computer program product, system, and method for using queues corresponding to attribute values associated with units of work to select the units of work to process. A plurality of queues for each of a plurality of attribute types of attributes are associated with the units of work to process, wherein there are queues for different possible attribute values for each of the attribute types. A unit of work to process is received. A determination is made for each of the attribute types at least one of the queues corresponding to at least one attribute value for the attribute type associated with the received unit of work. A record for the received unit of work is added to each of the determined queues.


