A grid-enabled distributed branch-and-bound algorithm with application on the Steiner problem in graphs

Authors:
Lúcia M. A. Drummond;Eduardo Uchoa;Alexandre D. Gonçalves;Juliana M. N. Silva;Marcelo C. P. Santos;Maria Clícia S. de Castro
Affiliations:
Department of Computer Science, Fluminense Federal University, Brazil;Department of Production Engineering, Fluminense Federal University, Brazil;Department of Computer Science, Fluminense Federal University, Brazil;Department of Computer Science, Fluminense Federal University, Brazil;Department of Computer Science, Fluminense Federal University, Brazil;Department of Informatics, State University of Rio de Janeiro, Brazil
Venue:
Parallel Computing - Optimization on grids - Optimization for grids
Year:
2006

Citing 13
Cited 2

LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
The globus project: a status report

Future Generation Computer Systems - Special issue on metacomputing
Anomalies in parallel branch-and-bound algorithms

Communications of the ACM
Master–Worker: An Enabling Framework for Applications on the Computational Grid

Cluster Computing
Fault Tolerant Wide-Area Parallel Computing

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Fault Tolerant Computing on the Grid: What are My Options?

HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
An Efficient Fault-Tolerant Scheduling Algorithm for Real-Time Tasks with Precedence Constraints in Heterogeneous Systems

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
MPICH-G2: a Grid-enabled implementation of the Message Passing Interface

Journal of Parallel and Distributed Computing - Special issue on computational grids
Fault Tolerance in Message Passing Interface Programs

International Journal of High Performance Computing Applications
Linux-HA heartbeat system design

ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4

Hierarchical branch and bound algorithm for computational grids

Future Generation Computer Systems
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work introduces a distributed branch-and-bound algorithm to be run on computational Grids. Grids are often organized in a hierarchical fashion: clusters of processors connected via high-speed links, while the clusters themselves are geographically distant and connected through slower links. Our algorithm does not employ the usual master-worker paradigm and it considers the hierarchical structure of Grids in its load balance and fault tolerance procedures. This algorithm was applied over an existing code for the Steiner Problem in graphs. Experiments on real Grid conditions have demonstrated its efficiency and scalability.