Skip to main content

Heuristic Optimization of Scheduling and Allocation for Distributed Systems with Soft Deadlines

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2794))

Abstract

This paper studies optimal deployment and priorities for a class of distributed real-time systems which have complex server tasks, many concurrent scenarios, operations with deterministic or stochastic execution demands, arbitrary precedence between operations, and hard or soft deadline requirements. The soft deadlines take the form of a required percentage of responses falling within the deadline. This work improves on an earlier optimization approach which was only applied to hard deadlines. As before, heuristic measures derived from solutions of layered queueing models are used to guide step-by-step improvement of the priorities and allocation, searching for a feasible solution which meets the soft deadline requirements. Effectiveness is demonstrated on a range of examples including thousands of individual cases.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bettati, R.: End-to-end scheduling to meet deadlines in distributed systems. Ph.D. thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA (March 1994)

    Google Scholar 

  2. Dingle, N.J., Harrison, P.G., Knottenbelt, W.J.: Response time densities in Generalized Stochastic Petri net models. In: Proceeding of the Third Workshop on Software and Performance, Rome (July 2002)

    Google Scholar 

  3. El-Sayed, H.M., Cameron, D., Woodside, C.M.: Automated performance modeling from scenarios and SDL designs of distributed systems. In: Proc. of the Int. Symposium on Software Engineering for Parallel and Distributed Systems (PDSE 1998), Kyoto (April 1998)

    Google Scholar 

  4. El-Sayed, H.M., Cameron, D., Woodside, C.M.: Automation Support for Software Performance Engineering. In: Proc. Joint Int. Conf. on Measurement and Modeling of Computer Systems (Sigmetrics 2001/Performance 2001), Cambridge, MA, pp. 301–311 (2001), ACM order no. 488010

    Google Scholar 

  5. Franks, G., Hubbard, A., Majumdar, S., Petriu, D., Rolia, J., Woodside, C.M.: A toolset for performance engineering and software design of client-server systems. Performance Evaluation 24(1–2), 117–135 (1995)

    Article  MATH  Google Scholar 

  6. Franks, G., Majumdar, S., Neilson, J., Petriu, D., Rolia, J., Woodside, M.: Performance analysis of distributed server systems. In: Proceedings of The Sixth International Conference on Software Quality, Ottawa, Canada, October 28–30, pp. 15–26 (1996)

    Google Scholar 

  7. Franks, G.: Performance analysis of distributed server systems. Ph.D. thesis, Dept. of Systems and Comp. Eng., Carleton University (December 1999)

    Google Scholar 

  8. Garcia, J.J.G., Gonzalez Harbour, M.: Optimized priority assignment for task and messages in distributed hard real-time systems. In: Proc. IEEE Workshop on Parallel and Distributed Real-Time Systems, California, April 1995, pp. 124–132 (1995)

    Google Scholar 

  9. Gardner, M.K.: Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems. Thesis of Doctor of Philosophy, in Computer Science in the Graduate College of the University of Illinois at Urbana-Champaign (1999)

    Google Scholar 

  10. Hou, C.J., Shin, K.G.: Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. In: Proc. of the Real Time system symposium, pp. 146–155 (1992)

    Google Scholar 

  11. Leung, J.Y.T., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation 2(4), 237–250 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  12. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard realtime environment. J. Assoc. Computing. Mach. 20, 46–61 (1973)

    MATH  MathSciNet  Google Scholar 

  13. Peng, D.T., Shin, K.G.: Static allocation of periodic tasks with precedence constraints in distributed real-time systems. In: Proc. of the 9th Intl. Conf. On Distributed computing systems, pp. 190–198 (1989)

    Google Scholar 

  14. Petriu, D., Woodside, M.: Analysing Software Requirements Specifications for Performance. In: Third Int. Workshop on Software and Performance, Rome (July 2002)

    Google Scholar 

  15. Petriu, D.C., Woodside, M.: Software Performance Model from System Scenarios in Use Case Maps. In: International Conferences on Modelling Techniques and Tools for Computer Performance Evaluation, pp. 141–158 (2002)

    Google Scholar 

  16. Petriu, D.C., Shen, H.: Applying the UML Performance Profile: Graph Grammar- Based Derivation of LQN Models from UML specifications. In: International Conferences on Modelling Techniques and Tools for Computer Performance Evaluation, pp. 159–177 (2002)

    Google Scholar 

  17. Rolia, J.R., Sevcik, K.: The method of layers. IEEE Transactions on Software Engineering 21(8), 689–700 (1995)

    Article  Google Scholar 

  18. Sun, J.: Fixed Periodic Scheduling of Periodic Tasks with End-To-End Deadlines. Ph.D. thesis, Department of Computer Science, University of Illinois at Urbana- Champaign, Urbana, Illinois, USA (March 1996)

    Google Scholar 

  19. Tindel, K.W., Burns, A., Wellings, A.J.: Allocating hard real-time tasks: an NP hard problem made easy. Real-Time Systems 4(2), 145–165 (1992)

    Article  Google Scholar 

  20. Woodside, C.M.: Throughput calculation for basic stochastic rendezvous networks. Performance Evaluation 9(2), 143–160 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  21. Woodside, C.M., Monforton, G.M.: Fast allocation of processes in distributed and parallel systems. IEEE Transactions on Parallel and Distributed Systems 4(2) (February 1993)

    Google Scholar 

  22. Woodside, C.M., Neilson, J.E., Petriu, D.C., Majumdar, S.: The stochastic rendezvous network model for performance of synchronous client server-like distributed software. IEEE Transactions on Computers 44(1), 20–34 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheng, T., Woodside, M. (2003). Heuristic Optimization of Scheduling and Allocation for Distributed Systems with Soft Deadlines. In: Kemper, P., Sanders, W.H. (eds) Computer Performance Evaluation. Modelling Techniques and Tools. TOOLS 2003. Lecture Notes in Computer Science, vol 2794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45232-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45232-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40814-7

  • Online ISBN: 978-3-540-45232-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics