Generating cache hints for improved program efficiency

Beyls, Kristof; D’Hollander, Erik H.

doi:10.1016/j.sysarc.2004.09.004

Cited by 86 publications

(81 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The paper does not discuss instrumentation overhead or trace size. [6] make a distinction between uses of reuse distance information. source hints are passed to the compiler to define cache dependence information such as instruction B's operand is prefetched by instruction A, thus its latency will be that of a cache hit.…”

Section: Related Work and Acknowledgmentsmentioning

confidence: 99%

Automated locality optimization based on the reuse distance of string operations

Ashok¹,

Li²

2011

International Symposium on Code Generation and Optimization (CGO 2011)

View full text Add to dashboard Cite

Abstract-String operations such as memcpy, memset and memcmp account for a nontrivial amount of Google datacenter resources. String operations hurt processor cache efficiency when the data accessed is not reused shortly thereafter. Such cache pollution can be avoided by using nontemporal memory access to bypass L2/L3 caches. As reuse distance varies greatly across different memcpy static call contexts in the same program, an efficient solution needs to be call context sensitive. We propose a novel solution to this problem using the page protection mechanism to measure reuse distance and the GCC feedback directed optimization mechanism to generate nontemporal memory access instructions at the appropriate static code contexts. First, the compiler inserts instrumentation for calls to string operations. Then a run time library measures reuse distance using the page protection mechanism during a representative profiling run. The compiler finally generates calls to specialized string operations that use nontemporal operations for the arguments with large reuse distance. We present a full implementation and initial results including speedup on large datacenter applications.

show abstract

Section: Related Work and Acknowledgmentsmentioning

confidence: 99%

Automated locality optimization based on the reuse distance of string operations

Ashok¹,

Li²

2011

International Symposium on Code Generation and Optimization (CGO 2011)

View full text Add to dashboard Cite

show abstract

“…[19] since t1 and nt1 have different meanings for floating point loads 3 . Intel compiler only uses t1 for loads and using t1 is clearly a better choice than using nt1 or nta as shown in figure 2.…”

Section: Performance Impact Of Instruction Hintsmentioning

confidence: 99%

“…Compiler can generate multiple copies of an instruction with different hints and the corresponding code to select the hints at runtime as discussed in [2] [3]. The selection can be based on the calculation on various runtime parameters (working set, stride and etc.).…”

Section: Generating Multiple Copiesmentioning

confidence: 99%

A Study of the Performance Potential for Dynamic Instruction Hints Selection

Zhai

et al. 2006

Advances in Computer Systems Architecture

View full text Add to dashboard Cite

Abstract. Instruction hints have become an important way to communicate compile-time information to the hardware. They can be generated by the compiler and the post-link optimizer to reduce cache misses, improve branch prediction and minimize other performance bottlenecks. This paper discusses different instruction hints available on modern processor architectures and shows the potential performance impact on many benchmark programs. Some hints can be effectively selected at compile time with profile feedback. However, since the same program executable can behave differently on various inputs and performance bottlenecks may change on different micro-architectures, significant performance opportunities can be exploited by selecting instruction hints dynamically.

show abstract

“…For example, probabilistic inference problems in Bayesian networks can be solved by first representing the network as a set of propositional clauses, and then model counting the clause set to compute all the marginal probabilities [14,17,39]. Similarly, model counting has applications to various program transformation and optimization problems such as memory size minimization [47], worst case execution time estimation [33], increasing parallelism [47], and improving cache effectiveness [19]. More recently, model counting is used in a variety of security applications.…”

Section: Introductionmentioning

confidence: 99%

A model counter for constraints over unbounded strings

et al. 2014

View full text Add to dashboard Cite

Model counting is the problem of determining the number of solutions that satisfy a given set of constraints. Model counting has numerous applications in the quantitative analyses of program execution time, information flow, combinatorial circuit designs as well as probabilistic reasoning. We present a new approach to model counting for structured data types, specifically strings in this work. The key ingredient is a new technique that leverages generating functions as a basic primitive for combinatorial counting. Our tool SMC which embodies this approach can model count for constraints specified in an expressive string language efficiently and precisely, thereby outperforming previous finite-size analysis tools. SMC is expressive enough to model constraints arising in realworld JavaScript applications and UNIX C utilities. We demonstrate the practical feasibility of performing quantitative analyses arising in security applications, such as determining the comparative strengths of password strength meters and determining the information leakage via side channels.

show abstract

Generating cache hints for improved program efficiency

Cited by 86 publications

References 33 publications

Automated locality optimization based on the reuse distance of string operations

Automated locality optimization based on the reuse distance of string operations

A Study of the Performance Potential for Dynamic Instruction Hints Selection

A model counter for constraints over unbounded strings

Contact Info

Product

Resources

About