Hybrid-Priority scheduling of resource-sharing sporadic task systems

Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS

Volumn , Issue , 2008, Pages 248-257

  Baruah, Sanjoy ^a   Fisher, Nathan ^b  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b WAYNE STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDED TECHNOLOGY; HYBRID SCHEDULING;

BOOLEAN FUNCTIONS; COMPUTER NETWORKS; REAL TIME SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

SCHEDULING ALGORITHMS;

EID: 51249111801     PISSN: 15453421     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTAS.2008.7     Document Type: Conference Paper

References (29)

1. BAKER, T. P. Stack-based scheduling of real-time processes. Real-Time Systems: The International Journal of Time-Critical Computing 3 (1991).
2. BARUAH, S. Resource sharing in EDF-scheduled systems: A closer look. In Proceedings of the IEEE Real-time Systems Symposium (Rio de Janeiro, December 2006), IEEE Computer Society Press, pp. 379-387.
3. BARUAH, S., HOWELL, R., AND ROSIER, L. Feasibility problems for recurring tasks on one processor. Theoretical Computer Science 118, 1 (1993), 3-20.
4. BARUAH, S., MOK, A., AND ROSIER, L. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium (Orlando, Florida, 1990), IEEE Computer Society Press, pp. 182-190.
5. BOLLELLA, G. Priorities considered harmful (scheduling algorithms considered). Usenet posting, 2002. Archived at URL http://cio.nist.gov/esd/emaildir/lists/rtjdiscuss/msg00356.html.
6. BRIL, R. Existing worst-case response time analysis of realtime tasks under fixed-priority scheduling with deferred preemption is too optimistic. Tech. Rep. 06-05, Technische Universiteit Eindhoven (TU/e), Feb. 2006.
7. BRIL, R. Existing worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption refuted. In Work in Progress (WiP) session of the 18th Euromicro Conference on Real-Time Systems (July 2006), pp. 1-4.
8. BURNS, A. Preemptive priority based scheduling: An appropriate engineering approach. In Advances in Real-Time Systems, S. H. Son, Ed. Prentice-Hall, 1994, pp. 225-248.
9. BUTTAZZO, G. Rate-monotonic vs. EDF: Judgement day. Real-Time Systems: The International Journal of Time-Critical Computing 29, 1 (2005), 5-26.
10. BUTTAZZO, G. C. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, second ed. 2005.
11. CRESPO, A., ALBERTOS, P., BALBASTRE, P., VALLS, M., AND SIM, M. L. J. Schedulability issues in complex embedded control systems. In IEEE Computer Aided Control Systems Design Symposium (2006), IEEE Computer Society Press, pp. 1200-1205.
12. DAVIS, R. L., BURNS, A., BRIL, R. J., AND LUKKIEN, J. J. Controller area network (CAN) schedulability analysis: Refuted, revisited, and revised. Real-Time Systems: The International Journal of Time-Critical Computing 35 (2007), 239-272.
13. DERTOUZOS, M. Control robotics: the procedural control of physical processors. In Proceedings of the IFIP Congress (1974), pp. 807-813.
14. GEORGE, L., RIVIERRE, N., AND SPURI, M. Preemptive and non-preemptive real-time uniprocessor scheduling. Tech. Rep. RR-2966, INRIA: Institut National de Recherche en Informatique et en Automatique, 1996.
15. GWINN, J. Priorities considered harmful (scheduling algorithms considered). Usenet posting, 2002. Archived at URL http://cio.nist.gov/esd/ emaildir/lists/rtjdiscuss/msg00353.html.
16. HARBOUR, M. G., AND GUTIRREZ, J. C. P. Response time analysis for tasks scheduled under EDF within fixed priorities. In Proceedings of the IEEE Real-Time Systems Symposium (Cancun, Mexico, December 2003), IEEE Computer Society Press, pp. 200-209.
17. JOSEPH, M., AND PANDYA, P. Finding response times in a real-time system. The Computer Journal 29, 5 (Oct. 1986), 390-395.
18. KLEIN, M., RALYA, T., POLLAK, B., OBENZA, R., AND HARBOUR, M.G. A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, Boston, 1993.
19. LEHOCZKY, J., SHA, L., AND DING, Y. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of the Real-Time Systems Symposium - 1989 (Santa Monica, California, USA, Dec. 1989), IEEE Computer Society Press, pp. 166-171.
20. LIPARI, G., AND BUTTAZZO, G. Schedulability analysis of periodic and aperiodic tasks with resource constraints. Journal Of Systems Architecture 46, 4 (2000), 327-338.
21. LIU, C., AND LAYLAND, J. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20, 1 (1973), 46-61.
22. MOK, A. K. Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, 1983. Available as Technical Report No. MIT/LCS/TR-297.
23. MOSSE, D., BAKER, T., BARUAH, S., BUTTAZZO, G., BURNS, A., SHA, L., AND STANKOVIC, J. Fixed or dynamic priority? that is the question. In Real-Time Systems Symposium (Panel discussion) (Lisbon, Portugal, December 2004), IEEE Computer Society Press, p. 9.
24. PELLIZZONI, R., AND LIPARI, G. Feasibility analysis of real-time periodic tasks with offsets. Real-Time Systems: The International Journal of Time-Critical Computing 30, 1-2 (May 2005), 105-128.
25. TINDELL, K. W., BURNS, A., AND WELLINGS, A. Calculating controller area network (CAN) message response times. Control Engineering Practice 3, 8 (1995), 1163-1169.
26. TINDELL, K. W., HANSSON, H., AND WELLINGS, A. J. Analysing real-time communications: Controller area network (CAN). In Proceedings of the IEEE Real-Time System Symposium (December 1994).
27. WELLINGS, A., RICHARDSON, M., BURNS, A., AUDS-LEY, N., AND TINDELL, K. Applying new scheduling theory to static priority pre-emptive scheduling. Tech. Rep. RTRG/92/120, Real Time Systems Group, Department of Computer Science, University of York, 1992. Submitted to the UK Software Engineering Journal.
28. ZERZELIDIS, A., AND WELLINGS, A. Getting more flexible scheduling in the RTSJ. In Proceedings of the Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06) (2006), IEEE Computer Society Press, pp. 3-10.
29. ZUBERI, K. M., PILLAI, P., AND SHIN, K. G. EMERALDS: A small-memory real-time microkernel. In Operating Systems Review 34(5): Proceedings of the Seventeenth ACM Symposium on Operating Systems Principles (Decmeber 1999), pp. 277-291.