Efficient grid scheduling through the incremental schedule-based approach

Computational Intelligence

Volumn 27, Issue 1, 2011, Pages 4-22

  Klusáček, Dalibor ^a   Rudová, Hana ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Grid computing; heuristic; incremental approach; local search; policy; scheduling

Indexed keywords

COMPUTATIONAL GRIDS; DYNAMIC CHARACTER; FIRST COME FIRST SERVED; GRID SCHEDULING; GRID USERS; HEURISTIC; INCREMENTAL APPROACH; LOCAL SEARCH; ON-MACHINES; POLICY; RUNTIMES; TABU SEARCH ALGORITHMS;

GRID COMPUTING; RESPONSE TIME (COMPUTER SYSTEMS); TABU SEARCH;

SCHEDULING ALGORITHMS;

EID: 79951779654     PISSN: 08247935     EISSN: 14678640     Source Type: Journal    
DOI: 10.1111/j.1467-8640.2010.00369.x     Document Type: Conference Paper

References (42)

1. Abraham, A., R. Buyya, and, B. Nath,. 2000. Nature's heuristics for scheduling jobs on computational Grids. In The 8th IEEE International Conference on Advanced Computing and Communications (ADCOM 2000), Los Alamitos, CA, pp. 45-52.
2. Abraham, A., H. Liu, C. Grosan, and, F. Xhafa,. 2008. Nature inspired meta-heuristics for grid scheduling: Single and multi-objective optimization approaches. In Metaheuristics for Scheduling in Distributed Computing Environments, Volume 146 of Studies in Computational Intelligence, Berlin, Germany: Springer, pp. 247-272.
3. Abramson, D., R. Buyya, M. Murshed, and, S. Venugopal,. 2005. Scheduling parameter sweep applications on global Grids: A deadline and budget constrained cost-time optimisation a (Pubitemid 40479560)
4. Armentano V. A., and, D. S. Yamashita,. 2000. Tabu search for scheduling on identical parallel machines to minimize mean tardiness. Journal of Intelligent Manufacturing, 11: 453-460. (Pubitemid 32067227)
5. Baraglia, R., R. Ferrini, and, P. Ritrovato,. 2005. A static mapping heuristics to map parallel applications to heterogeneous computing systems: Research articles. Concurrency and Computation: Practice and Experience, 17 (13): 1579-1605. (Pubitemid 41560623)
6. Blazewicz, J., J. K. Lenstra, and, A. H. G. Rinnooy Kan,. 1983. Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics, 5 (1): 11-24.
7. Brucker, P., 1998. Scheduling Algorithms. Springer Verlag, Berlin, Germany.
8. Brucker, P., A. Drexl, R. Möhring, K. Neumann, and, E. Pesch,. 1999. Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112 (1): 3-41.
9. Buyya R., and, M. Murshed,. 2002. GridSim: A toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing. The Journal of Concurrency and Computation: Practice and Experience, 14: 1175-1220.
10. Capannini, G., R. Baraglia, D. Puppin, L. Ricci, and, M. Pasquali,. 2007. A job scheduling framework for large computing farms. In SC '07: Proceedings of the 2007 ACM/IEEE Conference on Supercomputing, ACM, New York, pp. 1-10.
11. Carretero, J., and, F. Xhafa,. 2006. Using genetic algorithms for scheduling jobs in large scale grid applications. Journal of Technological and Economic Development-A Research Journal of Vilnius Gediminas Technical University, 12 (1): 11-17. (Pubitemid 43563211)
12. Moab workload manager administrator's guide, version 6.0.0. Cluster Resources, December 2010.
13. Epema, D., S. Anoep, C. Dumitrescu, A. Iosup, M. Jan, H. Li, and, L. Wolters,. 2010. Grid workloads archive, December 2010.
14. Feitelson, D. G., 2010. Parallel workloads archive, December 2010.
15. Feitelson, D. G., and, A. M. Weil,. 1998. Utilization and predictability in scheduling the IBM SP2 with backfilling. In Parallel Processing Symposium, International, IEEE, Los Alamitos, CA, pp. 542-546.
16. Fibich, P., L. Matyska, and, H. Rudová,. 2005. Model of Grid scheduling problem. In Exploring Planning and Scheduling for Web Services, Grid and Autonomic Computing, AAAI Press. Technical Report WS-05-03, Menlo Park, CA, pp. 17-24.
17. Foster, I., and, C. Kesselman,. 1998. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco, CA.
18. Gentzsch, W., 2001. Sun Grid Engine: towards creating a compute power grid. In Proceedings of the First IEEE/ACM International Symposium on Cluster Computing and the Grid, Los Alamitos, CA, pp. 35-36.
19. Glover, F. W., and, G. A. Kochenberger, editors. 2003. Handbook of Metaheuristics. Kluwer, Dordrecht, the Netherlands.
20. Glover, F. W., and, M. Laguna,. 1998. Tabu search. Kluwer, Boston, MA.
21. Graham, R. L., E. L. Lawler, J. K. Lenstra, and, A. H. G. Rinnooy Kan,. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5: 287-326.
22. Hoos, H. H., and, T. Stützle,. 2005. Stochastic Local Search Foundations and Applications. Elsevier, San Francisco.
23. Hovestadt, M., O. Kao, A. Keller, and, A. Streit,. 2003. Scheduling in HPC resource management systems: Queuing vs. planning. In Job Scheduling Strategies for Parallel Processing, volume 2862 of LNCS, Springer, Berlin, Germany, pp. 1-20.
24. Huedo, E., R. Montero, and, I. Llorente,. 2005. The GridWay framework for adaptive scheduling and execution on Grids. Scalable Computing: Practice and Experience, 6 (3): 1-8.
25. Jones, J. P., 2005. PBS Professional 7, administrator guide. Altair.
26. KlusáÄek, D., L. Matyska, and, H. Rudová,. 2008a. Alea-Grid scheduling simulation environment. In 7th International Conference on Parallel Processing and Applied Mathematics (PPAM 2007), volume 4967 of LNCS, Springer, Berlin, Germany, pp. 1029-1038.
27. KlusáÄek, D., H. Rudová, R. Baraglia, M. Pasquali, and, G. Capannini,. 2008b. Comparison of multi-criteria scheduling techniques. In Grid Computing Achievements and Prospects, Springer, Berlin, Germany, pp. 173-184.
28. Pinedo, M., 2005. Planning and scheduling in manufacturing and services. Springer, Heidelberg, Germany.
29. Ritchie, G., and, J. Levine,. 2003. A fast, effective local search for scheduling independent jobs in heterogeneous computing environments. Technical Report, Centre for Intelligent Systems and their Applications, University of Edinburgh.
30. Shmueli, E., and, D. G. Feitelson,. 2003. Backfilling with lookahead to optimize the performance of parallel job scheduling. In Job Scheduling Strategies for Parallel Processing, volume 2862 of LNCS, Springer, Berlin, Germany, pp. 228-251.
31. Skovira, J., W. Chan, H. Zhou, and, D. A. Lifka,. 1996. The EASY-LoadLeveler API Project. In Job Scheduling Strategies for Parallel Processing, volume 1162 of LNCS, Berlin, Germany, Springer, pp. 41-47.
32. Smith, W., I. Foster, and, V. Taylor,. 2000. Scheduling with advanced reservations. In International Parallel and Distributed Processing Symposium (IPDPS '00), Los Alamitos, CA, pp. 127-132. (Pubitemid 30591228)
33. Stucky, K.-U., W. Jakob, A. Quinte, and, W. SüÃ,. 2006. Solving scheduling problems in Grid resource management using an evolutionary algorithm. In On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE, volume 4276 of LNCS, Springer, Berlin, Germany, pp. 1252-1262. (Pubitemid 44891903)
34. Subrata, R., A. Y. Zomaya, and, B. Landfeldt,. 2007. Artificial life techniques for load balancing in computational Grids. Journal of Computer and System Sciences, 73 (8): 1176-1190. (Pubitemid 47531811)
35. SüÃ, W., W. Jakob, A. Quinte, and, K.-U. Stucky,. 2005. GORBA: A global optimising resource broker embedded in a Grid resource management system. In International Conference on Parallel and Distributed Computing Systems, PDCS 2005, IASTED/ACTA Press, Calgary, AB, pp. 19-24.
36. Tang, X., and, S. T. Chanson,. 2000. Optimizing static job scheduling in a network of heterogeneous computers. In ICPP '00: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing, IEEE, Los Alamitos, CA, pp. 373-382.
37. Techiouba, A. D., G. Capannini, R. Baraglia, D. Puppin, and, M. Pasquali,. 2008. Backfilling strategies for scheduling streams of jobs on computational farms. In Making Grids Work, Springer, Berlin, Germany, pp. 103-115.
38. Thain, D., T. Tannenbaum, and, M. Livny,. 2005. Distributed computing in practice: the Condor experience. Concurrency and Computation: Practice and Experience, 17 (2-4): 323-356. (Pubitemid 40285781)
39. T'kindt, V., and, J.-C. Billaut,. 2006. Multicriteria Scheduling, Theory, Models and Algorithms (2nd ed.). Springer, Berlin, Germany.
40. Tsafrir, D., and, D. G. Feitelson,. 2006. The dynamics of backfilling: solving the mystery of why increased inaccuracy may help. In IEEE International Symposium on Workload Characterization (IISWC), IEEE, Los Alamitos, CA, pp. 131-141.
41. Xhafa, F., and, A. Abraham,. 2008. Meta-heuristics for grid scheduling problems. In Metaheuristics for Scheduling in Distributed Computing Environments, volume 146 of Studies in Computational Intelligence, Springer, Berlin, Germany, pp. 1-37.
42. Xu M. Q., 2001. Effective metacomputing using LSF multicluster. In CCGRID'01: Proceedings of the First International Symposium on Cluster Computing and the Grid, IEEE, Los Alamitos, CA, pp. 100-105.