Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm

  • Authors:
  • Kento Aida;Wataru Natsume;Yoshiaki Futakata

  • Affiliations:
  • -;-;-

  • Venue:
  • CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper discusses the impact of the hierarchicalmaster-worker paradigm on performance of an applicationprogram, which solves an optimization problem by a parallelbranch and bound algorithm on a distributed computingsystem. The application program, which this paperaddresses, solves the BMI Eigenvalue Problem, whichis an optimization problem to minimize the greatest eigenvalueof a bilinear matrix function. This paper proposesa parallel branch and bound algorithm to solve the BMIEigenvalue Problem with the hierarchical master-workerparadigm. The experimental results showed that the conventionalalgorithm with the master-worker paradigm significantlydegraded performance on a Grid test bed, wherecomputing resources were distributed on WAN via a firewall;however, the hierarchical master-worker paradigmsustained good performance.