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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Published: |
Acta Press Anaheim
2007
|
| Subjects: |