Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers.
Robert CypherSmaragda KonstantinidouPublished in: SIAM J. Comput. (1996)
Keyphrases
- message passing
- shared memory
- parallel computers
- parallel computing
- belief propagation
- distributed systems
- factor graphs
- sum product
- massively parallel
- parallel implementation
- sum product algorithm
- inference in graphical models
- distributed memory
- markov random field
- lower bound
- parallel algorithm
- computational complexity
- parallel processing
- graphical models
- lower and upper bounds
- data transfer
- computer architecture
- parallel architectures
- preprocessing
- high quality
- information systems