317 search results - page 10 / 64 » Snap-Stabilization in Message-Passing Systems |
ISORC
1998
IEEE
14 years 2 months ago
1998
IEEE
Traditionally transactions have been singlethreaded. In such an environment the thread terminating the transaction is, by definition, the thread which performed the work. Therefor...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
In this paper we report on features added to a parallel debugger to simplify the debugging of message passing programs. These features include replay, setting consistent breakpoin...
CCECE
2006
IEEE
14 years 3 months ago
2006
IEEE
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
LCPC
1997
Springer
14 years 1 months ago
1997
Springer
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...