Sardar Khaliq uz Zaman1, Tahir Maqsood1, Mazhar Ali1, Kashif Bilal1, Sajjad A. Madani1, Atta ur Rehman Khan2,*
Computer Systems Science and Engineering, Vol.34, No.2, pp. 79-90, 2019, DOI:10.32604/csse.2019.34.079
Abstract Optimal task allocation in Large-Scale Computing Systems (LSCSs) that endeavors to balance the load across limited computing resources is considered an
NP-hard problem. MinMin algorithm is one of the most widely used heuristic for scheduling tasks on limited computing resources. The MinMin minimizes
makespan compared to other algorithms, such as Heterogeneous Earliest Finish Time (HEFT), duplication based algorithms, and clustering algorithms.
However, MinMin results in unbalanced utilization of resources especially when majority of tasks have lower computational requirements. In this work
we consider a computational model where each machine has certain bounded capacity to execute a predefined number of tasks… More >
Login
Register
