skip to main content
10.1145/1516241.1516351acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

Analysis on quantum-based fixed priority scheduling of real-time tasks

Published:15 February 2009Publication History

ABSTRACT

Fixed priority schedulers are widely used for real-time systems, and there were efforts to improve the schedulability. Preemption threshold scheduling is one of such efforts with a dual priority scheme. It increases the schedulability by introducing priority inversion during task execution. In this paper, we analyze another scheduling model, quantum-based scheduling. When quantum-based scheduling is combined with priority-based scheduling, the quantum introduces a partially non-preemptive region. We show that the non-preemptiveness introduced by quantum-based scheduling can improve the schedulability of fixed priority tasks, and there is a task set which is not schedulable by preemption threshold scheduling but is schedulable by quantum-based scheduling. This paper presents a method to calculate the worst case response time of tasks in quantum-based scheduling. Based on the previous research results for preemptive and non-preemptive scheduling, we present a priority assignment method for quantum-based scheduling also.

References

  1. J. H. Anderson, R. Jain, and K. Jeffay. Efficient object sharing in quantum-based real-time systems. In Proceedings of the 19th IEEE Real-Time Systems Symposium, pages 346--355, Dec. 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. C. Audsley. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical report, Department of Computer Science, University of York, 1991.Google ScholarGoogle Scholar
  3. N. C. Audsley, A. Burns, M. Richardson, and A. Wellings. Hard real-time scheduling: The deadline monotonic approach. In Proceedings of IEEE Workshop on Real-Time Operating Systems and Software, pages 133--137, May 1991.Google ScholarGoogle ScholarCross RefCross Ref
  4. S. Baruah. The limited-preemption uniprocessor scheduling of sporadic task systems. In Proceedings of the 17th Euromicro Conference on Real-Time Systems, pages 137--144, July 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. E. Bini, G. C. Buttazzo, and G. M. Buttazzo. Rate monotonic analysis: The hyperbolic bound. IEEE Transactions on Computers, 52(7):933--942, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Chen, A. Harji, and P. Buhr. Solution space for fixed-priority with preemption threshold. In Proceedings of the 11th IEEE Real-Time and Embedded Technology and Applications Symposium, pages 385--394, Mar. 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. L. George, N. Riviere, and M. Spuri. Preemptive and non-preemptive real-time uniprocessor scheduling. Technical report, INRIA, 1996.Google ScholarGoogle Scholar
  8. R. Ghattas and A. G. Dean. Preemption threshold scheduling: Stack optimality, enhancements and analyis. In Proceedings of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium, pages 147--157, Apr. 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Gopalakrishnan and G. M. Parulkar. Bringing real-time scheduling theory and practice closer for multimedia computing. In Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 1--12, May 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. D.-Z. He, F.-Y. Wang, and W. Li. Dynamic preemption threshold scheduling for specific real-time control systems. In Proceedings of the IEEE International Conference on Networking, Sensing and Control, pages 395--400, Mar. 2005.Google ScholarGoogle Scholar
  11. K. Jeffay, D. F. Stanat, and C. U. Martel. On non-preemptive scheduling of periodic and sporadic tasks. In Proceedings of IEEE Real-Time Systems Symposium, pages 129--139, Dec. 1991.Google ScholarGoogle Scholar
  12. D. I. Katcher, H. Arakawa, and J. K. Strosnider. Engineering and analysis of fixed priority schedulers. IEEE Transactions on Software Engineering, 19(9):920--934, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Kim, S. Hong, and T.-H. Kim. Integrating real-time synchronization schemes into preemption threshold scheduling. In Proceedings of the 5th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, page 145, Apr. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. P. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proceedings of IEEE Real-Time Systems Symposium, pages 201--209, 1990.Google ScholarGoogle ScholarCross RefCross Ref
  15. T. M. Lim, B.-S. Lee, and C. K. Yeo. Quantum-based earliest deadline first scheduling for multiservices. IEEE Transactions on Multimedia, 9(1):157--168, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of ACM, 20(1):46--61, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Y. Wang and M. Saksena. Scheduling fixed-priority tasks with preemption threshold. In Proceedings of the 6th International Conference on Real-Time Computing Systems and Applications, pages 328--335, Dec. 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Analysis on quantum-based fixed priority scheduling of real-time tasks

      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
      • Published in

        cover image ACM Conferences
        ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
        February 2009
        704 pages
        ISBN:9781605584058
        DOI:10.1145/1516241

        Copyright © 2009 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 15 February 2009

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate251of941submissions,27%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader