Volume 4, Issue 3, November 2013, Pages 560–567
Farhad Soleimanian Gharehchopogh1, Majid Ahadi2, Isa Maleki3, Ramin Habibpour4, and Amin Kamalinia5
1 Department of Computer Engineering, Hacettepe University, Ankara, Turkey
2 Department of Computer Engineering, Science and Research Branch, Islamic Azad University, West Azerbaijan, Urmia, Iran
3 Department of Computer Engineering, Science and Research Branch, Islamic Azad University, West Azerbaijan, Urmia, Iran
4 Department of Computer Engineering, Science and Research Branch, Islamic Azad University, West Azerbaijan, Urmia, Iran
5 Department of Computer Engineering, Science and Research Branch, Islamic Azad University, West Azerbaijan, Urmia, Iran
Original language: English
Copyright © 2013 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Grid Computing is the technology of dividing computer networks with different and heterogeneous resources based on distribution computing. Grid computing has no limitation due to its geographical domain and the type of undercover resources. Generally, a grid network can be considered as a series of several big branches, different kinds of microprocessors, thousands of PC computers and workstations in all over the world. The goal of grid computing is to apply available computing resources easily for complicated calculations vie sites which are distributed geographically. In another words, the least cost for many users is to support parallelism, minimize the time of task operation and so on in scientific, trade and industrial contexts. To reach the goal, it is necessary to use an efficient scheduling system as a vital part for grid environment. Generally, scheduling plays very important role in grid networks. So, selecting the type of scheduling algorithm has an important role in optimizing the reply and waiting time which involve as two important factors. As providing scheduling algorithms which can minimize tasks runtime and increase operational power has remarkable importance in these categories. In this paper, we discuss about scheduling algorithms which involve independent algorithms such as Minimum Execution Time, Minimum Completion Time, Min-min, Max-min and XSuffrage.
Author Keywords: Grid Computing, Scheduling, Scheduling Algorithms, Network, Resource.
Farhad Soleimanian Gharehchopogh1, Majid Ahadi2, Isa Maleki3, Ramin Habibpour4, and Amin Kamalinia5
1 Department of Computer Engineering, Hacettepe University, Ankara, Turkey
2 Department of Computer Engineering, Science and Research Branch, Islamic Azad University, West Azerbaijan, Urmia, Iran
3 Department of Computer Engineering, Science and Research Branch, Islamic Azad University, West Azerbaijan, Urmia, Iran
4 Department of Computer Engineering, Science and Research Branch, Islamic Azad University, West Azerbaijan, Urmia, Iran
5 Department of Computer Engineering, Science and Research Branch, Islamic Azad University, West Azerbaijan, Urmia, Iran
Original language: English
Copyright © 2013 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
Grid Computing is the technology of dividing computer networks with different and heterogeneous resources based on distribution computing. Grid computing has no limitation due to its geographical domain and the type of undercover resources. Generally, a grid network can be considered as a series of several big branches, different kinds of microprocessors, thousands of PC computers and workstations in all over the world. The goal of grid computing is to apply available computing resources easily for complicated calculations vie sites which are distributed geographically. In another words, the least cost for many users is to support parallelism, minimize the time of task operation and so on in scientific, trade and industrial contexts. To reach the goal, it is necessary to use an efficient scheduling system as a vital part for grid environment. Generally, scheduling plays very important role in grid networks. So, selecting the type of scheduling algorithm has an important role in optimizing the reply and waiting time which involve as two important factors. As providing scheduling algorithms which can minimize tasks runtime and increase operational power has remarkable importance in these categories. In this paper, we discuss about scheduling algorithms which involve independent algorithms such as Minimum Execution Time, Minimum Completion Time, Min-min, Max-min and XSuffrage.
Author Keywords: Grid Computing, Scheduling, Scheduling Algorithms, Network, Resource.
How to Cite this Article
Farhad Soleimanian Gharehchopogh, Majid Ahadi, Isa Maleki, Ramin Habibpour, and Amin Kamalinia, “Analysis of Scheduling Algorithms in Grid Computing Environment,” International Journal of Innovation and Applied Studies, vol. 4, no. 3, pp. 560–567, November 2013.
