Using Parallel Computing in Queueing Network Simulation

2016 ◽  
Vol 685 ◽  
pp. 943-947 ◽  
Author(s):  
Roman Mesheryakov ◽  
Alexander Moiseev ◽  
Anton Demin ◽  
Vadim Dorofeev ◽  
Vasily Sorokin
Keyword(s):  
Parallel Computing ◽  
Queueing Networks ◽  
High Performance ◽  
High Efficiency ◽  
Discrete Event ◽  
Queueing Network ◽  
Object Oriented Programming ◽  
Computer Cluster ◽  
General Network ◽  
High Performance Computer

The paper is devoted to the simulation of queueing networks on high performance computer clusters. The objective is to develop a mathematical model of queueing network and simulation approach to the modelling of the general network functionality, as well as to provide a software implementation on a high-performance computer cluster. The simulation is based on a discrete-event approach, object oriented programming, and MPI technology. The model of the queueing networks simulation system was developed as an application that allows a user to simulate networks of rather free configuration. The experiments on a high performance computer cluster emphasize the high efficiency of parallel computing.

Software for Queueing Analysis

2018 ◽  
pp. 255-291
Keyword(s):  
Queueing Networks ◽  
Discrete Event ◽  
Queueing Network ◽  
Queueing Analysis ◽  
Discrete Events ◽  
Technical Literature ◽  
Event Simulation ◽  
Statistical Program ◽  
Service Times ◽  
Waiting Lines

Chapter 8 gives a brief discussion of computer simulation for discrete events. The chapter lists software programs in the technical literature that outline programs for the simulation of discrete events, both of commercial origin and free programs. In addition to the lists submitted, the authors present specialized packages for analysis and simulation of waiting lines in the R language. Statistical considerations are presented, which must be taken into account when obtaining data from simulations in situations of waiting lines. Chapter 8 presents three packages of the statistical program R: the “queueing” analysis package provides versatile tools for analysis of birth- and death-based Markovian queueing models and single and multiclass product-form queueing networks; “simmer” package is a process-oriented and trajectory-based discrete-event simulation (DES) package for R; and, the purpose of the “queuecomputer” package is to calculate, deterministically, the outputs of a queueing network, given the arrival and service times of all the customers. It also uses simulation for the implementation of a method for the calculation of queues with arbitrary arrival and service times. For each theme, the authors show the use of the packages in R.

Concavity of queueing systems with NBU service times

1998 ◽  
Vol 30 (2) ◽  
pp. 551-567 ◽  
Author(s):  
Rajendran Rajan ◽  
Rajeev Agrawal
Keyword(s):  
Queueing Networks ◽  
Discrete Event ◽  
Queueing Systems ◽  
Queueing Network ◽  
Search Space ◽  
System Parameters ◽  
Wide Range ◽  
Service Times ◽  
And Control ◽  
Better Than

This paper establishes structural properties for the throughput of a large class of queueing networks with i.i.d. new-better-than-used service times. The main result obtained in this paper is applied to a wide range of networks, including tandems, cycles and fork-join networks with general blocking and starvation (as well as certain networks with splitting and merging of traffic streams), to deduce the concavity of their throughput as a function of system parameters, such as buffer and initial job configurations, and blocking and starvation parameters. These results have important implications for the optimal design and control of such queueing networks by providing exact solutions, reducing the search space over which optimization need be performed, or establishing the convergence of optimization algorithms. In order to obtain results for such disparate networks in a unified manner, we introduce the framework of constrained discrete event systems (CDES), which enables us to characterize any permutable and non-interruptive queueing network through its constraint set. The main result of this paper establishes comparison properties of the event occurrence processes of CDES as a function of the constraint sets, which are then translated into the above-mentioned concavity of the throughput as a function of system parameters in the context of queueing networks.

Concavity of queueing systems with NBU service times

1998 ◽  
Vol 30 (02) ◽  
pp. 551-567
Author(s):  
Rajendran Rajan ◽  
Rajeev Agrawal
Keyword(s):  
Queueing Networks ◽  
Discrete Event ◽  
Queueing Systems ◽  
Queueing Network ◽  
Search Space ◽  
System Parameters ◽  
Wide Range ◽  
Service Times ◽  
And Control ◽  
Better Than

This paper establishes structural properties for the throughput of a large class of queueing networks with i.i.d. new-better-than-used service times. The main result obtained in this paper is applied to a wide range of networks, including tandems, cycles and fork-join networks with general blocking and starvation (as well as certain networks with splitting and merging of traffic streams), to deduce the concavity of their throughput as a function of system parameters, such as buffer and initial job configurations, and blocking and starvation parameters. These results have important implications for the optimal design and control of such queueing networks by providing exact solutions, reducing the search space over which optimization need be performed, or establishing the convergence of optimization algorithms. In order to obtain results for such disparate networks in a unified manner, we introduce the framework of constrained discrete event systems (CDES), which enables us to characterize any permutable and non-interruptive queueing network through its constraint set. The main result of this paper establishes comparison properties of the event occurrence processes of CDES as a function of the constraint sets, which are then translated into the above-mentioned concavity of the throughput as a function of system parameters in the context of queueing networks.

scholarly journals Improving computational efficiency of GLUE method for hydrological model uncertainty and parameter estimation using CPU-GPU hybrid high performance computer cluster

2021 ◽  
Author(s):  
Depeng Zuo ◽  
Guangyuan Kan ◽  
Hongquan Sun ◽  
Hongbin Zhang ◽  
Ke Liang
Keyword(s):  
Parameter Estimation ◽  
Computational Efficiency ◽  
High Performance ◽  
Large Scale ◽  
Hydrological Model ◽  
Computer Cluster ◽  
Comparison Results ◽  
High Performance Computer ◽  
Glue Method ◽  
Generalized Likelihood Uncertainty Estimation

Abstract. The Generalized Likelihood Uncertainty Estimation (GLUE) method has been thrived for decades, huge number of applications in the field of hydrological model have proved its effectiveness in uncertainty and parameter estimation. However, for many years, the poor computational efficiency of GLUE hampers its further applications. A feasible way to solve this problem is the integration of modern CPU-GPU hybrid high performance computer cluster technology to accelerate the traditional GLUE method. In this study, we developed a CPU-GPU hybrid computer cluster-based highly parallel large-scale GLUE method to improve its computational efficiency. The Intel Xeon multi-core CPU and NVIDIA Tesla many-core GPU were adopted in this study. The source code was developed by using the MPICH2, C++ with OpenMP 2.0, and CUDA 6.5. The parallel GLUE method was tested by a widely-used hydrological model (the Xinanjiang model) to conduct performance and scalability investigation. Comparison results indicated that the parallel GLUE method outperformed the traditional serial method and have good application prospect on super computer clusters such as the ORNL Summit and Sierra of the TOP500 super computers around the world.

scholarly journals Influence of slope and external temperature on smoke stratification in case of fire in bi-directional road tunnel

2018 ◽  
Vol 16 ◽  
pp. 02002
Author(s):  
Peter Weisenpacher ◽  
Jan Glasa ◽  
Lukas Valasek
Keyword(s):  
High Performance ◽  
Road Tunnel ◽  
Smoke Movement ◽  
Fire Dynamics ◽  
External Temperature ◽  
Computer Cluster ◽  
Parallel Version ◽  
Road Tunnels ◽  
Simulation Scenario ◽  
High Performance Computer

Jet fan ventilation strategy in case of fire in bi-directional road tunnels is focused on maintaining smoke stratification. There are several factors influencing stratification under specific conditions. In this paper smoke movement during a 5 MW fire in a 600 m long road tunnel is studied by computer simulation and the influence of slope and external temperature on smoke stratification is analysed. Calculations were performed on a high performance computer cluster using parallel version of Fire Dynamics Simulator. Smoke stratification upstream of the fire is maintained in every simulation scenario with the exception of declivous tunnel, in which buoyancy intensifies backlayering. The behaviour of the smoke movement downstream of the fire is more complex. In the case of horizontal tunnel the stratification is not maintained in the vicinity of the fire and region with untenable conditions expands downstream. In the tunnel with slope of -2° this expansion is accelerated, while in the tunnel with slope of 2° untenable conditions spread in opposite direction. The influence of exterior temperature higher than temperature inside the tunnel is relatively weak in horizontal tunnels; however, it becomes very important in sloping tunnels, especially downstream of the fire.

Discrete-Event Approach to Simulation of Queueing Networks

2016 ◽  
Vol 685 ◽  
pp. 939-942 ◽  
Author(s):  
Alexander Moiseev ◽  
Anton Demin ◽  
Vadim Dorofeev ◽  
Vasily Sorokin
Keyword(s):  
Queueing Networks ◽  
General Scheme ◽  
Discrete Event ◽  
Queueing Network ◽  
Configuration Software ◽  
Basic Algorithm ◽  
Basic Principles ◽  
Develop Software ◽  
Under Construction ◽  
And Behavior

The paper is devoted to basic principles to develop software queueing networks simulations. A mathematical model and general scheme of the queueing network are presented in the paper. Main network components and behavior parameters are described. The application can simulate the networks of rather complex configuration. Software under construction uses a discrete-event approach for the simulation process. Basic algorithm of the simulation is also presented.

scholarly journals FDS simulation of smoke backlayering in emergency lay-by of a road tunnel with longitudinal ventilation

2021 ◽  
Vol 2090 (1) ◽  
pp. 012100
Author(s):  
P Weisenpacher ◽  
J Glasa ◽  
L Valasek ◽  
T Kubisova
Keyword(s):  
High Performance ◽  
Road Tunnel ◽  
Smoke Movement ◽  
Fire Dynamics ◽  
Computer Cluster ◽  
Longitudinal Ventilation ◽  
Smoke Spread ◽  
Fire Scenarios ◽  
Significant Length ◽  
High Performance Computer

Abstract This paper investigates smoke movement and its stratification in a lay-by of a 900 m long road tunnel by computer simulation using Fire Dynamics Simulator. The lay-by is located upstream of the fire in its vicinity. The influence of lay-by geometry on smoke spread is evaluated by comparison with a fictional tunnel without lay-by. Several fire scenarios with various tunnel slopes and heat release rates of fire in the tunnels without and with the lay-by are considered. The most significant breaking of smoke stratification and decrease of visibility in the area of the lay-by can be observed in the case of zero slope tunnel for more intensive fires with significant length of backlayering. Several other features of smoke spread in the lay-by are analysed as well. The parallel calculations were performed on a high-performance computer cluster.

Sign in / Sign up

Export Citation Format

Share Document