Triggered queue transformation
AssigneeLive Nation Entertainment, Inc.
InventorsDebbie Hsu, Gary Yu, Jonathan Philpott, Suzanne Lai, Hong Zhou
Life of this patent
Estimating the term…
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.
Claims20
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:
- 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;
- performing an initial processing of each request communication of the plurality of request communications to:
- identify plurality of task factors, each task factor of the plurality of task factors including one or more constraints corresponding to the request communication, and
- determine that the request communication corresponds to a request for access to a resource;
- identifying a first queue associated with the resource;
- generating, for each request communication of the plurality of request communications, a first queue task corresponding to the request communication, the first queue task representing the plurality of task factors;
- storing, for each request communication of the plurality of request communications, the first queue task in the first queue, each first queue task stored in the first queue being targeted for processing according to a first resource structure associated with the resource;
- detecting whether the first resource structure has changed, the detection of the change of the first resource structure being based on one or more factors associated with the first queue, and changing the first resource structure corresponding to generating a second resource structure associated with the resource;
- accessing a constraint hierarchy for processing each first queue task, the constraint hierarchy representing priorities of task factors within each first queue task;
- for each first queue task, transforming the first queue task into a second queue task, the transformation being based at least in part on the constraint hierarchy;
- storing each second queue task in a second queue, each second queue task stored in the second queue being targeted for processing according to the second resource structure associated with the resource;
- and
- sequentially processing each second queue task stored in the second queue according to the second resource structure.
A computer-implemented method for processing multiple queue tasks based upon task factors and resource structures, the 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;
- performing an initial processing of each request communication of the plurality of request communications to:
- identify plurality of task factors, each task factor of the plurality of task factors including one or more constraints corresponding to the request communication, and
- determine that the request communication corresponds to a request for access to a resource;
- identifying a first queue associated with the resource;
- generating, for each request communication of the plurality of request communications, a first queue task corresponding to the request communication, the first queue task representing the plurality of task factors;
- storing, for each request communication of the plurality of request communications, the first queue task in the first queue, each first queue task stored in the first queue being targeted for processing according to a first resource structure associated with the resource;
- detecting whether the first resource structure has changed, the detection of the change of the first resource structure being based on one or more factors associated with the first queue, and changing the first resource structure corresponding to generating a second resource structure associated with the resource;
- accessing a constraint hierarchy for processing each first queue task, the constraint hierarchy representing priorities of task factors within each first queue task;
- for each first queue task, transforming the first queue task into a second queue task, the transformation being based at least in part on the constraint hierarchy;
- storing each second queue task in a second queue, each second queue task stored in the second queue being targeted for processing according to the second resource structure associated with the resource;
- and
- sequentially processing each second queue task stored in the second queue according to the second resource structure.
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 a plurality of request communications, each request communication of the plurality of request communications being received from a device of a plurality of devices;
- performing an initial processing of each request communication of the plurality of request communications to:
- identify plurality of task factors, each task factor of the plurality of task factors including one or more constraints corresponding to the request communication, and
- determine that the request communication corresponds to a request for access to a resource;
- identifying a first queue associated with the resource;
- generating, for each request communication of the plurality of request communications, a first queue task corresponding to the request communication, the first queue task representing the plurality of task factors;
- storing, for each request communication of the plurality of request communications, the first queue task in the first queue, each first queue task stored in the first queue being targeted for processing according to a first resource structure associated with the resource;
- detecting whether the first resource structure has changed, the detection of the change of the first resource structure being based on one or more factors associated with the first queue, and changing the first resource structure corresponding to generating a second resource structure associated with the resource;
- accessing a constraint hierarchy for processing each first queue task, the constraint hierarchy representing priorities of task factors within each first queue task;
- for each first queue task, transforming the first queue task into a second queue task, the transformation being based at least in part on the constraint hierarchy;
- storing each second queue task in a second queue, each second queue task stored in the second queue being targeted for processing according to the second resource structure associated with the resource;
- and
- sequentially processing each second queue task stored in the second queue according to the second resource structure.
Dependencies are inferred from the claim text.