Contention-free executions for real-time multiprocessor scheduling

Authors:
Jinkyu Lee;Arvind Easwaran;Insik Shin
Affiliations:
Sungkyunkwan University, South Korea;Nanyang Technological University, Singapore;KAIST, South Korea
Venue:
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Year:
2014

Citing 19
Cited 0

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Deadline-based scheduling of periodic task systems on multiprocessors

Information Processing Letters
Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors

IEEE Transactions on Computers
Improved Schedulability Analysis of EDF on Multiprocessor Platforms

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor*This work is supported in part by Brain Korea 21 project and in part by ICT.

IEICE - Transactions on Information and Systems
A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Accounting for cache-related preemption delay in dynamic priority schedulability analysis

Proceedings of the conference on Design, automation and test in Europe
Techniques for Multiprocessor Global Schedulability Analysis

RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms

RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
EDZL scheduling analysis

Real-Time Systems
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

IEEE Transactions on Parallel and Distributed Systems
Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors

ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling

RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Multi-core for mobile phones

Proceedings of the Conference on Design, Automation and Test in Europe
LLF Schedulability Analysis on Multiprocessor Platforms

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Maximizing Contention-Free Executions in Multiprocessor Scheduling

RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
FPZL Schedulability Analysis

RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

A time slot is defined as contention-free if the number of jobs with remaining executions in the slot is no larger than the number of processors, or contending, otherwise. Then an important property holds that in any contention-free slot, all jobs with remaining executions are guaranteed to be scheduled as long as the scheduler is work-conserving. This article aims at improving schedulability by utilizing the contention-free slots. To achieve this, this article presents a policy (called CF policy) that moves some job executions from contending slots to contention-free ones. This policy can be employed by any work-conserving, preemptive scheduling algorithm, and we show that any algorithm extended with this policy dominates the original algorithm in terms of schedulability. We also present improved schedulability tests for algorithms that employ this policy, based on the observation that interference from jobs is reduced when their executions are postponed to contention-free slots. Simulation results demonstrate that the CF policy, incorporated into existing algorithms, significantly improves schedulability of those existing algorithms.