CIS 3110 Lecture Notes - Lecture 12: Discrete Event Simulation, Priority Queue
2 Mar 2018
School
Department
Course
Professor
Document Summary
Discrete event simulation: a number of simultaneous processes or threads that will be simulated, each alternating between bursts of cpu usage and i/o waiting, the process data will be read in from a data file. Set up a loop, jump forward in time with each iteration to whenever the next meaningful event occurs. Some time steps may be small ( even 0 if two or more things happen at the same time ) and some may be large. Some events may trigger other events, which are then put on the schedule to be processed when their time comes. Priority queue is an important data structure in des which holds events to be scheduled. A priority queue stores a collection of items. Keys in a priority queue can be arbitrary objects on which an order is defined. Two distinct items in a priority queue can have the same key. ]
