کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
431835 | 688638 | 2013 | 10 صفحه PDF | دانلود رایگان |
• Reliability-oriented task assignment in distributed systems is investigated.
• A simple and effective IG algorithm is proposed for the problem.
• Comparison studies show the superiority of our algorithm over others.
• Convergence analysis is also conducted.
This paper investigates the problem of allocating parallel application tasks to processors in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The problem of finding an optimal task allocation for more than three processors is known to be NP-hard in the strong sense. To deal with this challenging problem, we propose a simple and effective iterative greedy algorithm to find the best possible solution within a reasonable amount of computation time. The algorithm first uses a constructive heuristic to obtain an initial assignment and iteratively improves it in a greedy way. We study the performance of the proposed algorithm over a wide range of parameters including problem size, the ratio of average communication time to average computation time, and task interaction density. The viability and effectiveness of our algorithm is demonstrated by comparing it with recently proposed task allocation algorithms for maximizing system reliability available in the literature.
Journal: Journal of Parallel and Distributed Computing - Volume 73, Issue 8, August 2013, Pages 1106–1115