By Topic

Parallel execution of an irregular algorithm depth first search (DFS) on heterogeneous clusters of workstation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. A. M. Ibrahim ; Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., China ; L. Xinda ; J. M. Rwakarambi

This paper presents a status report on our efforts and experiences with heterogeneous clusters of workstation based on dynamic load balancing for parallel tree computation depth-first-search (DFS) project at the High Performance Computing laboratory in Shanghai Jiaotong University. We describe an implementation of one parallel search algorithm DFS, running under the MPI message passing interface and Solaris operating system on heterogeneous workstation clusters. The main goal of this paper is to demonstrate the speed gained by the heterogeneous workstation clusters platform computing to solve large search problem, distribute the tree search space among the processors and show through a parallel simulation application, the maturity of the more recent technologies. We have run the parallelism and distribution of the search space of the DFS algorithm among the processors successfully found that the critical issue in parallel DFS algorithm is the distribution of the search space among the processors. First experimental results of parallel DFS are given for tests that will serve as a starting point for further development of our project. We are presenting our preliminary progress here, and we expect in the near future to demonstrate a real dynamic load balancing for DFS algorithm running on heterogeneous clusters of workstation computing platform resulting in a good load balance among all the processors

Published in:

Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences on  (Volume:3 )

Date of Conference: