WORKFLOW SCHEDULING ACCORDING TO DATA DEPENDENCIES IN COMPUTATIONAL CLOUDS

ABSTRACT The number of applications needing big data is on the rise nowadays, where the big data processing tasks are sent as workflows to cloud computing systems. Considering the recent advances in the Internet technology, cloud computing have become the most popular computing technology. The sched...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Batoul Khazaie, Hamid Saadatfar
Formato:	article
Lenguaje:	EN
Publicado:	Scientific Research Support Fund of Jordan (SRSF) and Princess Sumaya University for Technology (PSUT) 2021
Materias:	bottleneck task data-intensive applications resource allocation sensitive task workflow scheduling Information technology T58.5-58.64 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/bfa2af0e291c4c8ea69e756b678b137e
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:bfa2af0e291c4c8ea69e756b678b137e
record_format	dspace
spelling	oai:doaj.org-article:bfa2af0e291c4c8ea69e756b678b137e2021-12-03T07:32:06ZWORKFLOW SCHEDULING ACCORDING TO DATA DEPENDENCIES IN COMPUTATIONAL CLOUDS2413-935110.5455/jjcit.71-1626545510https://doaj.org/article/bfa2af0e291c4c8ea69e756b678b137e2021-12-01T00:00:00Zhttp://www.ejmanager.com/fulltextpdf.php?mno=98765https://doaj.org/toc/2413-9351ABSTRACT The number of applications needing big data is on the rise nowadays, where the big data processing tasks are sent as workflows to cloud computing systems. Considering the recent advances in the Internet technology, cloud computing have become the most popular computing technology. The scheduling approach in cloud computing environments has always been a topic of interest to many researchers. This paper proposes a new scheduling algorithm for data-intensive workflows based on data dependencies in computational clouds. The proposed algorithm tries to minimize the makespan by considering the details of the workflow structure and virtual machines. The concepts and details defined and considered in this study has received less emphasis in previous works. According to the results, the proposed algorithm reduced the duration of communication between tasks and runtimes by taking into account the features of data-intensive workflows and proper task assignment. Consequently, it reduced the total makespan in comparison with previous algorithms. [JJCIT 2021; 7(4.000): 349-362]Batoul KhazaieHamid SaadatfarScientific Research Support Fund of Jordan (SRSF) and Princess Sumaya University for Technology (PSUT)articlebottleneck taskdata-intensive applicationsresource allocationsensitive taskworkflow schedulingInformation technologyT58.5-58.64Electronic computers. Computer scienceQA75.5-76.95ENJordanian Journal of Computers and Information Technology , Vol 7, Iss 4, Pp 349-362 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	bottleneck task data-intensive applications resource allocation sensitive task workflow scheduling Information technology T58.5-58.64 Electronic computers. Computer science QA75.5-76.95
spellingShingle	bottleneck task data-intensive applications resource allocation sensitive task workflow scheduling Information technology T58.5-58.64 Electronic computers. Computer science QA75.5-76.95 Batoul Khazaie Hamid Saadatfar WORKFLOW SCHEDULING ACCORDING TO DATA DEPENDENCIES IN COMPUTATIONAL CLOUDS
description	ABSTRACT The number of applications needing big data is on the rise nowadays, where the big data processing tasks are sent as workflows to cloud computing systems. Considering the recent advances in the Internet technology, cloud computing have become the most popular computing technology. The scheduling approach in cloud computing environments has always been a topic of interest to many researchers. This paper proposes a new scheduling algorithm for data-intensive workflows based on data dependencies in computational clouds. The proposed algorithm tries to minimize the makespan by considering the details of the workflow structure and virtual machines. The concepts and details defined and considered in this study has received less emphasis in previous works. According to the results, the proposed algorithm reduced the duration of communication between tasks and runtimes by taking into account the features of data-intensive workflows and proper task assignment. Consequently, it reduced the total makespan in comparison with previous algorithms. [JJCIT 2021; 7(4.000): 349-362]
format	article
author	Batoul Khazaie Hamid Saadatfar
author_facet	Batoul Khazaie Hamid Saadatfar
author_sort	Batoul Khazaie
title	WORKFLOW SCHEDULING ACCORDING TO DATA DEPENDENCIES IN COMPUTATIONAL CLOUDS
title_short	WORKFLOW SCHEDULING ACCORDING TO DATA DEPENDENCIES IN COMPUTATIONAL CLOUDS
title_full	WORKFLOW SCHEDULING ACCORDING TO DATA DEPENDENCIES IN COMPUTATIONAL CLOUDS
title_fullStr	WORKFLOW SCHEDULING ACCORDING TO DATA DEPENDENCIES IN COMPUTATIONAL CLOUDS
title_full_unstemmed	WORKFLOW SCHEDULING ACCORDING TO DATA DEPENDENCIES IN COMPUTATIONAL CLOUDS
title_sort	workflow scheduling according to data dependencies in computational clouds
publisher	Scientific Research Support Fund of Jordan (SRSF) and Princess Sumaya University for Technology (PSUT)
publishDate	2021
url	https://doaj.org/article/bfa2af0e291c4c8ea69e756b678b137e
work_keys_str_mv	AT batoulkhazaie workflowschedulingaccordingtodatadependenciesincomputationalclouds AT hamidsaadatfar workflowschedulingaccordingtodatadependenciesincomputationalclouds
_version_	1718373837481967616

WORKFLOW SCHEDULING ACCORDING TO DATA DEPENDENCIES IN COMPUTATIONAL CLOUDS

Ejemplares similares