COST MINIMIZATION ALGORITHMS FOR BIG DATA

COST MINIMIZATION ALGORITHMS FOR BIG DATA
Author(s):
K.Dhanalakshmi
Keywords:
Data center management, offline algorithm, dynamic programming, online algorithm
Abstract
cost minimization has become an emergent issue for the upcoming big data era. Different from conventional cloud services, one of the main features of big data services is the tight coupling between data and computation as computation tasks can be conducted only when the corresponding data are available Due to the increasing usage of cloud computing applications, it is important to minimize energy cost consumedby a data center, and simultaneously, to improve quality of service via data center management. One promising approach is to switch some servers in a data center to the idle mode for saving energy while to keep a suitable number of servers in the active mode for providing timely service. In this paper, we design both online and offline algorithms for this problem. For the offline algorithm, we formulate data center management as a cost minimization problem by considering energy cost, delay cost (to measure service quality), and switching cost (to change servers' active/idle mode).
Article Details
Unique Paper ID: 147080 Publication Volume & Issue: Volume 5, Issue 4 Page(s): 24 - 28
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org