Scheduling self-suspending tasks: new and old results

DOI10.4230/LIPICS.ECRTS.2019.16MaRDI QIDQ5089119zbMATH OpenFDO

Authors

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ECRTS.2019.16

zbMATH Keywords

computational complexitymaster-slave problemself-suspensionspeedup factors

Mathematics Subject Classification ID

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

Recommendations

• Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks
• Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms
• A real-time configurable synchronization protocol for self-suspending process sets
• A new algorithm for scheduling periodic, real-time tasks

Cites work

• Measuring the performance of schedulability tests
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• On the pitfalls of resource augmentation factors and utilization bounds in real-time scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling master-slave multiprocessor systems
• Shop Problems With Two Machines and Time Lags
• Speed is as powerful as clairvoyance
• The master-slave paradigm in parallel computer and industrial settings

Cited in

(2)

• Enhancing self-scheduling algorithms via synchronization and weighting
• Scheduling with machine conflicts

This page was built for publication: Scheduling self-suspending tasks: new and old results

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