AN EMPIRICAL-ASSESSMENT OF PRIORITY-QUEUES IN EVENT-DRIVEN MOLECULAR-DYNAMICS SIMULATION
AN EMPIRICAL-ASSESSMENT OF PRIORITY-QUEUES IN EVENT-DRIVEN MOLECULAR-DYNAMICS SIMULATION
复制标题
DOI：
10.1016/0010-4655(95)00120-2
复制
发表时间：
1995-12-01
影响因子：
6.3
通讯作者：
CORDERO, P
中科院分区：
文献类型：
--
作者：
MARIN, M;CORDERO, P
在过去的几十年里，已经开发了许多接近最优优先级的队列。这些优先级队列中的许多都适合于对硬粒子系统模拟过程中产生的事件进行有效管理。在本文中，我们比较了目前已知的最快优先级队列的执行时间以及用作优先级队列的某些形式的二叉搜索树。我们得出结论，严格平衡二叉树的不寻常适应对于这类模拟具有最佳性能。
In the last decades a number of near optimal priority queues have been developed. Many of these priority queues are suitable for the efficient management of events generated during simulations of hard-particle systems. In this paper we compare the execution times of the fastest priority queues known today as well as some forms of binary search trees used as priority queues. We conclude that an unusual adaptation of a strictly balanced binary tree has the best performance for this class of simulations.