A language for the compact representation of multiple program versions

Sebastien Donadio; James Brodman; Thomas Roeder; Kamen Yotov; Denis Barthou; Albert Cohen; María Jesús Garzarán; David Padua; Keshav Pingali

doi:10.1007/978-3-540-69330-7_10

A language for the compact representation of multiple program versions

Sebastien Donadio, James Brodman, Thomas Roeder, Kamen Yotov, Denis Barthou, Albert Cohen, María Jesús Garzarán, David Padua, Keshav Pingali

Siebel School of Computing and Data Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRALz overcome this issue by empirically searching in the space of possible program versions for the one that performs the best. Empirical search can also be applied by programmers, but because they lack a tool to automate the process, programmers need to manually re-write the application in terms of several parameters whose best value will be determined by the empirical search in the target machine. In this paper, we present the design of an annotation language, meant to be used either as an intermediate representation within library generators or directly by the programmer. This language that we call X represents parameterized programs in a compact and natural way. It provides an powerful optimization framework for high performance computing.

Original language	English (US)
Title of host publication	Languages and Compilers for Parallel Computing - 18th International Workshop, LCPC 2005, Revised Selected Papers
Publisher	Springer
Pages	136-151
Number of pages	16
ISBN (Print)	3540693297, 9783540693291
DOIs	https://doi.org/10.1007/978-3-540-69330-7_10
State	Published - 2006
Event	18th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2005 - Hawthorne, NY, United States Duration: Oct 20 2005 → Oct 22 2005

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4339 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	18th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2005
Country/Territory	United States
City	Hawthorne, NY
Period	10/20/05 → 10/22/05

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Online availability

10.1007/978-3-540-69330-7_10

Library availability

Discover UIUC Full Text

Cite this

Donadio, S., Brodman, J., Roeder, T., Yotov, K., Barthou, D., Cohen, A., Garzarán, M. J., Padua, D., & Pingali, K. (2006). A language for the compact representation of multiple program versions. In Languages and Compilers for Parallel Computing - 18th International Workshop, LCPC 2005, Revised Selected Papers (pp. 136-151). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4339 LNCS). Springer. https://doi.org/10.1007/978-3-540-69330-7_10

A language for the compact representation of multiple program versions. / Donadio, Sebastien; Brodman, James; Roeder, Thomas et al.
Languages and Compilers for Parallel Computing - 18th International Workshop, LCPC 2005, Revised Selected Papers. Springer, 2006. p. 136-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4339 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Donadio, S, Brodman, J, Roeder, T, Yotov, K, Barthou, D, Cohen, A, Garzarán, MJ , Padua, D & Pingali, K 2006, A language for the compact representation of multiple program versions. in Languages and Compilers for Parallel Computing - 18th International Workshop, LCPC 2005, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4339 LNCS, Springer, pp. 136-151, 18th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2005, Hawthorne, NY, United States, 10/20/05. https://doi.org/10.1007/978-3-540-69330-7_10

Donadio S, Brodman J, Roeder T, Yotov K, Barthou D, Cohen A et al. A language for the compact representation of multiple program versions. In Languages and Compilers for Parallel Computing - 18th International Workshop, LCPC 2005, Revised Selected Papers. Springer. 2006. p. 136-151. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-69330-7_10

Donadio, Sebastien ; Brodman, James ; Roeder, Thomas et al. / A language for the compact representation of multiple program versions. Languages and Compilers for Parallel Computing - 18th International Workshop, LCPC 2005, Revised Selected Papers. Springer, 2006. pp. 136-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{db822b157bda4c88a710e3e7a4290f0d,

title = "A language for the compact representation of multiple program versions",

abstract = "As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRALz overcome this issue by empirically searching in the space of possible program versions for the one that performs the best. Empirical search can also be applied by programmers, but because they lack a tool to automate the process, programmers need to manually re-write the application in terms of several parameters whose best value will be determined by the empirical search in the target machine. In this paper, we present the design of an annotation language, meant to be used either as an intermediate representation within library generators or directly by the programmer. This language that we call X represents parameterized programs in a compact and natural way. It provides an powerful optimization framework for high performance computing.",

author = "Sebastien Donadio and James Brodman and Thomas Roeder and Kamen Yotov and Denis Barthou and Albert Cohen and Garzar{\'a}n, {Mar{\'i}a Jes{\'u}s} and David Padua and Keshav Pingali",

note = "Copyright: Copyright 2015 Elsevier B.V., All rights reserved.; 18th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2005 ; Conference date: 20-10-2005 Through 22-10-2005",

year = "2006",

doi = "10.1007/978-3-540-69330-7_10",

language = "English (US)",

isbn = "3540693297",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "136--151",

booktitle = "Languages and Compilers for Parallel Computing - 18th International Workshop, LCPC 2005, Revised Selected Papers",

address = "Germany",

}

TY - GEN

T1 - A language for the compact representation of multiple program versions

AU - Donadio, Sebastien

AU - Brodman, James

AU - Roeder, Thomas

AU - Yotov, Kamen

AU - Barthou, Denis

AU - Cohen, Albert

AU - Garzarán, María Jesús

AU - Padua, David

AU - Pingali, Keshav

PY - 2006

Y1 - 2006

N2 - As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRALz overcome this issue by empirically searching in the space of possible program versions for the one that performs the best. Empirical search can also be applied by programmers, but because they lack a tool to automate the process, programmers need to manually re-write the application in terms of several parameters whose best value will be determined by the empirical search in the target machine. In this paper, we present the design of an annotation language, meant to be used either as an intermediate representation within library generators or directly by the programmer. This language that we call X represents parameterized programs in a compact and natural way. It provides an powerful optimization framework for high performance computing.

AB - As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRALz overcome this issue by empirically searching in the space of possible program versions for the one that performs the best. Empirical search can also be applied by programmers, but because they lack a tool to automate the process, programmers need to manually re-write the application in terms of several parameters whose best value will be determined by the empirical search in the target machine. In this paper, we present the design of an annotation language, meant to be used either as an intermediate representation within library generators or directly by the programmer. This language that we call X represents parameterized programs in a compact and natural way. It provides an powerful optimization framework for high performance computing.

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

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

U2 - 10.1007/978-3-540-69330-7_10

DO - 10.1007/978-3-540-69330-7_10

M3 - Conference contribution

AN - SCOPUS:43949129775

SN - 3540693297

SN - 9783540693291

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 136

EP - 151

BT - Languages and Compilers for Parallel Computing - 18th International Workshop, LCPC 2005, Revised Selected Papers

PB - Springer

T2 - 18th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2005

Y2 - 20 October 2005 through 22 October 2005

ER -

A language for the compact representation of multiple program versions

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this