Performance comparison of six efficient pure heuristics for scheduling meta-tasks on heterogeneous distributed environments

Neural Network World

Volumn 19, Issue 6, 2009, Pages 695-710

  Izakian, Hesam ^a   Abraham, Ajith ^a   Snášel, Václav ^b  

^a Machine Intelligence Research Labs MIR Labs   (Czech Republic)

^b VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

Flowtime; Heterogeneous distributed environments; Makespan; Pure heuristic; Scheduling

Indexed keywords

CONVERGENCE BEHAVIORS; DISTRIBUTED COMPUTING SYSTEMS; DISTRIBUTED ENVIRONMENTS; FLOW-TIME; HETEROGENEOUS ENVIRONMENTS; HEURISTIC SCHEDULING; MAKESPAN; META HEURISTIC ALGORITHM; META-HEURISTIC APPROACH; META-HEURISTIC METHODS; MINIMIZING MAKESPAN; NP COMPLETE PROBLEMS; PERFORMANCE COMPARISON; REAL WORLD SITUATIONS; SCHEDULING TASKS;

CONVERGENCE OF NUMERICAL METHODS; HEURISTIC ALGORITHMS; SCHEDULING ALGORITHMS; SIMULATED ANNEALING;

HEURISTIC METHODS;

EID: 76749100804     PISSN: 12100552     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Ali S., Braun T. D., Siegel H. J., Maciejcwski A. A.: Heterogeneous computing. Encyclopedia of Distributed Computing, Kluwcr Academic, 2001.
2. Braun T. D., Siegel H. J., Beck N., Boloni L. L., Maheswaran M., Reuthcr A. I., Robertson J. P., Theys M. D., Yao B.: A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing, 61, 2001, pp. 810-837. (Pubitemid 33658407)
3. Fcrnandcz-Baca D.: Allocating modules to processors in a distributed system. IEEE Transactions on Software Engineering, 15, 1989, pp. 1427-1436.
4. Ibarra O. H., Kim C. E.: Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. Assoc. Comput. Mach, 1977, pp. 280-289.
5. Page J., Naughton J.: Framework for task scheduling in heterogeneous distributed computing using genetic algorithms. Artificial Intelligence Review, 2005, pp. 415-429.
6. Singh H., Youssef A.: Mapping and scheduling heterogeneous task graphs using genetic algorithms. 5th IEEE Heterogeneous Computing Workshop, 1996, pp. 86-97.
7. Wang L., Siegel H. J., Roychowdhury V. P., Maciejcwski A. A.: Task matching and scheduling in heterogeneous computing environments using a genetic algorithm based approach. J. Parallel Distrib. Comput., 47, 1997, pp. 1-15.
8. Ritchie G., Lcvine J.: A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments. 23rd Workshop of the UK Planning and Scheduling Special Interest Group, 2004.
9. Yarkhan A., Dongarra J.: Experiments with scheduling using simulated annealing in a grid environment. 3rd International Workshop on Grid Computing, 2002, pp. 232-242.
10. Freund R. F., Ghcrrity M., Ambrosius S., Campbell M., Haldcrman M., Hcnsgcn D., Keith E., Kidd T., Kussow M., Lima J. D., Mirabile F., Moore L., Rust B., and Siegel H. J.: Scheduling resources in multi-user, heterogeneous, computing environments with SmartNct. 7th IEEE Heterogeneous Computing Workshop, 1998, pp. 184-199.
11. Abraham A., Buyya R., Nath B.: Nature's heuristics for scheduling jobs on computational grids. The 8th IEEE International Conference on Advanced Computing and Communications, 2000.
12. Macheswaran M., Ali S., Siegel H. J., Hensgcn D., Freund R. F.: Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. J. Parallel Distribut. Comput., 59, 1999, pp. 107-131.
13. Hagcrup T.: Allocating Independent Tasks to Parallel Processors: An Experimental Study. Journal of Parallel and Distributed Computing, 47, 1997, pp. 185-197.
14. Goldberg D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley. Reading. MA, 1997.
15. Glover F.: Tabu search. ORSA Journal of Computing, 1, 1989, pp. 190-206.
16. Kirkpatrick S., Gelatt Jr. C., Vccchi M.: Optimization by simulated annealing. Science, 220, 1983, pp. 671-680.
17. Dorigo M.: Optimization, learning, and natural algorithms. Ph.D. Thesis, Dip. Elettronica c Informazione, Politecnico di Milano, Italy, 1992.
18. Kennedy J., Eberhart R.C.: Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, 1995, pp. 1942-1948.
19. Izakian H., Ladani B. T., Zamanifar K., and Abraham A.: A Novel Particle Swarm Optimization Approach for Grid Job Scheduling. Springer-Verlag Berlin Heidelberg, 2009, pp. 100-109.
20. Izakian H., Abraham A., Snasel V.: Metaheuristic Based Scheduling Mcta-Tasks in Distributed Heterogeneous Computing Systems. Sensors, 9, 2009, pp. 5339-5350.