Rashmi Sharma, Nitin, Journal of Information Processing Systems Vol. 10, No. 2, pp. 193-214, Jun. 2014  

10.3745/JIPS.01.0001
Keywords: Distributed System(DS), Task Assignment Heuristics, Task Duplication(TD), Directed Acyclic Graph(DAG)
Fulltext: PDF

Abstract

Load balancing is the major benefit of any distributed system. To facilitate this advantage, task duplication and migration methodologies are employed. As this paper deals with dependent tasks (DAG), we used duplication. Task duplication reduces the overall schedule length of DAG along-with load balancing. This paper proposes a new task duplication algorithm at the time of tasks assignment on various processors. With the intention of conducting proposed algorithm performance computation; simulation has been done on the Netbeans IDE. The mesh topology of a distributed system is simulated at this juncture. For task duplication, overall schedule length of DAG is the main parameter that decides the performance of a proposed duplication algorithm. After obtaining the results we compared our performance with arbitrary task assignment, CAWF and HEFT-TD algorithms. Additionally, we also compared the complexity of the proposed algorithm with the Duplication Based Bottom Up scheduling (DBUS) and Heterogeneous Earliest Finish Time with Task Duplication (HEFT-TD).

Statistics
Cite this article