An ant algorithm for balanced job scheduling in grids

Reed, 2003, Grids, the TeraGrid, and Beyond, IEEE Computer, 36, 62, 10.1109/MC.2003.1160057 BOINC website, http://boinc.berkeley.edu/ D. Kondo, D.P. Anderson, J. McLeod, Performance evaluation of scheduling policies for volunteer computing, in: Proc. IEEE International Conference on e-Science and Grid Computing, Dec. 2007, pp. 415–422 Chang, 2007, Job scheduling and data replication on data grids, Future Generation Computer Systems, 23, 846, 10.1016/j.future.2007.02.008 Gao, 2005, Adaptive grid job scheduling with genetic algorithms, Future Generation Computer Systems, 21, 151, 10.1016/j.future.2004.09.033 Byun, 2007, MJSA: Markov job scheduler based on availability in desktop grid computing environment, Future Generation Computer Systems, 23, 616, 10.1016/j.future.2006.09.004 F. Dong, S.K. Akl, Scheduling algorithms for grid computing: State of the art and open problems, Technical Report No. 2006-504, School of Computing, Queen’s University, Kingston, Ontario, Canada, January 2006 Dorigo, 2005, Ant colony optimization theory: A survey, Theoretical Computer Science, 344, 243, 10.1016/j.tcs.2005.05.020 M. Dorigo, Ant colony optimization, http://www.aco-metaheuristic.org Dorigo, 1997, Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1, 53, 10.1109/4235.585892 E. Salari, K. Eshghi, An ACO algorithm for graph coloring problem, in: Congress on Computational Intelligence Methods and Applications, 15–17 Dec. 2005, p. 5 Xiaoxia Zhang, Lixin Tang, CT-ACO—hybridizing ant colony optimization with cycle transfer search for the vehicle routing problem, in: Congress on Computational Intelligence Methods and Applications, 15–17 Dec. 2005, p. 6 H. Yan, X. Qin, X. Li, M.-H. Wu, An improved ant algorithm for job scheduling in grid computing, in: Proceedings of 2005 International Conference on Machine Learning and Cybernetics, vol. 5, 18–21 Aug. 2005, pp. 2957–2961 Saha, 1995, Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures, Journal of Parallel and Distributed Computing, 28, 1, 10.1006/jpdc.1995.1085 Paranhos, 2003, Trading cycles for information: Using replication to schedule bag-of-tasks applications on computational grids, vol. 2790, 169 T. Stutzle, MAX-MIN Ant System for Quadratic Assignment Problems Technical Report AIDA-97-04, Intellectics Group, Department of Compute Science, Darmstadt University of Technology, Germany, July 1997 Bullnheimer, 1999, A new rank-based version of the ant system: A computational study, Central European Journal for Operations Research and Economics, 7, 25 E.D. Taillard, L.M. Gambardella, Adaptive memories for the quadratic assignment problem, Technical Report IDSIA-87-97, IDSIA, Lugano, Switzerland, 1997 Dorigo, 1996, The ant system: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics, Part B, 26, 29, 10.1109/3477.484436 Kwang Mong Sim, Weng Hong, Sun, Multiple ant-colony optimization for network routing, in: Proceedings of the First International Symposium on Cyber Worlds, 6–8 Nov. 2002, pp. 277–281 Heinonen, 2007, Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem, Applied Mathematics and Computation, 187, 989, 10.1016/j.amc.2006.09.023 Jianfu Li, Wei Zhang, Solution to multi-objective optimization of flow shop problem based on ACO algorithm, in: Proceeding of 2006 International Conference Computational Intelligence and Security, vol. 1, Nov. 2006, pp. 417–420 Burke, 2005, An ant algorithm hyperheuristic for the project presentation scheduling problem, IEEE Congress on Evolutionary Computing, 3, 2263, 10.1109/CEC.2005.1554976 Walter, 2007, An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria, Computers & Operations Research, 41, 645 Silberschatz, 2005 Maheswaran, 1999, Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing system, Journal of Parallel and Distributed Computing, 59, 107, 10.1006/jpdc.1999.1581 Taiwan unigrid project portal site, http://www.unigrid.org.tw Network Weather Service (NWS), http://nws.cs.ucsb.edu/ewiki/ Globus Toolkit v4, http://www.globus.org/toolkit/downloads/4.0.4/ V. Sarkar, Determining average program execution times and their variance, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1989, pp. 298–312 Park, 1993, Predicting program execution times by analyzing static and dynamic program paths, Real-Time Systems, 5, 31, 10.1007/BF01088696 J. Engblom, A. Ermedahl, Modeling complex flows for worst-case execution time analysis, in: Proceedings of the 21st IEEE Real-Time Systems Symposium, 2000, pp. 163–174 Stappert, 2000, Complete worst-case execution time analysis of straight-line hard real-time programs, Journal of Systems Architecture, 46, 339, 10.1016/S1383-7621(99)00010-7 Zhang, 2008, Predict task running time in grid environments based on CPU load predictions, Future Generation Computer Systems, 24, 489, 10.1016/j.future.2007.07.003 The globus alliance, http://www.globus.org/ Academia sinica, http://www.sinica.edu.tw/ National Center for High Performance Computing, http://www.nchc.org.tw/ Hsing Kuo University of Management (HKU), http://www.hku.edu.tw National Dong Hwa University (NDHU), http://www.ndhu.edu.tw Daniel P. Bovet, Marco Cesati, Understanding the Linux Kernel, O’reilly Media, Oct. 2000 Henderson, 1995, Job scheduling under the portable batch system, vol. 949, 279 Load sharing facility, http://www.platform.com/Products/platform-lsf GLPK, http://www.gnu.org/software/glpk/ Bland, 1981, Ellipsoid method, a survey, Operations Research, 29, 1039, 10.1287/opre.29.6.1039