Parallel Simulation of Queueing Petri Nets

Abstract

Queueing Petri Nets (QPNs) are a powerful formalism to model the performance of software systems. Such models can be solved using analytical or simulation techniques. Analytical techniques suffer from scalability issues, whereas simulation techniques often require very long simulation runs. Existing simulation techniques for QPNs are strictly sequential and cannot exploit the parallelism provided by modern multi-core processors. In this paper, we present an approach to parallel discrete-event simulation of QPNs using a conservative synchronization algorithm. We consider the spatial decomposition of QPNs as well as the lookahead calculation for different scheduling strategies. Additionally, we propose techniques to reduce the synchronization overhead when simulating performance models describing systems with open workloads. The approach is evaluated in three case studies using performance models of real-world software systems. We observe speedups between 1.9 and 2.5 for these case studies. We also assessed the maximum speedup that can be achieved with our approach using synthetic models.

Authors and Affiliations

Jürgen Walter, Simon Spinner, Samuel Kounev

Keywords

Related Articles

A Survey of System Level Power Management Schemes in the Dark-Silicon Era for Many-Core Architectures

Power consumption in Complementary Metal Oxide Semiconductor (CMOS) technology has escalated to a point that only a fractional part of many-core chips can be powered-on at a time. Fortunately, this fraction can be increa...

Outage Performance of Cooperative Cognitive Radio Networks under Joint Constraints of Co-Channel Interference, Intercept Probability and Hardware Imperfection

This paper evaluates outage probability (OP) of a cooperative underlay cognitive radio network in the presence of a passive secondary eavesdropper under joint impacts of limited interference from a primary network and ha...

Security-Reliability Analysis of Multi-hop LEACH Protocol with Fountain Codes and Cooperative Jamming

In this paper, we investigate trade-off between security and reliability of Fountain codes (FCs) based low-energy adaptive clustering hierarchy (LEACH) networks, where the encoded packets are sent to the destination by u...

A Critical Review of the Routing Protocols in Opportunistic Networks

The goal of Opportunistic Networks (OppNets) is to enable message transmission in an infrastructure less environment where a reliable end-to-end connection between the hosts in not possible at all times. The role of OppN...

TiPeNeSS: A Timed Petri Net Simulator Software with Generally Distributed Firing Delays

Performance analysis can be carried out in several ways, especially in case of Markovian models. In order to interpret high level of abstraction, we often use modeling tools like timed Petri nets (TPNs). Although some su...

Download PDF file
  • EP ID EP46050
  • DOI http://dx.doi.org/10.4108/eai.24-8-2015.2261102
  • Views 316
  • Downloads 0

How To Cite

Jürgen Walter, Simon Spinner, Samuel Kounev (2016). Parallel Simulation of Queueing Petri Nets. EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, 3(8), -. https://europub.co.uk/articles/-A-46050