A Bi- Objective Workflow Application Scheduling In Cloud Computing Systems
Saved in:
| Title: | A Bi- Objective Workflow Application Scheduling In Cloud Computing Systems |
|---|---|
| Authors: | Yalda Aryan |
| Publisher Information: | Zenodo |
| Publication Year: | 2014 |
| Collection: | Zenodo |
| Subject Terms: | Cloud computing, Heterogeneous distributed computing systems, market oriented systems, Workflow scheduling, Genetic Algorithm |
| Description: | The task scheduling is a key process in large-scale distributed systems like cloud computing infrastructures which can have much impressed on system performance. This problem is referred to as a NP-hard problem because of some reasons such as heterogeneous and dynamic features and dependencies among the requests. Here, we proposed a bi-objective method called DWSGA to obtain a proper solution for allocating the requests on resources. The purpose of this algorithm is to earn the response quickly, with some goal-oriented operations. At first, it makes a good initial population by a special way that uses a bidirectional tasks prioritization. Then the algorithm moves to get the most appropriate possible solution in a conscious manner by focus on optimizing the makespan, and considering a good distribution of workload on resources by using efficient parameters in the mentioned systems. Here, the experiments indicate that the DWSGA amends the results when the numbers of tasks are increased in application graph, in order to mentioned objectives. The results are compared with other studied algorithms. Original Source URL : http://airccse.org/journal/ijite/papers/3214ijite06.pdf For more details : http://airccse.org/journal/ijite/vol3.html |
| Document Type: | article in journal/newspaper |
| Language: | unknown |
| Relation: | https://zenodo.org/records/2575352; oai:zenodo.org:2575352; https://doi.org/10.5281/zenodo.2575352 |
| DOI: | 10.5281/zenodo.2575352 |
| Availability: | https://doi.org/10.5281/zenodo.2575352 https://zenodo.org/records/2575352 |
| Rights: | Creative Commons Attribution 4.0 International ; cc-by-4.0 ; https://creativecommons.org/licenses/by/4.0/legalcode |
| Accession Number: | edsbas.A327879D |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | The task scheduling is a key process in large-scale distributed systems like cloud computing infrastructures which can have much impressed on system performance. This problem is referred to as a NP-hard problem because of some reasons such as heterogeneous and dynamic features and dependencies among the requests. Here, we proposed a bi-objective method called DWSGA to obtain a proper solution for allocating the requests on resources. The purpose of this algorithm is to earn the response quickly, with some goal-oriented operations. At first, it makes a good initial population by a special way that uses a bidirectional tasks prioritization. Then the algorithm moves to get the most appropriate possible solution in a conscious manner by focus on optimizing the makespan, and considering a good distribution of workload on resources by using efficient parameters in the mentioned systems. Here, the experiments indicate that the DWSGA amends the results when the numbers of tasks are increased in application graph, in order to mentioned objectives. The results are compared with other studied algorithms. Original Source URL : http://airccse.org/journal/ijite/papers/3214ijite06.pdf For more details : http://airccse.org/journal/ijite/vol3.html |
|---|---|
| DOI: | 10.5281/zenodo.2575352 |