Article

Optimizing embedded applications using programmer-inserted hints

Authors:

G. Chen,

M. KandemirAuthors Info & Claims

ASP-DAC '05: Proceedings of the 2005 Asia and South Pacific Design Automation Conference

Pages 157 - 160

https://doi.org/10.1145/1120725.1120794

Published: 18 January 2005 Publication History

Get Access

Abstract

This paper explores the possibility of exploiting programmer-inserted hints in the application code to improve performance beyond what could be achieved using an optimizing compiler. These hints can be beneficial in two scenarios: (1) when compiler analysis fails to identify opportunity and/or legality for a potential optimization, and (2) when it is not a good idea to invoke an optimization at the point the opportunity is first encountered during execution. Our goal is to strike a balance between two extremes -- pure compiler-based scheme (i.e., user-transparent approach) and pure user-based scheme (i.e., assembly programming). In particular, we defend a strategy where a few programmer-inserted hints can enable the compiler to do much better job than the pure compiler approach without requiring the programmer to encode low-level optimizations.

References

[1]

R. Cohn and P. G. Lowney. Design and Analysis of Profile-Based Optimization in Compaq's Compilation Tools for Alpha. Journal of Instruction-Level Parallelism, 3, 2000.]]

Google Scholar

[2]

S. Jinturkar, J. Thilo, J. Glossner, P. D'Arcy, and S. Vassiliadis. Profile Directed Compilation in DSP Applications, Proceedings of the International Conference on Signal Processing Applications and Technology, September, 1998.]]

Google Scholar

[3]

T. L. Johnson, D. A. Connors, M. C. Merten, and W. W. Hwu. Runtime Cache Bypassing. IEEE Transactions on Computers, Vol. 48, No. 12, December 1999, pp. 1338--1354.]]

Digital Library

Google Scholar

[4]

D. Koufaty and J. Torrellas. Compiler Support for Data Forwarding in Scalable Shared-Memory Multiprocessors. Proceedings of International Conference on Parallel Processing, 1999.]]

Digital Library

Google Scholar

[5]

T. C. Mowry, M. S. Lam, and A. Gupta. Design and Evaluation of a Compiler Algorithm for Prefetching. Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, October 1992.]]

Digital Library

Google Scholar

[6]

H. Patterson. Informed Prefetching and Caching. Carnegie Mellon Ph.D. Dissertation, CMU-CS-97-204, December 1997.]]

Digital Library

Google Scholar

[7]

D. Poulsen and P. C. Yew. Data Prefetching and Data Forwarding in Shared-Memory Multiprocessors. Proceedings of the International Conference on Parallel Processing, Vol. II, Aug. 1994, pp. 276--280.]]

Digital Library

Google Scholar

Cited By

View all

Moore RChilders B(2014)Building and using application utility models to dynamically choose thread countsThe Journal of Supercomputing10.1007/s11227-014-1148-368:3(1184-1213)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1007/s11227-014-1148-3
Moore RChilders B(2012)Using utility prediction models to dynamically choose program thread countsProceedings of the 2012 IEEE International Symposium on Performance Analysis of Systems & Software10.1109/ISPASS.2012.6189220(135-144)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1109/ISPASS.2012.6189220

Optimizing embedded applications using programmer-inserted hints
1. Software and its engineering
  1. Software notations and tools

Recommendations

Incremental concrete syntax for embedded languages
SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing

Embedded domain-specific languages (EDSLs) are known to improve the productivity of developers. However, for many domains no DSL implementation is available. Two important reasons are: First, the effort to implement embedded DSLs that provide the domain'...
On compiling embedded languages in LISP
LFP '80: Proceedings of the 1980 ACM conference on LISP and functional programming

In INTERLISP we find a number of embedded languages such as the iterative statement and the pattern match facility in the CLISP package, the editor and makefile languages and so forth. We will in this paper concentrate on the problem of extending the ...
Implementing an embedded compiler using program transformation rules

Domain-specific languages DSLs are well-recognized to ease programming and improve robustness for a specific domain, by providing high-level domain-specific notations and checks of domain-specific properties. The compiler of a DSL, however, is often ...

Comments

Information & Contributors

Information

Published In

ASP-DAC '05: Proceedings of the 2005 Asia and South Pacific Design Automation Conference

January 2005

1495 pages

ISBN:0780387376

DOI:10.1145/1120725

General Chair:
Ting-Ao Tang
Fudan University, Shanghai, P. R. China

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 January 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ASPDAC05

Sponsor:

SIGDA

ASPDAC05: Asia and South Pacific Design Automation Conference

January 18 - 21, 2005

Shanghai, China

Acceptance Rates

Overall Acceptance Rate 466 of 1,454 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
86
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Moore RChilders B(2014)Building and using application utility models to dynamically choose thread countsThe Journal of Supercomputing10.1007/s11227-014-1148-368:3(1184-1213)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1007/s11227-014-1148-3
Moore RChilders B(2012)Using utility prediction models to dynamically choose program thread countsProceedings of the 2012 IEEE International Symposium on Performance Analysis of Systems & Software10.1109/ISPASS.2012.6189220(135-144)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1109/ISPASS.2012.6189220

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Recommendations

Incremental concrete syntax for embedded languages

On compiling embedded languages in LISP

Implementing an embedded compiler using program transformation rules

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations