MEFTTD: A Parallel Awareness Scheduler

This paper presents a scheduling algorithm on cluster, named modified earliest finish time with task description (MEFTTD). Unlike other algorithms, MEFTTD needs programmers to describe the attribute of their parallel program. Then, MEFTTD uses these descriptions to optimize scheduling strategy. In this paper, round-robin algorithm (R-R), Heterogeneous Earliest-Finish-Time algorithm (HEFT) and MEFTTD are compared. The overall result demonstrates that MEFTTD can improve scheduling performance dramatically.