Queuing tasks in a computer system
US-2016266930-A1 · Sep 15, 2016 · US
US12159166B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12159166-B2 |
| Application number | US-202318511676-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 16, 2023 |
| Priority date | May 6, 2016 |
| Publication date | Dec 3, 2024 |
| Grant date | Dec 3, 2024 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Methods and systems disclosed herein relate generally to evaluating resource loads to determine when to transform queues and to specific techniques for transforming at least part of queues so as to correspond to alternative resources.
Opening claim text (preview).
We claim: 1. A method for updating queue tasks stored in a queue based on a change in a resource structure for the queue, the method comprising: processing a first queue according to a first resource structure, wherein: the first queue includes a set of queue tasks, each of the set of queue tasks includes a respective subset of task factors of a set of task factors, the set of task factors corresponds to a plurality of constraints included in requests for a resource, and first access rights to the resource are identified for each of the set of queue tasks, based on the respective subset of task factors, according to the first resource structure; detecting a change from the first resource structure of the first queue to a second resource structure; determining a status of each of the set of task factors based on the change in the first resource structure of the first queue; updating a subset of queue tasks of the set of queue tasks based on the status of a specific task factor of the set of task factors, wherein: the specific task factor is determined as a non-operational state, and the subset of queue tasks is updated to generate a set of modified queue tasks; and executing the set of modified queue tasks according to the second resource structure, wherein the set of modified queue tasks is executed according to the second resource structure to identify second access rights to the resource. 2. The method according to claim 1 , further comprising: generating a second queue based on the change from the first resource structure to the second resource structure; and adding the set of modified queue tasks in the second queue to execute the set of modified queue tasks according to the second resource structure. 3. The method according to claim 1 , further comprising: changing a range of the specific task factor based on the status of the specific task factor, wherein: the range of the specific task factor is changed to generate a modified task factor, and the range of the specific task factor is changed such that the status of the modified task factor becomes an operational state; determining one of an expansion or a non-expansion of other task factors of the set of task factors based on the change in the range of the specific task factor; and executing the set of modified queue tasks based on the change in the range of the specific task factor and the expansion or the non-expansion of the other task factors. 4. The method according to claim 1 , wherein the status of the specific task factor as the non-operational state indicates: availability of a number of the first access rights to the resource identified based on the specific task factor is lesser than a threshold, or the first access rights to the resource are not available based on the specific task factor. 5. The method according to claim 1 , further comprising: retrieving a protocol to determine a constraint hierarchy based on the set of task factors of each of the subset of queue tasks, wherein the constraint hierarchy indicates a priority for a change of a first constraint of the plurality of constraints with respect to a change of a second constraint of the plurality of constraints; and updating the subset of queue tasks based on the constraint hierarchy. 6. The method according to claim 1 , wherein the plurality of constraints includes a performing entity associated with the resource, a location of the resource, a date of the resource, a time of the resource, a number of the first access rights to the resource, and an access location of the resource. 7. The method according to claim 1 , further comprising: transmitting interface data to a plurality of user devices, wherein: each of the plurality of user devices is associated with a respective user of a plurality of users, the subset of queue tasks is generated in response to requests for the first access rights to the resource received by the plurality of user devices, each of the plurality of user devices is enabled to present an interface based on the interface data, and the interface includes multiple options to change a queue task of the subset of queue tasks; selecting an option from the multiple options to change the queue task based on a user input from a corresponding user of the plurality of users; and updating the queue task based on the option. 8. The method according to claim 1 , further comprising detecting the change from the first resource structure of the first queue to the second resource structure based on a length of the queue exceeds a threshold. 9. The method according to claim 1 , further comprising deactivating the first resource structure based on the change from the first resource structure to the second resource structure, wherein the first resource structure is deactivated to stop accepting requests for the first access rights to the resource according to the first resource structure. 10. A system for updating queue tasks stored in a queue based on a change in a resource structure for the queue, the system comprising: at least one processor configured to: process a first queue according to a first resource structure, wherein: the first queue includes a set of queue tasks, each of the set of queue tasks includes a respective subset of task factors of a set of task factors, the set of task factors corresponds to a plurality of constraints included in requests for a resource, and first access rights to the resource are identified for each of the set of queue tasks, based on the respective subset of task factors, according to the first resource structure; detect a change from the first resource structure of the first queue to a second resource structure; determine a status of each of the set of task factors based on the change in the first resource structure of the first queue; update a subset of queue tasks of the set of queue tasks based on the status of a specific task factor of the set of task factors, wherein: the specific task factor is determined as a non-operational state, and the subset of queue tasks is updated to generate a set of modified queue tasks; and execute the set of modified queue tasks according to the second resource structure, wherein the set of modified queue tasks is executed according to the second resource structure to identify second access rights to the resource. 11. The system according to claim 10 , wherein the at least one processor is further configured to: generate a second queue based on the change from the first resource structure to the second resource structure; and add the set of modified queue tasks in the second queue to execute the set of modified queue tasks according to the second resource structure. 12. The system according to claim 10 , wherein the at least one processor is further configured to: change a range of the specific task factor based on the status of the specific task factor, wherein: the range of the specific task factor is changed to generate a modified task factor, and the range of the specific task factor is changed such that the status of the modified task factor becomes an operational state; determine one of an expansion or a non-expansion of other task factors of the set of task factors based on the change in the range of the specific task factor; and execute the set of modified queue tasks based on the change in the range of the specific task factor and the expansion or the non-expansion of the other task factors. 13. The system according to claim 10 , wherein the status of the specific task factor as the non-operational state indicates: availability of a number of the first access rig
Allocation of resources, e.g. of the central processing unit [CPU] · CPC title
Constraint · CPC title
Resource constraint · CPC title
Specific access rights for resources, e.g. using capability register · CPC title
Energy efficient computing, e.g. low power processors, power management or thermal management · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.