Bio-Inspired Workflow Scheduling on HPC Platforms
Efficient scheduling of tasks in workflows of cloud or grid applications is a key to achieving better utilization of resources as well as timely completion of the user jobs. Many scientific applications comprise several tasks that are dependent in nature and are specified by workflow graphs. The aim...
| Permalink: | http://skupnikatalog.nsk.hr/Record/nsk.NSK01001163126/Details |
|---|---|
| Matična publikacija: |
Tehnički glasnik (Online) 15 (2021), 1 ; str. 60-68 |
| Glavni autori: | Kaur, Mandeep (Author), Kadam, Sanjay |
| Vrsta građe: | e-članak |
| Jezik: | eng |
| Online pristup: |
https://doi.org/10.31803/tg-20210204183323 Elektronička verzija članka |
| LEADER | 02785naa a22003254i 4500 | ||
|---|---|---|---|
| 001 | NSK01001163126 | ||
| 003 | HR-ZaNSK | ||
| 005 | 20230213111108.0 | ||
| 006 | m d | ||
| 007 | cr|||||||||||| | ||
| 008 | 230213s2021 ci |o |0|| ||eng | ||
| 024 | 7 | |2 doi |a 10.31803/tg-20210204183323 | |
| 035 | |a (HR-ZaNSK)001163126 | ||
| 040 | |a HR-ZaNSK |b hrv |c HR-ZaNSK |e ppiak | ||
| 041 | 0 | |a eng | |
| 042 | |a croatica | ||
| 044 | |a ci |c hr | ||
| 080 | 1 | |2 2011 | |
| 100 | 1 | |a Kaur, Mandeep |4 aut |9 HR-ZaNSK | |
| 245 | 1 | 0 | |a Bio-Inspired Workflow Scheduling on HPC Platforms |h [Elektronička građa] |c Mandeep Kaur, Sanjay Kadam. |
| 300 | |b Ilustr. | ||
| 504 | |a Bibliografija: | ||
| 504 | |a Summary. | ||
| 520 | |a Efficient scheduling of tasks in workflows of cloud or grid applications is a key to achieving better utilization of resources as well as timely completion of the user jobs. Many scientific applications comprise several tasks that are dependent in nature and are specified by workflow graphs. The aim of the cloud meta-scheduler is to schedule the user application tasks (and the applications) so as to optimize the resource utilization and to execute the user applications in minimum amount of time. During the past decade, there have been several attempts to use bio-inspired scheduling algorithms to obtain an optimal or near optimal schedule in order to minimize the overall schedule length and to optimize the use of resources. However, as the number of tasks increases, the solution space comprising different tasks-resource mapping sequences increases exponentially. Hence, there is a need to devise mechanisms to improvise the search strategies of the bio-inspired scheduling algorithms for better scheduling solutions in lesser number of iterations/time. The objective of the research work in this paper is to use bio-inspired bacteria foraging optimization algorithm (BFOA) along with other heuristics algorithms for better search of the scheduling solution space for multiple workflows. The idea is to first find a schedule by the heuristic algorithms such as MaxMin, MinMin, and Myopic, and use these as initial solutions (along with other randomly generated solutions) in the search space to get better solutions using BFOA. The performance of our approach with the existing approaches is compared for quality of the scheduling solutions. The results demonstrate that our hybrid approach (MinMin/Myopic with BFOA) outperforms other approaches. | ||
| 700 | 1 | |a Kadam, Sanjay |4 aut |9 HR-ZaNSK | |
| 773 | 0 | |t Tehnički glasnik (Online) |x 1848-5588 |g 15 (2021), 1 ; str. 60-68 |w nsk.(HR-ZaNSK)000810940 | |
| 981 | |b Be2021 | ||
| 856 | 4 | 0 | |u https://doi.org/10.31803/tg-20210204183323 |
| 856 | 4 | 0 | |u https://hrcak.srce.hr/253023 |y Elektronička verzija članka |
| 856 | 4 | 1 | |y Digitalna.nsk.hr |