Cite Article

Job Scheduling Strategies in Grid Computing

Choose citation format

BibTeX

@article{IJASEIT10147,
   author = {Ardi Pujiyanta and Lukito Edi Nugroho and - Widyawan},
   title = {Job Scheduling Strategies in Grid Computing},
   journal = {International Journal on Advanced Science, Engineering and Information Technology},
   volume = {12},
   number = {3},
   year = {2022},
   pages = {1293--1300},
   keywords = {Advance reservation; MPI Job; FCFS-LRH; grid systems.},
   abstract = {Grid computing can be thought of as large-scale distributed cluster computing and distributed parallel network processing. Users can obtain enormous computing power through network technology, which is challenging to get from a single computer. Job scheduling in grid computing is a critical issue that affects the overall grid system capability. In traditional scheduling, jobs are placed in queues, waiting for the availability of resources. Reservations reject if the required resources not obtained at the specified time. The impact that arises is the reduced use of resources. The scheduling algorithm and the parameters used to perform the work may vary, such as execution time, delivery time, and the number of resources. There is no guarantee when the job will execute using the scheduling algorithm. Therefore, it is necessary to improve resource utilization in the grid system and ensure that jobs will be carried out. This paper proposes a reservation scheduling strategy for MPI work, First Come First Serve Left Right Hole (FCFS-LRH). MPI jobs execute simultaneously, using more than one resource for implementation. When Completed, user MPI jobs will be scheduled on virtual compute nodes and mapped to actual compute nodes. The experimental results show that the increase in resource utilization strongly influenced by time flexibility.},
   issn = {2088-5334},
   publisher = {INSIGHT - Indonesian Society for Knowledge and Human Development},
   url = {http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=10147},
   doi = {10.18517/ijaseit.12.3.10147}
}

EndNote

%A Pujiyanta, Ardi
%A Edi Nugroho, Lukito
%A Widyawan, -
%D 2022
%T Job Scheduling Strategies in Grid Computing
%B 2022
%9 Advance reservation; MPI Job; FCFS-LRH; grid systems.
%! Job Scheduling Strategies in Grid Computing
%K Advance reservation; MPI Job; FCFS-LRH; grid systems.
%X Grid computing can be thought of as large-scale distributed cluster computing and distributed parallel network processing. Users can obtain enormous computing power through network technology, which is challenging to get from a single computer. Job scheduling in grid computing is a critical issue that affects the overall grid system capability. In traditional scheduling, jobs are placed in queues, waiting for the availability of resources. Reservations reject if the required resources not obtained at the specified time. The impact that arises is the reduced use of resources. The scheduling algorithm and the parameters used to perform the work may vary, such as execution time, delivery time, and the number of resources. There is no guarantee when the job will execute using the scheduling algorithm. Therefore, it is necessary to improve resource utilization in the grid system and ensure that jobs will be carried out. This paper proposes a reservation scheduling strategy for MPI work, First Come First Serve Left Right Hole (FCFS-LRH). MPI jobs execute simultaneously, using more than one resource for implementation. When Completed, user MPI jobs will be scheduled on virtual compute nodes and mapped to actual compute nodes. The experimental results show that the increase in resource utilization strongly influenced by time flexibility.
%U http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=10147
%R doi:10.18517/ijaseit.12.3.10147
%J International Journal on Advanced Science, Engineering and Information Technology
%V 12
%N 3
%@ 2088-5334

IEEE

Ardi Pujiyanta,Lukito Edi Nugroho and - Widyawan,"Job Scheduling Strategies in Grid Computing," International Journal on Advanced Science, Engineering and Information Technology, vol. 12, no. 3, pp. 1293-1300, 2022. [Online]. Available: http://dx.doi.org/10.18517/ijaseit.12.3.10147.

RefMan/ProCite (RIS)

TY  - JOUR
AU  - Pujiyanta, Ardi
AU  - Edi Nugroho, Lukito
AU  - Widyawan, -
PY  - 2022
TI  - Job Scheduling Strategies in Grid Computing
JF  - International Journal on Advanced Science, Engineering and Information Technology; Vol. 12 (2022) No. 3
Y2  - 2022
SP  - 1293
EP  - 1300
SN  - 2088-5334
PB  - INSIGHT - Indonesian Society for Knowledge and Human Development
KW  - Advance reservation; MPI Job; FCFS-LRH; grid systems.
N2  - Grid computing can be thought of as large-scale distributed cluster computing and distributed parallel network processing. Users can obtain enormous computing power through network technology, which is challenging to get from a single computer. Job scheduling in grid computing is a critical issue that affects the overall grid system capability. In traditional scheduling, jobs are placed in queues, waiting for the availability of resources. Reservations reject if the required resources not obtained at the specified time. The impact that arises is the reduced use of resources. The scheduling algorithm and the parameters used to perform the work may vary, such as execution time, delivery time, and the number of resources. There is no guarantee when the job will execute using the scheduling algorithm. Therefore, it is necessary to improve resource utilization in the grid system and ensure that jobs will be carried out. This paper proposes a reservation scheduling strategy for MPI work, First Come First Serve Left Right Hole (FCFS-LRH). MPI jobs execute simultaneously, using more than one resource for implementation. When Completed, user MPI jobs will be scheduled on virtual compute nodes and mapped to actual compute nodes. The experimental results show that the increase in resource utilization strongly influenced by time flexibility.
UR  - http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=10147
DO  - 10.18517/ijaseit.12.3.10147

RefWorks

RT Journal Article
ID 10147
A1 Pujiyanta, Ardi
A1 Edi Nugroho, Lukito
A1 Widyawan, -
T1 Job Scheduling Strategies in Grid Computing
JF International Journal on Advanced Science, Engineering and Information Technology
VO 12
IS 3
YR 2022
SP 1293
OP 1300
SN 2088-5334
PB INSIGHT - Indonesian Society for Knowledge and Human Development
K1 Advance reservation; MPI Job; FCFS-LRH; grid systems.
AB Grid computing can be thought of as large-scale distributed cluster computing and distributed parallel network processing. Users can obtain enormous computing power through network technology, which is challenging to get from a single computer. Job scheduling in grid computing is a critical issue that affects the overall grid system capability. In traditional scheduling, jobs are placed in queues, waiting for the availability of resources. Reservations reject if the required resources not obtained at the specified time. The impact that arises is the reduced use of resources. The scheduling algorithm and the parameters used to perform the work may vary, such as execution time, delivery time, and the number of resources. There is no guarantee when the job will execute using the scheduling algorithm. Therefore, it is necessary to improve resource utilization in the grid system and ensure that jobs will be carried out. This paper proposes a reservation scheduling strategy for MPI work, First Come First Serve Left Right Hole (FCFS-LRH). MPI jobs execute simultaneously, using more than one resource for implementation. When Completed, user MPI jobs will be scheduled on virtual compute nodes and mapped to actual compute nodes. The experimental results show that the increase in resource utilization strongly influenced by time flexibility.
LK http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=10147
DO  - 10.18517/ijaseit.12.3.10147