ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

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

Journal: International Journal of Science and Research (IJSR) (Vol.3, No. 12)

Publication Date:

Authors : ; ;

Page : 2112-2115

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

Source : Downloadexternal Find it from : Google Scholarexternal

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.

Last modified: 2021-06-30 21:15:01