Task Registry and Queue System for Parallel Execution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computing systems face inefficiencies in task execution, leading to delayed or missed task performance due to sequential execution methods.
Innovation Solution
A system comprising a user device and a computing device with a processor and memory, which receives and manages dependent computing tasks, determines execution nodes, and transmits tasks to these nodes based on event or time triggers, ensuring efficient execution by utilizing task queues and registries.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If sequential execution of tasks is used, then system simplicity is maintained, but task execution efficiency deteriorates and tasks may be delayed or missed
Solution Approach 1:
The patent segments the task execution system into multiple independent nodes that can execute tasks simultaneously. Each node maintains its own task queue and can independently process tasks, transforming the sequential execution model into a parallel distributed execution model. This segmentation enables multiple tasks to be executed concurrently across different nodes, significantly improving task execution efficiency while maintaining relative simplicity at each individual node level.
Solution Approach 2:
The patent introduces a new dimension of parallelism by distributing tasks across multiple spatial nodes rather than executing them sequentially in a single thread of execution. By adding this spatial dimension to the task execution model, the system can process multiple tasks simultaneously across different nodes, transforming the temporal sequential execution into a spatially distributed parallel execution model.
2Reliability
If task dependencies are tracked manually, then system complexity is reduced, but task execution accuracy deteriorates and dependent tasks may not be executed correctly
Solution Approach 1:
The patent implements a feedback mechanism where each node monitors the execution status of tasks and automatically updates the task registry. When a task completes execution, the node sends a status update back to the central registry, which then automatically triggers the execution of dependent tasks whose prerequisites have been satisfied. This automated feedback loop ensures accurate tracking of task dependencies without requiring manual intervention, significantly improving task execution accuracy.
Solution Approach 2:
The system enables self-service automation where the task registry automatically manages task dependency tracking and triggers execution of dependent tasks based on completion status. Each node independently reports its execution status, and the registry autonomously determines which dependent tasks should be executed next, eliminating the need for manual dependency management while ensuring accurate task execution sequencing.
3Loss of time
If tasks are executed without automated triggering, then system complexity is minimized, but task execution timeliness deteriorates and tasks may not be executed at the correct time
Solution Approach 1:
The patent implements preliminary action by pre-configuring task dependencies and execution triggers in the task registry before task execution begins. The system预先 establishes which tasks depend on which other tasks, so when a prerequisite task completes, the dependent task is automatically triggered without delay. This preliminary setup of execution rules ensures that tasks are executed at the correct time based on their dependency relationships, eliminating timing delays while maintaining systematic organization.
Data Source
AI summary
A method, apparatus, computer-readable medium, and/or system may comprise a user device configured to receive, from a user, a selection of a plurality of dependent computing tasks for a first computing task. The user device may transmit, to a computing device, the selection of the plurality of dependent computing tasks for the first computing task. The system may comprise a computing device comprising a processor and memory storing computer-executable instructions that, when executed by the processor, cause the computing device to receive, from the user device, the selection of the plurality of dependent computing tasks for the first computing task. The computing device may store, at a task registry and in association with the first computing task, an indication of the plurality of dependent computing tasks. The computing device may cause transmission of the first computing task from the task registry to a task queue. In some aspects, a dependent task queue may comprise the plurality of dependent computing tasks. The computing device may determine whether the plurality of dependent computing tasks has been executed. If the plurality of dependent computing tasks has been executed, the computing device may determine one or more nodes for executing the first computing task and cause transmission of the first computing task from the task queue to the one or more nodes for executing the first computing task. The one or more nodes may be configured to execute the first computing task in response to receiving the first computing task from the task queue.