Skip to main content

On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors

  • Conference paper

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

Abstract

We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model includes tasks with time/utility function time constraints, mutual exclusion constraints, and arbitrary arrival, execution-time and resource access behaviors, with timeliness optimization objective of maximizing total accrued utility while ensuring mutual exclusion constraints and deadlock-freedom. Since this problem is NP-hard, we develop a class of polynomial-time heuristic algorithms, called the Global Utility Accrual (GUA), and present two algorithm instances, namely, Non-Greedy Global Utility Accrual (NG-GUA) and Greedy Global Utility Accrual (G-GUA). We establish several properties of the algorithms including conditions under which optimal total utility is accrued, mutual exclusion constraints are satisfied, and deadlock-freedom is achieved. We develop a Linux-based real-time kernel called ChronOS, extended from PREEMPT_RT real-time patch. ChronOS provides a framework for implementation of a variety of multiprocessor schedulers. Our experimental studies with ChronOS reveal the effectiveness of GUA algorithms under a broad range of workloads.

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. ChronOS Real-time Linux, http://www.chronoslinux.org

  2. Allen, R., Garlan, D.: A Case Study in Architectural Modelling: The AEGIS System. In: Proceedings of the 8th International Workshop on Software Specification and Design, IWSSD 1996, p. 6. IEEE Computer Society, Washington DC (1996)

    Google Scholar 

  3. Anderson, J.H., Bud, V., Devi, U.C.: An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems. In: Proceedings of the 17th Euromicro Conference on Real-Time Systems, ECRTS 2005, pp. 199–208 (2005)

    Google Scholar 

  4. Andersson, B., Baruah, S., Jonsson, J.: Static-priority Scheduling on Multiprocessors. In: RTSS 2001, pp. 193–202 (December 2001)

    Google Scholar 

  5. Andersson, B., Jonsson, J.: The Utilization Bounds of Partitioned and Pfair Static-priority Scheduling on Multiprocessors are 50%. In: ECRTS 2003, pp. 33–40 (July 2003)

    Google Scholar 

  6. Baruah, S., Fisher, N.: The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems. IEEE Trans. Comput. 55(7), 918–923 (2006)

    Article  Google Scholar 

  7. Baruah, S.K.: The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors. Real-Time Syst. 32(1-2), 9–20 (2006)

    Article  MATH  Google Scholar 

  8. Baruah, S.K., Cohen, N.K., Plaxton, C.G., Varvel, D.A.: Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica 15(6), 600–625 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bertogna, M., Cirinei, M., Lipari, G.: Improved Schedulability Analysis of EDF on Multiprocessor Platforms. In: ECRTS 2005, pp. 209–218 (2005)

    Google Scholar 

  10. Chen, S.Y., Hsueh, C.W.: Optimal Dynamic-Priority Real-Time Scheduling Algorithms for Uniform Multiprocessors. In: Proceedings of the 2008 Real-Time Systems Symposium, RTSS 2008, pp. 147–156. IEEE Computer Society, Washington DC (2008)

    Google Scholar 

  11. Cho, H.: Utility Accrual Real-Time Scheduling and Synchronization on Single and Multiprocessors. Ph.D. thesis, Virginia Tech. (2006)

    Google Scholar 

  12. Cho, H., Ravindran, B., Jensen, E.D.: An Optimal Real-Time Scheduling Algorithm for Multiprocessors. In: Proceedings of the 27th IEEE International Real-Time Systems Symposium, RTSS 2006, pp. 101–110. IEEE Computer Society, Washington DC (2006)

    Chapter  Google Scholar 

  13. Clark, R.K.: Scheduling Dependent Real-Time Activities. Ph.D. thesis, CMU, CMU-CS-90-155 (1990)

    Google Scholar 

  14. Clark, R., Jensen, E.D., Kanevsky, A., Maurer, J., Wallace, P., Wheeler, T., Zhang, Y., Wells, D., Lawrence, T., Hurley, P.: An Adaptive, Distributed Airborne Tracking System (“Process the Right Tracks at the Right Time”). In: Rolim, J.D.P. (ed.) IPPS-WS 1999 and SPDP-WS 1999. LNCS, vol. 1586, pp. 353–362. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  15. Funaoka, K., Kato, S., Yamasaki, N.: Work-Conserving Optimal Real-Time Scheduling on Multiprocessors. In: Euromicro Conference on Real-Time Systems, ECRTS 2008, pp. 13–22 (2-4, 2008)

    Google Scholar 

  16. Funk, S., Nanadur, V.: LRE-TL: An Optimal Multiprocessor Scheduling Algorithm for Sporadic Task Sets. In: 17th International Conference on Real-Time and Network Systems, pp. 159–168 (2009)

    Google Scholar 

  17. Garyali, P.: On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors. Master’s thesis, Virginia Tech. (2010)

    Google Scholar 

  18. Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, San Francisco (2008)

    Google Scholar 

  19. Jensen, E., Locke, C., Tokuda, H.: A Time Driven Scheduling Model for Real-Time Operating Systems. In: IEEE RTSS, pp. 112–122 (1985)

    Google Scholar 

  20. Jensen, E., Northcutt, J.: Alpha: A Non-proprietary OS for Large, Complex, Distributed Real-Time Systems. In: Proceedings of IEEE Workshop on Experimental Distributed Systems, pp. 35–41 (11-12, 1990)

    Google Scholar 

  21. Koren, G., Shasha, D.: D-OVER; An Optimal On-line Scheduling Algorithm for Overloaded Real-Time Systems. In: Real-Time Systems Symposium 1992, pp. 290–299 (2-4, 1992)

    Google Scholar 

  22. Koren, G., Shasha, D.: MOCA: A Multiprocessor On-line Competitive Algorithm for Real-Time System Scheduling. Theor. Comput. Sci. 128(1-2), 75–97 (1994)

    Article  MATH  Google Scholar 

  23. Lakshmanan, K., Rajkumar, R., Lehoczky, J.: Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors. In: 21st Euromicro Conference on Real-Time Systems, ECRTS 2009, pp. 239–248 (1-3, 2009)

    Google Scholar 

  24. Li, P.: Utility Accrual Real-Time Scheduling: Models and Algorithms. Ph.D. thesis, Virginia Tech. (July 2004)

    Google Scholar 

  25. Li, P., Wu, H., Ravindran, B., Jensen, E.D.: A Utility Accrual Scheduling Algorithm for Real-Time Activities with Mutual Exclusion Resource Constraints. IEEE Trans. Comput. 55(4), 454–469 (2006)

    Article  Google Scholar 

  26. Locke, C.D.: Best-Effort Decision Making for Real-Time Scheduling. Ph.D. thesis, CMU, CMU-CS-86-134 (1986)

    Google Scholar 

  27. Molnar, I.: CONFIG PREEMPT REALTIME, “Fully Preemptible Kernel”, vp-2.6.9-rc4-mm1-t4, http://lwn.net/Articles/105948/

  28. OMG: Real-time CORBA 2.0: Dynamic Scheduling Specification. Tech. rep., Object Management Group (September 2001)

    Google Scholar 

  29. Patterson, D.: The Trouble With Multicore. IEEE Spectrum 47(7), 28–32 (2010)

    Article  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

Garyali, P., Dellinger, M., Ravindran, B. (2010). On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors. 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_21

Download citation

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

  • 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