Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/274554
Title: Performance Analysis of Energy Saving In Cloud Environment
Researcher: Kalyana Sundaram N.
Guide(s): S.P.Rajagopalan
University: Vels University
Completed Date: 
Abstract: Nowadays cloud computing is a fastest developing technology in the universe. The vendor, newlinepartners and business developers structures the cloud computing world. A large distributed newlineplatform like Windows or Linux with million numbers of servers will spend approximately newline190,000 MWH per year, limited power to uphold greater than 10,000 households. In 2005, the newlineoverall data center energy utilization was 1% of the total US energy utilization. In future, the newlinepower utilization is predicted to grow at a fast rate of more than 25% per year. newlineThe challenges and issues are formed everyday in public and private organizations. The newlinechallenges of cloud computing is Energy monitoring, Enforcement, and Higher costs. One of the newlineissues in cloud computing are load balancing and task scheduling. Load balancing is the process newlineof distributing service requests across a group of servers. Users of one workstation are not newlineobstructing by the intensive applications run on a different workstation. When there are large newlinenumber of machines on the network are idle, then the efficiency of computation process is newlinedecreased. The efficient sharing of computing resources in a distributed system is more complex newlinecompared to centralized system. Resources are fragmented and distributed over a set of newlineautonomous and physically separate hosts. Task Scheduling is used to reduce the average newlineresponse time of processes. Two algorithms were introduced. They are: Energy Saving Dynamic newlineLoad Balancing (ESDLB) and Energy Saving Task Scheduling (ESTS) algorithms. ESDLB newlinealgorithm promises by sharing the workload of heavily loaded workstations with lightly loaded newlineworkstations. ESDLB algorithm shows the comparison of the servers used and their newlinecomputational tasks. ESTS algorithm is used to compare the performance of different types of newlinescheduling such as First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR) newlineand Priority scheduling. newline
Pagination: 
URI: http://hdl.handle.net/10603/274554
Appears in Departments:Department of computer science & enigineering

Files in This Item:
File Description SizeFormat 
acknowledgement.pdfAttached File61.41 kBAdobe PDFView/Open
appendices.pdf113.11 kBAdobe PDFView/Open
certificates.pdf110.67 kBAdobe PDFView/Open
chapter 1.pdf618.84 kBAdobe PDFView/Open
chapter 2.pdf168.04 kBAdobe PDFView/Open
chapter 3.pdf401.57 kBAdobe PDFView/Open
chapter 4.pdf4.86 MBAdobe PDFView/Open
chapter 5.pdf8.07 MBAdobe PDFView/Open
chapter 6.pdf85.72 kBAdobe PDFView/Open
contents.pdf112.97 kBAdobe PDFView/Open
list of tables_figures.pdf138.21 kBAdobe PDFView/Open
publications.pdf499.97 kBAdobe PDFView/Open
references.pdf137.96 kBAdobe PDFView/Open
title.pdf195.88 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: