Processor bounding for an efficient non-preemptive task scheduling algorithm

DOI10.1007/S11786-019-00395-7MaRDI QIDQ2009223zbMATH OpenOpenAlexWikidataFDO

Authors Vlad Rădulescu, Ştefan Andrei, Albert M. K. 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

lower and upper bounds of processors' numbermultiprocessor schedulingnon-preemptive scheduling

Mathematics Subject Classification ID

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

Recommendations

• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
• Polynomial time schedulability test for periodic non-preemptive 2-task system
• The study of design optimization about single-processor scheduling algorithms in real-time system

Cites work

• An approximation algorithm for scheduling on three dedicated machines
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• FPSL, FPCL and FPZL schedulability analysis
• scientific article; zbMATH DE number 3873052 (Why is no real title available?)
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• 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
• Schedulability issues for EDZL scheduling on real-time multiprocessor systems
• Scheduling independent multiprocessor tasks
• Scheduling multiprocessor tasks on three dedicated processors
• The non-preemptive scheduling of periodic tasks upon multiprocessors

Cited in

(10)

• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
• Utilization based schedulability bounds for age constraint process sets in real-time systems
• Polynomial time schedulability test for periodic non-preemptive 2-task system
• The limited-preemptive feasibility of real-time tasks on uniprocessors
• On the pitfalls of resource augmentation factors and utilization bounds in real-time scheduling
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• scientific article; zbMATH DE number 1497769 (Why is no real title available?)
• Testing task schedulers on Linux system
• The study of design optimization about single-processor scheduling algorithms in real-time system
• A non-preemptive scheduling algorithm for soft real-time systems

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

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