메뉴 건너뛰기




Volumn , Issue , 1996, Pages 230-240

Efficient worst case timing analysis of data caching

Author keywords

[No Author keywords available]

Indexed keywords

ACCURATE TIMING; ARRAY AND POINTER; BENCHMARK PROGRAMS; CONSERVATIVE APPROACHES; CURRENT ANALYSIS; DATA DEPENDENCE ANALYSIS; MEMORY LOCATIONS; WORST-CASE EXECUTION TIME;

EID: 0029720110     PISSN: 10801812     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTTAS.1996.509540     Document Type: Conference Paper
Times cited : (64)

References (17)
  • 1
    • 84884307257 scopus 로고
    • Compilers principles, techniques, and tools addison-wesley publishing company
    • MA
    • A. V. Aho, R. Sethi, and J. D. Ullman. Compilers Principles, Techniques, and Tools. Addison-Wesley Publishing Company, Reading. MA, 1988.
    • (1988) Reading
    • Aho, A.V.1    Sethi, R.2    Ullman, J.D.3
  • 9
    • 0001391363 scopus 로고
    • A characterization of the minimum cycle mean in a digraph
    • R. M. Karp. A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics, 23:309-311, 1978.
    • (1978) Discrete Mathematics , vol.23 , pp. 309-311
    • Karp, R.M.1
  • 12
    • 84884324427 scopus 로고
    • An introduction to formal languages and automata
    • Lexington, MA
    • P. Linz. An Introduction to Formal Languages and Automata. D. C. Heath and Company, Lexington, MA, 1990.
    • (1990) D. C. Heath and Company
    • Linz, P.1
  • 13
    • 84882583100 scopus 로고
    • Deterministic upperbounds of the worst-case execution times of cached programs
    • J.-C. Liu and H.-J. Lee. Deterministic Upperbounds of the Worst-case Execution Times of Cached Programs. In Proceedings of the 15th Real-Time Systems Symposium, pages 182-191, 1994.
    • (1994) Proceedings of the 15th Real-Time Systems Symposium , pp. 182-191
    • Liu, J.-C.1    Lee, H.-J.2
  • 15
    • 0027556297 scopus 로고
    • Predicting program execution times by analyzing static and dynamic program paths
    • March
    • C. Y. Park. Predicting Program Execution Times by Analyzing Static and Dynamic Program Paths. Journal of Real-Time Systems, 5(1):31-62, March 1993.
    • (1993) Journal of Real-Time Systems , vol.5 , Issue.1 , pp. 31-62
    • Park, C.Y.1
  • 16
    • 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. Journal of Real-Time Systems, l(2): 159-176, Sept. 1989
    • (1989) Journal of Real-Time Systems , vol.1 , Issue.2 , pp. 159-176
    • Puschner, P.1    Koza, C.2
  • 17
    • 0024683086 scopus 로고
    • Reasoning about time in higher-level language software
    • July
    • A. C. Shaw. Reasoning About Time in Higher-Level Language Software. IEEE Transactions On SofhYare Engineering, 15(7):875-889, July 1989.
    • (1989) IEEE Transactions on SofhYare Engineering , vol.15 , Issue.7 , pp. 875-889
    • Shaw, A.C.1


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