Modelling and Monte-Carlo Simulations for a Concurrency Problem

D. Logofătu and F. Dietrich (Germany)


Deadlock, Continuous Probability Theory, Geometry, Monte-Carlo Simulation, Parallelization, Concurrency, and Threading


This paper describes Monte-Carlo simulation techniques that calculate how effective the risk of a blockage in case of concurrent processes is. We start describing a common problem in current computer science, the deadlock. This is followed by a mathematical abstraction of the problem. Three solution models are presented for it, two of them designed for multidimensional cases. These models are then tested in experiments and compared against the exact solutions.

Important Links:

Go Back