Skip to main content

Scheduling Model in Global Real-Time High Performance Computing with Network Calculus

  • Conference paper
Grid and Cooperative Computing (GCC 2003)

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

Included in the following conference series:

  • 353 Accesses

Abstract

We first put forward abstractive model of global scheduling pattern from the global scheduling pattern. Under the framework of the abstractive pattern, we can use a rate-latency server into the QoS parameters, although it can not be the optimal scheduling algorithms in the special schedulers, but for the global scale. It can be easy to get the delay bounds of end-to-end in the uncertain surroundings using some definitions and theories of network calculus.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kim, K., Nahrstedt, K.: A Resource Broker Model with Integrated Reservation Scheme. In: IEEE International Conference on Multimedia and Expo 2000, ICME 2000 (August 2000)

    Google Scholar 

  2. Garimella, G.: Advance CPU Reservations with the Dynamic Soft Real-Time Scheduler, Master’s Thesis, University of Illinois at Urbana-Champaign (1999)

    Google Scholar 

  3. Chu, H., Nahrstedt, K.: A Soft Real Time Scheduling Server in UNIX Operating System. In: Steinmetz, R. (ed.) IDMS 1997. LNCS, vol. 1309, Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Smith, W., Foster, I., Taylor, V.: Scheduling with Advanced Reservations. In: International Parallel and Distributed Processing Symposium, IPDPS 2000 (May 2000)

    Google Scholar 

  5. Wolfe, V.F., Johnston, L.D.R., Morgan, T., et al.: Patterns in Global Dynamic Middleware Scheduling and Binding, http://www.cs.wustl.edu/~mk1/RealTimePatterns/OOPSLA2001/submissions/VicFayWolfe.pdf

  6. Le Boudec, J.Y., Thiran, P.: Network Calculus. Springer, Berlin (2002)

    Google Scholar 

  7. Stiliadis, D., Varma, A.: Latency-rate servers: A general model for analysis of traffic scheduling algorithms. IEEE/ACM Transactions on Networking 6, 611–625 (1998)

    Article  Google Scholar 

  8. Boudec, L.: Some properties of variable length packet. In: Proceedings of ACM Sigmetrics 2001, Boston (June 2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hou, Y., Zhang, S., Zhong, Y. (2004). Scheduling Model in Global Real-Time High Performance Computing with Network Calculus. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24680-0_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21993-4

  • Online ISBN: 978-3-540-24680-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics