A Cost-Optimized Data Parallel Task Scheduling with Deadline Constraints in Cloud

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Large-scale distributed systems have the advantages of high processing speeds and large communication bandwidths over the network. The processing of huge real-world data within a time constraint becomes tricky, due to the complexity of data parallel task scheduling in a time constrained environment. This paper proposes data parallel task scheduling in cloud to address the minimization of cost and time constraints. By running concurrent executions of tasks on multi-core cloud resources, the number of parallel executions could be increased correspondingly, thereby, finishing the task within the deadline is possible. A mathematical model is developed here to minimize the operational cost of data parallel tasks by feasibly assigning a load to each virtual machine in the cloud data center. This work experiments with a machine learning model that is replicated on the multi-core cloud heterogeneous resources to execute different input data concurrently to accomplish distributive learning. The outcome of concurrent execution of data-intensive tasks on different parts of the input dataset gives better solutions in terms of processing the task by the deadline at optimized cost.

Cite

CITATION STYLE

APA

Rajalakshmi, N. R., Dumka, A., Kumar, M., Singh, R., Gehlot, A., Akram, S. V., … Noya, I. D. (2022). A Cost-Optimized Data Parallel Task Scheduling with Deadline Constraints in Cloud. Electronics (Switzerland), 11(13). https://doi.org/10.3390/electronics11132022

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