22 search results - page 4 / 5 » Fault Tolerance in Message Passing and in Action |
SRDS
2008
IEEE
14 years 4 months ago
2008
IEEE
The efficiency of service discovery is critical in the development of fully decentralized middleware intended to manage large scale computational grids. This demand influenced t...
PODC
2009
ACM
14 years 4 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
APCSAC
2007
IEEE
14 years 4 months ago
2007
IEEE
MPI (the Message Passing Interface) continues to be the dominant programming model for parallel machines of all sizes, from small Linux clusters to the largest parallel supercomput...
ISCA
2009
IEEE
14 years 4 months ago
2009
IEEE
Detecting data races in parallel programs is important for both software development and production-run diagnosis. Recently, there have been several proposals for hardware-assiste...
PDCAT
2005
Springer
14 years 3 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...