Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{147080,
        author = {K.Dhanalakshmi},
        title = {COST MINIMIZATION ALGORITHMS FOR BIG DATA },
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {5},
        number = {4},
        pages = {24-28},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=147080},
        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).},
        keywords = {Data center management, offline algorithm, dynamic programming, online algorithm},
        month = {},
        }