메뉴 건너뛰기




Volumn 36, Issue 7, 2001, Pages 103-112

Blocking and array contraction across arbitrarily nested loops using affine partitioning

Author keywords

[No Author keywords available]

Indexed keywords


EID: 17644395320     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/568014.379586     Document Type: Article
Times cited : (24)

References (24)
  • 4
    • 0028743437 scopus 로고
    • Compiler transformations for high-performance computing
    • December
    • D. Bacon, S. Graham, and O. Sharp. Compiler transformations for high-performance computing. Computing Surveys, 26(4):345-420, December 1994.
    • (1994) Computing Surveys , vol.26 , Issue.4 , pp. 345-420
    • Bacon, D.1    Graham, S.2    Sharp, O.3
  • 7
    • 0026933251 scopus 로고
    • Some efficient solutions to the affine scheduling problem, part I, one dimensional time
    • October
    • P. Feautrier. Some efficient solutions to the affine scheduling problem, part I, one dimensional time. International Journal of Parallel Programming, 21(5):313-348, October 1992.
    • (1992) International Journal of Parallel Programming , vol.21 , Issue.5 , pp. 313-348
    • Feautrier, P.1
  • 10
    • 0344047770 scopus 로고
    • Solution of the Euler equations by a multigrid method
    • A. Jameson. Solution of the Euler equations by a multigrid method. Applied Mathematics and Computation, 13:327-356, 1983.
    • (1983) Applied Mathematics and Computation , vol.13 , pp. 327-356
    • Jameson, A.1
  • 18
    • 0032067773 scopus 로고    scopus 로고
    • Maximizing parallelism and minimizing synchronization with affine partitions
    • May
    • A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing, 24(3-4):445-475, May 1998.
    • (1998) Parallel Computing , vol.24 , Issue.3-4 , pp. 445-475
    • Lim, A.W.1    Lam, M.S.2


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