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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
ACTA Press
2007
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/10041/ http://www.informatik.uni-trier.de/~ley/db/conf/pdcn/pdcn2007.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|