Event Queue Priority Management for Multi-tenant Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems that manage multiple users requesting attention from a limited resource struggle to efficiently handle scenarios where users simultaneously request more than the system can deliver, as they lack the ability to examine transaction details or systematically reorder transactions for improved performance.
Innovation Solution
The implementation of a method and system that allow for the creation and processing of events with associated properties, where events are prioritized based on properties such as time, event type, requestor identity, and object identity, enabling efficient handling and processing within a multi-tenant system.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If FIFO or FILO queue implementations are used to handle transactions in turn, then the system can manage multiple users demanding attention from a limited resource, but the system cannot examine transaction details to efficiently handle the queue or systematically reorder transactions to improve performance
Solution Approach 1:
The patent applies parameter changes by associating priority values with events based on their properties (such as event type, requestor identity, or object identity). This allows the queue to dynamically reorder events based on priority parameters rather than simple arrival order, improving system performance while maintaining manageable complexity through systematic priority-based sorting.
2Productivity
If events are processed in arrival order using simple queue implementations, then the queue management is straightforward, but the system cannot optimize resource utilization or ensure fairness among multiple users
Solution Approach 1:
The patent implements dynamics by making the queue processing order adaptive rather than static. Events are dynamically reordered based on their priority associations, which are determined by event properties. This allows the system to optimize resource utilization and ensure fairness among users while maintaining ease of operation through automated priority-based sorting rather than manual intervention.
3Productivity
If the system processes all events from a single requestor before moving to the next, then resource allocation can be optimized for each requestor, but other requestors may experience delays and fairness is compromised
Solution Approach 1:
The patent applies local quality by associating different priority levels with events from different requestors based on their specific properties. This allows the system to optimize processing for each requestor locally while maintaining overall fairness through the priority mechanism. Events are processed in priority order rather than strict requestor order, ensuring both efficiency and fairness.
Data Source
AI summary
Methods and systems for queuing events are described. In one aspect, a method is disclosed that receives or creates an event and inserts the event into a queue. The method determines at least one property of the event and associates a priority with the event based on the property. The method then processes the event in accordance with its priority.