Parallel Simulation of Queueing Petri Nets


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


Related Articles

Knowledge Extraction Framework for Building a Largescale Knowledge Base

As the Web has already permeated to life styles of human beings, people tend to consume more data in online spaces, and to exchange their behaviours among others. Simultaneously, various intelligent services are availabl...

Empirical analysis of IPv6 transition technologies using the IPv6 Network Evaluation Testbed

IPv6 has yet to become more than a worthy successor of IPv4, which remains, for now, the dominant Internet Protocol. This is due to the complicated transition period through which the Internet will have to go, until IPv6...

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...

Eigenvalue-based Detection Techniques Using Finite Dimensional Complex Random Matrix Theory: A Review

Detection of primary users without requiring information of signal is of great importance in spectrum sensing (SS) in Cognitive Radio. Therefore, in recent years, eigenvalue based spectrum sensing algorithms are under th...

Outage Probability of Vehicular Networks under Unreliable Backhaul

This paper presents for the first time a heterogeneous vehicular model with multiple moving small cells and a moving receiver with unreliable backhaul. In this system, a macro-base station connects to multiple moving smal...

Download PDF file
  • EP ID EP46050
  • DOI
  • Views 183
  • 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), -.