Chapter

Applied Parallel Computing. State of the Art in Scientific Computing

Volume 3732 of the series Lecture Notes in Computer Science pp 481-489

A Distributed Divide and Conquer Skeleton

  • Juan R. GonzálezAffiliated withDpto. Estadítica, I.O. y Computación, Universidad de La Laguna
  • , Coromoto LeónAffiliated withDpto. Estadítica, I.O. y Computación, Universidad de La Laguna
  • , Casiano RodríguezAffiliated withDpto. Estadítica, I.O. y Computación, Universidad de La Laguna

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The MaLLBa library provides skeletons to solve combinatorial optimization problems. Its main objective is to simplify the implementation of algorithms based on some commonly used techniques such as Branch and Bound, Dynamic Programming and Divide and Conquer.

This work is focused on the MaLLBa::DnC skeleton, which solves problems that fit in the Divide and Conquer paradigm. The user has to provide functions particularized to the problem he wants to solve. Given that functions the skeleton encapsulates all remaining work and allows the problem to be solved either in a sequential or parallel way.

In this work we will present a new mpi asynchronous peer-processor implementation of the MaLLBa::DnC skeleton where all processors are peers and behave the same way (except during the initialization phase) and where decisions are taken based only on local information. Results on a Linux cluster of PC for matrix and huge integer multiplication are presented.