Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Optimum allocation of distributed service workflows with probabilistic real-time guarantees

  • Special Issue Paper
  • Published:
Service Oriented Computing and Applications Aims and scope Submit manuscript

Abstract

This paper addresses the problem of optimum allocation of distributed real-time workflows with probabilistic service guarantees over a set of physical resources. The discussion focuses on how such a problem may be mathematically formalized, in terms of both constraints and objective function to be optimized, which also accounts for possible business rules for regulating the deployment of the workflows. The presented formal problem constitutes a probabilistic admission control test that may be run by a provider in order to decide whether or not it is worth to admit new workflows into the system and to decide what the optimum allocation of the workflow to the available resources is. Various options are presented, which may be plugged into the formal problem description, depending on the specific needs of individual workflows. The presented problem has been implemented using GAMS and has been tested under various solvers. An illustrative numerical example and an analysis of the results of the implemented model under realistic settings are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Abeni L, Buttazzo G (1998) Integrating multimedia applications in hard real-time systems. In: RTSS ’98: Proceedings of the IEEE real-time systems symposium, Washington, DC, USA. IEEE Computer Society, p 4

  2. Abeni L, Buttazzo G, Lipari G, Caccamo M (2005) Soft real-time systems: predictability vs. efficiency. Springer, New York

    MATH  Google Scholar 

  3. Baruah SK, Cohen NK, Plaxton CG, Varvel DA (1994) Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15: 600–625

    Article  MathSciNet  Google Scholar 

  4. Bennett JCR, Zhang H (1997) Hierarchical packet fair queueing algorithms. IEEE/ACM Trans Netw 5(5): 675–689

    Article  Google Scholar 

  5. Caccamo M, Buttazzo GC, Thomas DC (2005) Efficient reclaiming in reservation-based real-time systems with variable execution times. IEEE Trans Comput 54(2): 198–213

    Article  Google Scholar 

  6. Checconi F, Cucinotta T, Faggioli D, Lipari G (2009) Hierarchical multiprocessor CPU reservations for the linux kernel. In: Proceedings of the 5th international workshop on operating systems platforms for embedded real-time applications (OSPERT 2009), Dublin, Ireland

  7. Cucinotta T, Anastasi G, Abeni L (2008) Real-time virtual machines. In: Proceedings of the 29th IEEE real-time system symposium (RTSS 2008), work in progress session, Barcelona

  8. Cucinotta T, Anastasi G, Abeni L (2009) Respecting temporal constraints in virtualised services. In: Proceedings of the 2nd IEEE international workshop on real-time service-oriented architecture and applications (RTSOAA 2009), Seattle, Washington

  9. Cucinotta T, Konstanteli K, Varvarigou T (2009) Advance reservations for distributed real-time workflows with probabilistic service guarantees. In: Proceedings of the IEEE international conference on service-oriented computing and applications (SOCA 2009), Taipei, Taiwan

  10. Davare A, Zhu Q, Natale M Di, Pinello C, Kanajan S, Sangiovanni-Vincentelli A (2007) Period optimization for hard real-time distributed automotive systems. In: Proc of DAC’07, San Diego, California, USA

  11. Farooq U, Majumdar S, Parsons EW (2005) Impact of laxity on scheduling with advance reservations in grids. In: MASCOTS ’05: Proceedings of the 13th IEEE international symposium on modeling, analysis, and simulation of computer and telecommunication systems. IEEE Computer Society, Washington, DC, USA, pp 319–324

  12. General Algebraic Modeling system (GAMS) GAMS Development Corporation. Available at http://www.gams.com/

  13. Gopalan K (2001) Real-time support in general purpose operating systems

  14. Kaushik NR, Figueira SM, Chiappari SA (2006) Flexible time- windows for advance reservation scheduling. In: MASCOTS ’06: Proceedings of the 14th IEEE international symposium on modeling, analysis, and simulation, Washington, DC, USA. IEEE Computer Society, pp 218–225

  15. Konstanteli K, Kyriazis D, Varvarigou T, Cucinotta T, Anastasi G (2009) Real-time guarantees in flexible advance reservations. In: Proceedings of the 2nd IEEE international workshop on real-time service-oriented architecture and applications (RTSOAA 2009), Seattle, Washington

  16. Kousiouris G, Checconi F, Mazzetti A, Zlatev Z, Papay J, Voith T, Kyriazis D (2010) Distributed interactive real-time multimedia applications: a sampling and analysis framework. In: Proceedings of the 1st international workshop on analysis tools and methodologies for embedded and real-time systems (WATERS)

  17. Lakshmanan K, Rajkumar R (2008) Distributed resource kernels: Os support for end-to-end resource isolation. In: RTAS ’08: Proceedings of the 2008 IEEE real-time and embedded technology and applications symposium, Washington, DC, USA. IEEE Computer Society, pp 195–204

  18. Li B, Zhao D (2007) Performance impact of advance reservations from the grid on backfill algorithms. In: GCC ’07: Proceedings of the sixth international conference on grid and cooperative computing. IEEE Computer Society, Washington, DC, USA, pp 456–461

  19. Lipari G, Lamastra G, Abeni L (2004) Task synchronization in reservation-based real-time systems. IEEE Trans Comput 53(12): 1591–1601

    Article  Google Scholar 

  20. Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1): 46–61

    Article  MATH  MathSciNet  Google Scholar 

  21. Mamat A, Lu Y, Deogun J, Goddard S (2008) Real-time divisible load scheduling with advance reservation. In: ECRTS ’08: Proceedings of the 2008 euromicro conference on real-time systems, Washington, DC, USA. IEEE Computer Society, pp 37–46

  22. Mercer C, Savage S, Tokuda H (1994) Processor capacity reserves for multimedia operating systems. In: Proceedings of the IEEE international conference on multimedia computing and systems

  23. Netto MA, Bubendorfer K, Buyya R (2007) Sla-based advance reservations with flexible and adaptive time qos parameters. In: ICSOC ’07: Proceedings of the 5th international conference on service-oriented computing. Springer-Verlag, Berlin, Heidelberg, pp 119–131

  24. Palopoli L, Cucinotta T, Marzario L, Lipari G (2009) AQuoSA—adaptive quality of service architecture. Softw Pract Exp 39(1): 1–31

    Article  Google Scholar 

  25. Sahinidis NV (2000) BARON branch and reduce optimization navigator user’s manual v4.0. University of Illinois at Urbana-Champaing, Department of Chemical Engineering. Available at http://archimedes.cheme.cmu.edu/baron/manuse.pdf

  26. Smith W, Foster I, Taylor V (2000) Scheduling with advanced reservations. In: Proceedings of the 14th international IEEE/ACM parallel and distributed processing symposium

  27. Stoica I, Abdel-wahab H, Jeffay K, Baruah SK, Gehrke JE, Plaxton CG (1996) A proportional share resource allocation algorithm for real-time, time-shared systems

  28. Zhao H, Sakellariou R (2006) Advance reservation policies for workflows. In: Proceedings of the 12th international workshop on job scheduling strategies for parallel processing, vol 4376. pp 47–67

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kleopatra Konstanteli.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Konstanteli, K., Cucinotta, T. & Varvarigou, T. Optimum allocation of distributed service workflows with probabilistic real-time guarantees. SOCA 4, 229–243 (2010). https://doi.org/10.1007/s11761-010-0068-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11761-010-0068-1

Keywords

Navigation