Comparison Between a Message Passing and a Global Shared Memory Parallel Computer by Means of a Concrete Monte-Carlo Algorithm.

Published in: CONPAR (1994)

Keyphrases

monte carlo
message passing
shared memory
parallel computers
parallel algorithm
importance sampling

parallel implementation
parallel architecture
parallel computing
dynamic programming
expectation maximization
matching algorithm

distributed memory
belief propagation
energy function
distributed systems
search space
parallel programming

bayesian networks
parallel architectures
markov chain
simulated annealing
optimal solution
preprocessing