Scheduling Messages with Earliest Deadline Techniques

Authors:
Marco Di Natale;Antonio Meschi
Affiliations:
Università di Pisa, Dipartimento Ingegneria Dell'Informazione, via Diotisalvi 3, 56100 Pisa - Italy;Università di Pisa, Dipartimento Ingegneria Dell'Informazione, via Diotisalvi 3, 56100 Pisa - Italy
Venue:
Real-Time Systems
Year:
2001

Citing 11
Cited 2

Responsive, deterministic IEEE 802.5 token ring scheduling

Real-Time Systems
A Window Protocol for Transmission of Time-Constrained Messages

IEEE Transactions on Computers
Stack-based scheduling for realtime processes

Real-Time Systems
The timed-token protocol for real-time communications

Computer
Analysis of hard real-time communications

Real-Time Systems
Performance of real-time bus scheduling algorithms

SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Fixed Priority Scheduling with Limited Priority Levels

IEEE Transactions on Computers
Non-preemptive scheduling of messages on controller area network for real-time control applications

RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Dynamic real-time channel setup and tear-down in DQDB networks

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Earliest Deadline Message Scheduling with Limited Priority Inversion

WPDRTS '96 Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems

Scheduling of computational processes in real-time distributed systems with uncertain task execution times

Journal of Computer and Systems Sciences International
A comparison of compositional schedulability analysis techniques for hierarchical real-time systems

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Thispaper discusses the applicability of earliest deadline schedulingtechniques to local area networks. The focus is on controllerarea networks (the only standard that allows direct implementation)although a comparison is tried with other possible implementationson different network topologies (and contention resolution methods).Message scheduling follows the well-known EDF algorithm. Thepaper discusses the limitations and the problems in the implementationof the algorithm on standard controller area network protocols.Then, it presents a short study on the comparative effectivenessof other contention resolution methods modeled on the standardsToken-ring and Carrier Sense Multiple Access-Collision DetectionCSMA-CD (all implementing the earliest deadline scheduling policy.)Finally, the paper shows how to compute an optimal packet sizewith respect to the guaranteeability of the real-time properties,exploiting the trade-off between preemptability and efficiency.