Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems.
Dariusz R. KowalskiMariam MomenzadehAlexander A. ShvartsmanPublished in: OPODIS (2003)
Keyphrases
- message passing
- shared memory
- distributed systems
- sum product algorithm
- matrix multiplication
- parallel architectures
- inference in graphical models
- distributed shared memory
- belief propagation
- max product
- distributed memory
- parallel algorithm
- probabilistic inference
- heterogeneous platforms
- multi processor
- parallel computing
- loopy belief propagation
- factor graphs
- parallel computers
- fault tolerant
- parallel machines
- parallel architecture
- approximate inference
- markov random field
- sum product
- graphic processing unit
- search algorithm
- parallel programming
- computing systems
- d objects