Triggered queue transformation
US-10228971-B2 · Mar 12, 2019 · US
US10684892B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10684892-B2 |
| Application number | US-201916298536-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 11, 2019 |
| Priority date | May 6, 2016 |
| Publication date | Jun 16, 2020 |
| Grant date | Jun 16, 2020 |
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).
What is claimed is: 1. A system comprising: one or more data processors; and a non-transitory computer readable storage medium containing instructions which when executed on the one or more data processors, cause the one or more data processors to perform actions including: receiving, from a remote system, a first indication of a plurality of resources; rendering, via a graphical user interface, a visual representation of the first indication; transmitting, to a remote system, a request communication indicating a request for a first resource of the plurality of resources, the request communication comprising a constraint, wherein the request communication is added to a queue task associated with the first resource; in response to a resource-provisioning condition being satisfied, receiving, from the remote system, a second indication indicating access rights associated with first resource are no longer available at a first time, wherein the first time corresponds with the constraint; and receiving a third indication indicating an assignment of an access right associated with the first resource at a second time, wherein the second time corresponds with the constraint. 2. The system of claim 1 , wherein the plurality of resources are a plurality of events. 3. The system of claim 1 , wherein the constraint comprises at least one of an upper price threshold or a lower price threshold. 4. The system of claim 1 , wherein the access right associated with the first resource at a second time comprises a ticket to an event occurring at the second time. 5. The system of claim 1 , wherein the instructions which when executed by the one or more data processors, further causes the one or more data processors to perform actions including: in response to the resource-provisioning condition being satisfied, receiving, from the remote system, an indication of a quantity of available access rights for the first resource at the second time. 6. The system of claim 1 , wherein the constraint comprises a range of times and the first time and second time are within the range of times. 7. The system of claim 1 , wherein the instructions which when executed by the one or more data processors, further causes the one or more data processors to perform actions including: receiving, from the remote system, the access right associated with the first resource at the second time, wherein the access right is a digital ticket. 8. A computer-implemented method comprising: receiving, from a remote system, a first indication of a plurality of resources; rendering, via a graphical user interface, a visual representation of the first indication; transmitting, to a remote system, a request communication indicating a request for a first resource of the plurality of resources, the request communication comprising a constraint wherein the request communication is added to a queue task associated with the first resource; in response to a resource-provisioning condition being satisfied, receiving, from the remote system, a second indication indicating access rights associated with first resource are no longer available at a first time, wherein the first time corresponds with the constraint; and receiving a third indication indicating an assignment of an access right associated with the first resource at a second time, wherein the second time corresponds with the constraint. 9. The computer-implemented method of claim 8 , wherein the plurality of resources are a plurality of events. 10. The computer-implemented method of claim 8 , wherein the constraint comprises at least one of an upper price threshold or a lower price threshold. 11. The computer-implemented method of claim 8 , wherein the access right associated with the first resource at a second time comprises a ticket to an event occurring at the second time. 12. The computer-implemented method of claim 8 , further comprising: in response to the resource-provisioning condition being satisfied, receiving, from the remote system, an indication of a quantity of available access rights for the first resource at the second time. 13. The computer-implemented method of claim 8 , wherein the constraint comprises a range of times and the first time and second time are within the range of times. 14. The computer-implemented method of claim 8 , further comprising: receiving, from the remote system, the access right associated with the first resource at the second time, wherein the access right is a digital ticket. 15. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause one or more data processors to perform actions including: receiving, from a remote system, a first indication of a plurality of resources; rendering, via a graphical user interface, a visual representation of the first indication; transmitting, to a remote system, a request communication indicating a request for a first resource of the plurality of resources, the request communication comprising a constraint, wherein the request communication is added to a queue task associated with the first resource; in response to a resource-provisioning condition being satisfied, receiving, from the remote system, a second indication indicating access rights associated with first resource are no longer available at a first time, wherein the first time corresponds with the constraint; and receiving a third indication indicating an assignment of an access right associated with the first resource at a second time, wherein the second time corresponds with the constraint. 16. The computer-program product of claim 15 , wherein the plurality of resources are a plurality of events. 17. The computer-program product of claim 15 , wherein the constraint comprises at least one of an upper price threshold or a lower price threshold. 18. The computer-program product of claim 15 , wherein the access right associated with the first resource at a second time comprises a ticket to an event occurring at the second time. 19. The computer-program product of claim 15 , wherein the instructions are configured to further cause one or more data processors to perform actions including: in response to the resource-provisioning condition being satisfied, receiving, from the remote system, an indication of a quantity of available access rights for the first resource at the second time. 20. The computer-program product of claim 15 , wherein the instructions are configured to further cause one or more data processors to perform actions including: receiving, from the remote system, the access right associated with the first resource at the second time, wherein the access right is a digital ticket.
Allocation of resources, e.g. of the central processing unit [CPU] · CPC title
Energy efficient computing, e.g. low power processors, power management or thermal management · CPC title
Multiprogramming arrangements · CPC title
Resource constraint · CPC title
considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration (scheduling strategies G06F9/4881 and subgroups) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.