메뉴 건너뛰기




Volumn , Issue , 1998, Pages 146-153

Facilitating worst-case execution times analysis for optimized code

Author keywords

[No Author keywords available]

Indexed keywords

COMPILER TRANSFORMATIONS; COTRANSFORMATION; EXECUTION INFORMATIONS; KEEP TRACK OF; OPTIMIZING COMPILERS; PROGRAM EXECUTION; WORST-CASE EXECUTION TIME; WORST-CASE EXECUTION TIME ANALYSIS;

EID: 84884699143     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMWRTS.1998.685079     Document Type: Conference Paper
Times cited : (31)

References (23)
  • 4
    • 0027870803 scopus 로고
    • Isolation and analysis of optimization errors
    • PLDI 1993, ACM SIGPLAN, ACM Press, June
    • M. R. Boyd and D. B. Whalley. Isolation and analysis of optimization errors. In PLDI 1993, volume 28 of ACM SIGPLAN Notices, pages 26-35. ACM SIGPLAN, ACM Press, June 1993.
    • (1993) ACM SIGPLAN Notices , vol.28 , pp. 26-35
    • Boyd, M.R.1    Whalley, D.B.2
  • 7
  • 8
    • 0007477602 scopus 로고    scopus 로고
    • Master's thesis, Department of Computer Systems, Uppsala University, Sept. DoCS MSc Thesis 97/94
    • J. Engblom. Worst-case execution time analysis for optimized code. Master's thesis, Department of Computer Systems, Uppsala University, Sept. 1997. DoCS MSc Thesis 97/94.
    • (1997) Worst-case Execution Time Analysis for Optimized Code
    • Engblom, J.1
  • 9
    • 84882696607 scopus 로고    scopus 로고
    • Deriving annotations for tight calculation of execution time
    • Proceedings of EuroPar 97, Springer Verlag, Aug.
    • A. Ermedahl and J. Gustafsson. Deriving annotations for tight calculation of execution time. In Proceedings of EuroPar 97, LNCS (Lecture Notes in Computer Science) 1300. Springer Verlag, Aug. 1997.
    • (1997) LNCS (Lecture Notes in Computer Science) , vol.1300
    • Ermedahl, A.1    Gustafsson, J.2
  • 12
    • 0028501199 scopus 로고
    • A retargetable technique for predicting execution time of code segments
    • Sept.
    • M. G. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time of code segments. Real-Time Systems, pages 159-182, Sept. 1994.
    • (1994) Real-Time Systems , pp. 159-182
    • Harmon, M.G.1    Baker, T.P.2    Whalley, D.B.3
  • 14
    • 0030378261 scopus 로고    scopus 로고
    • Safe and efficient elimination of infeasible execution paths in WCET estimation
    • IEEE, IEEE Computer Society Press
    • A. A. Kountouris. Safe and efficient elimination of infeasible execution paths in WCET estimation. In Proceedings of RTCSA'96. IEEE, IEEE Computer Society Press, 1996.
    • (1996) Proceedings of RTCSA'96
    • Kountouris, A.A.1
  • 16
    • 0030414718 scopus 로고    scopus 로고
    • Cache modelling for real-time software: Beyond direct mapped instruction caches
    • IEEE Computer Society Press, Dec.
    • Y.-T. S. Li, S. Malik, and A. Wolfe. Cache modelling for real-time software: Beyond direct mapped instruction caches. In Proceedings of the 17th IEEE Real-Time Systems Symposium, pages 254-263. IEEE Computer Society Press, Dec. 1996.
    • (1996) Proceedings of the 17th IEEE Real-Time Systems Symposium , pp. 254-263
    • Li, Y.-T.S.1    Malik, S.2    Wolfe, A.3
  • 19
    • 0027556297 scopus 로고
    • Predicting program execution times by analyzing static and dynamic program paths
    • Mar.
    • C. Y. Park. Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems, 5(1):31-62, Mar. 1993.
    • (1993) Real-Time Systems , vol.5 , Issue.1 , pp. 31-62
    • Park, C.Y.1


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