AN EXPERIMENTAL-ANALYSIS OF EVENT SET ALGORITHMS FOR DISCRETE EVENT SIMULATION

被引：4

作者：

NIKOLOPOULOS, SD ^{[1
]}

MACLEOD, R ^{[1
]}

机构：

[1] UNIV DUNDEE,DEPT MATH & COMP SCI,DUNDEE DD1 4HN,SCOTLAND

来源：

MICROPROCESSING AND MICROPROGRAMMING | 1993年 / 36卷 / 02期

关键词：

DISCRETE SIMULATION; EVENT SET ALGORITHMS; TIME FLOW MECHANISMS; DATA STRUCTURES;

D O I：

10.1016/0165-6074(93)90248-J

中图分类号：

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

学科分类号：

0812 ;

摘要：

A number of event set algorithms for discrete event simulation have been selected, analysed and tested under a wide variety of conditions to estimate their average performance. A set of typical stochastic scheduling distributions has been especially chosen to show the advantages and limitations of each algorithm. The event set algorithms have been divided into four classes: (I) Linear algorithms, (II) Binary Tree algorithms: Contiguous representation, (III) Binary Tree algorithms: Linked representation and (IV) Time Mapping algorithms. Experimental analysis has been done supported by plot diagrams showing the performance of each algorithm. Tables of comparisons are also presented.

引用

页码：71 / 81

页数：11

共 17 条

[1] A 2-LIST SYNCHRONIZATION PROCEDURE FOR DISCRETE EVENT SIMULATION [J].

BLACKSTONE, JH ;

HOGG, GL ;

PHILLIPS, DT .

COMMUNICATIONS OF THE ACM, 1981, 24 (12) :825-829

[2]

DOWNHAM DY, 1975, COMPUT J, V19, P74

[3]

FISHMAN GS, 1973, CONCEPTS METHODS DIS

[4] COMPARISON OF HEAPS AND TL STRUCTURE FOR SIMULATION EVENT SET [J].

FRANTA, WR ;

MALY, K .

COMMUNICATIONS OF THE ACM, 1978, 21 (10) :873-875

[5]

FRANTA WR, 1977, COMMUN ACM, V20, P569

[6]

FRANTA WR, 1977, PROCESS VIEW SIMULAT

[7]

FULLER AT, 1975, COMPUT J, V19, P173

[8]

Gonnet G.H., 1984, HDB ALGORITHMS DATA

[9] HEAPS APPLIED TO EVENT DRIVEN MECHANISMS [J].

GONNET, GH .

COMMUNICATIONS OF THE ACM, 1976, 19 (07) :417-418

[10]

Jonassen A., 1975, BIT (Nordisk Tidskrift for Informationsbehandling), V15, P409, DOI 10.1007/BF01931680

← 1 2 →