432 search results - page 3 / 87 » Internally deterministic parallel algorithms can be fast |
100
click to vote
JEA
1998
15 years 1 months ago
1998
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
135
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
108
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
155
click to vote
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...