An analysis of parallel heuristics for task allocation in multicomputers

Computing (Vienna/New York)

Volumn 59, Issue 3, 1997, Pages 259-275

  De Falco, I ^a,b   Del Balio, R ^a,b   Tarantino, E ^a,b  

^a Inst Res on Parallel Info Syst ^*

^b Inst Res on Parallel Info Syst   (Italy)

Author keywords

Genetic algorithms; Heuristics; Optimisation; Parallel processing; Simulated annealing

Indexed keywords

GENETIC ALGORITHMS; NUMERICAL ANALYSIS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SIMULATED ANNEALING;

PARALLEL HEURISTICS;

HEURISTIC METHODS;

EID: 0031352879     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02684444     Document Type: Article

References (27)

1. Goldberg, D. E.: Genetic algorithms in search, optimization and machine learning. New York: Addison-Wesley 1989.
2. Kirkpatrick, S., Gelatt, C. D., Vecchi, M. P.: Optimization by simulated annealing. Science 220, 671-680 (1983).
3. Clark, A.: Modern optimisation algorithms for cryptanalysis. In: Proc. of the Second Australian and New Zealand Conference on Intelligent Information Systems. Brisbane, Australia, pp. 258-262 Piscataway: IEEE 1994.
4. Mansour, N., Fox, G. C.: Allocating data to multicomputer nodes by physical optimization algorithms for loosely synchronous computations. Concurrency Pract. Exp. 4, 557-574 (1992).
5. Murata, T., Ishibuchi, H.: Performance evaluation of genetic algorithms for flowshop scheduling problems. In: Proc. of the First IEEE World Congress on Computational Intelligence, Orlando, U.S.A., vol. 2, pp. 812-817.
6. Glover, F.: Tabu search: Part I. ORSA J. Comput. 7, 190-206 (1989).
7. Glover, F.: Tabu search: Part II ORSA J. Comput. 2, 4-32 (1990).
8. Gunnels, J , Cull. P., Holloway, J. L.: Genetic algorithms and simulated annealing for gene mapping. In: Proc. of the First IEEE World Congress on Computational Intelligence. Orlando, U.S.A., vol. 1, pp. 385-390. Piscataway: IEEE 1994.
9. Kwok, D. P., Sheng, F.: Genetic algorithms and simulated annealing for optimal robot arm PID control. In: Proc. of the First IEEE World Congress on Computational Intelligence, Orlando. U.S A., vol. 2. pp. 707-713. Piscataway: IEEE 1994.
10. Davis, T. E , Principe, J. C.: A simulated annealing like convergence theory for the simple genetic algorithm. In: Proc. of the Fourth International Conference on Genetic Algorithms (Belew, R. K., Booker L. B,. eds.), pp. 174-181. San Mateo: Morgan-Kaufmann 1991.
11. Brown, D. E.: A parallel genetic heuristic for the quadratic assignment problem. In: Proc. of the Third International Conference on Genetic Algorithms (Schaffer, J. D., ed.), pp. 406-415. San Mateo: Morgan-Kaufmann 1989.
12. Mühlenbein, H.: Evolution in time and space - The parallel genetic algorithm. Foundations of genetic algorithms (Rawlins, G., ed.), pp. 316-337. Morgan-Kaufmann 1992.
13. Chaudhary, V., Aggarwal, J. K.: A generalized scheme for mapping parallel algorithms. IEEE Trans. Parallel Distr. Systems 4, 328-346 (1993).
14. Dowsland, K. A.: Simulated annealing. Modern heuristic techniques for combinatorial problems (Reeves, C, R., ed.), pp. 20-69. Great Britain: Orient Longman 1993.
15. Tanese, R.: Distributed genetic algorithms. In: Proc. of the Third International Conference on Genetic Algorithms (Schaffer, J. D., ed.), pp. 434-439. San Mateo: Morgan-Kaufmann 1989.
16. Manderick, B., Spiessens, P.: Fine-grained parallel genetic algorithms. In: Proc. of the Third International Conference on Genetic Algorithms (Schaffer, J. D., ed.), pp. 428-433. San Mateo: Morgan-Kaufmann 1989.
17. Mühlenbein, H., Schomisch, M., Born, J.: The parallel genetic algorithm as function optimizer. Parallel Comput. 17, 619-632 (1991).
18. De Falco, I., Del Balio, R., Tarantino, E., Vaccaro, R.: Simulation of genetic algorithms on MIMD multicomputers. Parallel Proc. Lett. 2, 381-389 (1992).
19. De Falco, I., Del Balio, R., Tarantino, E.: A parallel adaptive strategy for combinatorial optimization. In: Proc. of the IMACS International Symposium on Signal Processing, Robotics and Neural Networks, Lille, France (Borne, P., Fukuda, T., Tzafestas, S. G., eds.), pp. 502-507. Piscatawy: IEEE-SMC 1994.
20. De Falco, I., Del Balio, R., Tarantino, E., Vaccaro, R.: Parallel tabu search versus parallel evolution strategies. In: Proc. of the first IEEE International Conference on Massively Parallel Computing Systems, Ischia, Italy, pp. 564-569. Los Alamitos: IEEE 1994.
21. Boissin, N., Lutton, J. L.: A parallel simulated annealing algorithm. Parallel Comput. 19, 859-872 (1993).
22. Aarts, E. H. L., Korst, J. H. M.: Simulated annealing and boltzmann machines. New York: Wiley 1993.
23. Hurley, S.: Taskgraph mapping using a genetic algorithm: a comparison of fitness functions. Parallel Comput. 19, 1313-1317 (1993).
24. Selvakumar, S., Siva Ram Murthy, C.: An efficient algorithm for mapping VLSI circuit simulation programs onto multiprocessors. Parallel Comput. 17, 1009-1016 (1991).
25. De Falco, I., Del Balio, R., Tarantino, E.: Solving the mapping problem by parallel Tabu Search. In: Proc. of the Twelfth IASTED International Conference on Applied Informatics (Hamza, M. H., ed.), pp. 264-267. Zurich: IASTED 1994.
26. Connolly, D. T.: An improved scheme for the QAP. Eur. J. Operat. Res. 46, 93-100 (1990).
27. Laursen, P. S.: Simulated annealing for the QAP - optimal trade off between simulation time and solution quality. Eur. J. Operat. Res. 69, 238-243 (1993).