By Topic

Parallel Implementations of a Scalable Consistent Labeling Technique on Distributed Memory Multi-Processor Systems

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)
Lin, W.-M. ; Mississippi State University, USA ; Lu, Zhenhong

An efficient implementation of a consistent labeling technique can lead to a fast solution in solving all kinds of tree search problems by reducing the search space from a potentially exponential size to a much smaller size. In this paper a scalable parallel algorithm is presented in achieving labeling consistency. This algorithm is optimal in execution time as well as in processor-time product. It is suitable for implementation on most distributed memory multiprocessor system.

Published in:

Parallel Processing, 1993. ICPP 1993. International Conference on  (Volume:3 )

Date of Conference:

16-20 Aug. 1993