Advance Reservation for Parametric Job on Grid Computing

Pujiyanta, Ardi; Nugroho, Lukito Edi; Widyawan,

doi:10.1109/icic47613.2019.8985978

Cited by 3 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All jobs sent to the grid will first find a place in the virtual view, whether there is an empty slot or not [25]. If an empty slot found, the job will be placed in the virtual view.…”

Section: Virtual View and Physical Viewmentioning

confidence: 99%

Job Scheduling on Grid Computing Using First Fit, Best Fit, and Worst Fit

Pujiyanta

Novianto

2022

khif

View full text Add to dashboard Cite

Grid computing can be considered large-scale distributed cluster computing and parallel distributed network processing. The two most important issues in managing user work are resource allocation and scheduling of required resources. When user jobs are submitted, they are managed by resource intermediaries who find and allocate the right resources. After the resource allocation stage, work scheduled on the existing resources according to the user's required resources. In most grid systems with traditional scheduling, jobs are submitted and placed in waiting room queues to wait for the required resources to become available. Each grid system can use a different scheduling algorithm to execute jobs based on other parameters, such as resources, delivery time, and execution duration. There is no guarantee that these traditional scheduling algorithms will get the job done. The First Come First Serve Left Right Hole Scheduling (FCFS-LRH) reservation strategy improves resource utilization in a grid system by using a local scheduler. Compared to traditional strategies. There are two objectives of this research. First, compare the first fit, best fit, and worst fit algorithms to find empty timeslots and place them in a virtual view. Second, reduce the idle time value. The results showed that the FCFS-LRH method could reduce the idle time value of the FCFS-EDF and FCFS methods. The overall execution time of the first fit with the FCFS-LRH strategy is better than the FCFS-EDF

show abstract

“…All jobs sent to the grid will first find a place in the virtual view, whether there is an empty slot or not [25]. If an empty slot found, the job will be placed in the virtual view.…”

Section: Virtual View and Physical Viewmentioning

confidence: 99%

Job Scheduling on Grid Computing Using First Fit, Best Fit, and Worst Fit

Pujiyanta

Novianto

2022

khif

View full text Add to dashboard Cite

show abstract

“…Jobs that are placed in a logical view are still fragmented. Recombination is achieved when a job is executed at the actual computing node [27] [28].…”

Section: Proposed Advanced Reservation Strategymentioning

confidence: 99%

Resource allocation model for grid computing environment

Pujiyanta

Nugroho

Widyawan

2020

Int. J. Adv. Intell. Informatics

Self Cite

View full text Add to dashboard Cite

Grid computing is a collection of heterogeneous resources that is highly dynamic and unpredictable. It is typically used for solving scientific or technical problems that require a large number of computer processing cycles or access to substantial amounts of data. Various resource allocation strategies have been used to make resource use more productive, with subsequent distributed environmental performance increases. The user sends a job by providing a predetermined time limit for running that job. Then, the scheduler gives priority to work according to the request and scheduling policy and places it in the waiting queue. When the resource is released, the scheduler selects the job from the waiting queue with a specific algorithm. Requests will be rejected if the required resources are not available. The user can re-submit a new request by modifying the parameter until available resources can be found. Eventually, there is a decrease in idle resources between work and resource utilization, and the waiting time will increase. An effective scheduling policy is required to improve resource use and reduce waiting times. In this paper, the FCFS-LRH method is proposed, where jobs received will be sorted by arrival time, execution time, and the number of resources needed. After the sorting process, the work will be placed in a logical view, and the job will be sent to the actual resource when it executes. The experimental results show that the proposed model can increase resource utilization by 1.34% and reduce waiting time by 20.47% when compared to existing approaches. This finding could be beneficially implemented in cloud systems resource allocation management.

show abstract

A New Task Scheduling Algorithm for GRID Systems with Non-alienable Resources

Uzdenov

2021

Studies in Systems, Decision and Control

View full text Add to dashboard Cite

Advance Reservation for Parametric Job on Grid Computing

Cited by 3 publications

References 15 publications

Job Scheduling on Grid Computing Using First Fit, Best Fit, and Worst Fit

Job Scheduling on Grid Computing Using First Fit, Best Fit, and Worst Fit

Resource allocation model for grid computing environment

A New Task Scheduling Algorithm for GRID Systems with Non-alienable Resources

Contact Info

Product

Resources

About