Online Task Scheduling of Big Data Applications in the Cloud Environment
Open Access
- 15 May 2023
- journal article
- research article
- Published by MDPI AG in Information
- Vol. 14 (5) , 292
Abstract
The development of big data has generated data-intensive tasks that are usually time-consuming, with a high demand on cloud data centers for hosting big data applications. It becomes necessary to consider both data and task management to find the optimal resource allocation scheme, which is a challenging research issue. In this paper, we address the problem of online task scheduling combined with data migration and replication in order to reduce the overall response time as well as ensure that the available resources are efficiently used. We introduce a new scheduling technique, named Online Task Scheduling algorithm based on Data Migration and Data Replication (OTS-DMDR). The main objective is to efficiently assign online incoming tasks to the available servers while considering the access time of the required datasets and their replicas, the execution time of the task in different machines, and the computational power of each machine. The core idea is to achieve better data locality by performing an effective data migration while handling replicas. As a result, the overall response time of the online tasks is reduced, and the throughput is improved with enhanced machine resource utilization. To validate the performance of the proposed scheduling method, we run in-depth simulations with various scenarios and the results show that our proposed strategy performs better than the other existing approaches. In fact, it reduces the response time by 78% when compared to the First Come First Served scheduler (FCFS), by 58% compared to the Delay Scheduling, and by 46% compared to the technique of Li et al. Consequently, the present OTS-DMDR method is very effective and convenient for the problem of online task scheduling.Keywords
This publication has 74 references indexed in Scilit:
- Enabling customer-provided resources for cloud computing: Potentials,challenges, and implementationIEEE Transactions on Parallel and Distributed Systems, 2014
- MORM: A Multi-objective Optimized Replication Management strategy for cloud storage clusterJournal of Systems Architecture, 2014
- Analysis of Different Variants in Round Robin Algorithms for Load Balancing in Cloud ComputingInternational Journal of Computer Applications, 2013
- A Task Scheduling Algorithm for Hadoop PlatformJournal of Computers, 2013
- Improved Max-Min Algorithm in Cloud ComputingInternational Journal of Computer Applications, 2012
- A Deadline and Budget Constrained Cost and Time Optimization Algorithm for Cloud ComputingCommunications in Computer and Information Science, 2011
- CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithmsSoftware: Practice and Experience, 2010
- Lowest Data Replication Storage of Binary Vote Assignment Data GridCommunications in Computer and Information Science, 2010
- A new paradigm: Data-aware scheduling in grid computingFuture Generation Computer Systems, 2009
- Min-max vs. max-min flow control algorithms for optimal computer network capacity assignmentJournal of Computational and Applied Mathematics, 1984