Sciweavers

760 search results - page 42 / 152
» Efficient Communication Using Partial Information
Sort
View
TSP
2008
100views more  TSP 2008»
13 years 10 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
ICSE
2010
IEEE-ACM
13 years 12 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
CLUSTER
2006
IEEE
13 years 10 months ago
Performance of parallel communication and spawning primitives on a Linux cluster
The Linux cluster considered in this paper, formed from shuttle box XPC nodes with 2 GHz Athlon processors connected by dual Gb Ethernet switches, is relatively easily constructed...
David J. Johnston, Martin Fleury, Michael Lincoln,...
ICS
2003
Tsinghua U.
14 years 3 months ago
Inferential queueing and speculative push for reducing critical communication latencies
Communication latencies within critical sections constitute a major bottleneck in some classes of emerging parallel workloads. In this paper, we argue for the use of Inferentially...
Ravi Rajwar, Alain Kägi, James R. Goodman
CIC
2004
13 years 11 months ago
Dynamic Characteristics of k-ary n-cube Networks for Real-time Communication
Overlay topologies are now popular with many emerging peer-to-peer (P2P) systems, to efficiently locate and retrieve information. In contrast, the focus of this work is to use ove...
Gerald Fry, Richard West