메뉴 건너뛰기




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

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

Author keywords

Molecular dynamics; Priority queue

Indexed keywords

QUEUEING THEORY;

EID: 33846366012     PISSN: 00219991     EISSN: 10902716     Source Type: Journal    
DOI: 10.1016/j.jcp.2006.06.042     Document Type: Article
Times cited : (45)

References (40)
  • 1
    • 36849126204 scopus 로고
    • Studies in molecular dynamics. I. General method
    • Alder B.J., and Wainwright T.E. Studies in molecular dynamics. I. General method. J. Chem. Phys. 31 (1959) 459
    • (1959) J. Chem. Phys. , vol.31 , pp. 459
    • Alder, B.J.1    Wainwright, T.E.2
  • 3
    • 0000828834 scopus 로고
    • Molecular dynamics simulation using hard particles
    • Allen M.P., Frenkel D., and Talbot J. Molecular dynamics simulation using hard particles. Comput. Phys. Rep. 9 (1989) 301
    • (1989) Comput. Phys. Rep. , vol.9 , pp. 301
    • Allen, M.P.1    Frenkel, D.2    Talbot, J.3
  • 4
    • 85190280473 scopus 로고    scopus 로고
    • AMD Opteron Product Data Sheet. Publication 23932. (2004).
  • 5
    • 33846370201 scopus 로고    scopus 로고
    • Becker O.M., Mackerell A.D., Roux B., and Becker B.M. (Eds)
    • In: Becker O.M., Mackerell A.D., Roux B., and Becker B.M. (Eds). Computational Biochemistry and Biophysics. Marcel Dekker (2001)
    • (2001) Marcel Dekker
  • 6
    • 33846385358 scopus 로고
    • Programming pearls: Thanks
    • Bentley J. Programming pearls: Thanks. heaps. Commun. ACM (1985) 245-250
    • (1985) heaps. Commun. ACM , pp. 245-250
    • Bentley, J.1
  • 7
    • 0019698561 scopus 로고
    • A two-list synchronization procedure for discrete event simulation
    • 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
    • (1981) Commun. ACM , vol.24 , pp. 825-829
    • Blackstone, J.H.1    Hogg, G.L.2    Phillips, D.T.3
  • 8
    • 0000663669 scopus 로고
    • The analysis of a practical and nearly optimal priority queue algorithms
    • Brown M.R. The analysis of a practical and nearly optimal priority queue algorithms. SIAM J. Comput. 7 (1978) 298-319
    • (1978) SIAM J. Comput. , vol.7 , pp. 298-319
    • Brown, M.R.1
  • 10
    • 0004245772 scopus 로고    scopus 로고
    • Transition states in protein folding
    • Pain R.H. (Ed), Oxford University Press
    • Daggett V., and Fersht A.R. Transition states in protein folding. In: Pain R.H. (Ed). Mechanisms of Protein Folding (2000), Oxford University Press
    • (2000) Mechanisms of Protein Folding
    • Daggett, V.1    Fersht, A.R.2
  • 12
    • 10244259129 scopus 로고    scopus 로고
    • Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I. Algorithmic details
    • 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
    • (2005) J. Comput. Phys. , vol.202 , pp. 737-764
    • Donev, A.1    Torquato, S.2    Stillinger, F.H.3
  • 13
    • 0012745043 scopus 로고
    • Berne B.J. (Ed), Institute of Physics Publishing, London
    • 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
    • (1977) Molecular Dynamics Techniques for Hard Core Systems , vol.6 , pp. 1-40
    • Erpenbeck, J.J.1    Wood, W.W.2
  • 14
    • 85190261072 scopus 로고    scopus 로고
    • 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.
  • 18
    • 85190261963 scopus 로고    scopus 로고
    • J.O. Henriksen, An improved events list algorithm, in: Proceedings of the 1977 Winter Simulation Conference, IEEE, 1977, pp. 547-557.
  • 19
    • 85190237602 scopus 로고    scopus 로고
    • J.O. Henriksen, Event list management - A tutorial, in: Proceeding of the 1983 Winter Simulation Conference, IEEE, 1983, pp. 543-551.
  • 21
    • 85190302389 scopus 로고    scopus 로고
    • Intel Xeon Processor with 800 MHZ System Bus Datasheet. Document Number 302355-001, 2004.
  • 22
    • 0022698884 scopus 로고
    • An empirical comparison of priority-queue and event-set implementations
    • Jones D.W. An empirical comparison of priority-queue and event-set implementations. Commun. ACM 29 (1986) 300-311
    • (1986) Commun. ACM , vol.29 , pp. 300-311
    • Jones, D.W.1
  • 23
    • 85190269041 scopus 로고    scopus 로고
    • J.H. Kingston, The amortized complexity of Henriksens algorithm. Comput. Sci. Tech. Rep. 85-06, Dept. of Computer Science, University of Iowa, 1985.
  • 25
    • 0030182825 scopus 로고    scopus 로고
    • Analysis of an efficient algorithm for the hard-sphere problem
    • Krantz A.T. Analysis of an efficient algorithm for the hard-sphere problem. TOMACS 6 (1996) 185-229
    • (1996) TOMACS , vol.6 , pp. 185-229
    • Krantz, A.T.1
  • 26
    • 0000071792 scopus 로고
    • How to simulate billiards and similar systems
    • Lubachevsky B.D. How to simulate billiards and similar systems. J. Comput. Phys. 94 (1991) 255
    • (1991) J. Comput. Phys. , vol.94 , pp. 255
    • Lubachevsky, B.D.1
  • 27
    • 0001359576 scopus 로고
    • Efficient algorithms for many-body hard particle molecular dynamics
    • Marín M., Risso D., and Cordero P. Efficient algorithms for many-body hard particle molecular dynamics. J. Comput. Phys. 109 (1993) 306-317
    • (1993) J. Comput. Phys. , vol.109 , pp. 306-317
    • Marín, M.1    Risso, D.2    Cordero, P.3
  • 28
    • 0029517641 scopus 로고
    • An empirical assessment of priority queues in event-driven molecular dynamics simulation
    • 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
    • (1995) Comput. Phys. Commun. , vol.92 , pp. 214-224
    • Marín, M.1    Cordero, P.2
  • 29
    • 85190304860 scopus 로고    scopus 로고
    • R. Nix An evaluation of pagodas. Res. Rep. 164, Dept. of Computer Science, Yale University.
  • 30
    • 0001412006 scopus 로고
    • The event scheduling problem in molecular dynamics simulation
    • Rapaport D.C. The event scheduling problem in molecular dynamics simulation. J. Comput. Phys. 34 (1980) 84-201
    • (1980) J. Comput. Phys. , vol.34 , pp. 84-201
    • Rapaport, D.C.1
  • 33
    • 0000718681 scopus 로고
    • Measuring cache and TLB performance and their effects on benchmark runtimes
    • 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
    • (1995) IEEE Trans. Comp. , vol.44 , pp. 1223-1235
    • Saavedra, R.H.1    Smith, A.J.2
  • 34
    • 0026836792 scopus 로고
    • Reduction of the event-list for molecular dynamic simulation
    • Shida K., and Anzai Y. Reduction of the event-list for molecular dynamic simulation. Comput. Phys. Commun. 69 (1992) 317-329
    • (1992) Comput. Phys. Commun. , vol.69 , pp. 317-329
    • Shida, K.1    Anzai, Y.2
  • 35
    • 85190285392 scopus 로고    scopus 로고
    • 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.
  • 37
    • 0022093855 scopus 로고
    • Self-adjusting binary search trees
    • Tarjan R.E., and Sleator D.D. Self-adjusting binary search trees. JACM 32 (1985) 652-686
    • (1985) JACM , vol.32 , pp. 652-686
    • Tarjan, R.E.1    Sleator, D.D.2
  • 38
    • 33749601705 scopus 로고    scopus 로고
    • Ab initio discrete molecular dynamics approach to protein folding and aggregation
    • (Chapter 19)
    • 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)
    • (2006) Methods in Enzymology , vol.412 , pp. 314-338
    • Urbanc, B.1    Borreguero, J.M.2    Cruz, L.3    Stanley, H.E.4
  • 39
    • 0017961374 scopus 로고
    • A data structure for manipulating priority queues
    • Vuillemin J.A. A data structure for manipulating priority queues. Commun. ACM 21 (1978) 309-315
    • (1978) Commun. ACM , vol.21 , pp. 309-315
    • Vuillemin, J.A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.