loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Michael Poldner and Herbert Kuchen

Affiliation: University of Münster, Germany

ISBN: 978-972-8865-69-6

Keyword(s): Parallel Computing, Algorithmic Skeletons, Branch & Bound, Load Distribution, Termination Detection.

Related Ontology Subjects/Areas/Topics: Distributed and Mobile Software Systems ; Energy and Economy ; Load Balancing in Smart Grids ; Parallel and High Performance Computing ; Smart Grids ; Software Engineering

Abstract: Algorithmic skeletons are predefined components for parallel programming. We will present a skeleton for branch & bound problems for MIMD machines with distributed memory. This skeleton is based on a distributed work pool. We discuss two variants, one with supply-driven work distribution and one with demanddriven work distribution. This approach is compared to a simple branch & bound skeleton with a centralized work pool, which has been used in a previous version of our skeleton library Muesli. Based on experimental results for two example applications, namely the n-puzzle and the traveling salesman problem, we show that the distributed work pool is clearly better and enables good runtimes and in particular scalability. Moreover, we discuss some implementation aspects such as termination detection as well as overlapping computation and communication.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.231.229.89

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Poldner M.; Kuchen H. and (2006). ALGORITHMIC SKELETONS FOR BRANCH & BOUND.In Proceedings of the First International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-972-8865-69-6, pages 291-300. DOI: 10.5220/0001315002910300

@conference{icsoft06,
author={Michael Poldner and Herbert Kuchen},
title={ALGORITHMIC SKELETONS FOR BRANCH & BOUND},
booktitle={Proceedings of the First International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2006},
pages={291-300},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001315002910300},
isbn={978-972-8865-69-6},
}

TY - CONF

JO - Proceedings of the First International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - ALGORITHMIC SKELETONS FOR BRANCH & BOUND
SN - 978-972-8865-69-6
AU - Poldner, M.
AU - Kuchen, H.
PY - 2006
SP - 291
EP - 300
DO - 10.5220/0001315002910300

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.