EXTENT: a portable programming environment for designing and implementing high-performance block recursive algorithms

D. L. Dai, Sandeep Gupta, S. D. Kaushik, J. H. Lu, R. V. Singh, C. H. Huang, P. Sadayappan, R. W. Johnson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

EXTENT is an EXpert system for TENsor product formula Translation. In this paper we present a programming environment for automatic generation of parallel/vector programs from tensor product formulas. A tensor (Kronecker) product based programming methodology is used for designing high performance programs on various architectures. In this programming methodology, block recursive algorithms such as the fast Fourier transform and Strassen's matrix multiplication algorithm are expressed as tensor product formulas involving tensor product and other matrix operations. A tensor product formula can be systematically translated to parallel and/or vector code for various parallel architectures. A prototype system which generates programs for the Cray Y-MP, Cray T3D, and Intel Paragon has been developed. Performance results for some generated programs are presented.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM/IEEE Supercomputing Conference
Editors Anon
PublisherIEEE
Pages49-58
Number of pages10
StatePublished - 1994
Externally publishedYes
EventProceedings of the 1994 Supercomputing Conference - Washington, DC, USA
Duration: Nov 14 1994Nov 18 1994

Other

OtherProceedings of the 1994 Supercomputing Conference
CityWashington, DC, USA
Period11/14/9411/18/94

Fingerprint

Tensors
Parallel architectures
Fast Fourier transforms
Expert systems
Computer systems

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Dai, D. L., Gupta, S., Kaushik, S. D., Lu, J. H., Singh, R. V., Huang, C. H., ... Johnson, R. W. (1994). EXTENT: a portable programming environment for designing and implementing high-performance block recursive algorithms. In Anon (Ed.), Proceedings of the ACM/IEEE Supercomputing Conference (pp. 49-58). IEEE.

EXTENT : a portable programming environment for designing and implementing high-performance block recursive algorithms. / Dai, D. L.; Gupta, Sandeep; Kaushik, S. D.; Lu, J. H.; Singh, R. V.; Huang, C. H.; Sadayappan, P.; Johnson, R. W.

Proceedings of the ACM/IEEE Supercomputing Conference. ed. / Anon. IEEE, 1994. p. 49-58.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dai, DL, Gupta, S, Kaushik, SD, Lu, JH, Singh, RV, Huang, CH, Sadayappan, P & Johnson, RW 1994, EXTENT: a portable programming environment for designing and implementing high-performance block recursive algorithms. in Anon (ed.), Proceedings of the ACM/IEEE Supercomputing Conference. IEEE, pp. 49-58, Proceedings of the 1994 Supercomputing Conference, Washington, DC, USA, 11/14/94.
Dai DL, Gupta S, Kaushik SD, Lu JH, Singh RV, Huang CH et al. EXTENT: a portable programming environment for designing and implementing high-performance block recursive algorithms. In Anon, editor, Proceedings of the ACM/IEEE Supercomputing Conference. IEEE. 1994. p. 49-58
Dai, D. L. ; Gupta, Sandeep ; Kaushik, S. D. ; Lu, J. H. ; Singh, R. V. ; Huang, C. H. ; Sadayappan, P. ; Johnson, R. W. / EXTENT : a portable programming environment for designing and implementing high-performance block recursive algorithms. Proceedings of the ACM/IEEE Supercomputing Conference. editor / Anon. IEEE, 1994. pp. 49-58
@inproceedings{43e3868bf51f449483d74bf6cb4ed0aa,
title = "EXTENT: a portable programming environment for designing and implementing high-performance block recursive algorithms",
abstract = "EXTENT is an EXpert system for TENsor product formula Translation. In this paper we present a programming environment for automatic generation of parallel/vector programs from tensor product formulas. A tensor (Kronecker) product based programming methodology is used for designing high performance programs on various architectures. In this programming methodology, block recursive algorithms such as the fast Fourier transform and Strassen's matrix multiplication algorithm are expressed as tensor product formulas involving tensor product and other matrix operations. A tensor product formula can be systematically translated to parallel and/or vector code for various parallel architectures. A prototype system which generates programs for the Cray Y-MP, Cray T3D, and Intel Paragon has been developed. Performance results for some generated programs are presented.",
author = "Dai, {D. L.} and Sandeep Gupta and Kaushik, {S. D.} and Lu, {J. H.} and Singh, {R. V.} and Huang, {C. H.} and P. Sadayappan and Johnson, {R. W.}",
year = "1994",
language = "English (US)",
pages = "49--58",
editor = "Anon",
booktitle = "Proceedings of the ACM/IEEE Supercomputing Conference",
publisher = "IEEE",

}

TY - GEN

T1 - EXTENT

T2 - a portable programming environment for designing and implementing high-performance block recursive algorithms

AU - Dai, D. L.

AU - Gupta, Sandeep

AU - Kaushik, S. D.

AU - Lu, J. H.

AU - Singh, R. V.

AU - Huang, C. H.

AU - Sadayappan, P.

AU - Johnson, R. W.

PY - 1994

Y1 - 1994

N2 - EXTENT is an EXpert system for TENsor product formula Translation. In this paper we present a programming environment for automatic generation of parallel/vector programs from tensor product formulas. A tensor (Kronecker) product based programming methodology is used for designing high performance programs on various architectures. In this programming methodology, block recursive algorithms such as the fast Fourier transform and Strassen's matrix multiplication algorithm are expressed as tensor product formulas involving tensor product and other matrix operations. A tensor product formula can be systematically translated to parallel and/or vector code for various parallel architectures. A prototype system which generates programs for the Cray Y-MP, Cray T3D, and Intel Paragon has been developed. Performance results for some generated programs are presented.

AB - EXTENT is an EXpert system for TENsor product formula Translation. In this paper we present a programming environment for automatic generation of parallel/vector programs from tensor product formulas. A tensor (Kronecker) product based programming methodology is used for designing high performance programs on various architectures. In this programming methodology, block recursive algorithms such as the fast Fourier transform and Strassen's matrix multiplication algorithm are expressed as tensor product formulas involving tensor product and other matrix operations. A tensor product formula can be systematically translated to parallel and/or vector code for various parallel architectures. A prototype system which generates programs for the Cray Y-MP, Cray T3D, and Intel Paragon has been developed. Performance results for some generated programs are presented.

UR - http://www.scopus.com/inward/record.url?scp=0028743426&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028743426&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028743426

SP - 49

EP - 58

BT - Proceedings of the ACM/IEEE Supercomputing Conference

A2 - Anon, null

PB - IEEE

ER -