Artikel in Tagungsband INPROC-2015-05

Bibliograph.
Daten
Bach, Thomas; Tariq, Muhammad Adnan; Koldehofe, Boris; Rothermel, Kurt: A Cost Efficient Scheduling Strategy to Guarantee Probabilistic Workflow Deadlines.
In: Proceedings of the International Conference on Networked Systems.
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik.
S. 1-8, englisch.
Cottbus, Germany: IEEE Computer Society, 9. März 2015.
Artikel in Tagungsband (Konferenz-Beitrag).
KörperschaftInternational Conference on Networked Systems
CR-Klassif.C.2.4 (Distributed Systems)
Keywordsrobust workflow execution; parallel service execution; service execution
Kurzfassung

Today, workflows are widely used to model business processes. A recent trend is to use them to model applications in heterogeneous, large-scale distributed systems. In such systems, many, possibly mobile, providers offer independent and interchangeable services that can be used to satisfy the different activities of a workflow. Due to varying server loads, failures, and changing network characteristics, the response time of these services is highly volatile. Thus, it is hard to ensure the timely and reliable execution of workflows depending on such services. A common approach is to invoke several services in parallel to increase the probability of success. This, however, can easily lead to overprovisioning and high cost when needlessly invoked services have to be compensated. In this paper, we investigate the search space between parallel and sequential invocation of services. We propose to invoke independent services staggered over time to ensure timely workflow execution at minimal cost. Evaluations show that our approach reduces the execution cost by up to 85 % while it guarantees to fulfill activity deadlines with 99.9 % probability.

Volltext und
andere Links
PDF (1905293 Bytes)
Copyright© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Kontaktthomas.bach@ipvs.uni-stuttgart.de
Abteilung(en)Universität Stuttgart, Institut für Parallele und Verteilte Systeme, Verteilte Systeme
Projekt(e)ALLOW Ensembles
Eingabedatum14. Januar 2015
   Publ. Abteilung   Publ. Institut   Publ. Informatik