메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 49-56

Cache contents selection for statically-locked instruction caches: An algorithm comparison

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; DATA STORAGE EQUIPMENT; GENETIC ALGORITHMS; PROGRAM PROCESSORS; REAL TIME SYSTEMS;

EID: 33749047044     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2005.34     Document Type: Conference Paper
Times cited : (27)

References (19)
  • 4
    • 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
  • 5
    • 0024933416 scopus 로고
    • Smart (strategic memory allocation for real-time) cache design
    • Santa Monica, California, USA, Dec.
    • 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, Dec. 1989.
    • (1989) Proceedings of the 10th IEEE Real-time Systems Symposium (RTSS89) , pp. 229-237
    • Kirk, D.B.1
  • 7
    • 0020271514 scopus 로고
    • On the complexity of fixed priority scheduling of periodic real-time tasks
    • J. Leung and J. Whitehead. On the complexity of fixed priority scheduling of periodic real-time tasks. Performance Evaluation, 2(4):237-250, 1982.
    • (1982) Performance Evaluation , vol.2 , Issue.4 , pp. 237-250
    • Leung, J.1    Whitehead, J.2
  • 8
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-time environment
    • Jan.
    • C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, Jan. 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.1    Layland, J.2
  • 11
    • 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
  • 13
    • 33749074259 scopus 로고    scopus 로고
    • Performance analysis of static cache locking in hard real-time multitasking systems
    • IRISA, Oct.
    • I. Puaut, A. Arnaud, and D. Decotigny. Performance analysis of static cache locking in hard real-time multitasking systems. Technical Report 1568, IRISA, Oct. 2003.
    • (2003) Technical Report , vol.1568
    • Puaut, I.1    Arnaud, A.2    Decotigny, D.3
  • 14
    • 0036991624 scopus 로고    scopus 로고
    • Low-complexity algorithms for static cache locking in multitasking hard real-time systems
    • Austin, Texas, Dec.
    • I. Puaut and D. Decotigny. Low-complexity algorithms for static cache locking in multitasking hard real-time systems. In Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS02), pages 114-123, Austin, Texas, Dec. 2002.
    • (2002) Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS02) , pp. 114-123
    • Puaut, I.1    Decotigny, D.2
  • 15
    • 0000039023 scopus 로고
    • Calculating the maximum execution time of real-time programs
    • Sept.
    • P. Puschner and C. Koza. Calculating the maximum execution time of real-time programs. Real-Time Systems, 1(2): 159-176, Sept. 1989.
    • (1989) Real-time Systems , vol.1 , Issue.2 , pp. 159-176
    • Puschner, P.1    Koza, C.2
  • 16
    • 0024683086 scopus 로고
    • Reasoning about time in higher-level langage software
    • July
    • A. C. Shaw. Reasoning about time in higher-level langage software. IEEE Transactions on Software Engineering, 15(7):875-889, July 1989.
    • (1989) IEEE Transactions on Software Engineering , vol.15 , Issue.7 , pp. 875-889
    • Shaw, A.C.1
  • 18
    • 0028396945 scopus 로고
    • An extendible approach for analysing fixed priority hard real-time tasks
    • Mar
    • 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, Mar, 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가 분석하여 추출한 것입니다.