Periodic message scheduling on a switched ethernet for hard real-time communication

Authors:
Myung Kyun Kim;Hee Chan Lee
Affiliations:
University of Ulsan, Ulsan, Korea;University of Ulsan, Ulsan, Korea
Venue:
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Year:
2006

Citing 6
Cited 1

Switched Real-Time Ethernet and Earliest Deadline First Scheduling - Protocols and Traffic Handling

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The FTT-Ethernet Protocol: Merging Flexibility,Timeliness and Efficiency

ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Achieving Real-Time Communication over Ethernet with Adaptive Traffic Smoothing

RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
EtheReal: A Host-Transparent Real-Time Fast Ethernet Switch

ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Low-Latency Hard Real-Time Communication over Switched Ethernet

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)

Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)

Real-Time Communications on an Integrated Fieldbus Network Based on a Switched Ethernet in Industrial Environment

ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes a message transmission model for hard real-time communications of periodic messages on a switched Ethernet and also proposes an algorithm to schedule the messages to be transmitted within their deadlines. The proposed scheduling algorithm is a distributed one and is performed by the source and the destination nodes without the modification of the operational features of the standard Ethernet switch. When a new periodic message needs to be transmitted, it is first checked whether it can be scheduled on both the transmission and the reception links without affecting the already-schedlued messages, and a feasible schedule is made for the new message if it is schedulable. The proposed scheduling algorithm guarantees the transmission of periodic messages within their deadline and allows flexible message transmission on a hard real-time switched Ethernet.