Performance Comparison of Shared- and Distributed-Memory
Parallel Computers Using Knapsack Problem

Makoto Ando, Yoshio Tanaka, Kazuto Kubota, Motohiko Matsuda,
Yutaka Akiyama, Mitsuhisa Sato

In this paper, we report the performance comparison between shared- and distributed-memory parallel computers using knapsack problem as benchmarks. In some cases such that the search tree is broad, distributed-memory parallel computer shows better performance, though shared-memory parallel computer shows good performance in many cases.
Real World Computing Partnership