Skip to main content
SpringerLink
Log in

Introduction

  • Chapter
  • First Online:
Book cover Techniques for Building Timing-Predictable Embedded Systems

Abstract

Embedded systems are playing a more and more important role in our daily life; they exist everywhere in our society from consumer electronics such as multimedia systems, mobile phones, microwave ovens, refrigerators to industrial fields such as robotics, telecommunications, environment monitoring, and nuclear power plants. According to statistics reported by ARTEMIS [1], 98 % computing devices in the world are embedded systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. ARTEMIS European Technology Platform, http://www.artemis-ju.eu/embedded_systems

  2. V. Suhendra, T. Mitra, Exploring locking and partitioning for predictable shared caches on multi-cores, in DAC, 2008

    Google Scholar 

  3. A. Vajda, Programming Many-Core Chips (Springer, Dordrecht, 2011)

    Book  Google Scholar 

  4. R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. FerdinanRd, R. Heckmann, T. Mitra, F. Mueller, I. Puaut, P. Puschner, J. Staschulat, P. Stenström, The worst-case execution-time problem overview of methods and survey of tools. ACM Trans. Embed. Comput. Syst. 7(3), 36:1–36:53 (2008)

    Google Scholar 

  5. H. Theiling, Control flow graphs for real-time system analysis: reconstruction from binary executables and usage in ilp-based path analysis. Ph.D. thesis, Universitat des Saarlandes, 2002

    Google Scholar 

  6. C. Cullmann, F. Martin, Data-flow based detection of loop bounds, in 7th International Workshop on Worst-Case Execution Time (WCET) Analysis, ed. by C. Rochange (Dagstuhl, Wadern). Internationales Begegnungs- und Forschungszentrum f”ur Informatik (IBFI) (Schloss Dagstuhl, Wadern, 2007)

    Google Scholar 

  7. J. Gustafsson, A. Ermedahl, C. Sandberg, B. Lisper, Automatic derivation of loop bounds and infeasible paths for wcet analysis using abstract execution, in RTSS (IEEE Computer Society, Washington, DC, 2006), pp. 57–66

    Google Scholar 

  8. C. Healy, M. Sjödin, V. Rustagi, D. Whalley, R. Van Engelen, Supporting timing analysis by automatic bounding of loop iterations. Real-Time Syst. 18(2/3), 129–156 (2000)

    Article  Google Scholar 

  9. F. Stappert, P. Altenbernd, Complete worst-case execution time analysis of straight-line hard real-time programs. J. Syst. Archit. 46(4), 339–355 (2000)

    Article  Google Scholar 

  10. P. Altenbernd, On the false path problem in hard real-time programs, in Proceedings of the 8th Euromicro Workshop on Real-Time Systems, 1996, pp. 102–107

    Google Scholar 

  11. C.A. Healy, D.B. Whalley, Automatic detection and exploitation of branch constraints for timing analysis. IEEE Trans. Softw. Eng. 28(8), 763–781 (2002)

    Article  Google Scholar 

  12. R. Wilhelm, P. Lucas, O. Parshin, L. Tan, B. Wachter, Improving the precision of WCET analysis by input constraints and model-derived flow constraints, in Advances in Real-Time Systems, ed. by S. Chakraborty, J. Eberspächer. Lecture Notes in Computer Science. (Springer, Berlin, 2011)

    Google Scholar 

  13. J. Engblom, Processor pipelines and static worst-case execution time analysis. Ph.D. Thesis, Uppsala University, 2002

    Google Scholar 

  14. X. Li, A. Roychoudhury, T. Mitra, Modeling out-of-order processors for software timing analysis, in RTSS, 2004, pp. 92–103

    Google Scholar 

  15. S. Thesing, Safe and precise wcet determination by abstract interpretation of pipeline models. Ph.D. thesis, Universitat des Saarlandes, 2004

    Google Scholar 

  16. S. Wilhelm, B. Wachter, Symbolic state traversal for wcet analysis, in EMSOFT (ACM, New York, NY, 2009), pp. 137–146

    Google Scholar 

  17. E. Althaus, S. Altmeyer, R. Naujoks, Precise and efficient parametric path analysis, in LCTES (ACM, New York, NY, 2011), pp. 141–150

    Google Scholar 

  18. Y.-T. Steven Li, S. Malik, Performance analysis of embedded software using implicit path enumeration, in DAC (ACM, New York, NY, 1995), pp. 456–461

    Google Scholar 

  19. H. Theiling, C. Ferdinand, R. Wilhelm, Fast and precise wcet prediction by separated cache and path analyses. Real-Time Syst. 18(2/3), 157–179 (2000). doi:10.1023/A:1008141130870. http://dx.doi.org/10.1023/A:1008141130870

    Article  Google Scholar 

  20. H. Theiling, Ilp-based interprocedural path analysis, in EMSOFT ’02 (Springer, London, 2002), pp. 349–363

    Google Scholar 

  21. D. Grund, J. Reineke, Abstract interpretation of fifo replacement, in SAS (Springer, Berlin/Heidelberg, 2009), pp. 120–136

    Google Scholar 

  22. N. Guan, M. Lv, W. Yi, G. Yu, Wcet analysis with mru caches: Challenging lru for predictability. in RTAS, 2012, pp. 55–64

    Google Scholar 

  23. D. Grund, J. Reineke, Toward precise plru cache analysis, in WCET, 2010, pp. 23–35

    Google Scholar 

  24. C. Ferdinand, Cache behavior prediction for real-time systems. Ph.D. thesis, Universitat des Saarlandes, 1997

    Google Scholar 

  25. F. Mueller, Generalizing Timing Predictions to Set-Associative Caches, vol. 0 (IEEE Computer Society, Los Alamitos, CA, 1997), p. 64

    Google Scholar 

  26. J. Reineke, D. Grund, C. Berg, R. Wilhelm, Timing predictability of cache replacement policies. Real-Time Syst. 37(2), 99–122 (2007). doi:10.1007/s11241-007-9032-3. http://dx.doi.org/10.1007/s11241-007-9032-3

    Article  MATH  Google Scholar 

  27. R. Wilhelm, D. Grund, J. Reineke, M. Schlickling, M. Pister, C. Ferdinand, Memory hierarchies, pipelines, and buses for future architectures in time-critical embedded systems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(7), 966–978 (2009)

    Article  Google Scholar 

  28. D. Grund, J. Reineke, Precise and efficient fifo-replacement analysis based on static phase detection, in ECRTS (IEEE Computer Society, Washington, DC, 2010), pp. 155–164

    Google Scholar 

  29. M. Lv, N. Guan, W. Yi, Q. Deng, G. Yu, Efficient instruction cache analysis with model checking, in RTAS, Work-in-Progress Session, 2010

    Google Scholar 

  30. S. Baruah, A. Mok, L. Rosier, Preemptively scheduling hard-real-time sporadic tasks on one processor, in RTSS, 1990

    Google Scholar 

  31. M. Joseph, P.K. Pandya, Finding response times in a real-time system. Comput. J. 29(5), 390–395 (1986). doi:10.1093/comjnl/29.5.390. http://dx.doi.org/10.1093/comjnl/29.5.390

    Article  MathSciNet  Google Scholar 

  32. C.L. Liu, J.W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973). doi:10.1145/321738.321743. http://doi.acm.org/10.1145/321738.321743

    Article  MathSciNet  MATH  Google Scholar 

  33. On-Line Applications Research Corporation (OAR), RTEMS Applications C User’s Guide (2001)

    Google Scholar 

  34. J. Calandrino, H. Leontyev, A. Block, U. Devi, J. Anderson, Litmusrt: a testbed for empirically comparing real-time multiprocessor schedulers, in RTSS, 2006

    Google Scholar 

  35. J.P. Lehoczky, Fixed priority scheduling of periodic task sets with arbitrary deadlines, in RTSS, 1990

    Google Scholar 

  36. R.I. Davis, A. Burns, R.J. Bril, J.J. Lukkien, Controller Area Network (CAN) schedulability analysis: refuted, revisited and revised. Real-Time Syst. 35(3), 239–272 (2007)

    Article  Google Scholar 

  37. L. George, N. Rivierre, M. Spuri, Preemptive and non-preemptive real-time uni-processor scheduling. Technical Report, INRIA, 1996

    Google Scholar 

  38. L. Sha, R. Rajkumar, J. Lehoczky, Priority inheritance protocols: an approach to real-time synchronization. IEEE Trans. Comput. 39(9), 1175–1185 (1990). doi:10.1109/12.57058. http://dx.doi.org/10.1109/12.57058

    Article  MathSciNet  Google Scholar 

  39. N. Audsley, A. Burns, M. Richardson, K. Tindell, A.J. Wellings, Applying new scheduling theory to static priority preemptive scheduling. Softw. Eng. J. 8(5), 284–292 (1993). http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=238595

    Article  Google Scholar 

  40. A. Hamann, M. Jersak, K. Richter, R. Ernst, Design space exploration and system optimization with symta/s-symbolic timing analysis for systems, in RTSS, 2004

    Google Scholar 

  41. M. Gonzalez Harbour, J. Palencia Gutierrez, Schedulability analysis for tasks with static and dynamic offsets, in RTSS, 1998

    Google Scholar 

  42. K. Tindell, Adding time-offsets to schedulability analysis. Technical Report, 1994

    Google Scholar 

  43. S. Baruah, Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Syst. 24(1), 93–128 (2003). doi:10.1023/A:1021711220939. http://dx.doi.org/10.1023/A:1021711220939

    Article  MATH  Google Scholar 

  44. M. Stigge, N. Guan, W. Yi, Refinement-based exact response time analysis. Technical Report, 2014

    Book  Google Scholar 

  45. T.W. Kuo, A.K. Mok, Load adjustment in adaptive real-time systems, in RTSS, 1991

    Google Scholar 

  46. C. Lu, J.A. Stankovic, S.H. Son, G. Tao, Feedback control real-time scheduling: framework, modeling, and algorithms. Real-Time Syst. 23(1–2), 85–126 (2002)

    Article  MATH  Google Scholar 

  47. C.L. Liu, Scheduling algorithms for multiprocessors in a hard real-time environment, in JPL Space Programs Summary, 1969

    Google Scholar 

  48. J. Carpenter, S. Funk, P. Holman, A. Srinivasan, J. Anderson, S. Baruah, A categorization of real-time multiprocessor scheduling problems and algorithms, in Handbook of Scheduling - Algorithms, Models, and Performance Analysis (2004). http://www.crcnetbase.com/doi/abs/10.1201/9780203489802.ch30

  49. R.I. Davis, A. Burns, A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43(4), 35:1–35:44 (2011)

    Google Scholar 

  50. B. Andersson, S. Baruah, J. Jonsson, Static-priority scheduling on multiprocessors, in RTSS, 2001

    Google Scholar 

  51. B. Andersson, Global static priority preemptive multiprocessor scheduling with utilization bound 38%, in OPODIS, 2008

    Google Scholar 

  52. T.P. Baker, Multiprocessor edf and deadline monotonic schedulability analysis, in RTSS, 2003

    Google Scholar 

  53. S.K. Baruah, Techniques for multiprocessor global schedulability analysis, in RTSS, 2007

    Google Scholar 

  54. M. Bertogna, M. Cirinei, G. Lipari, Improved schedulability analysis of edf on multiprocessor platforms, in ECRTS, 2005

    Google Scholar 

  55. N. Guan, M. Stigge, W. Yi, G. Yu, New response time bounds for fixed priority multiprocessor scheduling, in Proceedings of the 30st IEEE Real-Time Systems Symposium (RTSS), 2009

    Google Scholar 

  56. B. Andersson, J. Jonsson, Some insights on fixed-priority preemptive non-partitioned multiprocessor scheduling. Technical Report, Chalmers University of Technology, 2001

    Google Scholar 

  57. S. Lauzac, R.G. Melhem, D. Mosse, Comparison of global and partitioning schemes for scheduling rate monotonic tasks on a multiprocessor, in ECRTS, 1998

    Google Scholar 

  58. S.K. Dhall, C.L. Liu, On a real-time scheduling problem. Oper. Res. 26(1), 127–140 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  59. B. Andersson, J. Jonsson, The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%, in Euromicro Conference on Real-Time Systems (ECRTS), 2003

    Google Scholar 

  60. S. Baruah, N. Fisher, The partitioned multiprocessor scheduling of sporadic task systems, in RTSS, 2005

    Google Scholar 

  61. A. Burchard, J. Liebeherr, Y. Oh, S.H. Son, New strategies for assigning real-time tasks to multiprocessor systems. IEEE Trans. Comput. 44(12), 1429–1442 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  62. N. Fisher, S.K. Baruah, T.P. Baker, The partitioned scheduling of sporadic tasks according to static-priorities, in ECRTS, 2006, pp. 118–127

    Google Scholar 

  63. D. Oh, T.P. Baker, Utilization bounds for n-processor rate monotone scheduling with static processor assignment. Real-Time Syst. 15(2), 183–192. doi:10.1023/A:1008098013753. http://dx.doi.org/10.1023/A:1008098013753 (1998)

    Google Scholar 

  64. S.K. Dhall, S. Davari, On a periodic real time task allocation problem, in Annual International Conference on System Sciences, 1986

    Google Scholar 

  65. E.G. Coffman Jr., M.R. Garey, D.S. Johnson, Approximation algorithms for bin packing: a survey, in Approximation Algorithms for NP-Hard Problems, ed. by D.S. Hochbaum (PWS Publishing Co., Boston, 1997), pp. 46–93. http://dl.acm.org/citation.cfm?id=241938.241940

    Google Scholar 

  66. J. Anderson, V. Bud, U.C. Devi, An EDF-based scheduling algorithm for multiprocessor soft real-time systems, in ECRTS, 2005

    Google Scholar 

  67. B. Andersson, K. Bletsas, S. Baruah, Scheduling arbitrary-deadline sporadic task systems multiprocessors, in RTSS, 2008

    Google Scholar 

  68. N. Guan, M. Stigge, W. Yi, G. Yu, Fixed-priority multiprocessor scheduling with Liu & Layland’s utilization bound, in RTAS, 2010

    Google Scholar 

  69. S. Kato, N. Yamasaki, Portioned EDF-based scheduling on multiprocessors, in EMSOFT, 2008

    Google Scholar 

  70. A. Abel, F. Benz, J. Doerfert, B. Dörr, S. Hahn, F. Haupenthal, M. Jacobs, A.H. Moin, J. Reineke, B. Schommer, R. Wilhelm, Impact of resource sharing on performance and performance prediction: a survey, in CONCUR, 2013, pp. 25–43

    Google Scholar 

  71. C. Rochange, An overview of approaches towards the timing analysability of parallel architecture, in PPES, 2011, pp. 32–41

    Google Scholar 

  72. J.C. Palencia Gutiérrez, J.J. Gutiérrez García, M. González Harbour, On the schedulability analysis for distributed hard real-time systems, in RTS, 1997, pp. 136–143

    Google Scholar 

  73. K. Tindell, Holistic schedulability analysis for distributed hard real-time system. Microprocess. Microprogram. 40(2–3), 117–134 (1994). doi:10.1016/0165-6074(94)90080-9. http://dx.doi.org/10.1016/0165-6074(94)90080-9

    Article  Google Scholar 

  74. S. Chakraborty, S. Künzli, L. Thiele, A general framework for analysing system properties in platform-based embedded system designs, in DATE, 2003, pp. 10190–10195

    Google Scholar 

  75. J. Rox, R. Ernst, Compositional performance analysis with improved analysis techniques for obtaining viable end-to-end latencies in distributed embedded systems, in STTT, 2013

    Google Scholar 

  76. L. Thiele, S. Chakraborty, M. Naedele, Real-time calculus for scheduling hard real-time systems, in ISCAS 2000, vol. 4, 2000, pp. 101–104

    Google Scholar 

  77. J.-Y. Le Boudec, P. Thiran, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet (Springer, Berlin/Heidelberg, 2001)

    Book  Google Scholar 

  78. E. Wandeler, Modular performance analysis and interface-based design for embedded real-time systems. Ph.D. thesis, ETHZ, 2006

    Google Scholar 

  79. B. Jonsson, S. Perathoner, L. Thiele, W. Yi, Cyclic dependencies in modular performance analysis, in EMSOFT, 2008, pp. 179–188

    Google Scholar 

  80. E. Wandeler, L. Thiele, Real-Time Calculus (RTC) Toolbox, (2006), http://www.mpa.ethz.ch/Rtctoolbox

  81. J. Hennessy, D. Patterson, Computer Architecture – A Quantitative Approach, 4th edn. (Morgan Kaufmann, San Francisco, 2007)

    Google Scholar 

  82. H. Al-Zoubi, A. Milenkovic, M. Milenkovic, Performance evaluation of cache replacement policies for the spec cpu2000 benchmark suite, in ACM-SE 42 (ACM, New York, NY, 2004), pp. 267–272

    Google Scholar 

  83. D. Eklov, N. Nikoleris, D. Black-Schaffer, E. Hagersten, Cache pirating: measuring the curse of the shared cache, in ICPP (IEEE Computer Society, Washington, DC, 2011), pp. 165–175

    Google Scholar 

  84. G. Grohoski, Niagara-2: a highly threaded server-on-a-chip, in HotChips, 2006

    Google Scholar 

  85. T.P. Baker, M. Cirinei, Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks, in OPODIS, 2007, pp. 62–75

    Google Scholar 

  86. Q. Deng, S. Gao, N. Guan, Z. Gu, G. Yu, Exact schedulability analysis for static-priority global multiprocessor scheduling using model-checking, in Proceedings of the 5th IFIP Workshop on Software Technologies for Future Embedded and Ubiquitous Systems (SEUS), 2007

    Google Scholar 

  87. N. Guan, Z. Gu, M. Lv, Q. Deng, G. Yu, Schedulability analysis of global fixed-priority or edf multiprocessor scheduling with symbolic model-checking, in ISORC, 2008, pp. 556–560

    Google Scholar 

  88. Y. Li, V. Suhendra, Y. Liang, T. Mitra, A. Roychoudhury, Timing analysis of concurrent programs running on shared cache multi-cores, in RTSS, 2009, pp. 57–67

    Google Scholar 

  89. J. Yan, W. Zhang, Wcet analysis for multi-core processors with shared l2 instruction caches, in RTAS, 2008

    Google Scholar 

  90. W. Zhang, J. Yan, Accurately estimating worst-case execution time for multi-core processors with shared direct-mapped instruction caches, in RTCSA, 2009, pp. 455–463

    Google Scholar 

  91. S. Perathoner, EDF scheduling with real time calculus, in Presentation, TEC Group, Computer Engineering and Networks Laboratory, ETH Zurich, 2007

    Google Scholar 

  92. J.P. Erickson, J.H. Anderson, Fair lateness scheduling: reducing maximum lateness in g-edf-like scheduling, in ECRTS (2012)

    Google Scholar 

  93. H. Leontyev, J.H. Anderson, Generalized tardiness bounds for global multiprocessor scheduling. Real-Time Syst. 44(1–3), 26–71 (2010)

    Article  MATH  Google Scholar 

  94. M. Spuri, Analysis of deadline scheduled real-time systems, in RR-2772, INRIA, France, 1996

    Google Scholar 

  95. J. Reineke, Caches in wcet analysis – predictability, competitiveness, sensitivity. Ph.D. thesis, Saarland University, 2008

    Google Scholar 

  96. R. Heckmann, M. Langenbach, S. Thesing, R. Wilhelm, The influence of processor architecture on the design and the results of wcet tools, in Proceedings of the IEEE (2003)

    Google Scholar 

  97. A. Malamy, R.N. Patel, N.M. Hayes, Methods and apparatus for implementing a pseudo-lru cache memory replacement scheme with a locking feature. US Patent 5029072, 1994

    Google Scholar 

  98. A.S. Tanenbaum, Modern Operating Systems, 3rd edn. (Prentice Hall Press, Upper Saddle River, NJ, 2007)

    Google Scholar 

  99. D. Eklov, N. Nikoleris, D. Black-Schaffer, E. Hagersten, Cache pirating: measuring the curse of the shared cache, in ICPP (IEEE Computer Society, Washington, DC, 2011), pp. 165–175. doi:10.1109/ICPP.2011.15. http://dx.doi.org/10.1109/ICPP.2011.15

    Google Scholar 

  100. P. Kongetira, K. Aingaran, K. Olukotun, Niagara: a 32-way multithreaded sparc processor. IEEE Micro 25(2), 21–29 (2005)

    Article  Google Scholar 

  101. J. Reineke, D. Grund, Relative competitive analysis of cache replacement policies, in Proceedings of the 2008 ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, LCTES ’08 (ACM, New York, NY, 2008), pp. 51–60

    Google Scholar 

  102. Y.-T.S. Li, S. Malik, A. Wolfe, Cache modeling for real-time software: beyond direct mapped instruction caches, in RTSS (IEEE Computer Society, Washington, DC, 1996), pp. 254–261

    Google Scholar 

  103. R.D. Arnold, F. Mueller, D.B. Whalley, M.G. Harmon, Bounding worst-case instruction cache performance, in RTSS (IEEE Computer Society, 1994), pp. 172–181

    Google Scholar 

  104. F. Mueller, Static cache simulation and its applications. Ph.D. thesis, Florida State University, 1994

    Google Scholar 

  105. F. Mueller, Timing analysis for instruction caches. Real-Time Syst. 18(2/3), 217–247 (2000). doi:10.1023/A:1008145215849. http://dx.doi.org/10.1023/A:1008145215849

    Article  Google Scholar 

  106. C. Ballabriga, H. Casse, Improving the first-miss computation in set-associative instruction caches, in ECRTS (IEEE Computer Society, Washington, DC, 2008), pp. 341–350

    Google Scholar 

  107. C. Cullmann, Cache persistence analysis: a novel approach theory and practice, in LCTES (ACM, New York, NY, 2011), pp. 121–130

    Google Scholar 

  108. C. Ferdinand, R. Wilhelm, On predicting data cache behavior for real-time systems, in Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems, LCTES ’98 (Springer, London, 1998), pp. 16–30

    Google Scholar 

  109. R. Sen, Y.N. Srikant, Wcet estimation for executables in the presence of data caches, in Proceedings of the 7th ACM & IEEE International Conference on Embedded Software, EMSOFT ’07 (ACM, New York, NY, 2007), pp. 203–212

    Book  Google Scholar 

  110. B.K. Huynh, L. Ju, A. Roychoudhury, Scope-aware data cache analysis for wcet estimation, in RTAS (IEEE Computer Society, Washington, DC, 2011), pp. 203–212

    Google Scholar 

  111. D. Hardy, I. Puaut, Wcet analysis of multi-level non-inclusive set-associative instruction caches, in RTSS (IEEE Computer Society, Washington, DC, 2008), pp. 456–466

    Google Scholar 

  112. T. Sondag, H. Rajan, A more precise abstract domain for multi-level caches for tighter wcet analysis, in RTSS (IEEE Computer Society, Washington, DC, 2010), pp. 395–404

    Google Scholar 

  113. Y. Li, V. Suhendra, Y. Liang, T. Mitra, A. Roychoudhury, Timing analysis of concurrent programs running on shared cache multi-cores, in RTSS (IEEE Computer Society, Washington, DC, 2009), pp. 57–67

    Google Scholar 

  114. S. Chattopadhyay, A. Roychoudhury, T. Mitra, Modeling shared cache and bus in multi-cores for timing analysis, in Proceedings of the 13th International Workshop on Software & Compilers for Embedded Systems, SCOPES ’10 (ACM, New York, NY, 2010), pp. 6:1–6:10

    Google Scholar 

  115. J. Staschulat, R. Ernst, Scalable precision cache analysis for real-time software, in ACM Transactions on Embedded Computing Systems, vol. 6, no. 4 (ACM, New York, 2007). doi:10.1145/1274858.1274863. http://doi.acm.org/10.1145/1274858.1274863

    Google Scholar 

  116. S. Altmeyer, C. Maiza, J. Reineke, Resilience analysis: tightening the crpd bound for set-associative caches, in LCTES (ACM, New York, NY, 2010), pp. 153–162

    Google Scholar 

  117. J. Reineke, D. Grund, Sensitivity of cache replacement policies, in ACM Transactions on Embedded Computing Systems, vol. 12 (ACM, New York, 2013), pp. 42:1–42:18. doi:10.1145/2435227.2435238. http://doi.acm.org/10.1145/2435227.2435238

    Google Scholar 

  118. P.P. Puschner, B. Alan, Guest editorial: a review of worst-case execution-time analysis. Real-Time Syst. 18(2/3), 115–128 (2000). http://dblp.uni-trier.de/db/journals/rts/rts18.html#PuschnerB00

    Article  Google Scholar 

  119. F.E. Allen, Control flow analysis, in Proceedings of Symposium on Compiler Optimization (ACM, New York, NY, 1970), pp. 1–19

    Book  Google Scholar 

  120. A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques, and Tools (Addison-Wesley Longman Publishing Co. Inc., Boston, MA, 1986)

    Google Scholar 

  121. J. Gustafsson, A. Betts, A. Ermedahl, B. Lisper, The mälardalen wcet benchmarks: past, present and future, in 10th International Workshop on Worst-Case Execution-Time Analysis, WCET’10, 2010

    Google Scholar 

  122. X. Li, Y. Liang, T. Mitra, A. Roychoudhury, Chronos: a timing analyzer for embedded software. Sci. Comput. Program. 69(1–3), 56–67 (2007). doi:10.1016/j.scico.2007.01.014. http://dx.doi.org/10.1016/j.scico.2007.01.014

    Article  MathSciNet  MATH  Google Scholar 

  123. T. Austin, E. Larson, D. Ernst, Simplescalar: an infrastructure for computer system modeling. Computer 35(2), 59–67 (2002)

    Article  Google Scholar 

  124. M. Lv, CATE: a simulator for cache analysis technique evaluation in WCET estimation (2012). Available from http://faculty.neu.edu.cn/ise/lvmingsong/cate/

    Google Scholar 

  125. M. Berkelaar, lp_solve: (mixed integer) linear programming problem solver (2003). Available from ftp://ftp.es.ele.tue.nl/pub/lp_solve

  126. R. Wilhelm, Why AI + ILP is good for WCET, but MC is not, nor ILP alone, in VMCAI, 2004

    Google Scholar 

  127. E.W. Dijkstra, Chapter I: notes on structured programming, in Structured Programming (Academic, London, 1972), pp. 1–82

    Google Scholar 

  128. M. Berkelaar, lp_solve: a mixed integer linear program solver. Relatorio Tecnico, Eindhoven University of Technology, 1999

    Google Scholar 

  129. M. Bertogna, M. Cirinei, Response-time analysis for globally scheduled symmetric multiprocessor platforms, in Proceedings of the 28th IEEE Real-Time Systems Symposium (RTSS), 2007

    Google Scholar 

  130. E. Bini, T.H.C. Nguyen, P. Richard, S.K. Baruah, A response-time bound in fixed-priority scheduling with arbitrary deadlines. IEEE Trans. Comput. 58(2), 279–286 (2009)

    Article  MathSciNet  Google Scholar 

  131. K. Tindell, H. Hansson, A. Wellings, Analysing realtime communications: controller area network (can), in RTSS, 1994

    Google Scholar 

  132. A. Burns, A. Wellings, Real-Time Systems and Programming Languages, 3rd edn. (Addison-Wesley, Boston, 2001)

    Google Scholar 

  133. L. Lundberg, Multiprocessor scheduling of age constraint processes, in RTCSA, 1998

    Google Scholar 

  134. N. Guan, W. Yi, Z. Gu, Q. Deng, G. Yu, New schedulability test conditions for non-preemptive scheduling on multiprocessor platforms, in RTSS, 2008

    Google Scholar 

  135. T.P. Baker, A comparison of global and partitioned edf schedulability tests for multiprocessors. Technical Report, Department of Computer Science, Florida State University, FL, 2005

    Google Scholar 

  136. M. Bertogna, M. Cirinei, G. Lipari, Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Trans. Parallel Distrib. Syst. 20(4), 553–566 (2008). doi:10.1109/TPDS.2008.129. http://dx.doi.org/10.1109/TPDS.2008.129

    Article  Google Scholar 

  137. K. Jeffay, D.F. Stanat, C.U. Martel, On non-preemptive scheduling of periodic and sporadic tasks, in Proceedings of the 12th IEEE Real-Time Systems Symposium (RTSS), 1991

    Google Scholar 

  138. H. Leontyev, J.H. Anderson, A unified hard/soft real-time schedulability test for global edf multiprocessor scheduling, in Proceedings of the 29th IEEE Real-Time Systems Symposium (RTSS), 2008

    Google Scholar 

  139. J. Goossens, S. Funk, S. Baruah, Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Syst. 25(2–3), 187–205 (2003). doi:10.1023/A:1025120124771. http://dx.doi.org/10.1023/A:1025120124771

    Article  MATH  Google Scholar 

  140. C.A. Phillips, C. Stein, E. Torng, J. Wein, Optimal time-critical scheduling via resource augmentation, in Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC), 1997

    Google Scholar 

  141. S.K. Baruah, S. Chakraborty, Schedulability analysis of non-preemptive recurring real-time tasks, in The 14th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS), 2006

    Google Scholar 

  142. S.K. Baruah, The non-preemptive scheduling of periodic tasks upon multiprocessors. Real-Time Syst. 32(1–2), 9–20 (2006). doi:10.1007/s11241-006-4961-9. http://dx.doi.org/10.1007/s11241-006-4961-9

    Article  MATH  Google Scholar 

  143. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448–461 (1973). doi:10.1016/S0022-0000(73)80033-9. http://dx.doi.org/10.1016/S0022-0000(73)80033-9

    Article  MathSciNet  MATH  Google Scholar 

  144. S.K. Baruah, A. Burns, Sustainable scheduling analysis, in Proceedings of the 27th IEEE Real-Time Systems Symposium (RTSS), 2006

    Google Scholar 

  145. A.K. Mok, W.-C. Poon, Non-preemptive robustness under reduced system load, in Proceedings of the 26th IEEE Real-Time Systems Symposium (RTSS), 2005

    Google Scholar 

  146. R. Ha, J.W.S. Liu, Validating timing constraints in multiprocessor and distributed real-time systems, in Proceedings of the 14th International Conference on Distributed Computing Systems (ICDCS), 1994

    Google Scholar 

  147. T.P. Baker, S. Baruah, Sustainable multiprocessor scheduling of sporadic task systems, in ECRTS, 2009

    Google Scholar 

  148. J. Anderson, A. Srinivasan, Mixed pfair/erfair scheduling of asynchronous periodic tasks J. Comput. Syst. Sci. 68(1), 157–204 (2004). doi:10.1016/j.jcss.2003.08.002. http://dx.doi.org/10.1016/j.jcss.2003.08.002

    Article  MathSciNet  MATH  Google Scholar 

  149. S.K. Baruah, N.K. Cohen, C.G. Plaxton, D.A. Varvel, Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15(6), 600–625 (1996). doi:10.1007/BF01940883. http://dx.doi.org/10.1007/BF01940883

    Article  MathSciNet  MATH  Google Scholar 

  150. U. Devi, J. Anderson, Tardiness bounds for global edf scheduling on a multiprocessor, in IEEE Real-Time Systems Symposium (RTSS), 2005

    Google Scholar 

  151. K. Lakshmanan, R. Rajkumar, J. Lehoczky, Partitioned fixed-priority preemptive scheduling for multi-core processors, in ECRTS, 2009

    Google Scholar 

  152. B. Andersson, E. Tovar, Multiprocessor scheduling with few preemptions, in RTCSA, 2006

    Google Scholar 

  153. B. Andersson, K. Bletsas, Sporadic multiprocessor scheduling with few preemptions, in Euromicro Conference on Real-Time Systems (ECRTS), 2008

    Google Scholar 

  154. S. Kato, N. Yamasaki, Real-time scheduling with task splitting on multiprocessors, in IEEE Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), 2007

    Google Scholar 

  155. S. Kato, N. Yamasaki, Y. Ishikawa, Semi-partitioned scheduling of sporadic task systems on multiprocessors, in ECRTS, 2009

    Google Scholar 

  156. S. Kato,N. Yamasaki, Portioned static-priority scheduling on multiprocessors, in IPDPS, 2008

    Google Scholar 

  157. S. Kato, N. Yamasaki, Semi-partitioned fixed-priority scheduling on multiprocessors, in RTAS, 2009

    Google Scholar 

  158. J.W.S. Liu, Real-Time Systems (Prentice Hall, Upper Saddle River, 2000)

    Google Scholar 

  159. J.P. Lehoczky, L. Sha, Y. Ding, The rate monotonic scheduling algorithm: exact characterization and average case behavior, in RTSS, 1989

    Google Scholar 

  160. T. Baker, An analysis of EDF schedulability on a multiprocessor. IEEE Trans. Parallel Distrib. Syst. 16(8), 760–768 (2005). doi:10.1109/TPDS.2005.88. http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.88

    Article  Google Scholar 

  161. H. Cho, B. Ravindran, E. Jensen, An optimal realtime scheduling algorithm for multiprocessors, in RTSS, 2006

    Google Scholar 

  162. K. Funaoka et al., Work-conserving optimal real-time scheduling on multiprocessors, in ECRTS, 2008

    Google Scholar 

  163. S. Lauzac, R. Melhem, D. Mosse, An efficient rms admission control and its application to multiprocessor scheduling, in IPPS, 1998

    Google Scholar 

  164. D. Chen, A.K. Mok, T.W. Kuo, Utilization bound revisited. IEEE Trans. Comput. 52(3), 351–361 (2003) doi:http://doi.ieeecomputersociety.org/10.1109/TC.2003.1183949

    Google Scholar 

  165. B.K. Bershad, B.J. Chen, D. Lee, T.H. Romer, Avoiding conflict misses dynamically in large direct mapped caches, in ASPLOS, 1994

    Google Scholar 

  166. J. Herter, J. Reineke, R. Wilhelm, Cama: cache-aware memory allocation for wcet analysis, in ECRTS, 2008

    Google Scholar 

  167. J. Rosen, A. Andrei, P. Eles, Z. Peng, Bus access optimization for predictable implementation of real-time applications on multiprocessor systems-on-chip, in RTSS, 2007

    Google Scholar 

  168. A. Fedorova, M. Seltzer, C. Small, D. Nussbaum, Throughput-oriented scheduling on chip multithreading systems. Technical Report, Harvard University, 2005

    Google Scholar 

  169. D. Chandra, F. Guo, S. Kim, Y. Solihin, Predicting inter-thread cache contention on a multi-processor architecture, in HPCA, 2005

    Google Scholar 

  170. J.H. Anderson, J.M. Calandrino, U.C. Devi, Real-time scheduling on multicore platforms, in RTAS, 2006

    Google Scholar 

  171. J.H. Anderson, J.M. Calandrino, Parallel real-time task scheduling on multicore platforms, in RTSS, 2006

    Google Scholar 

  172. J.M. Calandrino, J.H. Anderson, Cache-aware real-time scheduling on multicore platforms: heuristics and a case study, in ECRTS, 2008

    Google Scholar 

  173. K. Danne, M. Platzner, An edf schedulability test for periodic tasks on reconfigurable hardware devices, in LCTES, 2006

    Google Scholar 

  174. N. Guan, Q. Deng, Z. Gu, W. Xu, G. Yu, Schedulability analysis of preemptive and non-preemptive edf on partial runtime-reconfigurable fpgas, in ACM Transaction on Design Automation of Electronic Systems, vol. 13, no. 4 (2008)

    Google Scholar 

  175. N. Fisher, J. Anderson, S. Baruah, Task partitioning upon memory-constrained multiprocessors, in RTCSA, 2005, p. 1

    Google Scholar 

  176. V. Suhendra, C. Raghavan, T. Mitra, Integrated scratchpad memory optimization and task scheduling for mpsoc architectures, in CASES, 2006

    Google Scholar 

  177. H. Salamy, J. Ramanujam, A framework for task scheduling and memory partitioning for multi-processor system-on-chip, in HiPEAC, 2009

    Google Scholar 

  178. A. Wolfe, Software-based cache partitioning for real-time applications. J. Comput. Softw. Eng. 2(3), 315–327 (1994). http://dl.acm.org/citation.cfm?id=200781.200792

    Google Scholar 

  179. S. Dropsho, C. Weems, Comparing caching techniques for multitasking real-time systems. Technical Report, University of Massachusetts-Amherst, 1997

    Google Scholar 

  180. B.D. Bui, M. Caccamo, L. Sha, J. Martinez, Impact of cache partitioning on multi-tasking real time embedded systems, in RTCSA, 2008

    Google Scholar 

  181. D. Chiou, S. Devadas, L. Rudolph, B.S. Ang, Dynamic cache partitioning via columnization. Technical Report, MIT, 1999

    Google Scholar 

  182. D. Tam, R. Azimi, M. Stumm, L. Soares, Managing shared l2 caches on multicore systems in software, WIOSCA, 2007

    Google Scholar 

  183. J. Liedtke, H. Hartig, M. Hohmuth, Os-controlled cache predictability for real-time systems, in RTAS, 1997

    Google Scholar 

  184. N. Guan, M. Stigge, W. Yi, G. Yu, Cache-aware scheduling and analysis for multicores. Technical Report, Uppsala University, (http://user.it.uu.se/yi), 2009

  185. C. Kim, D. Burger, S.W. Keckler, An adaptive, nonuniform cache structure for wiredelay dominated on-chip caches, in ASPLOS, 2002

    Google Scholar 

  186. L. Thiele, S. Chakraborty, M. Naedele, Real-time calculus for scheduling hard real-time systems, in Proceedings of the International Symposium on Circuits and Systems, 2000

    Google Scholar 

  187. J.L. Boudec, P. Thiran, Network calculus – a theory of deterministic queuing systems for the internet, in LNCS 2050 (Springer, Berlin, 2001)

    Google Scholar 

  188. A. Maxiaguine, Y. Zhu, S. Chakraborty, W.-F. Wong, Tuning soc platforms for multimedia processing: identifying limits and tradeoffs, in CODES+ISSS, 2004

    Google Scholar 

  189. J. Bengtsson, W. Yi, Timed automata: semantics, algorithms and tools, in Lectures on Concurrency and Petri Nets, 2003

    Google Scholar 

  190. S. Perathoner, T. Rein, L. Thiele, K. Lampka, J. Rox, Modeling structured event streams in system level performance analysis, in LCTES, 2010

    Google Scholar 

  191. L. Thiele E. Wandeler, Characterizing workload correlations in multi processor hard real-time systems, in RTAS, 2005

    Google Scholar 

  192. L. Thiele, E. Wandeler, N. Stoimenov, Real-time interfaces for composing real-time systems, in EMSOFT, 2006

    Google Scholar 

  193. L.T.X. Phan, S. Chakraborty, P.S. Thiagarajan, A multi-mode real-time calculus, in RTSS, 2008

    Google Scholar 

  194. K. Tindell, J. Clark, Holistic schedulability analysis for distributed hard real-time systems. Microprocess. Microprogram. 40(2–3), 117–134 (1994) doi:10.1016/0165-6074(94)90080-9. http://dx.doi.org/10.1016/0165-6074(94)90080-9

    Article  Google Scholar 

  195. M. Gonzalez Harbour, J.J. Gutierrez Garcia, J.C. Palencia Gutierrez, J.M. Drake Moyano, Mast: modeling and analysis suite for real time applications, in ECRTS (2001)

    Google Scholar 

  196. S. Perathoner, E. Wandeler, L. Thiele, A. Hamann, S. Schliecker, R. Henia, R. Racu, R. Ernst, M. Gonzalez Harbour, Influence of different abstractions on the performance analysis of distributed hard real-time systems. Des. Autom. Embed. Syst. 13(1–2), 27–49 (2009). doi:10.1007/s10617-008-9015-1. http://dx.doi.org/10.1007/s10617-008-9015-1

    Article  Google Scholar 

  197. K. Lampka, S. Perathoner, L. Thiele, Analytic real-time analysis and timed automata: a hybrid method for analyzing embedded real-time systems, in EMSOFT, 2009

    Google Scholar 

  198. M. Moy, K. Altisen, Arrival curves for real-time calculus: the causality problem and its solutions, in TACAS, 2010

    Google Scholar 

  199. S.K. Baruah, D. Chen, S. Gorinsky, A.K. Mok, Generalized multiframe tasks. Real-Time Syst. 17(1), 5–22 (1999). doi:10.1023/A:1008030427220. http://dx.doi.org/10.1023/A:1008030427220

    Article  Google Scholar 

  200. K. Richter, Compositional scheduling analysis using standard event models. Ph.D. thesis, Technical University Carolo-Wilhelmina of Braunschweig, 2005

    Google Scholar 

  201. K. Richter, Compositional scheduling analysis using standard event models. Ph.D. thesis, Technical University of Braunschweig, 2004

    Google Scholar 

  202. V. Pollex, S. Kollmann, F. Slomka, Generalizing response-time analysis, in RTCSA, 2010

    Google Scholar 

  203. L. Thiele et al., A framework for evaluating design tradeoffs in packet processing architectures, in DAC, 2002

    Google Scholar 

  204. A. Easwaran, M. Anand, I. Lee, Compositional analysis framework using edp resource models, in RTSS, 2007

    Google Scholar 

  205. I. Shin, I. Lee, Compositional real-time scheduling framework, in RTSS, 2004

    Google Scholar 

  206. C. Kenna, J. Herman, B. Brandenburg, A. Mills, J. Anderson, Soft real-time on multiprocessors: are analysis-based schedulers really worth it?, in RTSS, 2011

    Google Scholar 

  207. S. Perathoner, EDF scheduling with real time calculus, in Presentation Slides, TEC Group, Computer Engineering and Networks Laboratory, ETH Zurich, 2007

    Google Scholar 

  208. E. Bini, G. Buttazzo, The space of EDF deadlines: the exact region and a convex approximation. Real-Time Syst. 41(1), 27–51 (2009) doi:10.1007/s11241-008-9060-7. http://dx.doi.org/10.1007/s11241-008-9060-7

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    Nan Guan (Assistant Professor)

Authors
  1. Nan Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Guan, N. (2016). Introduction. In: Techniques for Building Timing-Predictable Embedded Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-27198-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27198-9_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27196-5

  • Online ISBN: 978-3-319-27198-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation