lecturenotes07

lecturenotes07 - MS&E 223 Simulation Peter J Haas Lecture...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
MS&E 223 Lecture Notes #7 Simulation Event Lists Peter J. Haas Spring Quarter 2009-10 Page 1 of 2 Event Lists 1. Event Lists Based on our algorithm for generating sample paths of a GSMP, it is clear that one way to implement the clock-setting mechanism is to maintain a vector of clock readings (one per event). This approach is not efficient if there are a large number of events, but only a few are scheduled at any time point. Another approach (which works for GSMP’s with unit speeds) is to maintain a list of the scheduled occurrence times of the active events. This is called a future-event list . This approach is used in most commercial simulation packages. The topic merits some discussion, because event list processing can represent a substantial portion of the CPU time for a simulation—up to 40% by one estimate. 2. Data Structures for Event Lists The major activities that are performed on the event list are: 1. insertion of events 2. deletion of events 3. determining the next event to occur By keeping the events sorted by time of occurrence, the above tasks are simplified.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/06/2010 for the course MSE 223 taught by Professor Unknown during the Spring '09 term at Stanford.

Page1 / 2

lecturenotes07 - MS&E 223 Simulation Peter J Haas Lecture...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online