Abstract
This paper investigates the problem of estimating the quality of a given solution to a workflow scheduling problem. The underlying workflow model is one where tasks and inter-task communication links have stochastic QoS attributes. It has been proved that the exact determination even of the schedule length distribution alone is #P-complete in the general case. This is true even if the problems of processor-to-task allocation and inter-task communication are abstracted away, as in program evaluation and review technique (PERT) approaches. Yet aside from the makespan, there are many more parameters that are important for service providers and customers alike, e.g., reliability, overall quality, cost, etc. The assumption is, as in the distributed makespan problem, that all of these parameters are defined in terms of random variables with distributions known a priori for each possible task-to-processor assignment. This research provides an answer to the open question of the complexity of the so formulated problem. We also propose other than naive Monte Carlo methods to estimate the schedule quality for the purpose of, e.g., benchmarking different scheduling algorithms in a multi-attribute stochastic setting. The key idea is to apply to a schedule a novel procedure of transformation into a Bayesian network (BN). Once such a transformation is done, it is possible to prove that, for a known schedule, the problem of determining the overall QoS is still #P-complete, i.e., not more complex than the distributed PERT makespan problem. Moreover, it is possible to use the familiar Bayesian posterior probability estimation methods, given appropriately chosen evidence, instead of a blind Monte Carlo approach. As the schedules are usually required to satisfy well-defined QoS constraints, it is possible to map these to appropriately chosen conditioning variables in the generated BN.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Allahverdi, A., Gupta, J.N., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219–239 (1999)
Allahverdi, A., Ng, C., Cheng, T.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985–1032 (2008)
Dagum, P., Luby, M.: Approximating probabilistic inference in Bayesian belief networks is NP-hard. Artif. Intell. 60(1), 141–153 (1993)
Drozdowski, M.: Scheduling for Parallel Processing, 1st edn. Springer Publishing Company, Incorporated, New York (2009)
Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6(6), 721–741 (1984)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563–1581 (1966)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)
Hagstrom, J.N.: Computational complexity of PERT problems. Networks 18(2), 139–147 (1988)
Hagstrom, J.N.: Computing the probability distribution of project duration in a PERT network. Networks 20(2), 231–244 (1990)
Kwok, Y.-K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. (CSUR) 31(4), 406–471 (1999)
Li, Y.A., Antonio, J.K.: Estimating the execution time distribution for a task graph in a heterogeneous computing system. In: Proceedings of 6th Heterogeneous Computing Workshop, (HCW’97), pp. 172–184. IEEE (1997)
Ludwig, A., Möhring, R.H., Stork, F.: A computational study on bounding the makespan distribution in stochastic project networks. Ann. OR 102(1–4), 49–64 (2001)
Munier, A., Queyranne, M., Schulz, A.S.: Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. Integer Programming and Combinatorial Optimization, pp. 367–382. Springer, Berlin (1998)
Niño-Mora, J.: Stochastic scheduling. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, 2nd edn, pp. 3818–3824. Springer, New York (2009)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo (1988)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Springer Science+ Business Media, New York (2012)
Roth, D.: On the hardness of approximate reasoning. Artif. Intell. 82(1), 273–302 (1996)
Russell, S.J., Norvig, P., Canny, J.F., Malik, J.M., Edwards, D.D.: Artificial Intelligence: A Modern Approach, vol. 74. Prentice Hall, Englewood Cliffs (1995)
Schmidt, C.W., Grossmann, I.E.: The exact overall time distribution of a project with uncertain task durations. Eur. J. Oper. Res. 126(3), 614–636 (2000)
Wosko, M., Nikodem, J.: Estimation of QoS in stochastic workflow schedules. In: Proceedings of the 2nd Asia-Pacific Conference on Computer-Aided System Engineering, APCASE 2014, 12th February 2014, pp. 75–76 (2014)
Zeng, L., Benatallah, B., Ngu, A.H., Dumas, M., Kalagnanam, J., Chang, H.: QoS-aware middleware for web services composition. IEEE Trans. Softw. Eng. 30(5), 311–327 (2004)
Acknowledgments
The authors wish to thank Smart Services CRC for partially funding this work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Wosko, M., Nikodem, J. (2015). Estimation of Quality of Service in Stochastic Workflow Schedules. In: Borowik, G., Chaczko, Z., Jacak, W., Łuba, T. (eds) Computational Intelligence and Efficiency in Engineering Systems. Studies in Computational Intelligence, vol 595. Springer, Cham. https://doi.org/10.1007/978-3-319-15720-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-15720-7_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15719-1
Online ISBN: 978-3-319-15720-7
eBook Packages: EngineeringEngineering (R0)