Scheduling messages with earliest deadline techniques

DOI10.1023/A:1008177218257MaRDI QIDQ5946209zbMATH OpenOpenAlexFDO

Authors Marco Di Natale, Antonio Meschi

Publication date 14 October 2001

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008177218257

zbMATH Keywords

local area networksscheduling

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Optimal scheduling with deadline constraints in tree networks
• Scheduling real-time traffic with deadlines over a wireless channel
• The earliest deadline first scheduling with active buffer management for real-time traffic in the internet
• Minimality of EDF networks with resource sharing
• scientific article; zbMATH DE number 1196650

Cited in

(3)

• 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters
• Scheduling of computational processes in real-time distributed systems with uncertain task execution times
• Using adaptive timeouts to achieve at-most-once message delivery

This page was built for publication: Scheduling messages with earliest deadline techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946209)