Geodesic
Average Execution Times of Series-Parallel Networks
Séminaire lotharingien de combinatoire, Tome 29 (1992) 
Walter Gutjahr; Georg Pflug. Average Execution Times of Series-Parallel Networks. Séminaire lotharingien de combinatoire, Tome 29 (1992). http://geodesic.mathdoc.fr/item/SLC_1992_29_a3/
@article{SLC_1992_29_a3,
     author = {Walter Gutjahr and Georg Pflug},
     title = {Average {Execution} {Times} of {Series-Parallel} {Networks}},
     journal = {S\'eminaire lotharingien de combinatoire},
     year = {1992},
     volume = {29},
     url = {http://geodesic.mathdoc.fr/item/SLC_1992_29_a3/}
}
TY  - JOUR
AU  - Walter Gutjahr
AU  - Georg Pflug
TI  - Average Execution Times of Series-Parallel Networks
JO  - Séminaire lotharingien de combinatoire
PY  - 1992
VL  - 29
UR  - http://geodesic.mathdoc.fr/item/SLC_1992_29_a3/
ID  - SLC_1992_29_a3
ER  - 
%0 Journal Article
%A Walter Gutjahr
%A Georg Pflug
%T Average Execution Times of Series-Parallel Networks
%J Séminaire lotharingien de combinatoire
%D 1992
%V 29
%U http://geodesic.mathdoc.fr/item/SLC_1992_29_a3/
%F SLC_1992_29_a3

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

The papers investigates a model for series-parallel processing structures developed by E. Gelenbe. We show that, under the so-called combinatorial distribution assumption, the average total execution time of a series-parallel processing structure cannot grow essentially slower than n1/2, where n is the number of primitive tasks in the structure.