Parallel evidence combination on a SB-tree architecture
The paper presents a specialised parallel architecture and algorithms for the computation of Dempster's rule in evidential reasoning based on the Dempster-Shafer theory. The architecture is scalable and the complexity of the associated parallel algorithms is linear with respect to the number of processors. The approach supports efficient dynamic load balancing which is essential for incremental reasoning. The technique has been simulated on a UNIX based machine and can easily be implemented on a multiprocessor symmetric machine.