Nonnumeric search results on the EM-4 distributed-memory multiprocessor

  • Authors:

  • Andrew Sohn;Mitsuhisa Sato;Shuichi Sakai;Yuetsu Kodama;Yoshinori Yamaguchi

  • Affiliations:

  • New Jersey Institute of Technology, Newark, NJ;Electrotechnical Laboratory, Tsukuba, Ibaraki 305, Japan;Real World Computing Tsukuba Research Center, Tsukuba, Ibaraki 305, Japan;Electrotechnical Laboratory, Tsukuba, Ibaraki 305, Japan;Electrotechnical Laboratory, Tsukuba, Ibaraki 305, Japan

  • Venue:
  • Proceedings of the 1994 ACM/IEEE conference on Supercomputing
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

Numeric scientific problems have been the main focus of supercomputing as their numerous implementations on various multiprocessors indicate. Nonnumeric problems on the other hand have received very little attention for parallel implementation due to their irregular behaviors and a large amount of resource usage. This report presents our experiences implementing difficult nonnumeric problems on the EM-4 multiprocessor, believing that supercomputers should also be able to effectively execute nonnumeric problems if they are to be considered 'supercomputers.' We selected two typical search problems, the Eight-Puzzle and the Tower-of-Hanoi. Two parallel search techniques are used to implement the search problems, unidirectional and bidirectional heuristic search. A total of eight different programs has been implemented on the EM-4 multiprocessor with realistic problem sizes. Execution results demonstrate that the parallel bidirectional heuristic search can solve the tree depth 20 to 40 of the Eight-Puzzle in an optimal or near optimal number of iterations in less than two seconds, and is highly scalable as it gives over 40-fold speedup for both problems on 80 processors.