Pipeline Node Scheduling for Queue Overflow Control in PLCs

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The data collection and analysis system in factory automation requires a high-performance pipeline computing apparatus that can efficiently execute pipeline processing while preventing reception queue overflow, allowing users to freely determine data collection targets and processing methods, and integrating with programmable logic controllers for data-driven control.

Innovation Solution

A pipeline computing apparatus with a computing unit composed of nodes connected via reception queues and a control unit including a node monitoring unit, queue monitoring unit, priority variable calculating unit, and time allocating unit, which calculates a priority variable based on node processing time and accumulated message amounts to dynamically allocate operating time to each node.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If pipeline processing is executed at high speed to handle enormous data, then productivity is improved, but reception queue overflow occurs

Engineering Contradiction:
Improvedata processing speedVSAvoidreception queue overflow prevention
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent implements dynamic priority adjustment for pipeline nodes based on real-time queue status. The control unit monitors reception queue depths and dynamically changes node execution priorities, allowing the system to adapt processing speed to current load conditions, thereby preventing overflow while maintaining high throughput when possible

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent establishes a feedback mechanism where the control unit continuously monitors the depth of reception queues and uses this information to adjust node priorities. This closed-loop control ensures that processing speed is automatically regulated based on queue status, preventing overflow while optimizing productivity

Inventive Principle:
Principle #23Feedback

2Productivity

If node processing time is reduced to increase throughput, then productivity is improved, but message processing accuracy may deteriorate

Engineering Contradiction:
Improvepipeline throughputVSAvoidmessage processing accuracy
Core Design Contradiction:
ProductivityVSManufacturing precision

Solution Approach 1:

The patent applies different processing priorities to different nodes based on their specific functions and current queue depths. Rather than uniformly reducing processing time across all nodes, the system selectively adjusts priorities locally at each node, maintaining accuracy where needed while optimizing throughput where possible

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The patent changes the priority parameter of nodes dynamically based on system state. By adjusting the priority parameter rather than fixed processing time, the system can optimize throughput without compromising processing accuracy, as priority adjustment allows flexible resource allocation without altering fundamental processing requirements

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS12093736B2Pipeline computing apparatus, programmable logic controller, and pipeline processing execution method
Publication Date: 2024.09.17 OMRON CORP
  • US12093736B2 patent drawing
  • US12093736B2 patent drawing
  • US12093736B2 patent drawing

AI summary

A pipeline computing apparatus (110) comprises: a computing unit (120) configured as a pipeline; a node monitoring unit (161) that obtains a node processing time; a queue monitoring unit (162) that obtains an accumulated message amount; a priority variable calculating unit (163) that, on the basis of the node processing time and the accumulated message amount in a reception queue in a stage previous to the node, calculates a priority variable of the node; and a time allocating unit (164) that allocates operating time to each of nodes in accordance with the priority variable.