T. H. Cormen and M. T. Goodrich, A bridging model for parallel computation, communication, and I/O, ACM Computing Surveys, vol.28, issue.4es, 1996.
DOI : 10.1145/242224.242490

A. Czumaj, P. Kanarek, M. Kutylowski, and K. Lorys, Fast Generation of Random Permutations Via Networks Simulation, Algorithmica, vol.21, issue.1, pp.2-20, 1998.
DOI : 10.1007/PL00009206

F. K. Dehne, W. Dittrich, and D. Hutchinson, Efficient external memory algorithms by simulating coarse-grained parallel algorithms, ACM Symposium on Parallel Algorithms and Architectures, pp.106-115, 1997.

R. Durstenfeld, Algorithm 235: Random permutation, Communications of the ACM, vol.7, issue.7, p.420, 1964.
DOI : 10.1145/364520.364540

M. Essa¨?diessa¨?di, I. Guérin-lassous, and J. Gustedt, SSCRAP: An environment for coarse grained algorithms, Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems, pp.398-403, 2002.

M. Essa¨?diessa¨?di, J. Gustedt, and . Feb, An experimental validation of the PRO model for parallel and distributed computation, 14th Euromicro Conference on Parallel, Distributed and Network based Processing, pp.449-456, 2006.

A. H. Gebremedhin, I. Guérin-lassous, J. Gustedt, and J. A. Telle, PRO: a model for parallel resource-optimal computation, 16th Annual International Symposium on High Performance Computing Systems and Applications. IEEE, pp.106-113, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00100848

M. T. Goodrich, Randomized fully-scalable BSP techniques for multisearching and convex hull construction, Proceedings of the eighth annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Society of Industrial and Applied Mathematics, pp.767-776, 1997.

G. Lassous, I. Thierry, and ´. E. , Generating random permutations in the framework of parallel coarse grained models, Proceedings of OPODIS'2000, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072758

J. Gustedt, Towards Realistic Implementations of External Memory Algorithms Using a Coarse Grained Paradigm, International Conference on Computational Science and its Applications (ICCSA 2003), part II. No. 2668 in LNCS, pp.269-278, 2003.
DOI : 10.1007/3-540-44843-8_29

URL : https://hal.archives-ouvertes.fr/inria-00099787

J. Gustedt, S. Vialle, D. Vivo, A. Kågström, B. Elmroth et al., parXXL: A fine grained development environment on coarse grained architectures Workshop on state-of-the-art in scientific and parallel computing (PARA'06) Fast parallel generation of random permutations, of Lecture Notes in Comp. Sci proceedings of the 18th International Colloquium ICALP'91, pp.405-416, 1991.

D. E. Knuth, The Art of Computer Programming Seminumerical Algorithms, 1981.

C. P. Kruskal, L. Rudolph, and M. Snir, A complexity theory of efficient parallel algorithms, Theoretical Computer Science, vol.71, issue.1, pp.95-132, 1990.
DOI : 10.1016/0304-3975(90)90192-K

L. E. Moses and R. V. Oakford, Tables of Random Permutations, 1963.

J. H. Reif, An optimal parallel algorithm for integer sorting, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.496-504, 1985.
DOI : 10.1109/SFCS.1985.9

K. E. Siegrist and H. Zechner, Finite Sampling Models: The Multivariate Hypergeometric Distribution The patchwork rejection technique for sampling from unimodal distributions, Ch. C. ACM Trans. Modeling and Comp. Simul, vol.4, issue.91, pp.59-80, 1999.

L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181

J. S. Vitter, External memory algorithms and data structures: dealing with massive data, ACM Computing Surveys, vol.33, issue.2, pp.209-271, 2001.
DOI : 10.1145/384192.384193

J. S. Vitter and A. Aggarwal, The input/output complexity of sorting and related problems, Communications of the ACM, vol.31, issue.9, pp.1116-1127, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00075827

T. Wu, Computation of the multivariate hypergeometric distribution function, Computing Science and Statistics, vol.24, pp.25-28, 1992.

H. Zechner, Efficient sampling from continuous and discrete unimodal distributions, 1997.

H. Zechner and E. Stadlober, Erzeugung von beta-verteilten Zufallszahlen mittels Patchwork-Verwerfung, Computing, vol.28, issue.1, pp.1-18, 1993.
DOI : 10.1007/BF02280036