Sciweavers

1497 search results - page 60 / 300
» A Computational Model for Message Passing
Sort
View
PVM
1999
Springer
14 years 1 months ago
Building MPI for Multi-Programming Systems Using Implicit Information
Abstract. With the growing importance of fast system area networks in the parallel community, it is becoming common for message passing programs to run in multi-programming environ...
Frederick C. Wong, Andrea C. Arpaci-Dusseau, David...
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 9 months ago
The computational power of population protocols
We consider the model of population protocols introduced by Angluin et al. [AAD+ 04], in which anonymous finite-state agents stably compute a predicate of the multiset of their in...
Dana Angluin, James Aspnes, David Eisenstat, Eric ...
TRIDENTCOM
2006
IEEE
14 years 3 months ago
A reliable optimization on distributed mutual exclusion algorithm
– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
Moharram Challenger, Peyman Bayat, Mohammad Reza M...
GD
2008
Springer
13 years 10 months ago
Succinct Greedy Graph Drawing in the Hyperbolic Plane
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
David Eppstein, Michael T. Goodrich
CLUSTER
2004
IEEE
14 years 29 days ago
Improved message logging versus improved coordinated checkpointing for fault tolerant MPI
Fault tolerance is a very important concern for critical high performance applications using the MPI library. Several protocols provide automatic and transparent fault detection a...
Pierre Lemarinier, Aurelien Bouteiller, Thomas H&e...