Optimizing Cost and Maximizing Profit for Multi-Cloud-Based Big Data Computing by Deadline-Aware Optimize Resource Allocation

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cloud computing is most powerful and demanding for businesses in this decade. “Data is future oil” can be proved in many ways, as most of the business and corporate giants are very much worried about business data. In fact to accommodate and process this data, we required a very expensive platform that can work efficiently. Researchers and many professionals have been proved and standardize some cloud computing standards. But still, some modifications and major research toward big data processing in multi-cloud infrastructure need to investigate. Reliance on a single cloud provider is a challenging task with respect to services like latency, QoS and non-affordable monetary cost to application providers. We proposed an effective deadline-aware resource management scheme through novel algorithms, namely job tracking, resource estimation and resource allocation. In this paper, we will discuss two algorithms in detail and do an experiment in a multi-cloud environment. Firstly, we check job track algorithms and at last, we will check job estimation algorithms. Utilization of multiple cloud service providers is a promising solution for an affordable class of services and QoS.

Cite

CITATION STYLE

APA

Manekar, A., & Pradeepini, G. (2021). Optimizing Cost and Maximizing Profit for Multi-Cloud-Based Big Data Computing by Deadline-Aware Optimize Resource Allocation. In Studies in Computational Intelligence (Vol. 921, pp. 29–38). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-981-15-8469-5_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free