Task scheduling algorithm with minimal redundant duplications in homogeneous multiprocessor system

  • CHOI SANG BANG

초록

The performance of a homogeneous multiprocessor system depends on an algorithm which schedules input DAG. Among various task scheduling algorithms, ones that are using full duplication provide superior performance by duplicating tasks recursively. However, redundant duplications lead to increase of total execution time and decrease of processor idle time. In this paper, we propose GDRA which reduces total execution time and increases processor idle time by eliminating redundant duplications. Comparisons with other full duplication algorithms, such as CPFD, SD, and MDJ, show that GDRA provides the better performance as the CCR increases. © 2011 Springer-Verlag.

제목
Task scheduling algorithm with minimal redundant duplications in homogeneous multiprocessor system
저자
CHOI SANG BANG
학회명
The Third International Mega-Conference on Future Generation Information Technology 2011
개최지
제주 그랜드호텔
학회 개최일
2011-12-08 ~ 2011-12-10