A New Dynamic Scheduling Algorithm for Real-Time Heterogeneous Multiprocessor Systems
- 1 December 2007
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 112-115
- https://doi.org/10.1109/iita.2007.70
Abstract
In this paper, we investigate several potential processor selection policies for nonpreemptive scheduling of dynamically arriving real-time tasks (aperiodic task) in heterogeneous multiprocessor systems, and the P_IEFT policy among them is the best from the viewpoint of the schedule length. The P_IEFT policy selects the processor that minimizes the earliest finish time of a task. Simulation results show that the new algorithm using the P_IEFT policy outperforms the other algorithms that use the other processor selection policies.Keywords
This publication has 3 references indexed in Scilit:
- Integrated dynamic scheduling of hard and QoS degradable real-time tasks in multiprocessor systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient dynamic scheduling algorithm for multiprocessor real-time systemsIEEE Transactions on Parallel and Distributed Systems, 1998
- Efficient scheduling algorithms for real-time multiprocessor systemsIEEE Transactions on Parallel and Distributed Systems, 1990