Resource allocation model for grid computing environment
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 strate...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | EJournal Article |
| Published: |
Universitas Ahmad Dahlan,
2020-07-12.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 02909 am a22002893u 4500 | ||
|---|---|---|---|
| 001 | IJAIN_496_ijain_v6i2_p185-196 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Pujiyanta, Ardi |e author |
| 100 | 1 | 0 | |e contributor |
| 700 | 1 | 0 | |a Edi Nugroho, Lukito |e author |
| 700 | 1 | 0 | |a Widyawan, Widyawan |e author |
| 245 | 0 | 0 | |a Resource allocation model for grid computing environment |
| 260 | |b Universitas Ahmad Dahlan, |c 2020-07-12. | ||
| 500 | |a https://ijain.org/index.php/IJAIN/article/view/496 | ||
| 520 | |a 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. | ||
| 540 | |a Copyright (c) 2020 Ardi Pujiyanta, Lukito Edi Nugroho, Widyawan Widyawan | ||
| 540 | |a https://creativecommons.org/licenses/by-sa/4.0 | ||
| 546 | |a eng | ||
| 690 | |a FCFS-LRH, Grid computing, Resource allocation, Resource utilization, Waiting time | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |2 local | |
| 786 | 0 | |n International Journal of Advances in Intelligent Informatics; Vol 6, No 2 (2020): July 2020; 185-196 | |
| 786 | 0 | |n 2548-3161 | |
| 786 | 0 | |n 2442-6571 | |
| 787 | 0 | |n https://ijain.org/index.php/IJAIN/article/view/496/ijain_v6i2_p185-196 | |
| 856 | 4 | 1 | |u https://ijain.org/index.php/IJAIN/article/view/496/ijain_v6i2_p185-196 |z Get Fulltext |