A Complexity O(1) priority queue for event driven molecular dynamics simulations

Journal of Computational Physics

Volumn 221, Issue 2, 2007, Pages 615-625

  Paul, Gerald ^a  

^a Boston University   (United States)

Author keywords

Molecular dynamics; Priority queue

Indexed keywords

QUEUEING THEORY;

DYNAMICS SIMULATION; EVENT-DRIVEN; PRIORITY QUEUES;

MOLECULAR DYNAMICS;

EID: 33846366012     PISSN: 00219991     EISSN: 10902716     Source Type: Journal    
DOI: 10.1016/j.jcp.2006.06.042     Document Type: Article

References (40)

1. Alder B.J., and Wainwright T.E. Studies in molecular dynamics. I. General method. J. Chem. Phys. 31 (1959) 459
2. Allen M.P., and Tildesley D.J. Computer Simulations of Liquids (1987), Oxford Science Publications
3. Allen M.P., Frenkel D., and Talbot J. Molecular dynamics simulation using hard particles. Comput. Phys. Rep. 9 (1989) 301
4. AMD Opteron Product Data Sheet. Publication 23932. (2004).
5. In: Becker O.M., Mackerell A.D., Roux B., and Becker B.M. (Eds). Computational Biochemistry and Biophysics. Marcel Dekker (2001)
6. Bentley J. Programming pearls: Thanks. heaps. Commun. ACM (1985) 245-250
7. Blackstone J.H., Hogg G.L., and Phillips D.T. A two-list synchronization procedure for discrete event simulation. Commun. ACM 24 (1981) 825-829
8. Brown M.R. The analysis of a practical and nearly optimal priority queue algorithms. SIAM J. Comput. 7 (1978) 298-319
9. Brown R. Calendar queues. Commun. ACM 31 10 (1988) 1220-1227
10. Daggett V., and Fersht A.R. Transition states in protein folding. In: Pain R.H. (Ed). Mechanisms of Protein Folding (2000), Oxford University Press
11. Donev A., Torquato S., Stillinger F.H., and Connelly R. Jamming in hard sphere and disk packings. J. Appl. Phys. 95 (2004) 989-999
12. Donev A., Torquato S., and Stillinger F.H. Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I. Algorithmic details. J. Comput. Phys. 202 (2005) 737-764
13. Erpenbeck J.J., and Wood W.W. In: Berne B.J. (Ed). Statistical mechanics B: Modern theoretical chemistry. Molecular Dynamics Techniques for Hard Core Systems vol. 6 (1977), Institute of Physics Publishing, London 1-40
14. J. Francon, G. Viennot, J. Vuillemin, Description and analysis of an efficient priority queue representation, in: Proceeding of the 19th Annual Symposium on Foundations of Computer Science. IEEE, 1978, pp. 1-7.
15. Fredman M.L., Sedgewick R., Sleator D., and Tarjan R. The pairing heap: A new form of self-adjusting heap. Algorithmica 1 (1986) 111-129
16. Frenkel D., and Smit B. Understanding Molecular Simulation (2002), Academic Press, New York
17. Handy H. Cache Memory Book (1998), Academic Press
18. J.O. Henriksen, An improved events list algorithm, in: Proceedings of the 1977 Winter Simulation Conference, IEEE, 1977, pp. 547-557.
19. J.O. Henriksen, Event list management - A tutorial, in: Proceeding of the 1983 Winter Simulation Conference, IEEE, 1983, pp. 543-551.
20. Hennessy J.L., and Patterson D.A. Computer Architecture: A Quantitative Approach (2002), Elsevier
21. Intel Xeon Processor with 800 MHZ System Bus Datasheet. Document Number 302355-001, 2004.
22. Jones D.W. An empirical comparison of priority-queue and event-set implementations. Commun. ACM 29 (1986) 300-311
23. J.H. Kingston, The amortized complexity of Henriksens algorithm. Comput. Sci. Tech. Rep. 85-06, Dept. of Computer Science, University of Iowa, 1985.
24. Knuth D.E. The Art of Computer Programming Sorting and Searching Vol. 3 (1973), Addison-Wesley
25. Krantz A.T. Analysis of an efficient algorithm for the hard-sphere problem. TOMACS 6 (1996) 185-229
26. Lubachevsky B.D. How to simulate billiards and similar systems. J. Comput. Phys. 94 (1991) 255
27. Marín M., Risso D., and Cordero P. Efficient algorithms for many-body hard particle molecular dynamics. J. Comput. Phys. 109 (1993) 306-317
28. Marín M., and Cordero P. An empirical assessment of priority queues in event-driven molecular dynamics simulation. Comput. Phys. Commun. 92 (1995) 214-224
29. R. Nix An evaluation of pagodas. Res. Rep. 164, Dept. of Computer Science, Yale University.
30. Rapaport D.C. The event scheduling problem in molecular dynamics simulation. J. Comput. Phys. 34 (1980) 84-201
31. Rapaport D.C. Art of Molecular Dynamics Simulation (2004), Cambridge University Press
32. Sudus R.J. Molecular Simulation of Fluids (1999), Elsevier
33. Saavedra R.H., and Smith A.J. Measuring cache and TLB performance and their effects on benchmark runtimes. IEEE Trans. Comp. 44 (1995) 1223-1235
34. Shida K., and Anzai Y. Reduction of the event-list for molecular dynamic simulation. Comput. Phys. Commun. 69 (1992) 317-329
35. D.D. Sleator and R.E. Tarjan, Self-adjusting binary trees, in: Proceedings of the ACM SIGACT Symposium on theory of Computing, 1983, pp. 235-245.
36. Sleator D.D., and Tarjan R.E. Self-adjusting heaps. SIAM J. Comput. 15 (1986) 52-69
37. Tarjan R.E., and Sleator D.D. Self-adjusting binary search trees. JACM 32 (1985) 652-686
38. Urbanc B., Borreguero J.M., Cruz L., and Stanley H.E. Ab initio discrete molecular dynamics approach to protein folding and aggregation. Methods in Enzymology 412 (2006) 314-338 (Chapter 19)
39. Vuillemin J.A. A data structure for manipulating priority queues. Commun. ACM 21 (1978) 309-315
40. Williams J.W.J. Algorithm 232: Heapsort. Commun. ACM 7 (1964) 347-348