Characteristics and Comparison of Algorithms 101
Let us introduce the following notation for workflow graphs:
1. A→B—execution of part A of a workflow followed by execution of part
B.
2. A||B—parallel execution of parts A and B.
3. A
n
—parallel execution of n A parts.
4. nA—sequential execution of n A parts.
5. T1→T2—additional dependence of task T2 on task T1.
In order to assess relative performance of the algorithms, several tests
have been performed in the real workflow management environment described
in Section 6.2 working on top of the BeesyCluster middleware described in
Section 6.1.
In addition to the tests conducted by the author for various service avail-
ability as demonstrated in [68], a more thorough analysis is performed in this
book for a sa ...