메뉴 건너뛰기




Volumn 25, Issue 13, 1999, Pages 1785-1825

Compiling High Performance Fortran for distributed-memory architectures

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER ARCHITECTURE; COMPUTER SYSTEMS PROGRAMMING; DATA ACQUISITION; DATA REDUCTION; DATA STORAGE EQUIPMENT; FORTRAN (PROGRAMMING LANGUAGE); PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS);

EID: 0033285824     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00074-5     Document Type: Article
Times cited : (15)

References (76)
  • 1
    • 33746696661 scopus 로고    scopus 로고
    • High performance fortran compilation techniques for parallelizing scientific codes
    • Orlando Florida, USA, 7-13 November, 1998, ACM Press, New york and IEEE Computer Society Press, London
    • V.S. Adve. High performance fortran compilation techniques for parallelizing scientific codes. in: Proceedings of the 1998 ACM/IEEE SC98 Conference, 1998. Orlando Florida, USA, 7-13 November, 1998, ACM Press, New york and IEEE Computer Society Press, London, 1998.
    • (1998) Proceedings of the 1998 ACM/IEEE SC98 Conference, 1998
    • Adve, V.S.1
  • 9
    • 0343232942 scopus 로고    scopus 로고
    • High-level management of communication schedules in HPF-like languages
    • ICASE, Hampton, VA, September 1997. Also available as Technical Report, TR 97-5, Institute for Software Technology and Parallel Systems, University of Vienna, April
    • S. Benkner, P. Mehrotra, J. Van Rosendale, H.P. Zima, High-level management of communication schedules in HPF-like languages, NASA Contractor Report 201740, ICASE, Hampton, VA, September 1997. Also available as Technical Report, TR 97-5, Institute for Software Technology and Parallel Systems, University of Vienna, April 1997.
    • (1997) NASA Contractor Report 201740
    • Benkner, S.1    Mehrotra, P.2    Van Rosendale, J.3    Zima, H.P.4
  • 10
    • 0005271118 scopus 로고
    • Ph.D. thesis, Technical Report TR 94-8, University of Vienna, Institute of Software Technology and Parallel Systems, November
    • S. Benkner, Vienna Fortran 90 and its Compilation, Ph.D. thesis, Technical Report TR 94-8, University of Vienna, Institute of Software Technology and Parallel Systems, November 1994.
    • (1994) Vienna Fortran 90 and Its Compilation
    • Benkner, S.1
  • 11
    • 0003138853 scopus 로고    scopus 로고
    • VFC: The Vienna Fortran Compiler
    • Winter (to appear)
    • S. Benkner, VFC: The Vienna Fortran Compiler, Scientific Programming, Winter 1998 (to appear).
    • (1998) Scientific Programming
    • Benkner, S.1
  • 12
    • 0032635832 scopus 로고    scopus 로고
    • HPF+: High Performance Fortran for Advanced Scientific and Engineering Applications
    • Elsevier, Amsterdam, to appear
    • S. Benkner, HPF+: High Performance Fortran for Advanced Scientific and Engineering Applications, Future Generation Computer Systems, Elsevier, Amsterdam, 1999 (to appear).
    • (1999) Future Generation Computer Systems
    • Benkner, S.1
  • 13
    • 84973787739 scopus 로고
    • Evaluating array expressions on massively parallel machines with communication/computation overlap
    • V. Bouchitte, P. Boulet, A. Darte, Y. Robert, Evaluating array expressions on massively parallel machines with communication/computation overlap, in: Proceedings CONPAR 94-VAPP VI, 713-724, 1994.
    • (1994) Proceedings CONPAR 94-VAPP VI , pp. 713-724
    • Bouchitte, V.1    Boulet, P.2    Darte, A.3    Robert, Y.4
  • 17
    • 0342862804 scopus 로고    scopus 로고
    • A Tracing Protocol for Optimizing Data Parallel Irregular Computations
    • T. Brandes, C. Germain, A Tracing Protocol for Optimizing Data Parallel Irregular Computations, Lecture Notes in Computer Science, Vol. 1470, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1470
    • Brandes, T.1    Germain, C.2
  • 22
    • 0005870108 scopus 로고    scopus 로고
    • Enhancing OpenMP with Features for Locality Control
    • Institute for Software Technology and Parallel Systems, University of Vienna
    • B. Chapman, P. Mehrotra, H. Zima, Enhancing OpenMP with Features for Locality Control, Technical Report, Institute for Software Technology and Parallel Systems, University of Vienna, 1999.
    • (1999) Technical Report
    • Chapman, B.1    Mehrotra, P.2    Zima, H.3
  • 29
    • 85031674616 scopus 로고    scopus 로고
    • Optimizing Communication in SUPERB
    • Proc. Conpar 90-VAPP IV
    • H.M. Gerndt, H.P. Zima, Optimizing Communication in SUPERB, Proc. Conpar 90-VAPP IV, Lecture Notes in Computer Science, 457, pp. 300-311.
    • Lecture Notes in Computer Science , vol.457 , pp. 300-311
    • Gerndt, H.M.1    Zima, H.P.2
  • 30
  • 32
    • 0030190221 scopus 로고    scopus 로고
    • A unified framework for optimizing communication in data-parallel programs
    • M. Gupta, E. Schonberg, H. Srinivasan, A unified framework for optimizing communication in data-parallel programs, IEEE Trans. Parallel Distributed Sys. 7 (7) (1996) 689-704.
    • (1996) IEEE Trans. Parallel Distributed Sys. , vol.7 , Issue.7 , pp. 689-704
    • Gupta, M.1    Schonberg, E.2    Srinivasan, H.3
  • 37
    • 0003487726 scopus 로고
    • High Performance Fortran Forum, High Performance Fortran Language Specification Version 1.0
    • Rice University, Houston, TX, 3 May
    • High Performance Fortran Forum, High Performance Fortran Language Specification Version 1.0., Technical Report, Rice University, Houston, TX, 3 May, 1993.
    • (1993) Technical Report
  • 38
    • 0003565855 scopus 로고    scopus 로고
    • High Performance Fortran Forum, High Performance FORTRAN Language Specification, Version 2.0
    • Rice University, Houston, TX, January
    • High Performance Fortran Forum, High Performance FORTRAN Language Specification, Version 2.0, Technical Report, Rice University, Houston, TX, January 1997.
    • (1997) Technical Report
  • 39
    • 84976813879 scopus 로고
    • Compiling fortran D for MIMD distributed-memory machines
    • S. Hiranandani, K. Kennedy, C. Tseng, Compiling fortran D for MIMD distributed-memory machines, Communications of the ACM 35 (8) (1992) 66-80.
    • (1992) Communications of the ACM , vol.35 , Issue.8 , pp. 66-80
    • Hiranandani, S.1    Kennedy, K.2    Tseng, C.3
  • 41
    • 85031528969 scopus 로고    scopus 로고
    • Japan Association of High Performance Fortran, http://www.tokyo.rist.or.jp shunchan/index-e.html.
  • 43
    • 0030295731 scopus 로고    scopus 로고
    • Efficient index set generation for compiling HPF array statements on distributed-memory machines
    • S.D. Kaushik, C.-H. Huang, P. Sadayappan, Efficient index set generation for compiling HPF array statements on distributed-memory machines, J. Parallel Distributed Comput. 38 (2) (1996) 237-247.
    • (1996) J. Parallel Distributed Comput. , vol.38 , Issue.2 , pp. 237-247
    • Kaushik, S.D.1    Huang, C.-H.2    Sadayappan, P.3
  • 44
    • 0032108102 scopus 로고    scopus 로고
    • Automatic data layout for distributed-memory machines
    • K. Kennedy, U. Kremer, Automatic data layout for distributed-memory machines, ACM Trans. Programming Languages Syst. 20 (4) (1998) 869-916.
    • (1998) ACM Trans. Programming Languages Syst. , vol.20 , Issue.4 , pp. 869-916
    • Kennedy, K.1    Kremer, U.2
  • 45
    • 84976831884 scopus 로고
    • A linear-time algorithm for computing the memory access sequence in data-parallel programs
    • Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Santa Barbara, CA, 19-21 July, 1995, No. 8, ACM, New York
    • K. Kennedy, N. Nedeljkovic, A. Sethi, A linear-time algorithm for computing the memory access sequence in data-parallel programs, in: Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Santa Barbara, CA, 19-21 July, 1995, ACM SIGPLAN Notices, Vol. 30(8), No. 8, ACM, New York, 1995, pp. 102-111.
    • (1995) ACM SIGPLAN Notices , vol.30 , Issue.8 , pp. 102-111
    • Kennedy, K.1    Nedeljkovic, N.2    Sethi, A.3
  • 46
    • 0031372537 scopus 로고    scopus 로고
    • Inter-procedural distribution assignment placement: More than just enhancing intra-procedural placing techniques
    • IEEE Computer Society Press, London, November 10-14
    • J. Knoop, E. Mehofer, Inter-procedural distribution assignment placement: more than just enhancing intra-procedural placing techniques, in: Proceedings of the 1997 International Conference on Parallel Architectures and Compilation Techniques, 26-37, IEEE Computer Society Press, London, November 10-14, 1997.
    • (1997) Proceedings of the 1997 International Conference on Parallel Architectures and Compilation Techniques , pp. 26-37
    • Knoop, J.1    Mehofer, E.2
  • 48
    • 0026231040 scopus 로고
    • Compiling global name-space parallel loops for distributed execution
    • C. Koelbel, P. Mehrotra, Compiling global name-space parallel loops for distributed execution, IEEE Trans. Parallel Distributed Sys. 2 (4) (1991) 440-451.
    • (1991) IEEE Trans. Parallel Distributed Sys. , vol.2 , Issue.4 , pp. 440-451
    • Koelbel, C.1    Mehrotra, P.2
  • 51
    • 0025530906 scopus 로고
    • Generating explicit communication from shared-memory program references
    • New York, November
    • J. Li, M. Chen, Generating explicit communication from shared-memory program references, in: Proceedings of Supercomputing'90, New York, November 1990, pp. 865-876.
    • (1990) Proceedings of Supercomputing'90 , pp. 865-876
    • Li, J.1    Chen, M.2
  • 52
    • 0027694019 scopus 로고
    • Access normalization: Loop restructuring for numa computers
    • W. Li, K. Pingali, Access normalization: Loop restructuring for numa computers, ACM Trans. Comput. Sys. 11 (4) (1993) 353-375.
    • (1993) ACM Trans. Comput. Sys. , vol.11 , Issue.4 , pp. 353-375
    • Li, W.1    Pingali, K.2
  • 54
    • 0002756869 scopus 로고
    • Programming distributed memory architectures using Kali
    • A. Nicolau, D. Gelernter, T. Gross, D. Padua (Eds.), Pitman/MIT-Press, London
    • P. Mehrotra, J. VanRosendale, Programming distributed memory architectures using Kali. in: A. Nicolau, D. Gelernter, T. Gross, D. Padua (Eds.), Advances in Languages and Compilers for Parallel Processing, Pitman/MIT-Press, London, 1991, pp. 364-384.
    • (1991) Advances in Languages and Compilers for Parallel Processing , pp. 364-384
    • Mehrotra, P.1    VanRosendale, J.2
  • 57
    • 85029782595 scopus 로고
    • Adapting fortran 90 array programs for distributed memory architectures
    • H.P. Zima, (Ed.), Proceedings of the First International ACPC Conference, Salzburg, Austria, Springer, Berlin
    • J.H. Merlin, Adapting fortran 90 array programs for distributed memory architectures, in: H.P. Zima, (Ed.), Proceedings of the First International ACPC Conference, Salzburg, Austria, Lecture Notes in Computer Science, vol. 591, Springer, Berlin, 1991, pp. 184-200.
    • (1991) Lecture Notes in Computer Science , vol.591 , pp. 184-200
    • Merlin, J.H.1
  • 61
    • 0011624812 scopus 로고
    • Runtime Compilation Techniques for Data Partitioning and Communication Schedule Reuse
    • University of Maryland, April
    • R. Ponnusamy, J. Saltz, A. Choudhary, Runtime Compilation Techniques for Data Partitioning and Communication Schedule Reuse, Technical Report, UMIACS-TR-93-32, University of Maryland, April 1993.
    • (1993) Technical Report, UMIACS-TR-93-32
    • Ponnusamy, R.1    Saltz, J.2    Choudhary, A.3
  • 62
    • 0005385405 scopus 로고    scopus 로고
    • Evaluation of High Performance Fortran for CAS applications
    • NASA Ames Research Center, August
    • K. Roe, P. Mehrotra, Evaluation of High Performance Fortran for CAS applications, in: Proceedings for the Workshop on CAS Applications, NASA Ames Research Center, August 1996, pp. 133-138.
    • (1996) Proceedings for the Workshop on CAS Applications , pp. 133-138
    • Roe, K.1    Mehrotra, P.2
  • 68
    • 0032064895 scopus 로고    scopus 로고
    • Analysis of local enumeration and storage schemes in HPF
    • H. Sips, W. Denissen, K. van Reeuwijk, Analysis of local enumeration and storage schemes in HPF, Parallel Computing 24 (3/4) (1998) 355-382.
    • (1998) Parallel Computing , vol.24 , Issue.3-4 , pp. 355-382
    • Sips, H.1    Denissen, W.2    Van Reeuwijk, K.3
  • 69
    • 0000412263 scopus 로고
    • Generating communication for array statements: Design implementation, and evaluation
    • J.M. Stichnoth, D. O'Hallaron, T. Gross, Generating communication for array statements: Design implementation, and evaluation, J. Parallel Distributed Comput. 21 (1) (1994) 150-159.
    • (1994) J. Parallel Distributed Comput. , vol.21 , Issue.1 , pp. 150-159
    • Stichnoth, J.M.1    O'Hallaron, D.2    Gross, T.3
  • 70
    • 0000606960 scopus 로고    scopus 로고
    • Fast address sequence generation for data parallel programs using integer lattices
    • Advances in Languages and Compilers for Parallel Computing, Springer, Berlin
    • A. Thirumalai, J. Ramanujam, Fast address sequence generation for data parallel programs using integer lattices, Advances in Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, Springer, Berlin, 1996.
    • (1996) Lecture Notes in Computer Science
    • Thirumalai, A.1    Ramanujam, J.2
  • 71
    • 0031247803 scopus 로고    scopus 로고
    • Vienna fortran/HPF extensions for sparse and irregular problems and their compilation
    • November
    • M. Ujaldon, E.L. Zapata, B. Chapman, H. Zima, Vienna fortran/HPF extensions for sparse and irregular problems and their compilation, IEEE Trans. Parallel Distributed Sys. 8 (11) November 1997.
    • (1997) IEEE Trans. Parallel Distributed Sys. , vol.8 , Issue.11
    • Ujaldon, M.1    Zapata, E.L.2    Chapman, B.3    Zima, H.4
  • 73
    • 45549115356 scopus 로고
    • Superb: A tool for semi-automatic MIMD/SIMD parallelization
    • H. Zima, H. Bast, M. Gerndt, Superb: A tool for semi-automatic MIMD/SIMD parallelization, Parallel Computing 6 (1988) 1-18.
    • (1988) Parallel Computing , vol.6 , pp. 1-18
    • Zima, H.1    Bast, H.2    Gerndt, M.3


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