skip to main content
research-article

Uniprocessor scheduling under precedence constraints for embedded systems design

Published:12 December 2007Publication History
Skip Abstract Section

Abstract

In this paper, we present a novel approach to the constrained scheduling problem, while addressing a more general class of constraints that arise from the timing requirements on real-time embedded controllers. We provide general necessary and sufficient conditions for scheduling under precedence constraints and derive sufficient conditions for two well-known scheduling policies. We define mathematical problems that provide optimum priority and deadline assignments, while ensuring both precedence constraints and system's schedulability. We show how these problems can be relaxed to corresponding integer linear programming (ILP) formulations leveraging on available solvers. The results are demonstrated on a real design case.

References

  1. Baker, T. 2005. An analysis of fixed-priority scheduling, TR-050201, Florida State University. Tech. Rep. FSU-CS-TR-050201, Florida State University (June).Google ScholarGoogle Scholar
  2. Baker, T. P. 1991. Stack-based scheduling for realtime processes. Real-Time Systems 3, 1, 67--99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Bini, E. and Buttazzo, G. 2003. Rate monotonic analysis: The hyperbolic bound. IEEE Transactions on Computers 52, 7 (July), 933--942. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Bini, E. and Buttazzo, G. 2004. Schedulability analysis of periodic fixed priority systems. IEEE Transactions on Computers 53, 11 (Nov.), 1462--1473. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Buttazzo, G. 2005. Rate monotonic vs. edf: Judgement day. Real Time Systems 29, 1 (Jan.), 5--26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Coll, P., Ribeiro, C., and Souza, C. 2003. Multiprocessor scheduling under precedence constraints: Polyhedral results. In Optimization Online Digest.Google ScholarGoogle Scholar
  7. Correa, J. and Shulz, A. 2004. Single machine scheduling with precedence constraints. Tech. Rep. Sloan Working Paper No. 4499-04, MIT (Aug).Google ScholarGoogle Scholar
  8. Fersman, E. and Yi, W. 2004. A generic approach to schedulability analysis of real-time tasks. Nordic Journal of Computing 11, 2, 129--147. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Fersman, E., Mokrushin, L., Pettersson, P., and Yi, W. 2003. Schedulability analysis using two clocks. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03). Springer, New York. 224--239.Google ScholarGoogle Scholar
  10. Gillies, D., J.W, and Liu, W.-S. 1995. Scheduling tasks with and/or precedence constraints. SIAM Journal on Computing 24, 4, 797--810. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Graphviz. web page http://www.graphviz.org.Google ScholarGoogle Scholar
  12. Leung, J. and Whitehead, J. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation (Netherlands) 2, 4, 237--250.Google ScholarGoogle ScholarCross RefCross Ref
  13. Lisper, B. and Mellgren, P. 2001. Response-time calculation and priority assignment with integer programming methods. In Proceedings of the Work-in-Progress and Industrial Sessions, 13th Euromicro Conference on Real-Time Systems.Google ScholarGoogle Scholar
  14. Liu, C. and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20, 1 (Jan.) 44--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Makhorin, A. 2003. Glpk web page http://www.gnu.org/software/glpk/glpk.html.Google ScholarGoogle Scholar
  16. Mok, A., Tsou, D.-C., and Rooij, R. D. 1996. The msp.rtl real-time scheduler synthesis tool. In Proceedings of the 17th Real-Time Systems Symposium (RTSS'96). IEEE Computer Society, Washington, DC, 118. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Munier, A., Queyranne, M., and Schulz, A. 1998. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. In Proceedings of the 6th International Conference on Integer Programming and Combinatorial Optimization (IPCO'98).Google ScholarGoogle Scholar
  18. Sha, L., Rajkumar, R., and Lehoczky, J. 1990. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers 39, 9 (Sept.), 1175--1185. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Sha, L., Abdelzaher, T., Arzen, K.-E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., and Mok, A. 2004. Real time scheduling theory: A hystorical perspective. Real Time Systems 28, 2--3 (Nov.), 101--155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Spuri, M. and Stankovic, J. 1994. How to integrate precedence constraints and shared resources in real-time scheduling. IEEE Transactions on Computers 43, 12 (Dec.), 1407--1412. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Xu, J. and Parnas, D. 1990. Scheduling processes with release times, deadlines, precedence and exclusion relations. IEEE Transactions on Software Engineering 16, 3, 360--369. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Uniprocessor scheduling under precedence constraints for embedded systems design

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!