Load Balancing of Unbalanced Matrix Problem of the Sufficient Machines with Min-Min Algorithm

Nowadays, cloud computing as a developing Internet accommodation concept has been propagating to provide different Internet resources to users. Cloud computing occupies a variety of computing Internet applications for facilitating the execution of sizable voluminous-scale tasks. Cloud computing is a web predicated distributed computing. There is more than a million number of servers connected to the Internet to provide several types of accommodations to provide cloud users. Constrained numbers of servers execute fewer numbers tasks at a time. So it is not too easy to execute all functions at a time. Some systems run all functions, so there are needed to balance all loads. Load balance reduces the completion time as well as performs all tasks in a particular way. There are not possible to remain an equal number of servers to execute equal tasks. Tasks to be executed in cloud computing would be less than the connected servers sometime. Excess servers have to execute a fewer number of tasks. Here, we are going to present an algorithm for load balancing and performance with minimization completion time and throughput. We apply here a very famous Hungarian method to balance all loads in distributing computing. Hungarian Technique helps us to minimize the cost matrix problem.