Improved Power Efficient Job Scheduling UsingPFMCT Algorithm
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & DISTRIBUTED SYSTEMS (Vol.4, No. 3)Publication Date: 2015-05-25
Authors : Er.Mandeep Singh Tinna; ER. ACHHARDEEP KAUR;
Page : 69-75
Keywords : Power consumption; Completion Time; Job scheduling; Average waiting time; QOS; Grid computing.;
Abstract
This paper describes key areas like Makespan, Average waiting time and power consumption in Grid computing. In data centers, higher performance causes higher energy consumption. Consequently, power and energy management have become key areas of research. But completion time and average waiting time of jobs increased when we try to minimize the total power consumptions separately and Quality of Service (QoS) metrics, cannot be guaranteed. The difficulty of managing these challenges motivated us to purpose a hybrid algorithm by combining two already existing algorithms PFM and MCT. In this paper, we give a short survey and discussion on some issues and aspects of Power aware job scheduling and at the end we have presented Power aware job scheduling with Minimum completion time (PFMCT) algorithm to minimize completion time and to improve Quality of Service (QOS).
Other Latest Articles
- Reusing Learning Objects and the Impact of Web 3.0 on e-Learning Platforms
- ENHANCEMENT OF NETWORK LIFETIME USING IMPROVED MODLEACH IN WSN
- REVISED AND STORAGE CORN-FORAGE FOOD AND INDUSTRIAL PRODUCTS
- INFLUENCE OF LIGHT ON SYNTHESIS OF PLANT PIGMENTS INPOST-HARVESTED JONATHAN GOLD APPLES
- THE BASIS OF THE QUALITY OF GRAIN CORN - CONTROL OF MYCOTOXINS IN IT
Last modified: 2016-07-02 19:23:27