loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04)
Solving the Langford Problem in Parallel
Cork, Ireland
July 05-July 07
ISBN: 0-7695-2210-6
ASCII Text
x 
 
Christophe Jaillet, Michael Krajecki, "Solving the Langford Problem in Parallel," Parallel and Distributed Computing, International Symposium on, pp. 83-90, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISPDC.2004.46,
author = {Christophe Jaillet and Michael Krajecki},
title = {Solving the Langford Problem in Parallel},
journal ={Parallel and Distributed Computing, International Symposium on},
volume = {0},
year = {2004},
isbn = {0-7695-2210-6},
pages = {83-90},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPDC.2004.46},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing, International Symposium on
TI - Solving the Langford Problem in Parallel
SN - 0-7695-2210-6
SP83
EP90
A1 - Christophe Jaillet,
A1 - Michael Krajecki,
PY - 2004
KW - Langford problem
KW - OpenMP
KW - MPI
KW - parallel algorithm
VL - 0
JA - Parallel and Distributed Computing, International Symposium on
ER -
 
Christophe Jaillet, Universit? de Reims Champagne-Ardenne
Michael Krajecki, Universit? de Reims Champagne-Ardenne

In this paper, the parallel resolution of the Langford problem is studied. Two different approaches are developed.

First, an explicit construction of all the solutions is done using a shared memory. The application associated to this approach is written in C using the standard OpenMP library.

Second, a parallelization of the algebraic method introduced by Godfrey is proposed. The application is taking advantage of MPI and has revealed efficient up to 128 processors. This solution opens up some new perspectives such as solving the already resolved instances of the problem more quickly and solving the next two open instances of the problem in a near future.

Index Terms:
Langford problem, OpenMP, MPI, parallel algorithm
Citation:
Christophe Jaillet, Michael Krajecki, "Solving the Langford Problem in Parallel," ispdc, pp.83-90, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.