On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification.
A. K. BandyopadhyayJ. BandyopadhyayPublished in: J. Syst. Archit. (2000)
Keyphrases
- message passing
- belief propagation
- deadlock free
- shared memory
- markov random field
- distributed systems
- factor graphs
- inference in graphical models
- approximate inference
- multithreading
- pairwise
- sum product algorithm
- distributed shared memory
- database
- communication networks
- distributed environment
- management system
- bayesian networks