This paper describes a simulation specification language and execution environments that are being used to study the performance of distributed discrete event simulation. First, a simulation programming model based on Chandy-Misra distributed discrete event simulation is presented. Then, the Yaddes simulation specification language is described. Yaddes specifications are translated into C langu...

 This study deals with line balancing of BOB T-shirt model with the help of control limit analysis and discrete event simulation of the assembly lines. In this study control limit analysis is used to measure the performance of the assembly line and used to show the bottleneck operations of the assembly line and line balancing technique improves the productivity of the sewing line of the model. ...

The traditional technique to simulate physical systems modeled by partial differential equations is by means of a time-stepped methodology where the state of the system is updated at regular discrete time intervals. This method has inherent inefficiencies. In contrast, we propose a new asynchronous type of simulation based on a discrete-event-driven (as opposed to time-driven) approach, where t...

Parallel simulation has the potential to accelerate the execution of simulation applications. However, developing a parallel discrete-event simulation from scratch requires an in-depth knowledge of the mapping process from the physical model to the simulation model, and a substantial effort in optimisingperformance. This paper presents an overview of the SPaDES (Structured Parallel Discrete-Eve...

Lindén, J. 2018. Synchronization Techniques in Parallel Discrete Event Simulation. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1634. 57 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-513-0241-6. Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the pe...

Recently Rajasekaran and Ross [1] presented an algorithm that takes an expected 0(1) time to generate a nonuniform discrete random variate. In this paper we discuss how this algorithm can be employed in the efficient simulation of large-scale telephone networks. In a simulation based upon a standard event-list approach, the generation of a new event in the systems take 0(log n) time. With this ...