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 openmp and mpi tools are shown.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alba, E., et al.: Efficient parallel LAN/WAN algorithms for optimization: the MaLLBa project. Parallel Computing 32(5), 415–440 (2006)
Alba, E., Chicano, J.: Solving the Error Correcting Code Problem with Parallel Hybrid Heuristics. In: ACM Symposium on Applied Computing, pp. 985–989 (2004)
Brassard, G., Bratley, P.: Fundamentals of Algorithmics. Prentice-Hall, Englewood Cliffs (1997)
Cotta, C.: Scatter Search and Memetic Approaches to the Error Correcting Code Problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 51–61. Springer, Heidelberg (2004)
González, J.R., León, C., Rodríguez, C.: An Asynchronous Branch-and-Bound Skeleton for Heterogeneous Clusters. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J. (eds.) EuroPVM/MPI 2004. LNCS, vol. 3241, pp. 191–198. Springer, Heidelberg (2004)
Hill, R.: A First Course in Coding Theory. In: Oxford applied mathematics and computing science series, Oxford University Press, Oxford (1986)
Miranda, G., León, C.: An OpenMP skeleton for the A* heuristic search. In: Yang, L.T., et al. (eds.) HPCC 2005. LNCS, vol. 3726, pp. 717–722. Springer, Heidelberg (2005)
Morelos-Zaragoza, R.: The art of error correcting coding. Wiley, Chichester (2002)
OpenMP Architecture Review Board: OpenMP C and C++ Application Program Interface. Version 1.0 (1998), http://www.openmp.org
Snir, M., et al.: MPI: The Complete Reference. MIT Press, Cambridge (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
León, C., Martín, S., Miranda, G., Rodríguez, C., Rodríguez, J. (2008). Parallelizations of the Error Correcting Code Problem. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2007. Lecture Notes in Computer Science, vol 4818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78827-0_80
Download citation
DOI: https://doi.org/10.1007/978-3-540-78827-0_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78825-6
Online ISBN: 978-3-540-78827-0
eBook Packages: Computer ScienceComputer Science (R0)