A two-list synchronization procedure for discrete event simulation

The traditional mechanism for maintaining a list of pending events in a discrete event simulation is the simple linked list. However, in large scale simulations this list often becomes cumbersome to maintain since the number of pending events may become quite large. As a result, the execution time required by the simple linked list is often a significant portion of total simulation time. Several papers have been published suggesting improved synchronization procedures. The most efficient procedures reported are the time-indexed procedure and the two-level procedure. Both methodologies are much more efficient than simple linked lists; however, neither has been adopted by a general purpose simulation language. Further, both procedures require external parameter definition, which is a major handicap to their adoption by a general purpose language. This paper introduces a new sychronization procedure, the two-list procedure, which is much faster than simple linked lists for large pending event files. This procedure was designed for implementation in Fortran, and properly implemented it is transparent to the user. Thus it is ideal for adoption by general purpose simulation languages.

[1]  G. Stiny.  Ice-Ray: A Note on the Generation of Chinese Lattice Designs , 1977 .

[2]  Kurt Maly,et al.  An efficient data structure for the simulation event set , 1977, CACM.

[3]  Gaston H. Gonnet,et al.  Heaps applied to event driven mechanisms , 1976, CACM.

[4]  Harry M. Markowitz,et al.  SIMSCRIPT: A Simulation Programming Language , 1962 .

[5]  R Krishnamurti,et al.  Algorithmic Aspects of Plan Generation and Enumeration , 1978 .

[6]  Robin Th'ng,et al.  SPACES: an integrated suite of computer programs for accommodation scheduling, layout generation and appraisal of schools , 1975, Comput. Aided Des..

[7]  T. Willoughby,et al.  Computer-aided Architectural Planning , 1970 .

[8]  D. S. Willey.  Structure for automated architectural sketch design , 1978 .

[9]  P. C. Portlock,et al.  Provision for daylight in layout planning , 1973 .

[10]  R. Sharpe.  Optimum space allocation within buildings , 1973 .

[11]  George Stiny.  Two Exercises in Formal Composition , 1976 .

[12]  William L. Maxwell,et al.  Analysis of the Time Indexed List Procedure for Synchronization of Discrete Event Simulations , 1978 .

[13]  John S. Gero,et al.  On optimization in computer aided architectural design , 1980 .

[14]  W. Mitchell,et al.  Synthesis and Optimization of Small Rectangular Floor Plans , 1976 .

[15]  Thomas J. Schriber,et al.  Simulation Using GPSS , 1974 .

[16]  F. Paul Wyman,et al.  Improved event-scanning mechanisms for discrete event simulation , 1975, Commun. ACM.

[17]  Julia Ruch.  Interactive Space Layout: A Graph Theoretical Approach , 1978, 15th Design Automation Conference.

[18]  Jean G. Vaucher,et al.  A comparison of simulation event list algorithms , 1975, Commun. ACM.