Manipulating uncertain information is a necessary capability for any i
ntelligent system. Several approaches, such as the Bayesian theory, Ce
rtainty Factors, and the Dempster-Shafer method, have been proposed to
handle uncertainty. Among them the Dempster-Shafer method is the most
theoretical sound and consistent with human behavior; however, it is
argued on its computational complexity. This article presents a parall
el reasoning algorithm based on the Dempster-Shafer method and impleme
nts it on the transputer network. We first analyze the best topologies
of the transputer network with various numbers of processors; then th
e performance of the parallel program, such a speedup and efficiency,
is measured on these best topologies.