A deadline-based algorithm for dynamic task scheduling with precedence constraints

Authors:
Suriayati Chuprat;Shaharuddin Salleh
Affiliations:
Department of Science, College of Science and Technology, Universiti Teknologi Malaysia, Kuala Lumpur, Malaysia;Department of Mathematics, Faculty of Science, Universiti Teknologi Malaysia, Johor, Malaysia
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 8
Cited 0

Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm

Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
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
Robustness results concerning EDF scheduling upon uniform multiprocessors

ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

Real-Time Systems
Real Time Scheduling Theory: A Historical Perspective

Real-Time Systems
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new deadline-based algorithm for dynamic task scheduling on multiprocessor real-time systems. The proposed algorithm was built based on the well-known dynamic scheduling algorithm the Earliest Deadline First (EDF). We extend the EDF algorithm in three significant criterions: (1) The original EDF deals with set of periodic task. (2) It schedules only independent tasks. (3) It works best in the single processor system. Our contribution in this study is a creation of a new variation of EDF called EDF-pc that able to schedule set of non-periodic tasks. It also deals with tasks that may or may not have precedence constraints and it produced acceptable results in the multiprocessor systems.