A Multi-queue Round Robin Algorithm for Task Scheduling in Enterprise Application Integration Platforms in the Cloud

preprint OA: closed
View at publisher

Abstract

Contemporaneous environments involve a large number of information which is received from many interconnected devices and integrated by many platforms. The Internet of Things and Cloud computing offer services to deal with such big data, so that enterprises can play in their business core by outsourcing the development, the configuration, and the maintenance of those services and their computational resources. Many enterprises use integration Platform as a Service to maintain their applications and data working in a synchronous way. However, current task scheduling algorithms of integration platforms are facing some hardships to tackle with high volumes of data. In this article, we propose a scheduling algorithm based in the round-robin heuristic through multiple task queue, which presents better performance than the traditional First-in-first-out heuristic used by current platforms. We experimented our algorithm in the execution of an integration process, and we validated the results with statistical techniques.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00