Dynamic Task Assignment for Distributed Processing Load Balancing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing distributed processing systems face challenges in appropriately assigning tasks to arithmetic processing resources due to increased processing loads, leading to potential priority order issues when tasks are executed.
Innovation Solution
A task control system that includes a load detection component, a determination component, and an assignment component to dynamically adjust the allocation of tasks based on detected processing loads and states, prioritizing tasks according to their impact on the system and adjusting resource allocation accordingly.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If tasks are assigned to arithmetic processing resources based on fixed priority orders, then system operation is simple, but task execution efficiency deteriorates when processing loads increase
Solution Approach 1:
The patent implements dynamic task assignment by continuously monitoring processing load indications and state information, then adjusting task priority orders and resource allocation accordingly. The assignment component changes the order of priority for task assignment based on detected states and load conditions, transforming a static system into one that adapts in real-time to maintain optimal execution efficiency.
Solution Approach 2:
The patent employs feedback mechanisms where the load detection component continuously monitors processing load indications and state information, feeds this information back to the assignment component, which then adjusts task assignment strategies. This closed-loop feedback system enables the system to respond to changing conditions and maintain high productivity without requiring complex manual intervention.
2Productivity
If task priority orders are changed frequently to optimize execution, then task execution efficiency improves, but system stability deteriorates
Solution Approach 1:
The feedback mechanism monitors both processing load indications and state information before triggering priority changes. By incorporating state information as an additional condition, the system ensures that priority orders are only changed when genuinely necessary, preventing unnecessary fluctuations and maintaining stability while still optimizing execution efficiency when conditions warrant changes.
Solution Approach 2:
The system changes parameters (task priority orders) based on detected conditions (processing load indications and state information). By tying parameter changes to specific detected conditions rather than continuous adjustment, the system maintains stability while still achieving optimal execution efficiency when needed.
3Productivity
If more arithmetic processing resources are allocated to high-priority tasks, then task execution efficiency improves, but resource utilization deteriorates
Solution Approach 1:
The patent dynamically adjusts resource allocation by changing the order of priority for task assignment based on detected processing load indications and state information. When processing loads increase, high-priority tasks receive more resources; when loads decrease, resources are released for other uses. This dynamic approach ensures resources are allocated efficiently only when needed, preventing waste and improving overall utilization while maintaining execution efficiency.
Data Source
AI summary
To provide a system capable of appropriately assigning, in consideration of a state concerning increase in an arithmetic processing load required for executing each of a plurality of tasks, each task to a plurality of arithmetic processing resources. An indication value is detected which represents a degree of an arithmetic processing load required for executing each of the plurality of tasks. Whether or not the indication value satisfies a predetermined condition is determined. States or occurring events in an area concerning execution of the plurality of tasks are detected. Each of the plurality of tasks is assigned to each of the plurality of servers S1 to Sn (arithmetic processing resources) in a different order of priority depending on a difference of the detected state on a requirement that the indication value satisfies the predetermined condition.