Abstract
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techniques present common problems related to the use of inaccurate and out-of-date information, which degrade the global system performance. Besides that, they also do not properly model a grid environment. In order to adequately model a real grid environments and approach the scheduling using updated information, this paper uses complex network models and the simulated annealing optimization technique. The complex network concepts are used to better model the grid and extract environment characteristics, such as the degree distribution, the geodesic path, latency. The complex network vertices represent grid process elements, which are generalized as computers. The random and scale free models were implemented in a simulator. These models, associated with Dijkstra algorithm, helps the simulated annealing technique to find out efficient allocation solutions, which minimize the application response time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ranaweera, S., Agrawal, D.P.: A task duplication based scheduling algorithm for heterogeneous systems. In: IPDPS 2000. Parallel and Distributed Processing Symposium, pp. 445–450 (2000)
Choe, T., Park, C.: A task duplication based scheduling algorithm with optimality condition in heterogeneous systems. In: ICPPW 2002. International Conference on Parallel Processing Workshops, pp. 531–536. IEEE Computer Society Press, Los Alamitos (2002)
Keren, A., Barak, A.: Opportunity cost algorithms for reduction of i/o and interprocess communication overhead in a computing cluster. IEEE Transactions on Parallel and Distributed Systems 14, 39–50 (2003)
Wang, Q., Zhang, L.: Improving grid scheduling of pipelined data processing by combining heuristic algorithms and simulated annealing. In: IMSCCS 2006. First International Multi-Symposiums on Computer and Computational Sciences, vol. 1, pp. 583–588 (2006)
Pop, F., Dobre, C., Godza, G., Cristea, V.: A simulation model for grid scheduling analysis and optimization. In: PAR ELEC 2006. International Symposium on Parallel Computing in Electrical Engineering, pp. 133–138 (2006)
Feitelson, D.G.: Packing schemes for gang scheduling. In: IPPS 1996. Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing, London, UK, pp. 89–110. Springer, Heidelberg (1996)
Zhao, L., Lai, Y.-C., Park, K., Ye, N.: Onset of traffic congestion in complex networks. Phys. Rev. E Stat. Nonlin. Soft Matter Phys. 71, 26–125 (2005)
Costa, L.F., Travieso, G., Ruggiero, C.A.: Complex grid computing. The European Physical Journal B - Condensed Matter 44(1), 119–128 (2005)
Aggarwal, A.K., Aggarwal, M.: A unified scheduling algorithm for grid applications. In: HPCS 2006. 20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment, pp. 1–1 (2006)
Zheng, Q., Yang, H., Sun, Y.: How to avoid herd: a novel stochastic algorithm in grid scheduling. In: 15th IEEE International Symposium on High Performance Distributed Computing, pp. 267–278. IEEE Computer Society Press, Los Alamitos (2006)
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44, 486–504 (1997)
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)
Erdos, P., Renyi, A.: On random graphs. Publicationes Mathematicae 6, 290–297 (1959)
Barabasi, Albert: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ networks. Nature 393, 440–442 (1998)
Buchanan, M.: Nexus - Small Worlds and the Groundbreaking Science of Networks. W. W. Norton & Company (2002)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science, Number 4598, 220 (4598), 671–680 (1983)
Albert, R., Barabasi, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47–101 (2002)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM 1999. Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp. 251–262. ACM Press, New York (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishii, R.P., de Mello, R.F., Yang, L.T. (2007). A Complex Network-Based Approach for Job Scheduling in Grid Environments. In: Perrott, R., Chapman, B.M., Subhlok, J., de Mello, R.F., Yang, L.T. (eds) High Performance Computing and Communications. HPCC 2007. Lecture Notes in Computer Science, vol 4782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75444-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-75444-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75443-5
Online ISBN: 978-3-540-75444-2
eBook Packages: Computer ScienceComputer Science (R0)