Triggered queue transformation

Patent metadata

Field	Value
Publication number	US-11599386-B2
Application number	US-202016901292-A
Country	US
Kind code	B2
Filing date	Jun 15, 2020
Priority date	May 6, 2016
Publication date	Mar 7, 2023
Grant date	Mar 7, 2023

Abstract

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.

First claim

What is claimed is:

1. A system comprising:
one or more processors; and
a non-transitory computer readable storage medium containing instructions which when executed on the one or more processors, cause the one or more processors to perform actions including:
receiving a plurality of request communications, each request communication of the plurality of request communications being received from a device of a plurality of devices;
identifying a first resource associated with each request communication of the plurality of request communications, the first resource being identified from amongst a plurality of resources;
identifying, for each resource of the plurality of resources, a first queue associated with the first resource;
storing, for each request communication, a task in a queue position of the first queue of the first resource associated with the request communication;
sequentially processing each task in at least part of the first queue in accordance with a schedule;
detecting, based on one or more characteristics of the sequentially processing, that a resource-provisioning condition is satisfied;
in response to the detection, provisioning a second queue associated with a second resource, wherein both the first resource and the second resource have common characteristics selected from a group consisting of performing entity and location; and
sequentially processing tasks, other than the tasks in the queue position of the first queue, using the second queue.

2. The system of claim 1 , wherein each of the task in the at least part of the first queue includes a first task corresponding to a first request communication of the plurality of request communications, and wherein the tasks, other than the tasks in the queue position of the first queue, includes a second task corresponding to a second request communication of the plurality of request communications.

3. The system of claim 1 , wherein:
each of at least two of the tasks, other than the tasks in the queue position of the first queue, correspond to a task in the first queue;
the schedule indicates that tasks in the queue are to be processed in an order corresponding to positions of the tasks in the first queue; and
the sequentially processing is performed such that a relative order of the at least two of the tasks, other than the tasks in the queue position of the first queue, as determined based on the positions of the corresponding tasks in the first queue is preserved.

4. The system of claim 2 , wherein:
the sequentially processed each of the task in the at least part of the first queue includes a first incomplete subset of tasks in the first queue;
the actions further include, in response to the detection, transforming each task in a second incomplete subset of the tasks in the first queue so as to change a task factor of one or more task factors corresponding to the task; and
the sequential processing tasks, other than the tasks in the queue position of the first queue, includes processing at least one of the transformed tasks using the second queue and a corresponding transformed task factor.

5. The system of claim 4 , wherein transforming a task in the second incomplete subset of the tasks includes changing a task factor including a constraint corresponding to a location or value of one or more access rights.

6. The system of claim 4 , wherein:
for each of the request communication of the plurality of request communications:
the one or more task factors includes a plurality of task factors;
identifying a priority for the plurality of task factors; and

the transformation of the task corresponding to each of the request communication is performed so as to change a first task factor corresponding to the task of higher priority more than a second task factor corresponding to the task of lower priority.

7. The system of claim 1 , wherein processing each task of the tasks in the at least part of the first queue includes:
querying a resource structure with a constraint associated with the task;
receiving, as a result of the query, an identification of one or more available access rights that match the constraint;
assigning the one or more access rights to the device associated with the task or corresponding agent; and
transmitting one or more access right codes associated with the one or more access rights to the device associated with the task.

8. A computer-implemented method comprising:
receiving a plurality of request communications, each request communication of the plurality of request communications being received from a device of a plurality of devices;
identifying a first resource associated with each request communication of the plurality of request communications, the first resource being identified from amongst a plurality of resources;
identifying, for each resource of the plurality of resources, a first queue associated with the first resource;
storing, for each request communication, a task in a queue position of the first queue of the resource associated with the request communication;
sequentially processing each task in at least part of the first queue in accordance with a schedule;
detecting, based on one or more characteristics of the sequentially processing, that a resource-provisioning condition is satisfied;
in response to the detection, provisioning a second queue associated with a second resource, wherein both the first resource and the second resource have common characteristics selected from a group consisting of performing entity and location; and
sequentially processing tasks, other than the tasks in the queue position of the first queue, using the second queue.

9. The computer-implemented method of claim 8 , wherein each of the task in the at least part of the first queue includes a first task corresponding to a first request communication of the plurality of request communications, and wherein the tasks, other than the tasks in the queue position of the first queue, includes a second task corresponding to a second request communication of the plurality of request communications.

10. The computer-implemented method of claim 8 , wherein:
each of at least two of the tasks, other than the tasks in the queue position of the first queue, correspond to a task in the first queue;
the schedule indicates that tasks in the first queue are to be processed in an order corresponding to positions of the tasks in the first queue; and
the sequentially processing is performed such that a relative order of the at least two of the other tasks as determined based on the positions of the corresponding tasks in the first queue is preserved.

11. The computer-implemented method of claim 9 , wherein:
the sequentially processed each of the task in the at least part of the first queue includes a first incomplete subset of tasks in the first queue;
in response to the detection, transforming each task in a second incomplete subset of the tasks in the first queue so as to change a task factor of one or more task factors corresponding to the task; and
the sequential processing tasks, other than the tasks in the queue position of the first queue, includes processing at least one of the transformed tasks using the second queue and a corresponding transformed task factor.

12. The computer-implemented method of claim 11 , wherein transforming a task in the second incomplete subset of the tasks includes changing a task factor including a constraint corresponding to a location or value of one or more access rights.

13. The computer-implemented method of claim 11 , wherein:
for each of the request communication of the plurality of request communicati

Assignees

• Live Nation Entertainment Inc

Inventors

• Hsu Debbie
• Yu Gary
• Philpott Jonathan
• Lai Suzanne
• Zhou Hong

Classifications

• G06F9/5038

  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

• G06F9/50 Primary

  Allocation of resources, e.g. of the central processing unit [CPU] · CPC title

• Y02D10/00

  Energy efficient computing, e.g. low power processors, power management or thermal management · CPC title

• G06F2209/506

  Constraint · CPC title

• G06F9/4881 Primary

  Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title