Skip to main content

Partitioning Real-Time Systems on Multiprocessors with Shared Resources

  • Conference paper
Principles of Distributed Systems (OPODIS 2010)

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

Included in the following conference series:

Abstract

In this paper we propose a blocking-aware partitioning algorithm which allocates a task set on a multiprocessor (multi-core) platform in a way that the overall amount of blocking times of tasks are decreased. The algorithm reduces the total utilization which, in turn, has the potential to decrease the total number of required processors (cores). In this paper we evaluate our algorithm and compare it with an existing similar algorithm. The comparison criteria includes both number of schedulable systems as well as processor reduction performance.

This work was partially supported by the Swedish Foundation for Strategic Research (SSF) via Mälardalen Real-Time Research Centre (MRTC) at Mälardalen University.

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. Baker, T.: A comparison of global and partitioned EDF schedulability test for multiprocessors. Technical report (2005)

    Google Scholar 

  2. Baker, T.: Stack-based scheduling of real-time processes. Journal of Real-Time Systems 3(1), 67–99 (1991)

    Article  MathSciNet  Google Scholar 

  3. Carpenter, J., Funk, S., Holman, P., Srinivasan, A., Anderson, J., Baruah, S.: A categorization of real-time multiprocessor scheduling problems and algorithms. In: Handbook on Scheduling Algorithms, Methods, and Models. Chapman Hall/CRC, Boca (2004)

    Google Scholar 

  4. Devi, U.: Soft real-time scheduling on multiprocessors. In: PhD thesis (2006), http://www.cs.unc.edu/~anderson/diss/devidiss.pdf

  5. Lakshmanan, K., de Niz, D., Rajkumar, R.: Coordinated task scheduling, allocation and synchronization on multiprocessors. In: Proceedings of 30th IEEE Real-Time Systems Symposium (RTSS 2009), pp. 469–478 (2009)

    Google Scholar 

  6. Nemati, F., Nolte, T., Behnam, M.: Blocking-aware partitioning for multiprocessors. Technical report, Mälardalen Real-Time research Centre (MRTC), Mälardalen University (March 2010), http://www.mrtc.mdh.se/publications/2137.pdf

  7. Rajkumar, R.: Synchronization in Real-Time Systems: A Priority Inheritance Approach. Kluwer Academic Publishers, Dordrecht (1991)

    Book  MATH  Google Scholar 

  8. Tindell, K.W., Burns, A., Wellings, A.J.: Allocating hard real-time tasks: An NP-hard problem made easy. Journal of Real-Time Systems 4(2), 145–165 (1992)

    Article  Google Scholar 

  9. Altenbernd, P., Hansson, H.: The slack method: A new method for static allocation of hard real-time tasks. Journal of Real-Time Systems 15(2), 103–130 (1998)

    Article  Google Scholar 

  10. de Niz, D., Rajkumar, R.: Partitioning bin-packing algorithms for distributed real-time systems. Journal of Embedded Systems 2(3-4), 196–208 (2006)

    Article  Google Scholar 

  11. Baruah, S., Fisher, N.: The partitioned multiprocessor scheduling of sporadic task systems. In: Proceedings of 26th IEEE Real-Time Systems Symposium (RTSS 2005), pp. 321–329 (2005)

    Google Scholar 

  12. Rajkumar, R., Sha, L., Lehoczky, J.P.: Real-time synchronization protocols for multiprocessors. In: Proceedings of the 9th Real-Time Systems Symposium, RTSS 1988 (1988)

    Google Scholar 

  13. Gai, P., Lipari, G., Natale, M.D.: Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In: Proceedings of 22nd IEEE Real-Time Systems Symposium (RTSS 2001), pp. 73–83 (2001)

    Google Scholar 

  14. Gai, P., Di Natale, M., Lipari, G., Ferrari, A., Gabellini, C., Marceca, P.: A comparison of MPCP and MSRP when sharing resources in the janus multiple processor on a chip platform. In: Proceedings of 9th IEEE Real-Time And Embedded Technology Application Symposium (RTAS 2003), pp. 189–198 (2003)

    Google Scholar 

  15. López, J.M., Díaz, J.L., García, D.F.: Utilization bounds for EDF scheduling on real-time multiprocessor systems. Journal of Real-Time Systems 28(1), 39–68 (2004)

    Article  MATH  Google Scholar 

  16. Devi, U., Leontyev, H., Anderson, J.: Efficient synchronization under global EDF scheduling on multiprocessors. In: Proceedings of 18th IEEE Euromicro Conference on Real-time Systems (ECRTS 2006), pp. 75–84 (2006)

    Google Scholar 

  17. Block, A., Leontyev, H., Brandenburg, B., Anderson, J.: A flexible real-time locking protocol for multiprocessors. In: Proceedings of 13th IEEE Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), pp. 47–56 (2007)

    Google Scholar 

  18. Brandenburg, B., Calandrino, J., Block, A., Leontyev, H., Anderson, J.: Synchronization on multiprocessors: To block or not to block, to suspend or spin? In: Proceedings of 14th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2008), pp. 342–353 (2008)

    Google Scholar 

  19. Brandenburg, B., Anderson, J.: An implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP real-time synchronization protocols in LITMUS. In: Proceedings of 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2008), pp. 185–194 (2008)

    Google Scholar 

  20. Brandenburg, B.B., Anderson, J.H.: A comparison of the M-PCP, D-PCP, and FMLP on LITMUSRT. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 105–124. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  21. Easwaran, A., Andersson, B.: Resource sharing in global fixed-priority preemptive multiprocessor scheduling. In: Proceedings of 30th IEEE Real-Time Systems Symposium (RTSS 2009), pp. 377–386 (2009)

    Google Scholar 

  22. Nemati, F., Behnam, M., Nolte, T.: Efficiently migrating real-time systems to multi-cores. In: Proceedings of 14th IEEE Conference on Emerging Techonologies and Factory, ETFA 2009 (2009)

    Google Scholar 

  23. Burns, A.: Preemptive priority based scheduling: An appropriate engineering approach. In: Principles of Real-Time Systems, pp. 225–248. Prentice Hall, Englewood Cliffs (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nemati, F., Nolte, T., Behnam, M. (2010). Partitioning Real-Time Systems on Multiprocessors with Shared Resources. In: Lu, C., Masuzawa, T., Mosbah, M. (eds) Principles of Distributed Systems. OPODIS 2010. Lecture Notes in Computer Science, vol 6490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17653-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17653-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17652-4

  • Online ISBN: 978-3-642-17653-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics