Article (Scientific journals)
Solving the three dimensional quadratic assignment problem on a computational grid
Mezmaz, Mohand; Mehdi, Malika; Bouvry, Pascal et al.
2014In Cluster Computing, 17 (2), p. 205-217
Peer Reviewed verified by ORBi
 

Files


Full Text
cluster.pdf
Publisher postprint (1.12 MB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
distributed computing; branch and bound; 3D QAP
Abstract :
[en] The exact resolution of large instances of combinatorial optimization problems, such as three dimensional quadratic assignment problem (Q3AP), is a real challenge for grid computing. Indeed, it is necessary to reconsider the resolution algorithms and take into account the characteristics of such environments, especially large scale and dynamic availability of resources, and their multi-domain administration. In this paper, we revisit the design and implementation of the branch and bound algorithm for solving large combinatorial optimization problems such as Q3AP on the computational grids. Such gridification is based on new ways to effi- ciently deal with some crucial issues, mainly dynamic adaptive load balancing and fault tolerance. Our new approach allowed the exact resolution on a nation-wide grid of a dif- ficult Q3AP instance. To solve this instance, an average of 1,123 computing cores were used for less than 12 days with a peak of around 3,427 computing cores.
Research center :
ULHPC - University of Luxembourg: High Performance Computing
Disciplines :
Computer science
Author, co-author :
Mezmaz, Mohand;  University of Mons
Mehdi, Malika ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Bouvry, Pascal ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Talbi, El-Ghazali;  LIFL
Tuyttens, Daniel;  University of Mons
External co-authors :
yes
Language :
English
Title :
Solving the three dimensional quadratic assignment problem on a computational grid
Publication date :
2014
Journal title :
Cluster Computing
ISSN :
1386-7857
Publisher :
Springer Science & Business Media B.V.
Volume :
17
Issue :
2
Pages :
205-217
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBilu :
since 15 March 2017

Statistics


Number of views
101 (2 by Unilu)
Number of downloads
0 (0 by Unilu)

Scopus citations®
 
5
Scopus citations®
without self-citations
4
OpenCitations
 
3
WoS citations
 
4

Bibliography


Similar publications



Contact ORBilu