메뉴 건너뛰기




Volumn , Issue , 2002, Pages 114-123

Low-complexity algorithms for static cache locking in multitasking hard real-time systems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; COMPUTER OPERATING SYSTEMS; MULTITASKING; SCHEDULING;

EID: 0036991624     PISSN: 10528725     EISSN: None     Source Type: Journal    
DOI: 10.1109/REAL.2002.1181567     Document Type: Article
Times cited : (128)

References (19)
  • 6
    • 0033733125 scopus 로고    scopus 로고
    • Worst case execution time analysis for a processor with branch prediction
    • May
    • A. Colin and I. Puaut. Worst case execution time analysis for a processor with branch prediction. Real-Time Systems, 18(2-3):249-274, May 2000.
    • (2000) Real-Time Systems , vol.18 , Issue.2-3 , pp. 249-274
    • Colin, A.1    Puaut, I.2
  • 7
    • 84884687003 scopus 로고    scopus 로고
    • A modular and retargetable framework for tree-based WCET analysis
    • Delft, The Netherlands, June
    • A. Colin and I. Puaut. A modular and retargetable framework for tree-based WCET analysis. In Proc. of the 13th Euromicro Conference on Real-Time Systems, pages 37-44, Delft, The Netherlands, June 2001.
    • (2001) Proc. of the 13th Euromicro Conference on Real-Time Systems , pp. 37-44
    • Colin, A.1    Puaut, I.2
  • 9
    • 0022796618 scopus 로고
    • Finding response times in a real-time system
    • M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390-395, 1986.
    • (1986) The Computer Journal , vol.29 , Issue.5 , pp. 390-395
    • Joseph, M.1    Pandya, P.2
  • 11
    • 0024933416 scopus 로고
    • Smart (strategic memory allocation for real-time) cache design
    • Santa Monica, California, USA, December
    • D. B. Kirk. Smart (strategic memory allocation for real-time) cache design. In Proceedings of the 10th IEEE Real-Time Systems Symposium (RTSS89), pages 229-237, Santa Monica, California, USA, December 1989.
    • (1989) Proceedings of the 10th IEEE Real-Time Systems Symposium (RTSS89) , pp. 229-237
    • Kirk, D.B.1
  • 13
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-time environment
    • January
    • C.L. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, January 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.L.1    Layland, J.2
  • 14
    • 0030414718 scopus 로고    scopus 로고
    • Cache modeling for real-time software: Beyond direct mapped instruction cache
    • IEEE, IEEE Computer Society Press, December
    • Y.-T. S. Li, S. Malik, and A. Wolfe. Cache modeling for real-time software: Beyond direct mapped instruction cache. In Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS96), pages 254-263. IEEE, IEEE Computer Society Press, December 1996.
    • (1996) Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS96) , pp. 254-263
    • Li, Y.-T.S.1    Malik, S.2    Wolfe, A.3
  • 15
    • 0033355604 scopus 로고    scopus 로고
    • An integrated path and timing analysis method based on cycle-level symbolic execution
    • November
    • Thomas Lundqvist and Per Stenstrom. An integrated path and timing analysis method based on cycle-level symbolic execution. Real-Time Systems, 17(2-3):183-207, November 1999.
    • (1999) Real-Time Systems , vol.17 , Issue.2-3 , pp. 183-207
    • Lundqvist, T.1    Stenstrom, P.2
  • 16
    • 0033732401 scopus 로고    scopus 로고
    • Timing analysis for instruction caches
    • May
    • F. Mueller. Timing analysis for instruction caches. Real-Time Systems, 18(2):217-247, May 2000.
    • (2000) Real-Time Systems , vol.18 , Issue.2 , pp. 217-247
    • Mueller, F.1
  • 17
    • 0013225410 scopus 로고    scopus 로고
    • A review of worstcase execution-time analysis
    • May; Guest Editorial
    • P. Puschner and A. Burns. A review of worstcase execution-time analysis. Real-Time Systems, 18(2-3):115-128, May 2000. Guest Editorial.
    • (2000) Real-Time Systems , vol.18 , Issue.2-3 , pp. 115-128
    • Puschner, P.1    Burns, A.2
  • 18
    • 0027646104 scopus 로고
    • A dynamic programming algorithm for cache/memory partitioning for real-time systems
    • August
    • John E. Sasinowski and Jay K. Strosnider. A dynamic programming algorithm for cache/memory partitioning for real-time systems. IEEE Transactions on Computers, 42(8):997-1001, August 1993.
    • (1993) IEEE Transactions on Computers , vol.42 , Issue.8 , pp. 997-1001
    • Sasinowski, J.E.1    Strosnider, J.K.2
  • 19
    • 0028396945 scopus 로고
    • An extendible approach for analysing fixed priority hard real-time tasks
    • March
    • K. Tindell, A. Burns, and A. Wellings. An extendible approach for analysing fixed priority hard real-time tasks. Real-Time Systems, 6(1):133-151, March 1994.
    • (1994) Real-Time Systems , vol.6 , Issue.1 , pp. 133-151
    • Tindell, K.1    Burns, A.2    Wellings, A.3


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