AN EMPIRICAL-COMPARISON OF PRIORITY-QUEUE AND EVENT-SET IMPLEMENTATIONS

被引：99

作者：

JONES, DW

机构：

[1] Univ. of Iowa, Iowa City, United States

来源：

COMMUNICATIONS OF THE ACM | 1986年 / 29卷 / 04期

关键词：

PROBABILITY - Queueing Theory;

D O I：

10.1145/5684.5686

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The performance of some of the newer and special-purpose priority-queue implementations is compared against the older, classic implementations and the results analyzed. The author first describes the measurement methodology used. He then describes each of the 11 implementations tested, presenting results and giving general recommendations.

引用

页码：300 / 311

页数：12

共 6 条

[1] AN EMPIRICAL-COMPARISON OF PRIORITY-QUEUE AND EVENT-SET IMPLEMENTATIONS
VAUCHER, JG
COMMUNICATIONS OF THE ACM, 1986, 29 (10) : 1002 - 1003
[2] AN EMPIRICAL-COMPARISON OF PRIORITY-QUEUE AND EVENT-SET IMPLEMENTATIONS - REPLY
JONES, DW
COMMUNICATIONS OF THE ACM, 1986, 29 (10) : 1003 - 1005
[3] P-tree structures and event horizon: Efficient event-set implementations
Asdre, K
Nikolopoulos, SD
PROCEEDINGS OF THE 2005 WINTER SIMULATION CONFERENCE, VOLS 1-4, 2005, : 2700 - 2709
[4] P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
Katerina Asdre
Stavros D. Nikolopoulos
Journal of Computer Science and Technology, 2006, 21 : 19 - 26
[5] P-tree structures and event horizon: Efficient event-set implementations
Asdre, K
Nikolopoulos, SD
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (01) : 19 - 26
[6] CALENDAR QUEUES - A FAST 0(1) PRIORITY QUEUE IMPLEMENTATION FOR THE SIMULATION EVENT SET PROBLEM
BROWN, R
COMMUNICATIONS OF THE ACM, 1988, 31 (10) : 1220 - 1227

← 1 →