Processor bounding for an efficient non-preemptive task scheduling algorithm

DOI10.1007/s11786-019-00395-7zbMath1470.68036OpenAlexW2946163771WikidataQ127861872 ScholiaQ127861872MaRDI QIDQ2009223

Vlad Rădulescu, Ştefan Andrei, Albert Mo Kim Cheng

Publication date: 27 November 2019

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-019-00395-7

zbMATH Keywords

multiprocessor schedulingnon-preemptive schedulinglower and upper bounds of processors' number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Schedulability issues for EDZL scheduling on real-time multiprocessor systems
• Scheduling multiprocessor tasks on three dedicated processors
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• An approximation algorithm for scheduling on three dedicated machines
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• FPSL, FPCL and FPZL schedulability analysis
• Optimal scheduling for two-processor systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Priority inheritance protocols: an approach to real-time synchronization
• Scheduling independent multiprocessor tasks

This page was built for publication: Processor bounding for an efficient non-preemptive task scheduling algorithm