Cargando…
Application-aware deadline constraint job scheduling mechanism on large-scale computational grid
Recently, computational Grids have proven to be a good solution for processing large-scale, computation intensive problems. However, the heterogeneity, dynamics of resources and diversity of applications requirements have always been important factors affecting their performance. In response to thes...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6245787/ https://www.ncbi.nlm.nih.gov/pubmed/30458034 http://dx.doi.org/10.1371/journal.pone.0207596 |
_version_ | 1783372309475622912 |
---|---|
author | Tang, Xiaoyong Liao, Xiaoyi |
author_facet | Tang, Xiaoyong Liao, Xiaoyi |
author_sort | Tang, Xiaoyong |
collection | PubMed |
description | Recently, computational Grids have proven to be a good solution for processing large-scale, computation intensive problems. However, the heterogeneity, dynamics of resources and diversity of applications requirements have always been important factors affecting their performance. In response to these challenges, this work first builds a Grid job scheduling architecture that can dynamically monitor Grid computing center resources and make corresponding scheduling decisions. Second, a Grid job model is proposed to describe the application requirements. Third, this paper studies the characteristics of commercial interconnection networks used in Grids and forecast job transmission time. Fourth, this paper proposes an application-aware job scheduling mechanism (AJSM) that includes periodic scheduling flow and a heuristic application-aware deadline constraint job scheduling algorithm. The rigorous performance evaluation results clearly demonstrate that the proposed application-aware job scheduling mechanism can successful schedule more Grid jobs than the existing algorithms. For successful scheduled jobs, our proposed AJSM method is the best algorithm for job average processing time and makespan. |
format | Online Article Text |
id | pubmed-6245787 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-62457872018-11-30 Application-aware deadline constraint job scheduling mechanism on large-scale computational grid Tang, Xiaoyong Liao, Xiaoyi PLoS One Research Article Recently, computational Grids have proven to be a good solution for processing large-scale, computation intensive problems. However, the heterogeneity, dynamics of resources and diversity of applications requirements have always been important factors affecting their performance. In response to these challenges, this work first builds a Grid job scheduling architecture that can dynamically monitor Grid computing center resources and make corresponding scheduling decisions. Second, a Grid job model is proposed to describe the application requirements. Third, this paper studies the characteristics of commercial interconnection networks used in Grids and forecast job transmission time. Fourth, this paper proposes an application-aware job scheduling mechanism (AJSM) that includes periodic scheduling flow and a heuristic application-aware deadline constraint job scheduling algorithm. The rigorous performance evaluation results clearly demonstrate that the proposed application-aware job scheduling mechanism can successful schedule more Grid jobs than the existing algorithms. For successful scheduled jobs, our proposed AJSM method is the best algorithm for job average processing time and makespan. Public Library of Science 2018-11-20 /pmc/articles/PMC6245787/ /pubmed/30458034 http://dx.doi.org/10.1371/journal.pone.0207596 Text en © 2018 Tang, Liao http://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. |
spellingShingle | Research Article Tang, Xiaoyong Liao, Xiaoyi Application-aware deadline constraint job scheduling mechanism on large-scale computational grid |
title | Application-aware deadline constraint job scheduling mechanism on large-scale computational grid |
title_full | Application-aware deadline constraint job scheduling mechanism on large-scale computational grid |
title_fullStr | Application-aware deadline constraint job scheduling mechanism on large-scale computational grid |
title_full_unstemmed | Application-aware deadline constraint job scheduling mechanism on large-scale computational grid |
title_short | Application-aware deadline constraint job scheduling mechanism on large-scale computational grid |
title_sort | application-aware deadline constraint job scheduling mechanism on large-scale computational grid |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6245787/ https://www.ncbi.nlm.nih.gov/pubmed/30458034 http://dx.doi.org/10.1371/journal.pone.0207596 |
work_keys_str_mv | AT tangxiaoyong applicationawaredeadlineconstraintjobschedulingmechanismonlargescalecomputationalgrid AT liaoxiaoyi applicationawaredeadlineconstraintjobschedulingmechanismonlargescalecomputationalgrid |