Improved formal worst-case timing analysis of weighted round robin scheduling for ethernet

Authors:
Daniel Thiele;Jonas Diemer;Philip Axer;Rolf Ernst;Jan Seyler
Affiliations:
Technische Universität Braunschweig, Germany;Technische Universität Braunschweig, Germany;Technische Universität Braunschweig, Germany;Technische Universität Braunschweig, Germany;Daimler AG, Germany
Venue:
Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
Year:
2013

Citing 14
Cited 0

An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Strict Priority versus Weighted Fair Queueing in Switched Ethernet Networks for Time Critical Applications

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
The Time-Triggered Ethernet (TTE) Design

ISORC '05 Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised

Real-Time Systems
Providing accurate event models for the analysis of heterogeneous multiprocessor systems

CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
A performance study of Ethernet audio video bridging (AVB) for industrial real-time communication

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Network calculus: a theory of deterministic queuing systems for the internet

Network calculus: a theory of deterministic queuing systems for the internet
Worst-case end-to-end delay analysis of an avionics AFDX network

Proceedings of the Conference on Design, Automation and Test in Europe
Worst-case traversal time modelling of Ethernet based in-car networks using real time calculus

NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Weighted round-robin cell multiplexing in a general-purpose ATM switch chip

IEEE Journal on Selected Areas in Communications
Worst-Case Backlog Evaluation of Avionics Switched Ethernet Networks with the Trajectory Approach

ECRTS '12 Proceedings of the 2012 24th Euromicro Conference on Real-Time Systems
Synthesis of communication schedules for TTEthernet-based mixed-criticality systems

Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Monitoring Arbitrary Activation Patterns in Real-Time Systems

RTSS '12 Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ethernet networks become increasingly popular in many distributed embedded applications. As an alternative to strict priority (SP) scheduling, weighted round robin (WRR) is supported by most commercially available Ethernet switches. In WRR scheduling the link capacity is distributed fairly among traffic streams according to preset weights on a per round basis. As WRR does not provide latency guarantees, formal timing verification is necessary in order to deploy WRR in real-time applications. In this paper, we present a formal method to analyze WRR scheduling in Ethernet networks. Compared to existing methods which overestimate by assuming unnecessarily high interference, our method will take actual load bounds into account, thus achieving tighter analysis results. Finally, we perform an evaluation of our approach against existing methods and also against SP scheduling.