메뉴 건너뛰기




Volumn 1685 LNCS, Issue , 1999, Pages 383-390

Array SSA for explicitly parallel programs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EID: 84878637220     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48311-x_50     Document Type: Conference Paper
Times cited : (5)

References (9)
  • 3
    • 0026243790 scopus 로고
    • Efficiently computing static single assignment form and the control dependence graph
    • Oct.
    • R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Prog. Lang. Sys., 13(4): 451-490, Oct. 1991.
    • (1991) ACM Trans. on Prog. Lang. Sys. , vol.13 , Issue.4 , pp. 451-490
    • Cytron, R.1    Ferrante, J.2    Rosen, B.K.3    Wegman, M.N.4    Zadeck, F.K.5
  • 6
    • 0031705047 scopus 로고    scopus 로고
    • Array SSA form and its use in parallelization
    • San Diego, CA, Jan.
    • K. Knobe and V. Sarkar. Array SSA form and its use in parallelization. In ACM Symp. on Prin. of Prog. Lang. (PoPL), pages 107-120, San Diego, CA, Jan. 1998.
    • (1998) ACM Symp. on Prin. of Prog. Lang. (PoPL) , pp. 107-120
    • Knobe, K.1    Sarkar, V.2
  • 7
    • 84878667609 scopus 로고    scopus 로고
    • Concurrent static single assignment form and constant propagation for explicitly parallel programs
    • Aug.
    • J. Lee, S. Midkiff, and D. A. Padua. Concurrent static single assignment form and constant propagation for explicitly parallel programs. In W. on Lang. and Comp. for Par. Comp. (LCPC), Aug. 1997.
    • (1997) W. on Lang. and Comp. for Par. Comp. (LCPC)
    • Lee, J.1    Midkiff, S.2    Padua, D.A.3


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