Results 1 - 10 of 2,300

Informed Lifting for Message-Passing

by Kristian Kersting, Youssef El Massaoudi, Babak Ahmadi, Fabian Hadiji
"... Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world tasks. Recently, lifted belief propagation (LBP) has been proposed as an efficient approximate solution of this inference p ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
: message errors decay along paths. Intuitively, for a long chain graph with weak edge potentials, distant nodes will send and receive identical messages yet their computation trees are quite different. To overcome this, we propose iLBP, a novel, easy-to-implement, informed LBP approach that interleaves

Myrinet: A Gigabit-per-Second Local Area Network

by Nanette J. Boden, Danny Cohen, Robert E. Felderman, Alan E. Kulawik, Charles L. Seitz, Jakov N. Seizovic, Wen-king Su - IEEE Micro , 1995
"... Abstract. Myrinet is a new type of local-area network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP message-passing network that can span campus dimensions, rather than as a wide-a ..."
Abstract - Cited by 1011 (0 self) - Add to MetaCart
Abstract. Myrinet is a new type of local-area network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP message-passing network that can span campus dimensions, rather than as a wide

Reaching Agreement in the Presence of Faults

by M. Pease, R. Shostak, L. Lamport - JOURNAL OF THE ACM , 1980
"... The problem addressed here concerns a set of isolated processors, some unknown subset of which may be faulty, that communicate only by means of two-party messages. Each nonfaulty processor has a private value of reformation that must be communicated to each other nonfanlty processor. Nonfaulty proc ..."
Abstract - Cited by 653 (8 self) - Add to MetaCart
processors and n is the total number. It is also shown that if faulty processors can refuse to pass on reformation but cannot falsely relay information, the problem is solvable for arbitrary n _> m _> 0. This weaker assumption can be approxunated m practice using cryptographic methods.

Gromacs: A message-passing parallel molecular dynamics implementation

by H. J. C. Berendsen, D. Van Der Spoel, R. Van Drunen - Comp. Phys. Comm , 1995
"... A parallel message-passing implementation of a molecular dynamics (MD) program that is useful for bio(macro)molecules in aqueous environment is described. The software has been developed for a custom-designed 32-processor ring GROMACS (GROningen MAchine for Chemical Simulation) with communication to ..."
Abstract - Cited by 257 (6 self) - Add to MetaCart
A parallel message-passing implementation of a molecular dynamics (MD) program that is useful for bio(macro)molecules in aqueous environment is described. The software has been developed for a custom-designed 32-processor ring GROMACS (GROningen MAchine for Chemical Simulation) with communication

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks

by Seema Bandyopadhyay, Edward J. Coyle , 2003
"... A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to de ..."
Abstract - Cited by 390 (1 self) - Add to MetaCart
to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the Hmited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads

Message-passing for wireless . . .

by Paolo Giaccone, Devavrat Shah , 2010
"... In the recent years, message-passing paradigm has emerged as a canonical algorithmic solution to solve network-wide problems by means of minimal local information exchange, across variety of disciplines. The primary purpose of this work is to understand tradeoffs offered between network performance ..."
Abstract - Add to MetaCart
In the recent years, message-passing paradigm has emerged as a canonical algorithmic solution to solve network-wide problems by means of minimal local information exchange, across variety of disciplines. The primary purpose of this work is to understand tradeoffs offered between network

Types as Models: Model Checking Message-Passing Programs

by Sagar Chaki, Sriram K. Rajamani, Jakob Rehof - In Principles of Programming Languages (POPL , 2001
"... Abstraction and composition are the fundamental issues in making model checking viable for software. This paper proposes new techniques for automating abstraction and decomposition using source level type information provided by the programmer. Our system includes two novel components to achieve thi ..."
Abstract - Cited by 94 (3 self) - Add to MetaCart
Abstraction and composition are the fundamental issues in making model checking viable for software. This paper proposes new techniques for automating abstraction and decomposition using source level type information provided by the programmer. Our system includes two novel components to achieve

The generalized distributive law

by Srinivas M. Aji, Robert J. Mceliece - Information Theory, IEEE Transactions on
"... Abstract—In this semitutorial paper we discuss a general message passing algorithm, which we call the generalized dis-tributive law (GDL). The GDL is a synthesis of the work of many authors in the information theory, digital communications, signal processing, statistics, and artificial intelligence ..."
Abstract - Cited by 359 (2 self) - Add to MetaCart
Abstract—In this semitutorial paper we discuss a general message passing algorithm, which we call the generalized dis-tributive law (GDL). The GDL is a synthesis of the work of many authors in the information theory, digital communications, signal processing, statistics, and artificial intelligence

Message-Passing Program Development by Ensemble

by J. Y. Cotronis , 1997
"... We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in message-passing environments (MPE). Applications are specified by scripts, which represent Process Communication Graphs (PCG) annotated with i ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in message-passing environments (MPE). Applications are specified by scripts, which represent Process Communication Graphs (PCG) annotated

Message-Passing Program Development by Ensemble

by Cotronis Dept Of, J. Y. Cotronis - Recent Advances in PVM and MPI. LNCS Vol. 1332 , 1997
"... We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing environments (MPE). Applications are specified by scripts, which represent Process Communication Graphs (PCG) annotated with in ..."
Abstract - Add to MetaCart
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing environments (MPE). Applications are specified by scripts, which represent Process Communication Graphs (PCG) annotated
Results 1 - 10 of 2,300