Determining maximum stack usage in preemptive shared stack systems

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2006, Pages 445-453

  Hänninen, Kaj ^a,b   Mäki Turja, Jukka ^a   Bohlin, Markus ^a,d   Carlson, Jan ^a   Nolin, Mikael ^a,c  

^a MÄLARDALEN UNIVERSITY   (Sweden)

^b Arcticus Systems   (Sweden)

^c CC Systems   (Sweden)

^d SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DYNAMIC PROGRAMMING; PROBLEM SOLVING; REAL TIME SYSTEMS; STATIC ANALYSIS;

SCHEDULED SYSTEMS; SHARED STACK SYSTEMS; STATIC INFORMATION; SYSTEM MODELS;

STORAGE ALLOCATION (COMPUTER);

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

References (34)

1. Absint. Web page, http://www.absint.com/stackanalyzer/.
2. J. H. Anderson, S. Ramamurthy, and K. Jeffay. Real-time computing with lock-free shared objects. ACM Transactions on Computing Systems, 15(2): 134-165, May 1997.
3. Arcticus systems. Web page, http://www.arcticus-systems.se.
4. T. P. Baker. A stack based resource allocation policy for real-time processes. In Proceedings of the 11th IEEE Real-Time Systems Symposium, 1990.
5. D. Brylow, N. Damgaard, and J. Palsberg. Static checking of interrupt-driven software. In Proceedings of the 23rd International Conference on Software Engineering, May 2001.
6. A. Burns and A. Wellings. Real-Time Systems and Programming Languages, chapter 13.10.1 Immediate Ceiling Priority Inheritance. Addison-Wesley, second edition, 1996.
7. H. Cho, B. Ravindran, and E. D. Jensen. A space-optimal wait-free real-time synchronization protocol. In Proceed-ings of the 17th Euromicro Conference on Real-Time Systems, July 2005.
8. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, Cambridge, MA, USA, second edition, 2001.
9. R. Davis, N. Merriam, and N. Tracey. How embedded applications using an RTOS can stay within on-chip memory limits. In Proceedings of the WiP and Industrial Experience Session, Euromicro Conference on Real-Time Systems, June 2000.
10. R. Dobrin and G. Fohler. Reducing the number of preemptions in fixed priority scheduling. In 16th Euromicro Conference on Real-time Systems, Catania, Sicily, Italy, July 2004.
11. P. Gai, G. Lipari, and M. D. Natale. Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In Proceedings of the 22nd Real-Time Systems Symposium, London, UK, Dec 2001.
12. J. C. P. Gutierrez and M. G. Harbour. Schedulability analysis for tasks with static and dynamic offsets. In Proceedings of the 19th Real-Time Systems Symposium, Dec 1998.
13. Haldex traction systems. Web page, http://www.haldex-traction.com/.
14. R. Heckmann and C. Ferdinand. Verifying safety-critical timing and memory-usage properties of embedded software by abstract interpretation. In Proceedings of the Design, Automation and Test in Europe, March 2005.
15. BAE Systems Hägglunds. Web page, http://www.haggve.se.
16. K. Hänninen, J. Lundbäck, K.-L. Lundbäck, J. Mäki-Turja, and M. Nolin. Efficient event-triggered tasks in an RTOS. In Proceedings of the International Conference on Embedded Systems and Applications, June 2005.
17. 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. IEEE Transactions on Software Engineering, 27(9):805-826, Sept 2001.
18. Live devices etas group. Web page, http://en.etasgroup.com/products/rta/.
19. T. A. McKee and F. McMorris. Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications #2. Society for Industrial and Applied Mathematics (SIAM), 1999.
20. Micro digital. Web page, http://www.smxinfo.com/mt.htm.
21. Micro Digital Inc. smx Features and Architecture.
22. B. Middha, M. Simpson, and R. Barua. MTSS: Multi task stack sharing for embedded systems. In Proceedings of the ACM International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, San Francisco, CA, Sept 2005.
23. J. Mäki-Turja, K. Hänninen, and M. Nolin. Efficient Development of Real-Time Systems Using Hybrid Scheduling. In International conference on Embedded Systems and Applications (ESA), June 2005.
24. th Euromicro Conference on Real-Time Systems, July 2005.
25. H. Ramaprasad and F. Mueller. Bounding preemption delay within data cache reference patterns for real-time tasks. In Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium, April 2006.
26. J. Regehr. Scheduling tasks with mixed preemption relations for robustness to timing faults. In Proceedings of the 23rd IEEE Real-Time Systems Symposium, Dec 2002.
27. D. J. Rose and R. E. Tarjan. Algorithmic aspects of vertex elimination. In STOC '75: Proceedings of seventh annual ACM symposium on Theory of computing, pages 245-254, New York, NY, USA, 1975. ACM Press.
28. M. Saksena and Y. Wang. Scalable real-time system design using preemption thresholds. In Proceedings of the 21st Real-Time System Symposium, Nov 2000.
29. K. Sandström, C. Eriksson, and G. Fohler. Handling interrupts with static scheduling in an automotive vehicle control system. In 5th International Workshop on Real-Time Computing Systems and Applications (RTCSA '98), 27-29 October 1998, Hiroshima, Japan, pages 158-165. IEEE Computer Society, 1998.
30. J. Staschulat, S. Schliecker, and R. Ernst. Scheduling analysis of real-time systems with precise modeling of cache related preemption delay. In Proceedings of the 17th Euromicro Conference on Real-Time Systems, July 2005.
31. Tidorum. Web page, http://www.tidorum.fi/bound-t/.
32. K. Tindell. Using Offset Information to Analyse Static Priority Pre-emptively Scheduled Task Sets. Technical Report YCS-182, Dept. of Computer Science, University of York, England, 1992.
33. Unicoi systems. Web page, http://www.unicoi.com/fusion_rtos/fusion_rtos. htm.
34. Volvo Construction Equipment. Web page, http://www.volvoce.com.