The University of Southampton
University of Southampton Institutional Repository

LATA: learning automata-based task assignment on heterogeneous cloud computing platform

LATA: learning automata-based task assignment on heterogeneous cloud computing platform
LATA: learning automata-based task assignment on heterogeneous cloud computing platform
A cloud computing environment is a distributed system where idle resources are accessible across a wide area network, such as the Internet. Due to the diverse specifications of these resources, computational clouds exhibit high heterogeneity. Task scheduling, the process of dispatching cloud applications onto processing nodes, becomes a critical challenge in such environments. Ensuring high utilization in this heterogeneous environment entails identifying suitable machines or virtual machines capable of efficiently executing jobs, constituting a multi-objective optimization problem. This paper proposes a dynamic Learning Automata-based Task Assignment algorithm, named LATA, to address this challenge. In the algorithm, each application is represented as a Directed Acyclic Graph, with tasks as nodes and data dependencies as edges. Initially, tasks are grouped based on their data dependencies to consolidate independent tasks into one group. Subsequently, a variable-structure learning automaton is assigned to each group of tasks to identify appropriate task-machine combinations. The primary objectives of LATA include minimizing makespan and energy consumption by facilitating efficient task placement to achieve load balance and maximize resource utilization. Additionally, an enhancement is proposed, involving the use of a different grouping policy prior to task assignment to further improve performance. Computer simulation results demonstrate the superior performance of the proposed algorithms in highly heterogeneous environments compared to state-of-the-art algorithms. Notably, total execution time and energy consumption decrease by up to 50% and 37%, respectively.
Cloud computing, Directed acyclic graph, Learning automata, Task scheduling
0920-8542
24106–24137
Gheisari, Soulmaz
ec5925da-f424-4f49-8b72-d4d045ee7ba6
Shokrzadeh, Hamid
4b43b80a-2176-41fa-bc72-98d23813ecbd
Gheisari, Soulmaz
ec5925da-f424-4f49-8b72-d4d045ee7ba6
Shokrzadeh, Hamid
4b43b80a-2176-41fa-bc72-98d23813ecbd

Gheisari, Soulmaz and Shokrzadeh, Hamid (2024) LATA: learning automata-based task assignment on heterogeneous cloud computing platform. The Journal of Supercomputing, 80 (16), 24106–24137. (doi:10.1007/s11227-024-06292-6).

Record type: Article

Abstract

A cloud computing environment is a distributed system where idle resources are accessible across a wide area network, such as the Internet. Due to the diverse specifications of these resources, computational clouds exhibit high heterogeneity. Task scheduling, the process of dispatching cloud applications onto processing nodes, becomes a critical challenge in such environments. Ensuring high utilization in this heterogeneous environment entails identifying suitable machines or virtual machines capable of efficiently executing jobs, constituting a multi-objective optimization problem. This paper proposes a dynamic Learning Automata-based Task Assignment algorithm, named LATA, to address this challenge. In the algorithm, each application is represented as a Directed Acyclic Graph, with tasks as nodes and data dependencies as edges. Initially, tasks are grouped based on their data dependencies to consolidate independent tasks into one group. Subsequently, a variable-structure learning automaton is assigned to each group of tasks to identify appropriate task-machine combinations. The primary objectives of LATA include minimizing makespan and energy consumption by facilitating efficient task placement to achieve load balance and maximize resource utilization. Additionally, an enhancement is proposed, involving the use of a different grouping policy prior to task assignment to further improve performance. Computer simulation results demonstrate the superior performance of the proposed algorithms in highly heterogeneous environments compared to state-of-the-art algorithms. Notably, total execution time and energy consumption decrease by up to 50% and 37%, respectively.

Text
s11227-024-06292-6 - Version of Record
Available under License Creative Commons Attribution.
Download (2MB)

More information

Accepted/In Press date: 7 June 2024
Published date: 3 July 2024
Keywords: Cloud computing, Directed acyclic graph, Learning automata, Task scheduling

Identifiers

Local EPrints ID: 494345
URI: http://eprints.soton.ac.uk/id/eprint/494345
ISSN: 0920-8542
PURE UUID: c1f48d15-a270-4589-a5e2-0cddd96aa564
ORCID for Soulmaz Gheisari: ORCID iD orcid.org/0000-0001-8974-2841

Catalogue record

Date deposited: 04 Oct 2024 16:59
Last modified: 05 Oct 2024 02:17

Export record

Altmetrics

Contributors

Author: Soulmaz Gheisari ORCID iD
Author: Hamid Shokrzadeh

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×