Multicycle polling scheduling algorithms for FieldBus networks

DOI10.1023/A:1025167907933zbMath1075.68558OpenAlexW1506155454MaRDI QIDQ1431364

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

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

rate monotonic algorithmhard real-time schedulingearliest deadline first algorithmFieldBus communication networkspriority scheduling algorithm

Mathematics Subject Classification ID

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

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