A performance study of multiprocessor task scheduling algorithms
The Journal of Supercomputing
| Hi-index | 0.00 |
Duplication Based Scheduling (DBS) is a relatively new approach for solving multiprocessor scheduling problems. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target system. This paper proposes a new DBS algorithm which achieves considerable performance improvement over existing DBS algorithms with equal or less time complexity. The proposed algorithm obtains a comparable performance to DBS algorithms with higher complexities. The paper also proposes a variation of the proposed algorithm which adjusts the extent of duplications according to the limited number of processors available in the target system. Our simulation study reveals the gradual performance degradation of the proposed algorithm as the number of processors available in the system is decreased.