Modelling and Monte-Carlo simulations for a concurrency problem

Doina Logofǎtu, Felix Dietrich

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 21st IASTED International Conference on Modelling and Simulation, MS 2010
Pages259-264
Number of pages6
StatePublished - 2010
Externally publishedYes
Event21st IASTED International Conference on Modelling and Simulation, MS 2010 - Banff, AB, Canada
Duration: 15 Jul 201017 Jul 2010

Publication series

NameProceedings of the IASTED International Conference on Modelling and Simulation
ISSN (Print)1021-8181

Conference

Conference21st IASTED International Conference on Modelling and Simulation, MS 2010
Country/TerritoryCanada
CityBanff, AB
Period15/07/1017/07/10

Keywords

  • And Threading
  • Concurrency
  • Continuous probability theory
  • Deadlock
  • Geometry
  • Monte-Carlo simulation
  • Parallelization

Fingerprint

Dive into the research topics of 'Modelling and Monte-Carlo simulations for a concurrency problem'. Together they form a unique fingerprint.

Cite this