Skip to main content

Soft Real-Time Scheduling on SMT Processors with Explicit Resource Allocation

  • Conference paper
Architecture of Computing Systems – ARCS 2008 (ARCS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4934))

Included in the following conference series:

Abstract

Several software or hardware approaches have been proposed to reduce the execution time variability of SMT processors. Software solutions rely on profiling the schedulable tasks to determine the effects of resource sharing over their performance, while the hardware approaches consider a fixed small number of tasks, avoiding the global system-scheduling problem. Both approaches lack of generality or do not take into account architectural details.

This work targets the scheduling of soft real-time tasks on an explicit resource allocation processor, where the system is able to enforce hardware allocation decisions. We propose a simple extension to the Earliest Deadline First scheduler: Resource Aware EDF. RA-EDF uses resource allocation mechanisms to ensure at least the minimum amount of resources needed by a task to meet its deadline. It yields improvements on every case when compared to previous task schedulers: 8% better on average and up to 18%, requiring no additional profiling.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cazorla, F.J., et al.: Improving memory latency aware fetch policies for SMT processors. In: Proceedings of the 5th ISHPC (October 2003)

    Google Scholar 

  2. Cazorla, F.J., et al.: Qos for high-performance SMT processors in embedded systems. IEEE micro. Special Issue on Embedded Systems 24(4), 24–31 (2004)

    Google Scholar 

  3. Cazorla, F.J., et al.: Architectural support for real-time task scheduling in SMT processors. CASES-2005, 166–176 (2005)

    Google Scholar 

  4. Cazorla, F.J., et al.: Predictable performance in SMT processors: synergy between the OS and SMTs. IEEE Transactions on Computers 55(7), 785–799 (2006)

    Article  Google Scholar 

  5. Dertouzos, M.L., Mok, A.K.: Multiprocessor online scheduling of hard-real-time tasks. IEEE Trans. Softw. Eng. 15(12), 1497–1506 (1989)

    Article  Google Scholar 

  6. El-Haj-Mahmoud, A., et al.: Virtual multiprocessor: an analyzable, high-performance architecture for real-time computing. In: CASES (2005)

    Google Scholar 

  7. Goossens, J., Macq, C.: Limitation of the hyper-period in real-time periodic task set generation. In: Teknea (ed.) Proccedings of RTS 2001, Paris, France, pp. 133–148 (2001)

    Google Scholar 

  8. Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17(2), 416–429 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  9. Goossens, J., Richard, P.: Overview of real-time scheduling problem. In: Proceedings of the ninth international conference on project management and scheduling, Nancy France (April 2004)

    Google Scholar 

  10. Jain, R., Hughes, C.J., Adve, S.V.: Soft real-time scheduling on simultaneous multithreaded processors. In: Proceedings of RTSS 2002 (2002)

    Google Scholar 

  11. Lee, A., Potkonjak1, M., Mangione-Smith, W.H.: Mediabench: A tool for evaluating and synthesizing multimedia and communications systems. In: 30th MICRO, pp. 330–335 (1997)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. Marr, D.T., et al.: Hyper-threading technology architecture and microarchitecture. Intel Technology Journal 6(1) (February 2002)

    Google Scholar 

  14. Dhall, S.K., Liu, C.L.: On a Real-Time Scheduling Problem. Operations Research 26(1), 127–140 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lo, S.-W., Lam, K.-Y., Kuo, T.-W.: Real-Time Task Scheduling for SMT Systems. In: RTCSA 2005, pp. 5–10 (2005)

    Google Scholar 

  16. Snavely, A., Tullsen, D.M.: Symbiotic jobscheduling for a simultaneous mutlithreading processor. SIGPLAN Not. 35(11), 234–244 (2000)

    Article  Google Scholar 

  17. Snavely, A., Tullsen, D.M., Voelker, G.: Symbiotic jobscheduling with priorities for a simultaneous multithreading processor. In: Sigmetrics 2002 (2002)

    Google Scholar 

  18. Srinivasan, A., Baruah, S.: Deadline-based scheduling of periodic task systems on multiprocessors. Inf. Process. Lett. 84(2), 93–98 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  19. Tullsen, D.M., et al.: Exploiting choice: instruction fetch and issue on an implementable simultaneous multithreading processor. SIGARCH Comput. Archit. News 24(2), 191–202 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Uwe Brinkschulte Theo Ungerer Christian Hochberger Rainer G. Spallek

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boneti, C., Cazorla, F.J., Gioiosa, R., Valero, M. (2008). Soft Real-Time Scheduling on SMT Processors with Explicit Resource Allocation. In: Brinkschulte, U., Ungerer, T., Hochberger, C., Spallek, R.G. (eds) Architecture of Computing Systems – ARCS 2008. ARCS 2008. Lecture Notes in Computer Science, vol 4934. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78153-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78153-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78152-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics