Algorithm 947: Paraperm: Parallel Generation of Random Permutations with MPI

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F14%3A00211388" target="_blank" >RIV/68407700:21240/14:00211388 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/2669372" target="_blank" >http://dx.doi.org/10.1145/2669372</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2669372" target="_blank" >10.1145/2669372</a>

Result language
angličtina
Original language name
Algorithm 947: Paraperm: Parallel Generation of Random Permutations with MPI
Original language description
An algorithm for parallel generation of a random permutation of a large set of distinct integers is presented. This algorithm is designed for massively parallel systems with distributed memory architectures and the MPI-based runtime environments. Scalability of the algorithm is analyzed according to the memory and communication requirements. An implementation of the algorithm in a form of a software library based on the C++ programming language and the MPI application programming interface is further provided. Finally, performed experiments are described and their results discussed. The biggest of these experiments resulted in a generation of a random permutation of 2^41 integers in slightly more than four minutes using 131072 CPU cores.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GAP202%2F12%2F2011" target="_blank" >GAP202/12/2011: Parallel Input/Output Algorithms for Very Large Sparse Matrices</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)