Sciweavers

844 search results - page 81 / 169
» Truncated Message Passing
Sort
View
JACM
2008
90views more  JACM 2008»
13 years 9 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
PPL
2008
97views more  PPL 2008»
13 years 9 months ago
The Impact of Dynamic Channels on Functional Topology Skeletons
Parallel functional programs with implicit communication often generate purely hierarchical communication topologies during execution: communication only happens between parent an...
Jost Berthold, Rita Loogen
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 8 months ago
On Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
PVM
2010
Springer
13 years 7 months ago
Efficient MPI Support for Advanced Hybrid Programming Models
The number of multithreaded Message Passing Interface (MPI) implementations and applications is increasing rapidly. We discuss how multithreaded applications can receive messages o...
Torsten Hoefler, Greg Bronevetsky, Brian Barrett, ...
IPPS
1998
IEEE
14 years 1 months ago
Pin-Down Cache: A Virtual Memory Management Technique for Zero-Copy Communication
The overhead of copying data through the central processor by a message passing protocol limits data transfer bandwidth. If the network interface directly transfers the user'...
Hiroshi Tezuka, Francis O'Carroll, Atsushi Hori, Y...