2020
DOI: 10.1007/s12083-020-00934-1
|View full text |Cite
|
Sign up to set email alerts
|

Performance analysis of edge-PLCs enabled industrial Internet of things

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
2
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 24 publications
0
7
0
Order By: Relevance
“…(4) Performance comparison between static allocation and dynamic allocation of memory resources Figure 10 compares the total memory space occupied by the actions selected by the dynamic memory resource allocation method and the space occupied by the optimal static allocation method calculated by the Markov chain method described in our previous work [7] at each time period for processing the same piece of data. Because static allocation uses an unchanged allocation method, the amount of memory used over time is constant.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…(4) Performance comparison between static allocation and dynamic allocation of memory resources Figure 10 compares the total memory space occupied by the actions selected by the dynamic memory resource allocation method and the space occupied by the optimal static allocation method calculated by the Markov chain method described in our previous work [7] at each time period for processing the same piece of data. Because static allocation uses an unchanged allocation method, the amount of memory used over time is constant.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
“…It is in continuous progress to adapt to the complexity and uncertainty of modern industrial development. Modern PLCs gradually transform into edge-PLCs as a result of combining traditional logic control with networking, data collection, and processing [6,7]. Most PLCs have work memory and load memory for storing user programs and data, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Fig. 10 compares the total memory space occupied by the actions selected by the dynamic memory resource allocation method and the space occupied by the optimal static allocation method calculated by the Markov chain method described in our previous work [6] at each time period for processing the same piece of data. Because the allocation method in static allocation is unchanged, so the memory space occupied in each period is the same.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
“…As shown in Fig. 11, the DMRA algorithm trains the Q table and makes a strategy for the data of that day is compared with the execution of the Markov chain method [6], the execution time is reduced by about half. Because static allocation must compare all possible memory resource allocation methods, and then find the optimal solution, the program execution time is longer.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
See 1 more Smart Citation