US 12,761,953 B2Granted

Processing of queued tasks

AssigneePagerDuty, Inc.

InventorsBen Blair, Ravi Singh, Aly Simkins

Life of this patent

Estimating the term…

Loading patent…

Abstract

Techniques are described for a system comprising processing circuitry configured to create a linear index, wherein the linear index includes a plurality of positions, each position of the plurality of positions defined by at least a first tier and a second tier of a plurality of tiers; assign a plurality of tasks to the plurality of positions based on task hash values associated with the plurality of tasks; generate a random position on the linear index, wherein the random position includes a random hash value within a range of possible hash values associated with the plurality of tiers; select, based on the random position, a populated position of the plurality of positions, wherein the populated position is assigned one or more tasks of the plurality of tasks; obtain information for the one or more tasks based on the populated position; process, based on the information, the one or more tasks.

Claims20

Dependent claims

A method comprising:

creating, by a computing system, a linear index, wherein the linear index includes a plurality of positions, each position of the plurality of positions defined by at least a first tier and a second tier of a plurality of tiers;
assigning, by the computing system, a plurality of tasks to the plurality of positions based on task hash values associated with the plurality of tasks, wherein the task hash values are generated based on at least first tier values associated with the plurality of tasks and second tier values associated with the plurality of tasks;
generating, by the computing system, a random position on the linear index, wherein the random position includes a random hash value within a range of possible hash values associated with the plurality of tiers;
selecting, by the computing system and based on the random position, a populated position of the plurality of positions, wherein the populated position is assigned one or more tasks of the plurality of tasks;
obtaining, by the computing system, information for the one or more tasks based on the populated position;
and
processing, by the computing system and based on the information, the one or more tasks.

4 more elements

A system comprising one or more processors having access to a memory, the one or more processors configured to:

create a linear index, wherein the linear index includes a plurality of positions, each position of the plurality of positions defined by at least a first tier and a second tier of a plurality of tiers;
assign a plurality of tasks to the plurality of positions based on task hash values associated with the plurality of tasks, wherein the task hash values are generated based on at least first tier values associated with the plurality of tasks and second tier values associated with the plurality of tasks;
generate a random position on the linear index, wherein the random position includes a random hash value within a range of possible hash values associated with the plurality of tiers;
select, based on the random position, a populated position of the plurality of positions, wherein the populated position is assigned one or more tasks of the plurality of tasks;
obtain information for the one or more tasks based on the populated position;
and
process, based on the information, the one or more tasks.

4 more elements

A computer-readable storage medium encoded with instructions that, when executed, cause at least one processor of a computing system to:

create a linear index, wherein the linear index includes a plurality of positions, each position of the plurality of positions defined by at least a first tier and a second tier of a plurality of tiers;
assign a plurality of tasks to the plurality of positions based on task hash values associated with the plurality of tasks, wherein the task hash values are generated based on at least first tier values associated with the plurality of tasks and second tier values associated with the plurality of tasks;
generate a random position on the linear index, wherein the random position includes a random hash value within a range of possible hash values associated with the plurality of tiers;
select, based on the random position, a populated position of the plurality of positions, wherein the populated position is assigned one or more tasks of the plurality of tasks;
obtain information for the one or more tasks based on the populated position;
and
process, based on the information, the one or more tasks.

4 more elements

Dependencies are inferred from the claim text.