Reducing the number of preemptions in fixed priority scheduling

Proceedings - Euromicro Conference on Real-Time Systems

Volumn 16, Issue , 2004, Pages 144-152

  Dobrin, Radu ^a   Fohler, Gerhard ^a  

^a MÄLARDALEN UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; ENERGY UTILIZATION; GRAPH THEORY; MATHEMATICAL MODELS; REAL TIME SYSTEMS; TREES (MATHEMATICS);

ATTRIBUTES; DEADLINE FIRST ALGORITHM (EDF); FIXED PRIORITY SCHEDULING (FPS); OFFSETS;

SCHEDULING;

EID: 5644301219     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. N. Audsley, K. Tindell, and A. Burns. The end of the line for static cyclic scheduling? In Proceedings 5th Euromicro Workshop on Real-Time Systems, pages 36-41, Oulu, Finland, June 1993.
2. A. Burns, K. Tindell, and A. Wellings. Effective analysis for engineering real-time fixed priority schedulers. IEEE Trans. on Software Engineering, 21(5):475-80, May 1995.
3. G. Buttazzo. Rate monotonic vs. EDF: Judgment day. In Proc. 3rd ACM International Conference on Embedded Software, Philadephia, USA, Oct 2003.
4. R. Dobrin, G. Fohler, and P. Puschner. Translating off-line schedules into task attributes for fixed priority scheduling. In Proceedings of the 22nd IEEE Real-Time Systems Symposium, London, UK, Dec. 2001.
5. J. Echagüe, I. Ripol, and A. Crespo. Hard real-time preemptively scheduling with high context switch cost. In Procedings of the 7th Euromicro Workshop on Real-Time Systems, Odense, Denmark, Mar. 1995.
6. K. Jeffay and D. Stone. Accounting for interrupt handling costs in dynamic priority task systems. In Proceedings of Real-Time Systems Symposium, pages 212-221, Dec. 1993.
7. D. I. Katcher, H. Arakawa, and J. K. Strosnider. Engineering and analysis of fixed priority schedulers. Software Engineering, 19(9):920-934, 1993.
8. S. Kim, S. Hong, and T.-H. Kim. Integrating real-time synchronization schemes into preemption threshold scheduling. In Proc. 5th IEEE International Symposium on Object-oriented Real-time Distributed Computing, Crystal City, VA, USA, Apr. 2002.
9. S. Kim, S. Hong, and T.-H. Kim. Perfecting preemption threshold scheduling for object-oriented real-time system design: From the perspective of real-time synchronization. In Proc. Languages, Compilers, and Tools for Embedded Systems, Berlin, Germany, Jun. 2002.
10. C.-G. Lee, J. Hahn, Y.-M. Seo, S. L. Min, R. Ha, S. Hong, C. Y. Park, M. Lee, and C. S. Kim. Analysis of cache-related preemption delay in fixed-priority preemtive scheduling. IEEE Transactions on Computers, 47(6):700-713, June 1998.
11. C.-G. Lee, K. Lee, J. Hahn, Y.-M. Seo, S. L. Min, R. Ha, S. Hong, C. Y. Park, M. Lee, and C. S. Kim. Bounding cache-related preemption delay for real-time systems. Software Engineering, 27(9):805-826, Sep. 2001.
12. J. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proceddings of the Real-Time Symposium, pages 201-212, Dec. 1990.
13. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in hard real-time environment. Journ. of the ACM, 20, 1, Jan. 1973.
14. K. Ramamritham and J. Stankovic. Scheduling algorithms and operating systems support for real-time systems. IEEE, 82(1):55-67, Jan. 1994.
15. J. Schneider. Cache and pipeline sensitive fixed priority scheduling for preemptive real-time systems, 2000.
16. K. Tindell. Adding time-offsets to schedulability analysis, internal report, university of york, computer science dept, ycs-94-221.
17. Y. Wang and M. Saksena. Scheduling fixed priority tasks with preemption threshold. In In Proceedings, IEEE International Conference on Real-Time Computing Systems and Applications, December 1999, Dec. 1999.