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: 2014-12-05
Authors : V. Mogal; Shekhar H. Pingale;
Page : 2112-2115
Keywords : Multi-objective scheduling; Map Reduce; Bags-of-tasks; Hybrid clouds; NP Complete;
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.
Other Latest Articles
- EAACK - To Overcome from Intruders Attacks in Manet's by Providing Security Checks
- A Survey on Improved Framework for Smart Phone using Internet of Things
- On Certain Inequalities Pertaining to I-Function
- Improvement of Power Quality in A PMBLDC Motor Drive Using a Forward Buck Converter
- Effect of Argel Leaf Aqueous Extract (Solenostemma argel) on Enzyme Activity in Gills and Muscles of Juvenile Nile Tilapia (Oreochromis niloticus)
Last modified: 2021-06-30 21:15:01