A parallel searching scheme for multiprocessor systems and its application to combinatorial problems

  • Authors:

  • Masaharu Imai;Yuuji Yoshida;Teruo Fukumura

  • Affiliations:

  • School of Information Eng., Toyahashi University of Technology, Toyohashi, Japan;Computation Center, Nagoya University, Nagoya, Japan;Faculty of Engineering, Nagoya University, Nagoya, Japan

  • Venue:
  • IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a parallelized computational scheme called Parallelized Depth-First Algorithm (PDFA) for Branch-and-Bound (B&B) method that works on multiprocessor systems. It is shown theoretically that the space requirement of PDFA on p processing units is at most p times as much as that of the sequential B&B algorithm with the depth-first search function. Moreover, from our experimental results through simulation, it is known that the computation time of PDFA on p processing units can be resuced to less than 1/p that of the sequential B&B algorithm with the depth-first search function. We name this reduction effect in the computation time Acceleration Effect.