Predictability of least laxity first scheduling algorithm on multiprocessor real-time systems

Authors:
Sangchul Han;Minkyu Park
Affiliations:
School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea
Venue:
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Year:
2006

Citing 11
Cited 2

Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
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
Evaluation of a Hybrid Real-Time Bus Scheduling Mechanism for CAN

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
A Formal Approach to MpSoC Performance Verification

Computer
A Modified Least-Laxity-First Scheduling Algorithm for Real-Time Tasks

RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
Scheduling Analysis Integration for Heterogeneous Multiprocessor SoC

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors

IEEE Transactions on Computers
The future of multiprocessor systems-on-chips

Proceedings of the 41st annual Design Automation Conference
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
Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems

ISORC '06 Proceedings of the Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing

Predictability of Fixed-Job Priority schedulers on heterogeneous multiprocessor real-time systems

Information Processing Letters
Scheduling of hard real-time multi-phase multi-thread (MPMT) periodic tasks

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A priority-driven scheduling algorithm is said to be start time (finish time) predictable if the start time (finish time) of jobs in the schedule where each job executes for its actual execution time is bounded by the start times (finish times) of jobs in the schedules where each job executes for its maximum/minimum execution time. In this paper, we study the predictability of a job-level dynamic priority algorithm, LLF (Least Laxity First), on multiprocessor real-time systems. We present a necessary and sufficient condition for a priority-driven algorithm to be start time (finish time) predictable. Then, in LLF scheduling, we show that both the start time and the finish time are predictable if the actual execution times cannot be known. However, solely the finish time is predictable if the actual execution times can be known.