Universiti Teknologi Malaysia Institutional Repository

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

Chuprat, Suriayati and Salleh, Shaharuddin (2007) A deadline-based algorithm for dynamic task scheduling with precedence constraints. In: PDCN'07: Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference, 13-15th February 2007, Innsbruck, Austria.

Full text not available from this repository.

Official URL: http://www.informatik.uni-trier.de/~ley/db/conf/pd...


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.

Item Type:Conference or Workshop Item (Paper)
Additional Information:Helmar Burkhart (Ed.): Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, as part of the 25th IASTED International Multi-Conference on Applied Informatics, February 13-15 2007, Innsbruck, Austria. IASTED/ACTA Press 2007, ISBN 978-0-88986-639-3
Uncontrolled Keywords:multiprocessor systems, Earliest Deadline First
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System
ID Code:10041
Deposited By: Narimah Nawil
Deposited On:26 Jul 2010 10:11
Last Modified:29 Feb 2020 13:43

Repository Staff Only: item control page