메뉴 건너뛰기




Volumn 13, Issue 4 SPEC. ISSUE, 2014, Pages

Explicit reservation of cache memory in a predictable, preemptive multitasking real-time system

Author keywords

Cache related preemption delay; Fixed priority scheduling; Real time systems; Schedulability analysis

Indexed keywords

CACHE MEMORY; MULTITASKING; INTERACTIVE COMPUTER SYSTEMS; REAL TIME SYSTEMS;

EID: 84905965378     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/2523070     Document Type: Article
Times cited : (10)

References (39)
  • 1
    • 84856527978 scopus 로고    scopus 로고
    • Cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
    • IEEE Computer Society, Los Alamitos, CA
    • Sebastian Altmeyer, Robert Davis, and Claire Maiza. 2011. Cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. In Proceedings of the IEEE 32nd Real-Time Systems Symposium (RTSS'11). IEEE Computer Society, Los Alamitos, CA, 261-271.
    • (2011) Proceedings of the IEEE 32nd Real-Time Systems Symposium (RTSS'11) , pp. 261-271
    • Altmeyer, S.1    Davis, R.2    Maiza, C.3
  • 2
    • 84865315116 scopus 로고    scopus 로고
    • Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
    • Sebastian Altmeyer, Robert I. Davis, and Claire Maiza. 2012. Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. Real-Time Syst. 48, 499-526.
    • (2012) Real-Time Syst. , vol.48 , pp. 499-526
    • Altmeyer, S.1    Davis, R.I.2    Maiza, C.3
  • 3
    • 79960214257 scopus 로고    scopus 로고
    • Cache-related preemption delay via useful cache blocks: Survey and redefinition
    • Sebastian Altmeyer and ClaireMaiza. 2010. Cache-related preemption delay via useful cache blocks: Survey and redefinition. J. Syst. Arch. 57, 707-719.
    • (2010) J. Syst. Arch. , vol.57 , pp. 707-719
    • Altmeyer, S.1    Maiza, C.2
  • 5
    • 0000703331 scopus 로고
    • Applying new scheduling theory to static priority pre-emptive scheduling
    • N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings. 1993. Applying new scheduling theory to static priority pre-emptive scheduling. Softw. Engin. J. 8, 5, 284-292.
    • (1993) Softw. Engin. J. , vol.8 , Issue.5 , pp. 284-292
    • Audsley, N.1    Burns, A.2    Richardson, M.3    Tindell, K.4    Wellings, A.5
  • 6
    • 0026118563 scopus 로고
    • Stack-based scheduling of real-time processes
    • T. P. Baker. 1991. Stack-based scheduling of real-time processes. Real-Time Syst. 3, 1, 67-100.
    • (1991) Real-Time Syst. , vol.3 , Issue.1 , pp. 67-100
    • Baker, T.P.1
  • 7
    • 24944507809 scopus 로고    scopus 로고
    • Measuring the performance of schedulability tests
    • Enrico Bini and Giorgio C. Buttazzo. 2005. Measuring the performance of schedulability tests. Real-Time Syst. 30, 1-2, 129-154.
    • (2005) Real-Time Syst. , vol.30 , Issue.1-2 , pp. 129-154
    • Bini, E.1    Buttazzo, G.C.2
  • 9
    • 67649920936 scopus 로고    scopus 로고
    • Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
    • Reinder J. Bril, Johan J. Lukkien, and Wim F. Verhaegh. 2009.Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real-Time Syst. 42, 1-3, 63-119.
    • (2009) Real-Time Syst , vol.42 , Issue.1-3 , pp. 63-119
    • Bril, R.J.1    Lukkien, J.J.2    Verhaegh, W.F.3
  • 14
    • 33846861495 scopus 로고    scopus 로고
    • Controller area network (can) schedulability analysis: Refuted, revisited and revised
    • Robert Davis, Alan Burns, Reinder J. Bril, and Johan J. Lukkien. 2007. Controller area network (can) schedulability analysis: Refuted, revisited and revised. Real-Time Syst. 35, 3, 239-272.
    • (2007) Real-Time Syst. , vol.35 , Issue.3 , pp. 239-272
    • Davis, R.1    Burns, A.2    Bril, R.J.3    Lukkien, J.J.4
  • 15
    • 49149111959 scopus 로고    scopus 로고
    • Efficient exact schedulability tests for fixed priority real-time systems
    • R. Davis, A. Zabos, and A. Burns. 2008. Efficient exact schedulability tests for fixed priority real-time systems. IEEE Trans. Comput. 57, 9, 1261-1276.
    • (2008) IEEE Trans. Comput. , vol.57 , Issue.9 , pp. 1261-1276
    • Davis, R.1    Zabos, A.2    Burns, A.3
  • 19
    • 6944231166 scopus 로고    scopus 로고
    • The influence of processor architecture on the design and the results of WCET tools
    • Reinhold Heckmann, Marc Langenbach, Stephan Thesing, and Reinhard Wilhelm. 2003. The influence of processor architecture on the design and the results of WCET tools. Proc. IEEE 91, 7, 1038-1054.
    • (2003) Proc. IEEE , vol.91 , Issue.7 , pp. 1038-1054
    • Heckmann, R.1    Langenbach, M.2    Thesing, S.3    Wilhelm, R.4
  • 22
    • 0024173488 scopus 로고
    • A Case for direct-mapped caches
    • Mark D. Hill. 1988. A Case for direct-mapped caches. Computer 21, 12, 25-40.
    • (1988) Computer , vol.21 , Issue.12 , pp. 25-40
    • Hill, M.D.1
  • 23
    • 0024903997 scopus 로고
    • Evaluating associativity in CPU caches
    • M. D. Hill and A. J. Smith. 1989. Evaluating associativity in CPU caches. IEEE Trans. Comput. 38, 12, 1612-1630.
    • (1989) IEEE Trans. Comput. , vol.38 , Issue.12 , pp. 1612-1630
    • Hill, M.D.1    Smith, A.J.2
  • 25
    • 0000940792 scopus 로고    scopus 로고
    • Analysis of cache-related preemption delay in fixed-priority preemptive scheduling
    • Chang-Gun Lee, Joosun Hahn, Yang-Min Seo, Sang Lyul Min, Rhan Ha, Seongsoo Hong, Chang Yun Park, Minsuk Lee, and Chong Sang Kim. 1998. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Trans. Comput. 47, 6, 700-713.
    • (1998) IEEE Trans. Comput. , vol.47 , Issue.6 , pp. 700-713
    • Lee, C.-G.1    Hahn, J.2    Seo, Y.-M.3    Min, S.L.4    Ha, R.5    Hong, S.6    Park, C.Y.7    Lee, M.8    Kim, C.S.9
  • 26
    • 84861792435 scopus 로고    scopus 로고
    • Instruction cache locking for multi-task real-time embedded systems
    • Tiantian Liu, Minming Li, and Chun Jason Xue. 2012. Instruction cache locking for multi-task real-time embedded systems. Real-Time Syst. 48, 2, 166-197.
    • (2012) Real-Time Syst. , vol.48 , Issue.2 , pp. 166-197
    • Liu, T.1    Li, M.2    Xue, C.J.3
  • 30
  • 31
    • 70349518439 scopus 로고    scopus 로고
    • Timing analysis for preemptive multitasking real-time systems with caches
    • Yudong Tan and VincentMooney. 2007. Timing analysis for preemptive multitasking real-time systems with caches. ACM Trans. Embed. Comput. Syst. 6, 1.
    • (2007) ACM Trans. Embed. Comput. Syst. , vol.6 , pp. 1
    • Tan, Y.1    Mooney, V.2
  • 32
    • 0028396945 scopus 로고
    • An extendible approach for analyzing fixed priority hard real-time tasks
    • K. W. Tindell, A. Burns, and A. J. Wellings. 1994. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Syst. 6, 2, 133-151.
    • (1994) Real-Time Syst. , vol.6 , Issue.2 , pp. 133-151
    • Tindell, K.W.1    Burns, A.2    Wellings, A.J.3
  • 33
    • 0001733337 scopus 로고    scopus 로고
    • CPU cache prefetching: Timing evaluation of hardware implementations
    • John Tse and Alan Jay Smith. 1998. CPUcache prefetching: Timing evaluation of hardware implementations. IEEE Trans. Comput. 47, 5, 509-526.
    • (1998) IEEE Trans. Comput. , vol.47 , Issue.5 , pp. 509-526
    • Tse, J.1    Smith, A.J.2
  • 34
    • 38349171771 scopus 로고    scopus 로고
    • Data cache locking for tight timing calculations
    • Xavier Vera, Björn Lisper, and Jingling Xue. 2007. Data cache locking for tight timing calculations. Trans. Embed. Comput. Syst. 7, 1, 1-38.
    • (2007) Trans. Embed. Comput. Syst. , vol.7 , Issue.1 , pp. 1-38
    • Vera, X.1    Lisper, B.2    Xue, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.