On Probabilistic Parallel Programs with Process Creation and Synchronisation

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This is a technical report accompanying a TACAS'11 paper

Scientific paper

We initiate the study of probabilistic parallel programs with dynamic process creation and synchronisation. To this end, we introduce probabilistic split-join systems (pSJSs), a model for parallel programs, generalising both probabilistic pushdown systems (a model for sequential probabilistic procedural programs which is equivalent to recursive Markov chains) and stochastic branching processes (a classical mathematical model with applications in various areas such as biology, physics, and language processing). Our pSJS model allows for a possibly recursive spawning of parallel processes; the spawned processes can synchronise and return values. We study the basic performance measures of pSJSs, especially the distribution and expectation of space, work and time. Our results extend and improve previously known results on the subsumed models. We also show how to do performance analysis in practice, and present two case studies illustrating the modelling power of pSJSs.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On Probabilistic Parallel Programs with Process Creation and Synchronisation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Probabilistic Parallel Programs with Process Creation and Synchronisation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Probabilistic Parallel Programs with Process Creation and Synchronisation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-179394

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.