432 search results - page 6 / 87 » Internally deterministic parallel algorithms can be fast |
SAC
2009
ACM
15 years 4 months ago
2009
ACM
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...
78
Voted
EUROPAR
1997
Springer
15 years 1 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
SRDS
2008
IEEE
15 years 3 months ago
2008
IEEE
Existing clock synchronization algorithms assume a bounded clock reading error. This, in turn, results in an inflexible design that typically requires node crashes whenever the g...
PODC
2000
ACM
15 years 1 months ago
2000
ACM
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Large and fast hard disks for little money have enabled the processing of huge amounts of data on a single machine. For this purpose, the well-established STXXL library provides a...