A novel method for task scheduling in distributed systems using memetic

2009 2nd International Conference on Communication Theory, Reliability, and Quality of Service, CTRQ 2009

Volumn , Issue , 2009, Pages 58-62

  Jahanshahi, M ^a   Gholipour, M ^b   Kordafshari, M S ^b   Rahmani, A M ^c  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b ISLAMIC AZAD UNIVERSITY   (Iran)

^c ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

Memetic algorithm; Tabu search; Task scheduling

Indexed keywords

COMMUNICATION COST; CPU UTILIZATION; DISTRIBUTED SYSTEMS; KEY FACTORS; LOCAL SEARCH; MAKESPAN; MEMETIC; MEMETIC ALGORITHM; MEMETIC ALGORITHMS; MINIMIZING MAKESPAN; NOVEL METHODS; NP COMPLETE; OPTIMAL SOLUTIONS; SCHEDULING PROBLEM; SIMULATION RESULT; SOLUTION SPACE; TASK SCHEDULING; TASKS SCHEDULING;

COMMUNICATION; INFORMATION THEORY; MULTITASKING; QUALITY CONTROL; QUALITY OF SERVICE; RELIABILITY THEORY; SCHEDULING ALGORITHMS; SIGNAL RECONSTRUCTION;

TABU SEARCH;

EID: 70449115986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CTRQ.2009.29     Document Type: Conference Paper

References (31)

1. M. Nikravan and M. H. Kashani, "A Genetic Algorithm For Process Scheduling In Distributed Operating Systems Considering Load balancing", Proc. of 21st European Conference on Modelling and Simulation, ECMS 2007
2. S. H. Woo, S. Yang, S. Kim and T. Han, "Task scheduling in distributed computing systems with a genetic algorithm", hpcasia, p. 301, High-Performance Computing on the Information Superhighway, HPC-Asia '97, 1997.
3. E. S. H. Hou, N. Ansari and H. Ren, "A Genetic Algorithm for Multiprocessor Scheduling", IEEE Trans. On Parallel and Distributed Systems, 5(2), 1994, 113-120.
4. A M. Dell'Amico, A M. Trubian, "Applying Tabu Search to the Jobshop Scheduling Problem", J Annals of Ops. Res., 41, 1993
5. Glover F., "Tabu Search: A Tutorial", Interfaces, 20(4):74-94,1990.
6. Glover F., and Laguna M., Tabu Search, in Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, editor, John Wiley & Sons, Inc, 1993
7. A. Hertz, "Finding a Feasible Course Schedule Using Tabu Search", Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 35, 1992
8. A M. Laguna, A J. W. Barnes and A F. Glover, "Tabu Search Methodology for a Single Machine Scheduling Problem", Journal of Int. Manufacturing, 2, 63-74, 1991
9. A S. C. S. Porto, A C.C. Ribeiro, "Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling under Precedence Constraints", Journal of Heuristics, V 1, 1995
10. A S. C. S. Porto, A C.C. Ribeiro, "A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints", International Journal of High-Speed Computing, 7(2), 1995
11. A M. Widmer, "The Job-shop Scheduling with Tooling Constraints: A Tabu Search Approach", J. Opt. Res. S, 42, 75-82, 1991
12. M. F. Bramlette, "Initialization, Mutation, and Selection Methods in Genetic Algorithms for Function Optimization", Proc of the Fourth International Conference on Genetic Algorithms. Los Altos, CA, 1991
13. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991
14. S. Forrest, "Genetic Algorithms: Principles of Natural Selection Applied to Computation," Science, 261, 872-878, 1993
15. Speel H. C, "Memetics: On a conceptual framework for cultural evolution", Symposium of Einstein Meets Margritte, Free University of Brussels, 1995.
16. S. Areibi, M. Moussa, and H. Abdullah. "A comparison of genetic/memetic algorithms and heuristic searching. In Proc of the 2001 International Conference on Arti cial Intelligence ICAI 2001, Las Vegas, Nevada, 25, 2001.
17. H. Ishibuchi, T. Yoshida, and Tadahiko Murata, "Balance between genetic search and local search in memetic algorithms for multiobjective permutation owshop scheduling", IEEE Transactions on Evolutionary Computation,7(2):204-223, 2003.
18. P. Moscato, "New Ideas in Optimization, chapter Memetic Algorithms: A Short Introduction", pages 219-234. McGraw Hill, 1999.
19. H. El-Rewini, T.T. Lewis, and H.H. Ali. "Task Scheduling in Parallel and Distributed Systems", New Jersey: Prentice Hall, 1994.
20. Y. Chow and W.H. Kohler, "Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System", IEEE Transactions on Computers, Vol.28, pp. 354-361, 1979.
21. C.C.Shen, & W.H.Tsai, A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Using a Minimax Criterion, IEEE Trans. On Computers, 34(3), 1985, 197-203.
22. P.Y.R.Ma, E.Y. S. Lee and J.Tsuchiya, "A Task Allocation Model for Distributed Computing Systems", IEEE Trans. On Computers, 31(1), 1982, 41-47.
23. G. L. Park, "Performance Evaluation of a List Scheduling Algorithm In Distributed Memory Multiprocessor Systems", International Journal of Future Generation Computer Systems 20, 2004, 249-256.
24. C.I.Park and T.Y.Choe, "An optimal scheduling algorithm based on task duplication", IEEE Trans. on Computers, 51(4), 2002, 444-448.
25. C. M. Woodside, and G. G. Monforton, "Fast Allocation of Processes in Distributed and Parallel Systems", IEEE Trans. On Parallel and Distributed Systems, 4(2), 1993, 164-174.
26. A. K. Sarje and G. Sagar, "Heuristic Model for Task Allocation in Distributed Computer Systems", Proc. of the IEEE, 138(5), 1991, 313-318.
27. W.Yao, J.Yao and B.Li, "Main Sequences Genetic Scheduling For Multiprocessor Systems Using Task Duplication", International Journal of Microprocessors and Microsystems, 28, 2004, 85-94.
28. M. Moore, "An Accurate and Efficient Parallel Genetic Algorithm to Schedule Tasks on a Cluster", Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2003.
29. V. D. Martino, "Sub Optimal Scheduling in a Grid using Genetic Algorithms", Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2003.
30. A.Y. Zomaya, C. Ward and B. Macey, "Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues", IEEE Trans. On Parallel and Distributed Systems, 10(8), 1999, 795-812.
31. M. Lin and L.T.Yang, "Hybrid Genetic Algorithms for Scheduling Partially Ordered Tasks in a Multi-processor Environment", Proc. of the 6th IEEE Conf. on Real-Time Computer Systems and Applications, 1999, 382-387.