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

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...

Full description

Bibliographic Details
Main Authors: Chuprat, Suriayati, Salleh, Shaharuddin
Format: Conference or Workshop Item
Published: ACTA Press 2007
Subjects:
Online Access:http://eprints.utm.my/10041/
_version_ 1848891997022060544
author Chuprat, Suriayati
Salleh, Shaharuddin
author_facet Chuprat, Suriayati
Salleh, Shaharuddin
author_sort Chuprat, Suriayati
building UTeM Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T21:06:51Z
format Conference or Workshop Item
id utm-10041
institution Universiti Teknologi Malaysia
institution_category Local University
last_indexed 2025-11-15T21:06:51Z
publishDate 2007
publisher ACTA Press
recordtype eprints
repository_type Digital Repository
spelling utm-100412020-02-29T13:43:15Z http://eprints.utm.my/10041/ A deadline-based algorithm for dynamic task scheduling with precedence constraints Chuprat, Suriayati Salleh, Shaharuddin QA75 Electronic computers. Computer science 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. ACTA Press 2007-10 Conference or Workshop Item PeerReviewed 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. http://www.informatik.uni-trier.de/~ley/db/conf/pdcn/pdcn2007.html
spellingShingle QA75 Electronic computers. Computer science
Chuprat, Suriayati
Salleh, Shaharuddin
A deadline-based algorithm for dynamic task scheduling with precedence constraints
title A deadline-based algorithm for dynamic task scheduling with precedence constraints
title_full A deadline-based algorithm for dynamic task scheduling with precedence constraints
title_fullStr A deadline-based algorithm for dynamic task scheduling with precedence constraints
title_full_unstemmed A deadline-based algorithm for dynamic task scheduling with precedence constraints
title_short A deadline-based algorithm for dynamic task scheduling with precedence constraints
title_sort deadline-based algorithm for dynamic task scheduling with precedence constraints
topic QA75 Electronic computers. Computer science
url http://eprints.utm.my/10041/
http://eprints.utm.my/10041/