Allotment of independent tasks based on complete load balancing

There are various algorithms used for assigning tasks to heterogeneous processors. We propose an algorithm to assign N tasks to K processors. The motivation of this algorithm is to address the drawback of Minmin+, Maxmin+, Sufferage+ in solving problems with highly skewed costly distributions. The proposed algorithm is easy to implement and we have illustrated with detailed pseudo codes.