204 search results - page 15 / 41 » Fault-tolerant solutions for a MPI compute intensive applica... |
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
BMCBI
2005
13 years 7 months ago
2005
Background: BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local ...
DIALM
2007
ACM
13 years 11 months ago
2007
ACM
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
DSN
2003
IEEE
14 years 24 days ago
2003
IEEE
The DepAuDE architecture provides middleware to integrate fault tolerance support into distributed embedded automation applications. It allows error recovery to be expressed in te...
SIGCSE
2008
ACM
13 years 7 months ago
2008
ACM
: The generalized problem of placing n queens on an n-by-n board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion...