β Scribed by Xiangdong An; Nick Cercone
No coin nor oath required. For personal study only.
Multiply sectioned Bayesian networks (MSBNs) support multiagent probabilistic inference in distributed large problem domains. Inference with MSBNs can be performed using their compiled representations. The compilation involves moralization and triangulation of a set of local graphical structures. Privacy of agents may prevent us from compiling MSBNs at a central location. In earlier work, agents performed compilation sequentially via a depthβfirst traversal of the hypertree that organizes local subnets, where communication failure between any two agents would crush the whole work. In this paper, we present an asynchronous compilation method by which multiple agents compile MSBNs in full parallel. Compared with the traversal compilation, the asynchronous one is robust, selfβadaptive, and faultβtolerant. Experiments show that both methods provide similar quality compilation to simple MSBNs, but the asynchronous one provides much higher quality compilation to complex MSBNs. Empirical study also indicates that the asynchronous one is consistently faster than the traversal one. Copyright Β© 2009 John Wiley & Sons, Ltd.
π SIMILAR VOLUMES
Distributed-memory message-passing machines deliver scalable performance but are difficult to program. Shared-memory machines, on the other hand, are easier to program but obtaining scalable performance with large number of processors is difficult. Recently, scalable machines based on logically shar
We present Spar, a programming language for semi-automatic parallel programming, in particular for the programming of array-based applications. The language has been designed as part of the Automap project, in which a compiler and runtime system are being developed for distributed-memory systems. As