Multicycle polling scheduling algorithms for FieldBus networks

DOI10.1023/A:1025167907933MaRDI QIDQ1431364zbMATH OpenOpenAlexFDO

Authors S. Cavalieri, S. Monforte, A. Corsaro, G. Scapellato

Publication date 27 May 2004

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

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

zbMATH Keywords

earliest deadline first algorithmFieldBus communication networkshard real-time schedulingpriority scheduling algorithmrate monotonic algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Planning of time triggered communication schedules
• Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
• Verification of a fieldbus scheduling protocol using timed automata
• Optimization of polling systems with Bernoulli schedules
• Large-scale periodic scheduling in time-sensitive networks

Cited in

(1)

• Planning of time triggered communication schedules

This page was built for publication: Multicycle polling scheduling algorithms for FieldBus networks

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