The input/output complexity of sorting and related problems
Communications of the ACM
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A bridging model for parallel computation
Communications of the ACM
A bridging model for parallel computation, communication, and I/O
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The patchwork rejection technique for sampling from unimodal distributions
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Randomized fully-scalable BSP techniques for multi-searching and convex hull construction
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Algorithm 235: Random permutation
Communications of the ACM
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Fast Parallel Generation of Random Permutations
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Fast Generation of Random Permutations via Networks Simulation
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
PRO: A Model for Parallel Resource-Optimal Computation
HPCS '02 Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications
An Experimental Validation of the PRO Model for Parallel and Distributed Computation
PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
An optimal parallel algorithm for integer sorting
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Towards realistic implementations of external memory algorithms using a coarse grained paradigm
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Engineering parallel in-place random generation of integer permutations
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
| Hi-index | 0.00 |
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallelism and external memory. In contrast to previously known work for parallel setups, our method is able to fulfill the three criteria of uniformity, work-optimality and balance among the processors simultaneously. To guarantee the uniformity we investigate the matrix of communication requests between the processors. We show that its distribution is a generalization of the multivariate hypergeometric distribution and we give algorithms to sample it efficiently in the two settings.