Sciweavers

1497 search results - page 56 / 300
» A Computational Model for Message Passing
Sort
View
ICCS
2004
Springer
14 years 2 months ago
Predicting MPI Buffer Addresses
Communication latencies have been identified as one of the performance limiting factors of message passing applications in clusters of workstations/multiprocessors. On the receiver...
Felix Freitag, Montse Farreras, Toni Cortes, Jes&u...
ICDCN
2011
Springer
13 years 20 days ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
EUROPAR
2001
Springer
14 years 1 months ago
Optimal Polling for Latency-Throughput Tradeoffs in Queue-Based Network Interfaces for Clusters
We consider a networking subsystem for message–passing clusters that uses two unidirectional queues for data transfers between the network interface card (NIC) and the lower prot...
Dmitry Ponomarev, Kanad Ghose, Eugeny Saksonov
UAI
2008
13 years 10 months ago
Bounds on the Bethe Free Energy for Gaussian Networks
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
Botond Cseke, Tom Heskes
CDC
2009
IEEE
160views Control Systems» more  CDC 2009»
13 years 7 months ago
Exploring and exploiting routing opportunities in wireless ad-hoc networks
Abstract--In this paper, d-AdaptOR, a distributed opportunistic routing scheme for multi-hop wireless ad-hoc networks is proposed. The proposed scheme utilizes a reinforcement lear...
Abhijeet Bhorkar, Mohammad Naghshvar, Tara Javidi,...