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

DOI10.1016/J.JCSS.2015.05.005MaRDI QIDQ494054zbMATH OpenOpenAlexFDO

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

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

real-timedistributed systemstask 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)

Recommendations

• Publication:3478251
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• scientific article; zbMATH DE number 495275
• Robust adaptive metrics for deadline assignment in distributed hard real-time systems
• Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems

Cites work

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

Cited in

(2)

• Robust adaptive metrics for deadline assignment in distributed hard real-time systems
• End-to-end deadlines over dynamic topologies

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

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