메뉴 건너뛰기




Volumn 34, Issue 5, 1999, Pages 139-149

Enhanced code compression for embedded RISC processors

Author keywords

[No Author keywords available]

Indexed keywords


EID: 17244378935     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/301631.301655     Document Type: Article
Times cited : (12)

References (23)
  • 4
    • 0347467728 scopus 로고
    • Technical Report CRPC-TR95637-S, Center for Research on Parallel Computation, Rice University, October
    • K. Cooper and T. Simpson. Value-driven code motion. Technical Report CRPC-TR95637-S, Center for Research on Parallel Computation, Rice University, October 1995.
    • (1995) Value-driven Code Motion
    • Cooper, K.1    Simpson, T.2
  • 5
    • 0344075634 scopus 로고
    • Technical Report CRPC-TR95637-S, Center for Research on Parallel Computation, Rice University, October
    • K. Cooper, T. Simpson, and C. Vick. Operator strength reduction. Technical Report CRPC-TR95637-S, Center for Research on Parallel Computation, Rice University, October 1995.
    • (1995) Operator Strength Reduction
    • Cooper, K.1    Simpson, T.2    Vick, C.3
  • 9
    • 84976747050 scopus 로고
    • Analyzing and compressing assembly code
    • June
    • C. W. Fraser, E. W. Myers, and A. L. Wendt. Analyzing and compressing assembly code. SIGPLAN Notices, 19(6):117-121, June 1984.
    • (1984) SIGPLAN Notices , vol.19 , Issue.6 , pp. 117-121
    • Fraser, C.W.1    Myers, E.W.2    Wendt, A.L.3
  • 10
    • 85034558453 scopus 로고
    • Global dead computation elimination
    • Courant Institute of Mathematical Sciences, New York University, August
    • K. Kennedy. Global dead computation elimination. SETL Newsletter 111, Courant Institute of Mathematical Sciences, New York University, August 1973.
    • (1973) SETL Newsletter , vol.111
    • Kennedy, K.1
  • 16
    • 0019084292 scopus 로고
    • Compilation to compact code
    • November
    • B. Marks. Compilation to compact code. IBM Journal of Research and Development, 24(6):684-691, November 1980.
    • (1980) IBM Journal of Research and Development , vol.24 , Issue.6 , pp. 684-691
    • Marks, B.1
  • 18
    • 0016942292 scopus 로고
    • A space-economical suffix tree construction algorithm
    • April
    • E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, April 1976.
    • (1976) Journal of the ACM , vol.23 , Issue.2 , pp. 262-272
    • McCreight, E.M.1
  • 19
    • 84976695665 scopus 로고
    • Assembling code for machines with span-dependent instructions
    • April
    • T. G. Szymanski. Assembling code for machines with span-dependent instructions. Communications of the ACM, 21(4):300-308, April 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.4 , pp. 300-308
    • Szymanski, T.G.1
  • 20
    • 0001704377 scopus 로고
    • On-line construction of suffix trees
    • September
    • E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, September 1995.
    • (1995) Algorithmica , vol.14 , pp. 249-260
    • Ukkonen, E.1


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