Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs

List scheduling with duplication for heterogeneous computing systems

“…Then, we compare the performance of the HEFD algorithm to three well-known scheduling algorithms in HCS: the HEFT [21,32], HLD [4], and HCPFD [15] algorithms. To test the performance of the scheduling algorithms, an extensive simulation environment of HCS with 64 nodes, is built and run on varying from Pentium II to Pentium IV , based on Hunan University Supercomputer Center (HUSC).…”

“…Therefore, heuristics can be used to obtain a sub-optimal scheduling rather than parsing all possible schedules. Task scheduling has been extensively studied, and various heuristics have been proposed in the literature [10,31,25,23,17,20,28,29,12,16,21,32,7,30,27,1,8,22,9,2,11,3,15,4,34,5,26]. In compile-time scheduling, these heuristics are classified into a variety of categories (such as list scheduling, clustering and task duplication).…”

“…Idle time slots, left in a processor, are exploited for duplicating immediate parents of a child node so as to reduce its waiting time on the processor. Some techniques, such as HCPFD [15], HLD [4], were introduced in heterogeneous distributed systems. The comparison study in [15,4] shows that HCPFD,HLD significantly surpass other algorithms, such as DLS [27], HEFT [21,32], LDBS [11].…”

Reliability-aware scheduling strategy for heterogeneous distributed computing systems

“…Idle time slots, left in a processor, are exploited for duplicating immediate parents of a child node so as to reduce its waiting time on the processor. Based on this, some scheduling algorithms, such as HCPFD [17], HLD [4], were introduced for HDC systems. The comparison study in [17,4] shows that HCPFD, HLD significantly surpass other algorithms, such as DLS [32], HEFT [22,37].…”

“…Based on this, some scheduling algorithms, such as HCPFD [17], HLD [4], were introduced for HDC systems. The comparison study in [17,4] shows that HCPFD, HLD significantly surpass other algorithms, such as DLS [32], HEFT [22,37]. However, the duplication of immediate parents aims at reducing the schedule length and does not consider the task reliability.…”