A fault-tolerant parallel heuristic for assignment problems

Future Generation Computer Systems

Volumn 14, Issue 5-6, 1998, Pages 425-438

  Talbi, El Ghazali ^a   Hafidi, Zouhir ^a   Kebbal, Djemai ^a   Geib, Jean Marc ^a  

^a UNIV LILLE   (France)

Author keywords

Adaptive parallelism; Fault tolerance; Heuristic algorithms; Quadratic assignment problem; Simulated annealing; Tabu search

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; COMPUTER WORKSTATIONS; FAULT TOLERANT COMPUTER SYSTEMS; HEURISTIC METHODS; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS); SIMULATED ANNEALING;

FAULT TOLERANT PARALLEL HEURISTICS; QUADRATIC ASSIGNMENT PROBLEMS; TABU SEARCH;

PARALLEL PROCESSING SYSTEMS;

EID: 0032319892     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-739x(98)00044-2     Document Type: Article

References (29)

1. P.M. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: a survey and recent developments, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 16 (1994) 1-42.
2. T. Muntean, E.G. Talbi, A parallel genetic algorithm for process-processor mapping, in: M. Durand, F. ElDabagh (Eds.), Proceedings of the Second Symposium on High Performance Computing, Montpellier, France, Elsevier, Amsterdam, 1991, pp. 71-82.
3. C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1993.
4. D.A. Nichols, Using idle workstations in a shared computing environment, ACM Operating Sys. Rev. 215 (1987) 5-12.
5. M.M. Theimer, K.A. Lantz, Finding idle machines in a workstation-based distributed system, IEEE Trans. Software Engrg. 15(11) (1989) 1444-1458.
6. F. Glover, Tabu search - part I, ORSA J. Comput. (13) (1989) 190-206.
7. S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, Optimization by simulated annealing, Science 220(4598) (1983) 671-680.
8. F. Glover, M. Laguna, Tabu search, in: C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, 1992, Oxford, pp. 70-150.
9. S.C.S. Porto, C. Ribeiro, Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints, J. Heuristics 1(2) (1996) 207-223.
10. J. Chakrapani, J. Skorin-Kapov, Massively parallel tabu search for the quadratic assignment problem, Ann. Oper. Res. 41 (1993) 327-341.
11. V. Bachelet, P. Preux, E.G. Talbi, Hybrid parallel heuristics for the quadratic assignment problem, in: Parallel Optimization Colloquium POC96, Versailles, France, 1996.
12. P. Badeau, M. Gendreau, F. Guertin, J.-Y. Potvin, E. Taillard, A parallel tabu search heuristic for the vehicle routing problem with time windows, RR CRT-95-84, Centre de Recherche sur les Transports, Université de Montréal, 1995.
13. D. Gelernter, D.L. Kaminsky, Supercomputing out of recycled garbage: Preliminary experience with Piranha, in: Sixth ACM International Conference on Supercomputing, 1991.
14. J. Pruyne, M. Livny, Parallel processing on dynamic resources with CARMI, in: Proceedings of the Workshop on Job Scheduling for Parallel Processing IPPS'95, Lecture Notes in Computer Science, vol. 949, Springer, Berlin, 1995, pp. 259-278.
15. Z. Hafidi, E.-G. Talbi, J.-M. Geib, MARS: Adaptive scheduling of parallel applications in a multi-user heterogeneous environment, in: European School of Computer Science ESPPE'96: Parallel Programming Environments for High Performance Computing, Alpe d'Huez, France, 1996, pp. 119-122.
16. K.M. Chandy, L. Lamport, Distributed snapshots: Determining global states of distributed systems, ACM Trans. Comput. Systems 3 (1985) 63-75.
17. D. Kebbal, E.G. Talbi, J.-M. Geib, A new approach for checkpointing parallel applications, in: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA'97, LasVegas, USA, 1997, pp. 1643-1651.
18. A. Hertz, D. de Werra, The tabu search metaheuristic: How we use it?, Ann. Math. Artifi. Intell. (1989) 111-121.
19. T.C. Koopmans, M.J. Beckmann, Assignment problems and the location of economic activities, Econometrica 25 (1957) 53-76.
20. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory on NP-completeness, Freeman, New York, 1979.
21. S. Sahni, T. Gonzales, P-complete approximation problems, J. ACM 23 (1976) 556-565.
22. A. Brungger, A. Marzetta, J. Clausen, M. Perregaard, Joining forces in solving large-scale quadratic assignment problems in parallel, in: A. Gottlieb (Ed.), Proceedings of the 11 th International Parallel Processing Symposium, Morgan Kaufmann, Geneva, Switzerland, 1997, pp. 418-427.
23. E. Taillard, Comparison of iterative searches for the quadratic assignment problem, Location Sci. 3 (1995) 87-103.
24. S. Voss, Tabu search: Applications and prospects, Technical report, Technische Hochshule, Darmstadt, Germany, 1992.
25. T.D. Crainic, M. Toulouse, M. Gendreau, Towards a taxonomy of parallel tabu search algorithms, Technical Report CRT-933, Centre de Recherche sur les Transports, Université de Montreal, 1993.
26. E. Taillard, Parallel iterative search methods for vehicle routing problem, Networks 23 (1993) 661-673.
27. E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Comput. 17 (1991) 443-455.
28. M. Malek, M. Guruswamy, M. Pandya, H. Owens, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Ann. Oper. Res. 21 (1989) 59-84.
29. C. Rego, C. Roucairol, A parallel tabu search algorithm using ejection chains for the vehicle routing problem, Proceedings of the Metaheuristics International Conference, Breckenridge, 1995, pp. 253-295.