A mathematical model to compute makespan for application integration processes using graph theory approach Online publication date: Mon, 19-Dec-2022
by Sandra Neuckamp; Rafael Z. Frantz; Fabricia Roos-Frantz; Sandro Sawicki
International Journal of Computer Applications in Technology (IJCAT), Vol. 69, No. 3, 2022
Abstract: The performance of integration platforms depends on the performance of execution models implemented for execution engines. Integration processes can be divided into two levels: process execution and resource management. In the first level, we considered the processing time of tasks; as for the second level, we only analysed elements of management and allocation of computational resources. Our proposal aims to identify the elements present at these levels that impact the process execution time, so we develop a mathematical model which determines makespan analytically in integration processes using a Directed Acyclic Graph (DAG). The proposed mathematical model can be used not only to compute makespan, but also to identify the optimal number of computational threads to execute an integration process with the lowest possible makespan. This mathematical model is validated by a Coffee Shop integration process, which is a well-known benchmark to evaluate and compare integration platforms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com