One of the most recent concepts in the framework of today’s distributed systems is Cloud Computing. A very difficult problem that needs to be addressed is the management of the Cloud. When designing a Cloud scheduling strategy, the design trade-offs of the Cloud architecture should be evaluated. The easiest way to evaluate this infrastructure is to use a simulation tool (in this case CloudSim simulation toolkit). This article examines three different algorithms that consider the scheduling of tasks in Cloud, which are described as Directed Acyclic Graphs (DAGs) (interdependent tasks). The results of the scheduling algorithms are valuable because they are helpful for the design of the Cloud Computing scheduling algorithms and for the design of a Service Level Agreement (SLA) contract whose members are the Cloud Service Provider (CSP) and the Cloud Service Customers (CSCs). This paper shows that the selection of the scheduling algorithms is useful in the design of the SLA contract.
Scheduling in Cloud, CloudSim, SLA parameters, Directed Acyclic Graphs.
Bogdan ȚIGĂNOAIA, George IORDACHE, Cătălin NEGRU, Florin POP, "Scheduling in CloudSim of Interdependent Tasks for SLA Design", Studies in Informatics and Control, ISSN 1220-1766, vol. 28(4), pp. 477-484, 2019. https://doi.org/10.24846/v28i4y201911
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).