Queue-priority optimized algorithm: a novel task scheduling for runtime systems of application integration platforms

dc.contributor.authorFreire, D. L.
dc.contributor.authorFrantz, R. Z.
dc.contributor.authorRoos-Frantz, F.
dc.contributor.authorBasto-Fernandes, V.
dc.date.accessioned2022-06-24T15:46:50Z
dc.date.available2022-06-24T15:46:50Z
dc.date.issued2022
dc.date.updated2022-06-24T16:46:09Z
dc.description.abstractThe need for integration of applications and services in business processes from enterprises has increased with the advancement of cloud and mobile applications. Enterprises started dealing with high volumes of data from the cloud and from mobile applications, besides their own. This is the reason why integration tools must adapt themselves to handle with high volumes of data, and to exploit the scalability of cloud computational resources without increasing enterprise operations costs. Integration platforms are tools that integrate enterprises’ applications through integration processes, which are nothing but workflows composed of a set of atomic tasks connected through communication channels. Many integration platforms schedule tasks to be executed by computational resources through the First-in-first-out heuristic. This article proposes a Queue-priority algorithm that uses a novel heuristic and tackles high volumes of data in the task scheduling of integration processes. This heuristic is optimized by the Particle Swarm Optimization computational method. The results of our experiments were confirmed by statistical tests, and validated the proposal as a feasible alternative to improve integration platforms in the execution of integration processes under a high volume of data.eng
dc.description.versioninfo:eu-repo/semantics/acceptedVersion
dc.identifier.doi10.1007/s11227-021-03926-x
dc.identifier.issn0920-8542
dc.identifier.urihttp://hdl.handle.net/10071/25702
dc.journalThe Journal of Supercomputing
dc.language.isoeng
dc.number1
dc.pagination1501 - 1531
dc.peerreviewedyes
dc.publisherSpringer
dc.relation17/2551-0001206-2
dc.relation309315/2020-4
dc.rightsopen access
dc.subjectApplication integrationeng
dc.subjectHeuristiceng
dc.subjectOptimizationeng
dc.subjectSystem integrationeng
dc.subjectTask scheduling algorithmeng
dc.subject.fosDomínio/Área Científica::Ciências Naturais::Ciências da Computação e da Informaçãopor
dc.titleQueue-priority optimized algorithm: a novel task scheduling for runtime systems of application integration platformseng
dc.typearticle
dc.volume78
degois.publication.firstPage1501
degois.publication.issue1
degois.publication.lastPage1531
degois.publication.titleQueue-priority optimized algorithm: a novel task scheduling for runtime systems of application integration platformseng
dspace.entity.typePublicationen
iscte.alternateIdentifiers.scopus2-s2.0-85107799389
iscte.alternateIdentifiers.wosWOS:000660374600001
iscte.identifier.cienciahttps://ciencia.iscte-iul.pt/id/ci-pub-82062
iscte.subject.odsIndústria, inovação e infraestruturaspor

Ficheiros

Pacote original

A mostrar 1 - 1 de 1
A carregar...
Nome:
article_82062.pdf
Tamanho:
786.82 KB
Formato:
Adobe Portable Document Format
Descrição:
Versão Aceite