Triggered queue transformation

Patent metadata

Field	Value
Publication number	US-10228971-B2
Application number	US-201815871735-A
Country	US
Kind code	B2
Filing date	Jan 15, 2018
Priority date	May 6, 2016
Publication date	Mar 12, 2019
Grant date	Mar 12, 2019

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 digital data processing system for processing multiple queue tasks based upon task factors and resource structures, the digital data processing system including:
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:
identifying a first queue associated with a resource, the first queue comprising a plurality of queue tasks, the plurality of queue tasks being associated with a set of queue priorities, the set of queue priorities indicating a processing schedule of one or more queue tasks;
sequentially processing, based on the set of queue priorities, a first set of queue tasks of the plurality of queue tasks, the sequential processing using a resource structure associated with the resource, the resource structure indicating one or more access rights associated with the resource at a first time;
detecting, based on data corresponding to the first queue, that a resource-provisioning condition is satisfied;
in response to the detection, provisioning a new resource structure;
adding to a second queue, a second set of queue tasks of the plurality of queue tasks, the second queue being associated with the resource; and
sequentially processing, based on the set of queue priorities, the second set of queue tasks, the sequential processing using the new resource structure, the new resource structure indicating one or more access rights associated with the resource at a second time.

2. The digital data processing 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 a device, a request communication;
identifying one or more task factors, each task factor of the one or more task factors including a constraint corresponding to the request communication; and
identifying, based on the one or more task factors, the resource.

3. The digital data processing system of claim 1 , wherein the queue tasks in the first set of queue tasks are associated with a first request communication, and the second set of queue tasks are associated with a second request communication.

4. The digital data processing system of claim 1 , wherein detecting, based on data corresponding to the queue, that a resource-provisioning condition is satisfied includes:
receiving, via the resource structure, an indication of a quantity of available access rights for a resource; and
comparing the quantity of available access rights for a resource to a resource threshold to determine the quantity of available access rights for a resource is below the resource threshold.

5. The digital data processing system of claim 1 , herein detecting, based on data corresponding to the first queue, that a resource-provisioning condition is satisfied includes:
receiving, via the resource structure, an indication of a quantity of assigned access rights for a resource; and
comparing a quantity of available access rights for a resource to a resource threshold to determine the quantity of assigned access rights for a resource is above the resource threshold.

6. The digital data processing system of claim 1 , wherein detecting, based on data corresponding to the first queue, that a resource-provisioning condition is satisfied includes:
identifying a quantity of queue tasks in the first queue; and
comparing the quantity of queue tasks in the first queue to a queue length threshold to determine the quantity of queue tasks in the first queue exceeds the queue length threshold.

7. The digital data processing system of claim 1 , wherein provisioning a new resource structure includes:
modifying the resource structure to inhibit the sequential processing of the plurality of queue tasks in the first queue.

8. A computer-implemented method for processing multiple queue tasks based upon task factors and resource structures, the method comprising:
identifying, at a digital data processing system, a first queue associated with a resource, the first queue comprising a plurality of queue tasks, the plurality of queue tasks being associated with a set of queue priorities, the set of queue priorities indicating a processing schedule of one or more queue tasks;
sequentially processing, at the digital data processing system, based on the set of queue priorities, a first set of queue tasks of the plurality of queue tasks, the sequential processing using a resource structure associated with the resource, the resource structure indicating one or more access rights associated with the resource at a first time;
detecting, at the digital data processing system, based on data corresponding to the first queue, that a resource-provisioning condition is satisfied;
in response to the detection, provisioning, a new resource structure;
adding, at the digital data processing system, to a second queue, a second set of queue tasks of the plurality of queue tasks, the second queue being associated with the resource; and
sequentially processing, at the digital data processing system, based on the set of queue priorities, the second set of queue tasks, the sequential processing using the new resource structure, the new resource structure indicating one or more access rights associated with the resource at a second time.

9. The computer-implemented method of claim 8 , further comprising:
receiving, from a device, a request communication;
identifying, at the digital data processing system, one or more task factors, each task factor of the one or more task factors including a constraint corresponding to the request communication; and
identifying, based on the one or more task factors, the resource.

10. The computer-implemented method of claim 8 , wherein the queue tasks in the first set of queue tasks are associated with a first request communication, and the second set of queue tasks are associated with a second request communication.

11. The computer-implemented method of claim 8 , wherein detecting, based on data corresponding to the first queue, that a resource-provisioning condition is satisfied includes:
receiving, via the resource structure, an indication of a quantity of available access rights for a resource; and
comparing, at the digital data processing system, the quantity of available access rights for a resource to a resource threshold to determine the quantity of available access rights for a resource is below the resource threshold.

12. The computer-implemented method of claim 8 , wherein detecting, based on data corresponding to the first queue, that a resource-provisioning condition is satisfied includes:
receiving, via the resource structure, an indication of a quantity of assigned access rights for a resource; and
comparing, at the digital data processing system, a quantity of available access rights for a resource to a resource threshold to determine the quantity of assigned access rights for a resource is above the resource threshold.

13. The computer-implemented method of claim 8 , wherein detecting, based on data corresponding to the first queue, that a resource-provisioning condition is satisfied includes:
identifying a quantity of queue tasks in the first queue; and
comparing, at the digital data processing system, the quantity of queue tasks in the first queue to a queue length threshold to determine the quantity of queue tasks in the first queue exceeds the queue length threshold.

14. The computer-implemented method of claim 8 , wherein provis

Assignees

• Live Nation Entertainment Inc

Inventors

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

Classifications

• G06F9/50 Primary

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

• G06F2209/506

  Constraint · CPC title

• G06F9/4881 Primary

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

• G06F9/468

  Specific access rights for resources, e.g. using capability register · CPC title

• G06F2209/485

  Resource constraint · CPC title