The non-preemptive scheduling of periodic tasks upon multiprocessors

DOI10.1007/s11241-006-4961-9zbMath1103.68394MaRDI QIDQ853598

Sanjoy K. Baruah

Publication date: 17 November 2006

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

Full work available at URL: https://cdr.lib.unc.edu/downloads/th83m785z

zbMATH Keywords

multiprocessor systems; periodic tasks; non-preemptive scheduling; feasibility analysis; earliest-deadline first

Mathematics Subject Classification ID

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

68M14: Distributed systems

Related Items

Unnamed Item, Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems, Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints, Processor bounding for an efficient non-preemptive task scheduling algorithm, Polynomial time schedulability test for periodic non-preemptive 2-task system, Tardiness bounds under global EDF scheduling on a multiprocessor

Cites Work

• Unnamed Item
• Priority-driven scheduling of periodic task systems on multiprocessors
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• On non-preemptive scheduling of recurring tasks using inserted idle times
• Proportionate progress: A notion of fairness in resource allocation
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Pfair scheduling of generalized pinwheel task systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment