Parallelizations of the Error Correcting Code Problem

Authors:
C. León;S. Martín;G. Miranda;C. Rodríguez;J. Rodríguez
Affiliations:
Dpto. de Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna, Spain E-38271;Dpto. de Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna, Spain E-38271;Dpto. de Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna, Spain E-38271;Dpto. de Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna, Spain E-38271;Dpto. de Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna, Spain E-38271
Venue:
Large-Scale Scientific Computing
Year:
2009

Citing 6
Cited 0

Fundamentals of algorithmics

Fundamentals of algorithmics
MPI: The Complete Reference

MPI: The Complete Reference
Solving the error correcting code problem with parallel hybrid heuristics

Proceedings of the 2004 ACM symposium on Applied computing
The Art of Error Correcting Coding

The Art of Error Correcting Coding
Efficient parallel LAN/WAN algorithms for optimization. The mallba project

Parallel Computing
An OpenMP skeleton for the A* heuristic search

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, an exact approach to solve the Error Correcting Code problem is presented. For the implementation, the Branch and Bound skeleton of the MaLLBa library has been applied. This tool provides a hierarchy of C++classes which must be adapted to the specific requirements of the problem. Then, it generates two parallel solvers: one based on the message passing paradigm and other designed on the basis of a shared memory model. For both parallel proposals the sequential algorithm follows the same principles. Note that with a single and simple specification of the problem, the tool gives the user two different parallel approaches. Computational results obtained with the openmpand mpitools are shown.