Buradasınız

Anasayfa » Content

Analysis of Scheduling Algorithms in Grid Computing Environment

Journal Name:

  • International Journal of Innovation and Applied Studies

Publication Year:

  • 2013

Keywords (Original Language):

Author NameUniversity of Author
Bookmark/Search this post with
Abstract (Original Language): 
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.
  • 3
560
567
  • English

REFERENCES

References: 

[1] I. Gandotra, P. Abrol, P. Gupta, R. Uppa, and S. Singh, “Cloud Computing Over Cluster, Grid Computing: a Comparative
Analysis”, Journal of Grid and Distributed Computing, Vol. 1, no. 1, pp.1-4, 2011.
[2] I. Foster, Y. Zhao, I. Raicu, and S. Lu, “Cloud Computing and Grid Computing 360-Degree Compared”, IEEE Grid
Computing Environments Workshop (GCE 2008), Austin, TX, pp. 1-10, 2008.
[3] F. Berman, R. Wolski, H. Casanova, W. Cirne, H. Dail, M. Faerman, S. Figueira, J. Hayes, G. Obertelli, J. Schopf, G. Shao, S.
Smallen, S. Spring, A. Su, and D. Zagorodnov, “Adaptive computing on the grid using apples”, IEEE Trans. On Parallel and
Distributed Systems (TPDS), Vol. 14, No. 4, pp. 369-382, 2003.
[4] J. Broberg, S. Venugopal, and R. Buyya, “Market-oriented Grid and utility computing: The state-of-the-art and future
directions”, Journal of Grid Computing, Vol. 3, No. 6, pp. 255-276, 2008.
[5] C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, “Scheduling strategies for master-slave tasking
on heterogeneous processor platforms”, IEEE Trans. Parallel Distributed Systems, Vol. 15, pp. 319-330, 2004.
[6] O. Beaumont, A. Legrand, and Y. Robert, “Scheduling divisible workloads on heterogeneous platforms”, Parallel
Computing, Vol. 29, pp. 1121-1152, 2003.
[7] H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman, “Heuristics for Scheduling Parameter Sweep Applications in
Grid Environments”, In Ninth Heterogeneous Computing Workshop, IEEE Computer Society Press, pp. 349-363, 2000.
[8] E. Heymann, M. A. Senar, E. Luque, and M. Livny, “Adaptive scheduling for master-worker applications on the
computational grid”, Grid Computing - GRID 2000, Springer-Verlag LNCS, pp. 214-227, 2000.
[9] A. A. Khokhar, V. K. Prasanna, M. E. Shaaban, and C. L. Wang, “Heterogeneous computing: Challenges and
opportunities”, IEEE Computer, Vol. 26, No. 6, pp. 18-27, June 1993.
[10] J. P. Goux, S. Kulkarni, J. Linderoth, and M. Yoder, “An enabling framework for master worker applications on the
computational grid”, In Ninth IEEE International Symposium on High Performance Distributed Computing (HPDC’00),
IEEE Computer Society Press, 2000.
[11] Z. Yang, W. Zhao, W. Zhang, and S. Huang, “Research on trust model in autonomous domain of campus grid”,
International Conference on Computer Science and Service System (CSSS), Nanjing, pp. 1670-1672, 27-29 June 2011.
[12] I. Ahmad, S. Faheem, and G. Qasim, “MMOD: A General Resource Scheduling Algorithm for Computational Grid”,
International Conference on Emerging Technologies, Islamabad, pp. 141-144, 2007.
[13] E. Huedo, S.R. Montero, and I.M. Liorente, “Experiences on adaptive grid scheduling of parameter sweep applications”,
12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, pp. 28-33, 11-13 Feb 2004.
[14] J. Kolodziej and F. Xhafa, “Modelling of User Requirements and Behaviors in Computational Grids”, International
Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), Fukuoka, pp. 548-553, 4-6 Nov 2010.
[15] T.l. Casavant and J.G. Kuhl, “A taxonomy of scheduling in general-purpose distributed computing systems”, IEEE
Transactions on Software Engineering, Vol. 14, No. 2, pp. 141-154, Feb 1988.
[16] T.D. Braun, H.J. Siegel, N. Beck, L.L. Boloni, M. Maheswaran, A.I. Reuther, J.P. Robertson, M. D. Theys, B. Yao, D.
Hensgen, and R.F. Freund, “A Comparison Study of Eleven Static Heuristics for Mapping a Class of Independent Tasks
onto Heterogeneous Distributed Computing Systems”, Technical Report TR-ECE-00-4, School of Electrical and Computer
Engineering, Purdue University, Mar. 2000.
[17] M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, “Dynamic mapping of a class of independent tasks
onto heterogeneous computing systems”, J. Parallel Distrib. Comput, Vol. 59, pp. 107-121, 1999.
[18] T.D. Braun, H.J. Siegel, N. Beck, L.L. Boloni, M. Maheswaran, A.I. Reuther, J. P. Robertson, Mitchell D. Theys, and Bin Yao,
“A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed
Computing Systems”, Journal of Parallel and Distributed Computing, pp. 810-837, 2001.
[19] T. Andronikos and N. Koziris, “Optimal scheduling for UET-UCT grids into fixed number of processors”, 8th Euromicro
Workshop on Parallel and Distributed Processing, Rhodos, pp. 237-243, 2000.
[20] T. Andronikos, N. Koziris, G. Papakonstantinou, and P. Tsanakas, “Optimal Scheduling for UET-UCT Generalized n-
Dimensional Grid Task Graphs”, Proceedings of the 11th IEEE International Parallel Processing Symposium (IPPS97),
pp.146 -151, 1997.
[21] K. Christodoulopoulos, V. Sourlas, I. Mpakolas, and E. Varvarigos, “A comparison of centralized and distributed metascheduling
architectures for computation and communication tasks in Grid networks”, Journal Computer
Communications, Vol. 29, pp. 1172-1184, 2009.
Farhad Soleimanian Gharehchopogh, Majid Ahadi, Isa Maleki, Ramin Habibpour, and Amin Kamalinia
ISSN : 2028-9324 Vol. 4 No. 3, Nov. 2013 567
[22] O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, “Independent and divisible tasks scheduling on heterogeneous starshaped
platforms with limited memory”, Proceedings of the Conference on Parallel, Distributed and Network-Based
Processing (Euromicro-PDP’05), pp. 179-186, 2005.
[23] G.C. Sih and E. A. Lee, “A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor
architectures”, IEEE Trans. Parallel Distrib, pp. 175-186, 1993.
[24] R. Armstrong, D. Hensgen, and T. Kidd, “The relative performance of various mapping algorithms is independent of
sizable variances in run-time predictions”, in 7th IEEE Heterogeneous Computing Workshop (HCW '98), pp. 79-87, 1998.
[25] R.F. Freund, M. Gherrity, S. Ambrosius, M. Campbell, M. Halderman, D. Hensgen, E. Keith, T. Kidd, M. Kussow, J. D. Lima,
F. Mirabile, L. Moore, B. Rust, and H. J. Siegel, “Scheduling resources in multi-user, heterogeneous, computing
environments with SmartNet”, in 7th IEEE Heterogeneous Computing Workshop (HCW '98), pp. 184-199, 1998.
[26] L.Y. Tseng, Y.H. Chin, and S.C. Wang, “The Anatomy Study of High Performance Task Scheduling Algorithm for Grid
Computing System”, Computer Standards & Interfaces, Elsevier B.V, Vol. 31, pp. 713-722, 2009.
[27] O.M. Elzeki, M.Z. Rashad, and M.A. Elsoud, “Overview of Scheduling Tasks in Distributed Computing Systems”,
International Journal of Soft Computing and Engineering (IJSCE), Vol. 2, No. 3, pp. 470-475, July 2012.
[28] F. Alharbi, “Simple Scheduling Algorithm with Load Balancing for Grid Computing”, Asian Transactions on Computers
(ATC), Vol. 2, No. 2, pp. 8-15, 2012.
[29] R. Kaur, T. Kaur, and H. Kaur, “Scheduling in Grid Computing Environment”, International Journal of Advanced Research
in Computer Science and Software Engineering, Vol. 3, No. 6, pp. 455-458, June 2013.
[30] O.H. Ibarra and C.E. Kim, “Heuristic algorithms for scheduling independent tasks on no identical processors”, J. Assoc.
Comput., Vo. 24, No. 2, pp. 280-289, April 1977.

Thank you for copying data from http://www.arastirmax.com