Resource sharing in EDF-scheduled systems: A closer look

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2006, Pages 379-387

  Baruah, Sanjoy K ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Earliest deadline first; Feasibility analysis; Resource replication; Stack resource policy

Indexed keywords

EARLIEST DEADLINE FIRST; FEASIBILITY ANALYSIS; RESOURCE REPLICATION; STACK RESOURCE POLICY (SRP);

ALGORITHMS; OPTIMIZATION; REAL TIME SYSTEMS; SCHEDULING;

RESOURCE ALLOCATION;

EID: 38949143955     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2006.41     Document Type: Conference Paper

References (24)

1. T. P. Baker. Stack-based scheduling of real-time processes. Real-Time Systems: The International Journal of Time-Critical Computing, 3, 1991.
2. S. Baruah. Optimal resource-replication and the Priority Ceiling Protocol. In Proceedings of the International Conference on Real-time Computing Systems and Applications, Tokyo, Japan, March 2002. IEEE Computer Society Press.
3. S. Baruah and A. Burns. Sustainable scheduling analysis. In Proceedings of the IEEE Real-time Systems Symposium, Rio de Janeiro, December 2006. IEEE Computer Society Press.
4. S. Baruah, R. Howell, and L. Rosier. Feasibility problems for recurring tasks on one processor. Theoretical Computer Science, 118(1):3-20, 1993.
5. S. Baruah, A. Mok, and L. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium, pages 182-190, Orlando, Florida, 1990. IEEE Computer Society Press.
6. G. Buttazzo. Rate-monotonic vs. EDF: Judgement day. Real-Time Systems: The International Journal of Time-Critical Computing, 29(1):5-26, 2005.
7. G. C. Buttazzo. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Second edition, 2005.
8. M. Dertouzos. Control robotics: the procedural control of physical processors. In Proceedings of the IFIP Congress, pages 807-813, 1974.
9. E. W. Dijkstra. Co-operating sequential processes. In F. Genuys, editor, Programming Languages, pages 43-112. Academic Press N.Y., 1968.
10. L. George, N. Rivierre, and M. Spuri. Preemptive and non-preemptive real-time uniprocessor scheduling. Technical Report RR-2966, INRIA: Institut National de Recherche en Informatique et en Automatique, 1996.
11. A. Helal, A. Heddaya, and B. Bhargava. Replication Techniques in Distributed Systems. Kluwer Academic Publishers, 101 Philip Drive, Assinippi Park Norwell, MA 02061, USA, 1996.
12. M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390-395, Oct. 1986.
13. M. Klein, T. Ralya, B. Pollak, R. Obenza, and M. G. Harbour. A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, Boston, 1993.
14. B.W. Lampson and D.D. Redell. Experience with processes and monitors in Mesa. In Proceedings of the 7th ACM Symposium on Operating Systems Principles (SOSP), pages 43-44, 1979.
15. B. W. Lampson and D. D. Redell. Experience with processes and monitors in Mesa. Communications of the ACM, 23(2): 105-117, Feb. 1980.
16. J. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2:237-250, 1982.
17. G. Lipari and G. Buttazzo. Schedulability analysis of periodic and aperiodic tasks with resource constraints. Journal Of Systems Architecture, 46(4):327-338, 2000.
18. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
19. A. Mok. Task management techniques for enforcing ED scheduling on a periodic task set. In Proc. 5th IEEE Workshop on Real-Time Software and Operating Systems, pages 42-46, Washington D.C., May 1988.
20. A. K. Mok. 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.
21. D. Mosse, T. Baker, S. Baruah, G. Buttazzo, A. Burns, L. Sha, and J. Stankovic. Fixed or dynamic priority? that is the question. In Real-Time Systems Symposium (Panel discussion), page 9, Lisbon, Portugal, December 2004. IEEE Computer Society Press.
22. R. Pellizzoni and G. Lipari. Feasibility analysis of real-time periodic tasks with offsets. Real-Time Systems: The International Journal of Time-Critical Computing, 30(1-2): 105-128, May 2005.
23. L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers, 39(9): 1175-1185, 1990.
24. A. Wellings, M. Richardson, A. Burns, N. Audsley, and K. Tindell. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8:284-292, 1993.