Moghadam, Mahshid Helali ; Babamir, Seyed Morteza ; Mirabi, Meghdad (2016)
A Multi-Objective Optimization Model for Data-Intensive Workflow Scheduling in Data Grids.
41st IEEE Conference on Local Computer Networks Workshops. Dubai, UAE (07.11.2016-10.11.2016)
doi: 10.1109/LCN.2016.025
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
The concept of workflow is used for modeling many of the data-intensive scientific applications executed on data grids. A Workflow is a series of interdependent tasks during which data is processed by different tasks. Scheduling the workflows in the grids is the process of assigning tasks to appropriate resources with the aim of achieving goals such as reducing workflow completion time while considering the data dependencies between the tasks. Data access time, processing time, and waiting time together constitute task completion time in the grids. Workflow scheduling aims to optimize these parameters in such a way that the workflow completion time decreases, and the system efficiency improves. In this paper, a scheduling model based on multi-objective optimization is proposed for scheduling data-intensive workflows in data grids. The scheduling model aims to optimize data communication cost, waiting time, and tasks processing time while considering data dependencies between the tasks. The model defines the data communication cost in terms of data transfer time in various communications between nodes (intra-and inter-cluster communications). This study uses four different Multi-Objective Evolutionary Algorithms (MOEAs) as well as Random Search (RS) algorithm to implement the proposed scheduling model. Convenient coding mechanisms for representing chromosomes, compatible crossover and mutation operators were also designed. Simulation results of the proposed scheduling model using different optimization algorithms are presented. The results are then assessed and compared based on different quality indicators.
Typ des Eintrags: | Konferenzveröffentlichung |
---|---|
Erschienen: | 2016 |
Autor(en): | Moghadam, Mahshid Helali ; Babamir, Seyed Morteza ; Mirabi, Meghdad |
Art des Eintrags: | Bibliographie |
Titel: | A Multi-Objective Optimization Model for Data-Intensive Workflow Scheduling in Data Grids |
Sprache: | Englisch |
Publikationsjahr: | 7 November 2016 |
Verlag: | IEEE |
Buchtitel: | Proceedings: 2016 IEEE 41st Conference on Local Computer Networks - LCN Workshops 2016 |
Veranstaltungstitel: | 41st IEEE Conference on Local Computer Networks Workshops |
Veranstaltungsort: | Dubai, UAE |
Veranstaltungsdatum: | 07.11.2016-10.11.2016 |
DOI: | 10.1109/LCN.2016.025 |
Kurzbeschreibung (Abstract): | The concept of workflow is used for modeling many of the data-intensive scientific applications executed on data grids. A Workflow is a series of interdependent tasks during which data is processed by different tasks. Scheduling the workflows in the grids is the process of assigning tasks to appropriate resources with the aim of achieving goals such as reducing workflow completion time while considering the data dependencies between the tasks. Data access time, processing time, and waiting time together constitute task completion time in the grids. Workflow scheduling aims to optimize these parameters in such a way that the workflow completion time decreases, and the system efficiency improves. In this paper, a scheduling model based on multi-objective optimization is proposed for scheduling data-intensive workflows in data grids. The scheduling model aims to optimize data communication cost, waiting time, and tasks processing time while considering data dependencies between the tasks. The model defines the data communication cost in terms of data transfer time in various communications between nodes (intra-and inter-cluster communications). This study uses four different Multi-Objective Evolutionary Algorithms (MOEAs) as well as Random Search (RS) algorithm to implement the proposed scheduling model. Convenient coding mechanisms for representing chromosomes, compatible crossover and mutation operators were also designed. Simulation results of the proposed scheduling model using different optimization algorithms are presented. The results are then assessed and compared based on different quality indicators. |
Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Data and AI Systems |
Hinterlegungsdatum: | 08 Feb 2023 09:53 |
Letzte Änderung: | 08 Feb 2023 09:53 |
PPN: | |
Export: | |
Suche nach Titel in: | TUfind oder in Google |
Frage zum Eintrag |
Optionen (nur für Redakteure)
Redaktionelle Details anzeigen |