Abstract: Cloud computing is emerging as a potential player in field of Distributed computing. Therefore enhancement in scheduling algorithm is the major research area which is being under focused by various researchers. Efficient scheduling algorithm tends to increase the potential of any Cloud Service Provider (CSP) infrastructure. In order to increase the performance of scheduling capabilities, this work has been focused on improving Map e-K algorithm with the combination of worst fit scheduling algorithm. The Map e-K loop provides monitoring, analysing, planning & execution phases & under the planning phase we have used latency matrix that will create plan to allocate job request to VMs. Also, in this work thebinary search technique has been used to find appropriate VMs for incoming job request from the userThis hybrid version of Map e-K is successfully tested& shown under observed results.
Keywords: Cloud, Map e-K, Binary Search, latency Matrix.