Computing the average parallelism in trace monoids

Details Computing the average parallelism in trace monoids Computing the average parallelism in trace monoids

2001-12-11

arxiv.org/abs/cs/0112012v2

Computer Science

Discrete Mathematics

This is an extended version with proofs of D. Krob, J. Mairesse, and I. Michos. On the average parallelism in trace monoids. I

Scientific paper

The {\em height} of a trace is the height of the corresponding heap of pieces in Viennot's representation, or equivalently the number of factors in its Cartier-Foata decomposition. Let $h(t)$ and $|t|$ stand respectively for the height and the length of a trace $t$. Roughly speaking, $|t|$ is the `sequential' execution time and $h(t)$ is the `parallel' execution time. We prove that the bivariate commutative series $\sum_t x^{h(t)}y^{|t|}$ is rational, and we give a finite representation of it. We use the rationality to obtain precise information on the asymptotics of the number of traces of a given height or length. Then, we study the average height of a trace for various probability distributions on traces. For the uniform probability distribution on traces of the same length (resp. of the same height), the asymptotic average height (resp. length) exists and is an algebraic number. To illustrate our results and methods, we consider a couple of examples: the free commutative monoid and the trace monoid whose independence graph is the ladder graph.

Affiliated with

Also associated with

No associations

Rating

Computing the average parallelism in trace monoids 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 Computing the average parallelism in trace monoids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the average parallelism in trace monoids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-139763