Affiliation:
1. Czech Technical University in Prague
2. Louisiana State University
Abstract
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.
Funder
Office of Cyberinfrastructure
University of Illinois at Urbana-Champaign
LSU College of Engineering
Projects of Large Infrastructure for Research, Development, and Innovations
CERIT-SC computing and storage facilities
Center CERIT Scientific Cloud
the state of Illinois
National Grid Infrastructure MetaCentrum
U.S. Department of Energy
Blue Waters sustained-petascale computing project
Ministry of Education, Youth and Sports
National Center for Supercomputing Applications
Czech Science Foundation
Blue Waters
Louisiana Optical Network Initiative
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献