P. Le and . Momentanément-non-cohérent, Le programme utilisateur se charge de stocker les éléments dans un tableau temporaire et demande ensuite leur ré-intégration par la fonction (pma_add_array_elts)

L. Clé-permettant-d, ordonner les éléments est codée sur 64bits Le contenu des éléments fourni par l'utilisateur est copié à côté de la clé et la brique de base ainsi Bibliographie Alok Aggarwal and S. Vitter, Jeffrey. The input/output complexity of sorting and related problems, Commun. ACM, issue.9, pp.311116-1127, 1988.

J. Alder and T. E. Wainwright, Phase Transition for a Hard Sphere System, The Journal of Chemical Physics, vol.27, issue.5, pp.1208-1209, 1957.
DOI : 10.1063/1.1743957

J. Allard, H. Courtecuisse, and F. Faure, Implicit FEM and fluid coupling on GPU for interactive multiphysics simulation, ACM SIGGRAPH 2011 Talks on, SIGGRAPH '11, 2011.
DOI : 10.1145/2037826.2037895
URL : https://hal.archives-ouvertes.fr/inria-00589203

J. A. Anderson, C. D. Lorenz, and A. Travesset, General purpose molecular dynamics simulations fully implemented on graphics processing units, Journal of Computational Physics, vol.227, issue.10, pp.5342-5359, 2008.
DOI : 10.1016/j.jcp.2008.01.047

L. Arge, M. Knudsen, and K. Larsen, A general lower bound on the i/ocomplexity of comparison-based algorithms, Proceedings of the Third Workshop on Algorithms and Data Structures, WADS '93, pp.83-94, 1993.

J. Barnes and P. Hut, A hierarchical O(N log N) force-calculation algorithm, Nature, vol.6, issue.6096, pp.446-449, 1986.
DOI : 10.1038/324446a0

S. Bayraktar, U. Güdükbay, and B. Özgüç, GPU-Based Neighbor-Search Algorithm for Particle Simulations, Journal of Graphics, GPU, and Game Tools, vol.14, issue.1, pp.31-42, 2009.
DOI : 10.1080/2151237X.2009.10129272

M. A. Bender, E. D. Demaine, and M. Farach-colton, Cache-oblivious b-trees, Proceedings. 41st Annual Symposium on, pp.399-409, 2000.

A. Michael, H. Bender, and . Hu, An adaptive packed-memory array, ACM Trans. Database Syst, vol.32, 2007.

M. A. Bender, M. Farach-colton, and M. A. Mosteiro, Insertion sort is o(n log n). CoRR, cs, DS/0407003, 2002.

M. A. Bender, E. D. Demaine, and M. Farach-colton, Cache-Oblivious B-Trees, SIAM Journal on Computing, vol.35, issue.2, pp.341-358, 2005.
DOI : 10.1137/S0097539701389956

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall et al., Cilk : An efficient multithreaded runtime system, Journal of Parallel and Distributed Computing, vol.373, issue.51, pp.55-69, 1996.

R. Gerth-stølting-brodal, G. Fagerberg, and . Moruz, Cache-aware and cacheoblivious adaptive sorting, Proceedings of the 32nd international conference on Automata, Languages and Programming, ICALP'05, pp.576-588, 2005.

F. Broquedis, T. Gautier, and V. Danjean, libKOMP, an Efficient OpenMP Runtime System for Both Fork-Join and Data Flow Paradigms, Proceedings of the 8th international conference on OpenMP in a Heterogeneous World, IWOMP'12, pp.102-115
DOI : 10.1007/978-3-642-30961-8_8
URL : https://hal.archives-ouvertes.fr/hal-00796253

W. , M. Brown, P. Wang, S. J. Plimpton, and A. N. Tharrington, Implementing molecular dynamics on hybrid high performance computers ? short range forces, Computer Physics Communications, vol.182, issue.4, pp.898-911

R. Arthur and . Butz, Convergence with hilbert's space filling curve, Journal of Computer and System Sciences, vol.3, issue.2, pp.128-146, 1969.

S. Carlsson and J. Chen, On partitions and presortedness of sequences, Acta Informatica, vol.28, issue.3, pp.267-280
DOI : 10.1007/BF01185681

J. D. Cohen, M. C. Lin, D. Manocha, and M. Ponamgi, I-COLLIDE, Proceedings of the 1995 symposium on Interactive 3D graphics , SI3D '95, p.189, 1995.
DOI : 10.1145/199404.199437

R. Curtis, D. Cook, and . Kim, Best sorting algorithm for nearly sorted lists, Commun. ACM, vol.23, issue.11, pp.620-624, 1980.

R. Courant, K. Friedrichs, and H. Lewy, ???ber die partiellen Differenzengleichungen der mathematischen Physik, Mathematische Annalen, vol.98, issue.6, pp.32-74, 1928.
DOI : 10.1007/BF01448839

P. A. Cundall and O. D. Strack, A discrete numerical model for granular assemblies, G??otechnique, vol.29, issue.1, pp.47-65, 1979.
DOI : 10.1680/geot.1979.29.1.47

H. K. Dai and H. C. Su, On the Locality Properties of Space-Filling Curves, Algorithms and Computation, pp.385-394, 2003.
DOI : 10.1007/978-3-540-24587-2_40

E. D. Demaine, Cache-oblivious algorithms and data structures, In IN LECTURE NOTES FROM THE EEF SUMMER SCHOOL ON MASSIVE DATA SETS, vol.1, issue.32, 2002.

W. Edsger and . Dijkstra, Smoothsort, an alternative for sorting in situ, Science of Computer Programming, vol.11, issue.3 31, pp.223-233, 1982.

G. Dromey, Exploiting partial order with quicksort. Software : Practice and Experience, pp.509-518, 1984.

M. Durand, F. Faure, and B. Raffin, A Packed Memory Array to Keep Moving Particles Sorted, 9th Workshop on Virtual Reality Interaction and Physical Simulation (VRIPHYS), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00762593

M. Durand, P. Marin, F. Faure, and B. Raffin, DEM-based simulation of concrete structures on GPU, European Journal of Environmental and Civil Engineering, vol.193, issue.17, pp.1-13, 2012.
DOI : 10.1080/19648189.2012.716590
URL : https://hal.archives-ouvertes.fr/hal-00733674

M. Durand, F. Broquedis, T. Gautier, and B. Raffin, An Efficient OpenMP Loop Scheduler for Irregular Applications on Large-Scale NUMA Machines, IWOMP, pp.141-155, 2013.
DOI : 10.1007/978-3-642-40698-0_11
URL : https://hal.archives-ouvertes.fr/hal-00867438

V. Estivill-castro and D. Wood, A survey of adaptive sorting algorithms, ACM Computing Surveys, vol.24, issue.4, pp.441-476, 1992.
DOI : 10.1145/146370.146381

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, Cacheoblivious algorithms, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS '99, p.285, 1999.

P. Goswami, P. Schlegel, B. Solenthaler, and R. Pajarola, Interactive sph simulation and rendering on the gpu, Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, SCA '10, pp.55-64, 2010.

S. Green, Particle simulation using cuda, CUDA SDK, 2010.

L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, Journal of Computational Physics, vol.73, issue.2, pp.325-348, 1987.
DOI : 10.1016/0021-9991(87)90140-9

T. Harada, S. Koshizuka, and Y. Kawaguchi, Smoothed particle hydrodynamics on gpus, Structure, pp.1-8

H. Francis and . Harlow, Hydrodynamic problems involving large fluid distortions, Journal of the ACM, vol.4, issue.2, pp.137-142

S. Hentz, L. Daudeville, and F. V. Donzé, Identification and Validation of a Discrete Element Model for Concrete, Journal of Engineering Mechanics, vol.130, issue.6, pp.709-719, 2004.
DOI : 10.1061/(ASCE)0733-9399(2004)130:6(709)

C. Rama and . Hoetzlein, Fluids v.3 -a large-scale, open source fluid simulator., december 2012

M. Ihmsen, N. Akinci, M. Becker, and M. Teschner, A Parallel SPH Implementation on Multi-Core CPUs, Computer Graphics Forum, vol.87, issue.1-2, pp.99-112
DOI : 10.1111/j.1467-8659.2010.01832.x

A. Itai, A. Konheim, and M. Rodeh, A sparse table implementation of priority queues, Automata, Languages and Programming, pp.417-431
DOI : 10.1007/3-540-10843-2_34

M. Kunaseth, K. Nomura, H. Dursun, R. K. Kalia, A. Nakano et al., Memory-Access Optimization of Parallel Molecular Dynamics Simulation via Dynamic Data Reordering, Proceedings of the 18th international conference on Parallel Processing, Euro-Par'12, pp.781-792, 2012.
DOI : 10.1007/978-3-642-32820-6_78

A. Lamarca and R. E. Ladner, The Influence of Caches on the Performance of Sorting, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, SODA '97, pp.370-379, 1997.
DOI : 10.1006/jagm.1998.0985

C. Levcopoulos and O. Petersson, Splitsort?an adaptive sorting algorithm, Information Processing Letters, vol.391, issue.4 31, pp.205-211, 1991.
DOI : 10.1016/0020-0190(91)90181-g

H. Mannila, Measures of presortedness and optimal sorting algorithms, IEEE Trans. Comput, vol.34, issue.4, pp.318-325, 1985.

K. Mehlhorn, Sorting presorted files, Theoretical Computer Science 4th GI Conference, pp.199-212, 1979.
DOI : 10.1007/3-540-09118-1_22
URL : http://hdl.handle.net/11858/00-001M-0000-0014-AF7B-C

J. J. Monaghan, Smoothed Particle Hydrodynamics, Annual Review of Astronomy and Astrophysics, vol.30, issue.1, pp.543-574
DOI : 10.1146/annurev.aa.30.090192.002551

B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz, Analysis of the clustering properties of the hilbert space-filling curve. Knowledge and Data Engineering, IEEE Transactions on, vol.13, issue.1, pp.124-141, 2001.

R. David and . Musser, Introspective sorting and selection algorithms, Softw. Pract. Exper, vol.27, issue.8, pp.983-993, 1997.

N. Nvidia, CUDA c programming guide version 4.0. CUDA Documentation, 2011.

O. Petersson and A. Moffat, A framework for adaptive sorting, Discrete Applied Mathematics, vol.59, issue.2, pp.153-179, 1995.
DOI : 10.1016/0166-218X(93)E0160-Z

D. C. Rapaport, Enhanced molecular dynamics performance with a programmable graphics processor, Computer Physics Communications, vol.182, issue.4, pp.926-934
DOI : 10.1016/j.cpc.2010.12.029

J. Reindersreilly, &. Associates, and . Inc, Intel threading building blocks, 2007.

V. Rokhlin, Rapid solution of integral equations of classical potential theory, Journal of Computational Physics, vol.60, issue.2, pp.187-207, 1985.
DOI : 10.1016/0021-9991(85)90002-6

J. Rousseau, P. Marin, L. Daudeville, and S. Potapov, Couplage Eléments Finis/Eléments Discrets : application à la simulation d'impact localisé sur un ouvrage en béton armé, 9ème Colloque National en calcul des Structures, 2001.

J. Rousseau, Modélisation numérique du comportement dynamique de structures sous impact sévère avec un couplage éléments discrets / éléments finis. These, Université Joseph-Fourier -Grenoble I, 2001.

N. Satish, M. Harris, and M. Garland, Designing efficient sorting algorithms for manycore GPUs, 2009 IEEE International Symposium on Parallel & Distributed Processing, pp.1-10, 2002.
DOI : 10.1109/IPDPS.2009.5161005

Y. Shigeto and M. Sakai, Parallel computing of discrete element method on multi-core processors, Particuology, vol.9, issue.4, pp.398-405
DOI : 10.1016/j.partic.2011.04.002

. Sphysics and . Sphysics, URL https, 2011.

A. Sunarso, T. Tsuji, and S. Chono, GPU-accelerated molecular dynamics simulation for study of liquid crystalline flows, Journal of Computational Physics, vol.229, issue.15, pp.5486-5497
DOI : 10.1016/j.jcp.2010.03.047

J. Antoon-van-meel, A. Arnold, D. Frenkel, S. F. Zwart, and R. G. Belleman, Harvesting graphics power for MD simulations, Molecular Simulation, vol.19, issue.3, pp.259-266, 2001.
DOI : 10.1016/j.jcp.2006.06.039

L. Verlet, Computer "Experiments" on Classical Fluids. I. Thermodynamical Properties of Lennard-Jones Molecules, Physical Review, vol.159, issue.1, pp.98-103, 1967.
DOI : 10.1103/PhysRev.159.98

L. Xiao, X. Zhang, and S. A. Kubricht, Improving memory performance of sorting algorithms, Journal of Experimental Algorithmics, vol.5, 2000.
DOI : 10.1145/351827.384245

F. Zhang, L. Hu, J. Wu, and X. Shen, A SPH-based method for interactive fluids simulation on the multi-GPU, Proceedings of the 10th International Conference on Virtual Reality Continuum and Its Applications in Industry, VRCAI '11, pp.423-426, 2011.
DOI : 10.1145/2087756.2087834

X. Zhao, F. Li, and S. Zhan, A New GPU-Based Neighbor Search Algorithm for Fluid Simulations, 2010 2nd International Workshop on Database Technology and Applications, pp.1-4, 2010.
DOI : 10.1109/DBTA.2010.5659015