Skip to main content
Springer Nature Link
Log in

Rate-Based Resource Allocation Models for Embedded Systems

  • Conference paper
  • First Online:
Embedded Software (EMSOFT 2001)

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

Included in the following conference series:

Abstract

Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other correctness conditions are met. Static priority scheduling is easy to understand and support but it suffers from a number of significant shortcomings such as the complexity of simultaneously mapping timing and importance constraints onto priority values. Rate-based resource allocation schemes offer an attractive alternative to traditional static priority scheduling as they offer flexibility in specifying and managing timing and criticality constraints. This paper presents a taxonomy of rate-based resource allocation and summarizes the results of some recent experiments evaluating the real-time performance of three allocation schemes for a suite of intra-kernel and application-level scheduling problems encountered is supporting a multimedia workload on FreeBSD UNIX.

This work supported in parts by grants from the National Science Foundation (grants CDA-9624662, ITR-0082870, and ITR-0082866), and the IBM and Intel corporations.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. D. Anderson, Tzou, S., Wahbe, R., Govindan, R., Andrews, M., Support for Live Digital Audio and Video, Proc. 10th Intl. Conf. on Distributed Computing Systems, Paris, France, May 1990, pp. 54–61.

    Google Scholar 

  2. L. Abeni, G. Buttazzo, Integrating Multimedia Applications in Hard Real-Time Systems, Proc. of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, December 1998, pp. 4–13.

    Google Scholar 

  3. A. Bavier, and L. L. Peterson, BERT: A Scheduler for Best Effort and Real-time Tasks, Technical Report, Department of Computer Science, Princeton University, 2001.

    Google Scholar 

  4. A. Demers, S. Keshav, and S. Shenkar, Analysis and Simulation of a Fair Queueing Algorithm, Jour. of Internetworking Research &Experience, October 1990, pp. 3–12.

    Google Scholar 

  5. M. Hamdaoui and P. Ramanathan. A dynamic priority assignment technique for streams with (m,k)-firm deadlines, IEEE Transactions on Computers, April 1995.

    Google Scholar 

  6. P. Goyal, X. Guo, H. Vin, A Hierarchical CPU Scheduler for Multimedia Operating Systems, USENIX Symp. on Operating Systems Design & Implementation, Seattle, WA, Oct. 1996, pp. 107–121.

    Google Scholar 

  7. K. Jeffay, F. D. Smith, A. Moorthy, J. Anderson, Proportional Share Scheduling of Operating Systems Services for Real-Time Applications, Proc. of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, December 1998, pp. 480–491.

    Google Scholar 

  8. K. Jeffay, D. Bennett, Rate-Based Execution Abstraction for Multimedia Computing, Proc. of the Fifth Intl. Workshop on Network &Operating System Support for Digital Audio &Video, Durham, NH, April 1995, Lecture Notes in Computer Science, Vol. 1018, pp. 64–75, Springer-Verlag, Heidelberg.

    Google Scholar 

  9. K. Jeffay, S. Goddard, A Theory of Rate-Based Execution, Proc. 20th IEEE Real-Time Systems Symposium, Dec. 1999, pp. 304–314.

    Google Scholar 

  10. K. Jeffay, G. Lamastra, A Comparative Study of the Realization of Rate-Based Computing Services in General Purpose Operating Systems, Proceedings of the Seventh IEEE International Conference on Real-Time Computing Systems and Applications, Cheju Island, South Korea, December 2000, pages 81–90.

    Google Scholar 

  11. M. B. Jones, D. Rosu, M.-C. RosuCPU Reservations &Time Constraints: Efficient, Predictable Scheduling of Independent Activities, Proc., Sixteenth ACM Symposium on Operating Systems Principles, Saint-Malo, France, October 1997, pp. 198–211.

    Google Scholar 

  12. Lehoczky, J., Sha, L., Ding, Y., The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior, Proc. of the 10th IEEE Real-Time Systems Symp., Santa Monica, CA, December 1989, pp. 166–171.

    Google Scholar 

  13. J. Leung, and J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks, Performance Evaluation, 2, 1982, pp. 237–50.

    Google Scholar 

  14. J. W. S. Liu, Real-Time Systems, Prentice Hall, 2000.

    Google Scholar 

  15. C. L. Liu and J. W. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM, Vol. 20, No. 1, January 1973, pp. 46–61.

    MATH  MathSciNet  Google Scholar 

  16. Lynux Works, LynxOS and BlueCat real-time operating systems, http://www.lynx.com/index.html . 17. Mentor Graphics, VRTX Real-Time Operating System.

  17. A. K.-L., Mok, Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment, Ph.D. Thesis, MIT, Dept. of EE and CS, MIT/LCS/TR-297, May 1983.

    Google Scholar 

  18. J. Nieh, M. S. Lam, Integrated Processor Scheduling for Multimedia, Proc. 5th Intl. Workshop on Network and Operating System Support for Digital Audio & Video, Durham, N.H., April 1995, Lecture Notes in Computer Science, T. D. C. Little & R. Gusella, eds., Vol. 1018, Springer-Verlag, Heidelberg.

    Google Scholar 

  19. A. K. Parekh and R. G. Gallager, A Generalized Processor Sharing Approach To Flow Control in Integrated Services Networks-The Single Node Case, ACM/IEEE Transactions on Networking, Vol. 1, No. 3, 1992, pp. 344–357.

    Article  Google Scholar 

  20. pSOS+TM/68K Real-Time Executive, User’s Manual, Motorola, Inc.

    Google Scholar 

  21. QNX Operating System, System Architecture and Neutrino System Architecture Guide, QNX Software Systems Ltd, 1999.

    Google Scholar 

  22. M. Spuri, G. Buttazzo, Efficient Aperiodic Service Under the Earliest Deadline Scheduling, Proc. 15th IEEE Real-Time Systems Symp., Dec. 1994, pp. 2–11.

    Google Scholar 

  23. M. Spuri, G. Buttazzo, F. Sensini, Robust Aperiodic Scheduling Under Dynamic Priority Systems, Proc. 16th IEEE Real-Time Systems Symp., Dec. 1995, pp. 288–299.

    Google Scholar 

  24. I. Stoica, H. Abdel-Wahab, K. Jeffay, S. Baruah, J. Gehrke, C. Plaxton, A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems, Proc. 17th IEEE Real-Time Systems Symposium, Dec. 1996, pp. 288–299.

    Google Scholar 

  25. I. Stoica, H. Abdel-Wahab, K. Jeffay, On the Duality between Resource Reservation and Proportional Share Resource Allocation, Multimedia Computing & Networking’ 97, SPIE Proceedings Series, Vol. 3020, Feb. 1997, pp. 207–214.

    Google Scholar 

  26. VxWorks Programmer’s Guide, WindRiver System, Inc., 1997.

    Google Scholar 

  27. C.A. Waldspurger, W.E. Weihl, Lottery Scheduling: Flexible Proportional-Share Resource Management, Proc. of the First Symp. on Operating System Design and Implementation, Nov. 1994, pp. 1–12.

    Google Scholar 

  28. R. West, K. Schwan, and C. Poellabauer, Scalable scheduling support for loss and delay constrained media streams, Proceedings of the 5th IEEE Real-Time Technology and Applications Symposium, Vancouver, Canada, June 1999.

    Google Scholar 

  29. G. R. Wright, W. R. Stevens, TCP/IP Illustrated, Volume 2, The Implementation, Addison-Wesley, Reading MA, 1995

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC, 27599-3175, USA

    Kevin Jeffay

  2. Computer Science & Engineering, University of Nebraska - Lincoln, Lincoln, NE, 68588-0115, USA

    Steve Goddard

Authors
  1. Kevin Jeffay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steve Goddard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA, 94720-1770, USA

    Thomas A. Henzinger  & Christoph M. Kirsch  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jeffay, K., Goddard, S. (2001). Rate-Based Resource Allocation Models for Embedded Systems. In: Henzinger, T.A., Kirsch, C.M. (eds) Embedded Software. EMSOFT 2001. Lecture Notes in Computer Science, vol 2211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45449-7_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45449-7_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42673-8

  • Online ISBN: 978-3-540-45449-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics