Chuprat, Suriayati and Salleh, Shaharuddin (2007) A deadline-based algorithm for dynamic task scheduling with precedence constraints. In: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks. Acta Press Anaheim, California, USA, pp. 158-163. ISBN 978-0-88986-637-9
Full text not available from this repository.
Official URL: http://apps.isiknowledge.com
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.
| Item Type: | Book Section |
|---|---|
| Additional Information: | International Conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, Feb. 13-15, 2007 |
| Uncontrolled Keywords: | earliest deadline first; real-time systems; dynamic algorithm; multiprocessor and precedence constraint |
| Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering |
| Divisions: | Science |
| ID Code: | 11635 |
| Deposited By: | Nor Asmida Abdullah |
| Deposited On: | 24 Dec 2010 05:16 |
| Last Modified: | 28 Dec 2010 09:11 |
Repository Staff Only: item control page
