Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers.
Robert CypherSmaragda KonstantinidouPublished in: SPAA (1993)
Keyphrases
- message passing
- shared memory
- parallel computers
- belief propagation
- parallel computing
- distributed memory
- distributed systems
- factor graphs
- inference in graphical models
- graphical models
- markov random field
- parallel implementation
- sum product algorithm
- graph cuts
- computer architecture
- sum product
- stereo matching
- scheduling problem
- probabilistic model
- parallel architectures
- lower bound
- computational complexity