Task partitioning and priority assignment for distributed hard real-time systems

DOI10.1016/j.jcss.2015.05.005zbMath1328.68029OpenAlexW775972854MaRDI QIDQ494054

Luís Miguel Pinho, Geoffrey Nelissen, Luis Lino Ferreira, Ricardo Garibay-Martínez

Publication date: 31 August 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2015.05.005

zbMATH Keywords

distributed systemsreal-timetask allocationholistic analysisintermediate deadlinesmulti-threaded parallel taskspriority assignment

Mathematics Subject Classification ID

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

Related Items (1)

End-to-end deadlines over dynamic topologies

Cites Work

• Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways
• Multi-core real-time scheduling for generalized parallel task models
• On the complexity of fixed-priority scheduling of periodic, real-time tasks

This page was built for publication: Task partitioning and priority assignment for distributed hard real-time systems