By Topic

Unstructured tree search on SIMD parallel computers: a summary of results

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
$31 $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

2 Author(s)
Karypis, G. ; Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA ; Kumar, V.

The authors present methods for load balancing of unstructured tree computations on large-scale SIMD (single-instruction multiple-data) machines and analyze the scalability of these and other schemes. An efficient formulation of tree search on a SIMD machine comprises two major components: (i) a triggering mechanism, which determines when the search space redistribution must occur to balance search space over processors; and (ii) a scheme to redistribute the search space. The authors devised a redistribution mechanism and a triggering mechanism. Either of these can be used in conjunction with triggering and redistribution mechanisms developed by other researchers. The authors analyze the scalability of these mechanisms. The results are verified experimentally. The analysis and experiments show that the novel load balancing methods are highly scalable on SIMD architectures. Their scalability is shown to be no worse than that of the best load balancing schemes on MIMD (multiple-instruction multiple-data) architectures. The authors verified their theoretical results by implementing the 15-puzzle problem on a CM-2 SIMD parallel computer

Published in:

Supercomputing '92., Proceedings

Date of Conference:

16-20 Nov 1992