- Abstract:
-
In this paper We describe the development of a Bell-Curve Calculus, analogous to interval arithmetic, in which normal distributions can be combined with arithmetic operations, such as addition, maximum, minimum, etc. We apply this Bell-Curve Calculus to the propagation of Quality of Service properties within e-Science workflows. In particular, we apply it to the problem of estimating the overall runtime of a workflow from estimates of the runtimes of its component services. We evaluate both the accuracy and efficiency of this Bell-Curve Calculus approach compared to alternative approaches. In particular, we show that it is much faster than piecewise approximation approaches, but trades this off against a loss of accuracy, which nevertheless is sufficient for certain applications.
- Copyright:
- 2007 by The University of Edinburgh. All Rights Reserved
- Links To Paper
- No links available
- Bibtex format
- @Misc{EDI-INF-RR-1246,
- author = {
Lin Yang
and Alan Bundy
and Conrad Hughes
and Dave Berry
},
- title = {Fast, but Approximate, Workflow-Runtime Estimation Using the Bell-Curve Calculus},
- year = 2007,
- howpublished={Internet Publication},
- note = {Accepted by CCGrid 2007, but withdrawn due to inability to attend},
- }
|
