scholarly journals RT-EP: A Fixed-Priority Real Time Communication Protocol over Standard Ethernet

2005 ◽  
pp. 180-195 ◽  
Author(s):  
José María Martínez ◽  
Michael González Harbour
Keyword(s):  
Real Time ◽  
Communication Protocol ◽  
Fixed Priority

Harmonicity-Aware Task Partitioning for Fixed Priority Scheduling of Probabilistic Real-Time Tasks on Multi-Core Platforms

2017 ◽  
Vol 16 (4) ◽  
pp. 1-21 ◽  
Author(s):  
Tianyi Wang ◽  
Soamar Homsi ◽  
Linwei Niu ◽  
Shaolei Ren ◽  
Ou Bai ◽  
...  
Keyword(s):  
Real Time ◽  
Task Partitioning ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling

Application of the Real-Time EtherCAT Technology in Wind Power Control System

2012 ◽  
Vol 580 ◽  
pp. 155-159
Author(s):  
Xiang Ming Wang ◽  
Jin Chao Wang ◽  
Dong Hua Sun
Keyword(s):  
Control System ◽  
Real Time ◽  
Wind Power ◽  
High Speed ◽  
Communication Protocol ◽  
Data Communication ◽  
Data Acquisition System ◽  
Slave System ◽  
The Real ◽  
Wind Power System

In this paper, the real-time EtherCAT technology is introduced in detail, which including operating principle, communication protocol and the superiority performance of EtherCAT i.e. synchronicity, simultaneousness and high speed. To show how to design a slave system that considering the characteristics of application, the method of developing systems based no EtherCAT technology are proposed. Finally, a data acquisition system based on EtherCAT technology is designed. Application of EtherCAT technology can improve the real-time characteristics of data communication in wind power system.

scholarly journals Assigning Priorities for Fixed Priority Preemption Threshold Scheduling

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Saehwa Kim
Keyword(s):  
Real Time ◽  
Empirical Evaluation ◽  
Priority Assignment ◽  
Fixed Priority ◽  
Assignment Algorithm ◽  
Optimal Priority Assignment ◽  
A Performance

Preemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority orderings, we need an optimal priority assignment algorithm for PTS. This paper analyzes the inefficiency or nonoptimality of the previously proposed optimal priority assignment algorithms for PTS. We develop theorems for exhaustively but safely pruning infeasible priority orderings while assigning priorities to tasks for PTS. Based on the developed theorems, we correct the previously proposed optimal priority assignment algorithm for PTS. We also propose a performance improved optimal priority assignment algorithm for PTS proving its optimality. The empirical evaluation results clearly show the effectiveness of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document