Simulation Model Design and Execution: Building Digital WorldsThe author offers the first text to cover all three areas of simulation-Model Design, Model Execution, and Execution Analysis-in one source. He focuses on model design (using an extension of object- oriented design called multimodeling) and algorithms for serial and parallel model execution. Also covered is the SimPack simulation toolkit, with a full chapter devoted to using SimPack programs. |
From inside the book
Results 1-3 of 22
Page 56
... array . An array may also be used instead of the linked list approach . With an array , dynamic data storage management must be performed by the person writing the simulation rather than by the operating system or language compiler ...
... array . An array may also be used instead of the linked list approach . With an array , dynamic data storage management must be performed by the person writing the simulation rather than by the operating system or language compiler ...
Page 59
... array . The array - based ( implicit ) heap imple- mentation is normally quite fast , so we will concentrate on this approach while displaying heaps using both pointer and array illustrations . The adjective " implicit " refers to a ...
... array . The array - based ( implicit ) heap imple- mentation is normally quite fast , so we will concentrate on this approach while displaying heaps using both pointer and array illustrations . The adjective " implicit " refers to a ...
Page 239
... array F. We just need to alternate between F and G , where F would become the primary array at even - numbered generations , and G would become the primary at odd generations . 2. If space is an issue , we need not use two full - sized ...
... array F. We just need to alternate between F and G , where F would become the primary array at even - numbered generations , and G would become the primary at odd generations . 2. If space is an issue , we need not use two full - sized ...
Common terms and phrases
abstraction level algorithm approach attributes behavior block model bond graph cell cellular automata channel buffer components concept conceptual graph Consider constraint create data structure declarative model defined delay difference equations differential equations discrete event displays distribution dynamics End Main entity EVENT LIST Event Priority event scheduling example execution facility Figure flow functional block functional model hash table input instance integration interaction interval keyframe L-Systems Labanotation mapping Markov model method model types molecule multimodel node object occur operation output parallel parameters particles partition Petri Petri net phase phase space physical position PR 0 Token Preemptions problem processor queue queuing random number random variable represents Server shown in Fig SimPack space spatial models specify tank temporal logic Tempura Token Time Event trajectory transition tree update Util variable vector velocity zero