메뉴 건너뛰기




Volumn 1033, Issue , 1996, Pages 192-208

Fast address sequence generation for data-parallel programs using integer lattices

Author keywords

[No Author keywords available]

Indexed keywords

FORTRAN (PROGRAMMING LANGUAGE); INTEGER PROGRAMMING; PARALLEL PROCESSING SYSTEMS; VECTORS;

EID: 0000606960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014200     Document Type: Conference Paper
Times cited : (10)

References (17)
  • 5
    • 84955603639 scopus 로고
    • North-Holland Mathematical Library, North-Holland, Amsterdam, Second Edition)
    • P. M. Gruber and C. G. Lekkerkerker. Geometry of numbers. North-Holland Mathematical Library Volume 37, North-Holland, Amsterdam, 1987 (Second Edition).
    • (1987) Geometry of Numbers , vol.37
    • Gruber, P.M.1    Lekkerkerker, C.G.2
  • 6
    • 0348018595 scopus 로고
    • On compiling array expressions for efficient execution on distributed-memory machines
    • The Ohio State University, April
    • S K. S. Gupta, S. D. Kaushik, C.-H. Huang, and P. Sadayappan. On compiling array expressions for efficient execution on distributed-memory machines. Technical Report OSU-CISRC-94-TR19, The Ohio State University. April 1994.
    • (1994) Technical Report OSU-CISRC-94-TR19
    • Gupta, S.1    Kaushik, S.D.2    Huang, C.-H.3    Sadayappan, P.4
  • 7
    • 0003193398 scopus 로고
    • High Performance Fortran language specification
    • High Performance Fortran Forum
    • High Performance Fortran Forum. High Performance Fortran language specification. Scientific Programming, 2(1-2): 1-170, 1993.
    • (1993) Scientific Programming , vol.2 , Issue.1-2 , pp. 1-170
  • 10
    • 0011546321 scopus 로고
    • Compile-time generation of communication for scientific programs
    • Nov
    • C. Koelbel. Compile-time generation of communication for scientific programs. In Super-computing 91, pages 101-110, Nov. 1991.
    • (1991) Super-Computing , vol.91 , pp. 101-110
    • Koelbel, C.1
  • 12
    • 0000351960 scopus 로고
    • Non-unimodular transformations of nested loops
    • Nov
    • J. Ramanujam. Non-unimodular transformations of nested loops. In Proc. Supercomputing 92, pages 214-223, Nov. 1992.
    • (1992) Proc. Supercomputing , vol.92 , pp. 214-223
    • Ramanujam, J.1
  • 13
    • 0004155638 scopus 로고
    • Efficient compilation of array statements for private memory multicomput-ers
    • Carnegie-Mellon University, Feb
    • J. M. Stichnoth. Efficient compilation of array statements for private memory multicomput-ers. Technical Report CMU-CS-93-109, Carnegie-Mellon University, Feb. 1993.
    • (1993) Technical Report CMU-CS-93-109
    • Stichnoth, J.M.1
  • 14
    • 0011546022 scopus 로고
    • Code generation and optimization for array statements in HPF
    • Louisiana State University, Nov
    • A. Thirumalai and J. Ramanujam. Code generation and optimization for array statements in HPF. Technical Report ECE-TR-94-11-02, Louisiana State University, Nov. 1994.
    • (1994) Technical Report ECE-TR-94-11-02
    • Thirumalai, A.1    Ramanujam, J.2
  • 15
    • 84955596864 scopus 로고
    • Address sequence generation for data-parallel programs using integer lattices
    • Louisiana State University, Apr
    • A. Thirumalai and J. Ramanujam. Address sequence generation for data-parallel programs using integer lattices. Technical Report ECE-TR-95-04-03, Louisiana State University, Apr. 1995.
    • (1995) Technical Report ECE-TR-95-04-03
    • Thirumalai, A.1    Ramanujam, J.2


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