Downloading: Approach to Solve NP Complete Problem Using Game Theoretic Scheduling Algorithm and Map-Reduce on Clouds
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
www.ijsr.net | Open Access | Fully Refereed | Peer Reviewed International Journal

ISSN: 2319-7064



To prevent Server Overload, Your Article PDF will be Downloaded in Next Seconds

Approach to Solve NP Complete Problem Using Game Theoretic Scheduling Algorithm and Map-Reduce on Clouds

V. Mogal, Shekhar H. Pingale

Abstract: In case of NP-complete problem, it is curious issue to schedule large scale parallel computing applications on heterogeneous systems like Hybrid cloud. End user want to meet Qulity of Service requirement (QoS).To process huge number of Bagof- Task (BOT) concurrently in such environment with QOS is a Big problem. For that it needs a exact solution. Here we propose Multiobjective scheduling algorithm to schedule particular BOTs. Algorithm optimizes two user objectives such as, Execution time and Economic cost where two constraints to consider are Network Bandwidth and Storage requirement.

Keywords: Multi-objective scheduling, Map Reduce, Bags-of-tasks, Hybrid clouds, NP Complete



Top