# US 2025/0086017 A1 · Prioritized polling mechanism for efficiently managing distributed queues in content creation pipelines

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0086017 A1
- Document ID: US20250086017A1
- Status: Published application
- Kind: A1
- Application number: 18/467,193
- Filed: 2023-09-14
- Published: 2025-03-13
- Earliest claimed: 2023-09-12
- Assignees: Netflix, Inc.
- Applicants: Netflix, Inc.
- Inventors: Alexander SCHWORER; Gina Shinzu GRANGER; Murthy PARTHASARATHI; Rajnish PRASAD; Jose THOMAS
- Web page: https://patentgrep.com/patent/US20250086017A1

## CPC

- G06F 9/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)}
- G06F 9/5077: {Logical partitioning of resources; Management or configuration of virtualized resources (specific details on emulation or internal functioning of virtual machines G06F9/455)}
- G06F 8/63: {Image based installation; Cloning; Build to order}
- G06F 8/71: Version control (security arrangements therefor G06F21/57); Configuration management
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In various embodiments a computer-implemented method for launching a task associated with a content production pipeline in a non-native computing environment is disclosed. The method includes publishing user code associated with a task included in a content creation pipeline. The method further includes packaging the user code separately for each of a plurality of computing environments, where each code package enables the user code to execute within a respective computing environment. Further, the method includes storing artifact locations associated with the user code for each of the plurality of computing environments in a task registry. Responsive to the task being selected for execution, the method includes determining, based on a set of rules, a computing environment from the plurality of computing environments in which to execute the task. Additionally, the method includes launching the computing environment in accordance with the rules and executing the task in the computing environment.

## Claims

### Claim 1

A computer-implemented method, comprising:
populating a distributed queue with a plurality of job instances, wherein each job instance is tagged with a job type, a constraint type and an associated constraint value, and wherein the constraint type can be associated with one or more rules;
mapping each constraint type and associated constraint value to a unique correlation identifier value, wherein the unique correlation identifier value represents an aggregate priority of a corresponding job instance;
responsive to a call invocation to the distributed queue to return job instances associated with a particular job type and a particular constraint type in priority order, performing a filtering operation to dequeue job instances with the particular job type identified in the call invocation and a correlation identifier corresponding to the particular constraint type identified in the call invocation;
sorting the dequeued job instances based on rules associated with the particular constraint type; and
emitting the dequeued job instances in a sorted order of priority in accordance with the call invocation.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the plurality of job instances in the distributed queue are distributed over a plurality of computing environments.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein the plurality of computing environments comprises a cloud-computing environment, a data center, a private cloud, and a third-party computing environment.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein the plurality of job instances in the distributed queue are distributed over a plurality of computing environments, wherein the plurality of job instances is associated with a content production process, and wherein the distributed queue is managed centrally by a computing device in a central computing environment that is configured to execute the content production process.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein sorting the dequeued job instances comprises invoking dynamic comparator functions to perform the sorting.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein sorting the dequeued job instances further comprises performing the sorting based on additional constraint types and corresponding rules associated with the dequeued job instances.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein changing a priority of a job instance in the plurality of job instances in the distributed queue comprises changing a respective constraint type and corresponding constraint value tagged to the job instance.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the filtering operation is performed by a first application layer and sorting the dequeued job instances is performed by a second application layer.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the plurality of job instances in the distributed queue are distributed over a plurality of computing environments, wherein the distributed queue is managed centrally by a computing device in a central computing environment, and wherein the computing device in the central computing environment determines in which of the plurality of computing environments a job instance in the distributed queue executes.

### Claim 10

A non-transitory computer-readable storage medium including instructions that, when executed by a processor, cause the processor to perform the steps of:
populating a distributed queue with a plurality of job instances, wherein each job instance is tagged with a job type, a constraint type and an associated constraint value, and wherein the constraint type can be associated with one or more rules;
mapping each constraint type and associated constraint value to a unique correlation identifier value, wherein the unique correlation identifier value represents an aggregate priority of a corresponding job instance;
responsive to a call invocation to the distributed queue to return job instances associated with a particular job type and a particular constraint type in priority order, performing a filtering operation to dequeue job instances with the particular job type identified in the call invocation and a correlation identifier corresponding to the particular constraint type identified in the call invocation;
sorting the dequeued job instances based on rules associated with the particular constraint type; and
emitting the dequeued job instances in a sorted order of priority in accordance with the call invocation.

### Claim 11 (depends on 10)

The non-transitory computer readable media of claim 10, wherein the plurality of job instances in the distributed queue are distributed over a plurality of computing environments.

### Claim 12 (depends on 11)

The non-transitory computer readable media of claim 11, wherein the plurality of computing environments comprises a cloud-computing environment, a data center, a private cloud, and a third-party computing environment.

### Claim 13 (depends on 10)

The non-transitory computer readable media of claim 10, wherein the plurality of job instance in the distributed queue are distributed over a plurality of computing environment, wherein the plurality of job instances is associated with a content production process, and wherein the distributed queue is managed centrally by a computing device in a central computing environment that is configured to execute the content production process.

### Claim 14 (depends on 10)

The non-transitory computer readable media of claim 10, wherein sorting the dequeued job instances comprises invoking dynamic comparator functions to perform the sorting.

### Claim 15 (depends on 10)

The non-transitory computer readable media of claim 10, wherein sorting the dequeued job instances further comprises performing the sorting based on additional constraint types and corresponding rules associated with the dequeued job instances.

### Claim 16 (depends on 10)

The non-transitory computer readable media of claim 10, changing a priority of a job instance in the plurality of job instances in the distributed queue comprise changing a respective constraint type and corresponding constraint value tagged to the job instance.

### Claim 17

A system comprising:
a memory storing a content production process orchestrator application; and
a processor coupled to the memory, wherein when executed by the processor, the content production process orchestrator application causes the processor to:
populate a distributed queue with a plurality of job instances, wherein each job instance is tagged with a job type, a constraint type and an associated constraint value, and wherein the constraint type can be associated with one or more rules;
mapping each constraint type and associated constraint value to a unique correlation identifier value, wherein the unique correlation identifier value represents an aggregate priority of a corresponding job instance;
responsive to a call invocation to the distributed queue to return job instances associated with a particular job type and a particular constraint type in priority order, performing a filtering operation to dequeue job instances with the particular job type identified in the call invocation and a correlation identifier corresponding to the particular constraint type identified in the call invocation;
sorting the dequeued job instances based on rules associated with the particular constraint type; and
emitting the dequeued job instances in a sorted order of priority in accordance with the call invocation.

### Claim 18 (depends on 17)

The system of claim 17, wherein the plurality of job instances in the distributed queue are distributed over a plurality of computing environments.

### Claim 19 (depends on 17)

The system of claim 17, wherein the plurality of computing environments comprises a cloud-computing environment, a data center, a private cloud, and a third-party computing environment.

### Claim 20 (depends on 10)

The non-transitory computer readable media of claim 10, wherein the plurality of job instance in the distributed queue are distributed over a plurality of computing environment, wherein the plurality of job instances is associated with a content production process, and wherein the distributed queue is managed centrally by a computing device in a central computing environment that is configured to execute the content production process orchestrator application.
