GMSim: a tool for compositional GSMP modeling

The development of a discrete-event simulation too called GMSim, based on the generalized semi-Mark process (GSMP) formalism is described. The GSM representation comprises both analysis and simulation i unified framework. This paper focuses on the simulatio aspect and how to deal with a combinatorially explodin state space. A compositional GSMP modeling methodolo is proposed, which in turn is combined with an objec oriented programming approach. A key feature of the resulting tool is the close resem blance with the underlying mathematical structure. Th facilitates coherent modeling and also an efficient impl mentation. The tool is completely generic and extendib by Tcl script programming. Application specific compo nents are developed by C++ programming in combinati with M4 macro processing.

[1]  Al Stevens,et al.  C programming , 1990 .

[2]  Frode B. Nilsen,et al.  GMSim: A generalized semi-Markov simulation environment , 1998 .

[3]  Randy Brown,et al.  Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem , 1988, CACM.

[4]  Frode B. Nilsen,et al.  Efficient flit-level simulation , 1997 .

[5]  John K. Ousterhout,et al.  Tcl and the Tk Toolkit , 1994 .

[6]  P. Glynn.  A GSMP formalism for discrete event systems , 1989, Proc. IEEE.

[7]  David R. Cox,et al.  The Theory of Stochastic Processes , 1967, The Mathematical Gazette.

[8]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[9]  Vernon Rego,et al.  A performance comparison of event calendar algorithms: An empirical approach , 1993, Softw. Pract. Exp..

[10]  Jeffrey H. Kingston.  Analysis of Henriksen's Algorithm for the Simulation Event Set , 1986, SIAM J. Comput..

[11]  P. Glynn,et al.  Estimating time averages via randomly-spaced observations , 1987 .

[12]  Douglas W. Jones,et al.  An empirical comparison of priority-queue and event-set implementations , 1986, CACM.

[13]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[14]  Donald L. Iglehart,et al.  Simulation methods for queues: An overview , 1988, Queueing Syst. Theory Appl..

[15]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[16]  William M. McCormack,et al.  Analysis of future event set algorithms for discrete event simulation , 1981, CACM.

[17]  Peter W. Glynn,et al.  On the role of generalized semi-Markov processes in simulation output analysis , 1983, WSC '83.

[18]  Gerald S. Shedler.  Regenerative Stochastic Simulation , 1992 .

[19]  P. Haas,et al.  Regenerative generalized semi-markov processes , 1987 .

[20]  N. U. Prabhu.  Review: D. R. Cox, H. D. Miller, The Theory of Stochastic Processes , 1966 .

[21]  Paul Bratley,et al.  A guide to simulation , 1983 .