Predictable Binary Code Cache: A First Step towards Reconciling Predictability and Just-in-Time Compilation

Bouakaz, Adnan; Puaut, Isabelle; Rohou, Erven

doi:10.1109/rtas.2011.29

Cited by 2 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, also a data flow analysis is used to model the content of the D-ISP with the STACK replacement policy. For LRU only analysis methods that assume memory entities of a unique size [5], [23] are known, but the authors are not aware of any LRU analysis that is able to handle functions of different size. Therefore, a data flow analysis tracking all possible D-ISP states is also used for the LRU replacement policy.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Replacement Policies for a Function-Based Instruction Memory: A Quantification of the Impact on Hardware Complexity and WCET Estimates

Metzlaff

Ungerer

2012

2012 24th Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

Instruction memories have a large influence on the timing behavior of hard real-time systems. Thus, to obtain safe and tight WCET estimates the instruction memory has to be predictable. Instruction memories in embedded real-time systems range from scratchpads with fixed content to dynamically managed fine-grained caches. In this paper we focus on a function-based dynamic instruction memory (D-ISP) and examine different replacement policies. We show their influence on the timing behavior of a hard real-time system and the complexity of a hardware implementation. A timing analysis unveils that a stack-based replacement policy reaches similar WCET estimates as LRU, especially for small scratchpad sizes. But in contrast to the stack-based replacement policy, LRU cannot be implemented with a reasonable amount of resources. Whereas, an experimental implementation of the proposed stack-based replacement policy needs only up to 23% more resources than a FIFO implementation.

show abstract

Section: Discussionmentioning

confidence: 99%

“…In [23] two structures of a method cache for just-in-time (JIT) compilers are proposed and statically analyzed. One uses a fixed block size for all functions, whereas the other structure fixes the layout of the functions in the cache.…”

Section: Related Workmentioning

confidence: 99%

Replacement Policies for a Function-Based Instruction Memory: A Quantification of the Impact on Hardware Complexity and WCET Estimates

Metzlaff

Ungerer

2012

2012 24th Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

show abstract

“…Our experiments so far had only modest space requirements for recompilation (11-144KB per benchmark for SPECint2006). In addition, since in our approach nonrecompiled code is already available in native form and executes in parallel to recompilation, our system doesn't rely on smart code caching as heavily as other dynamic compilation systems that try to avoid slow, interpreted code execution [Hazelwood and Smith 2004;Bouakaz et al 2011].…”

Section: The Runtime Managermentioning

confidence: 99%

JIT technology with C/C++

Nuzman¹,

Eres²,

Dyshel³

et al. 2013

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

The growing gap between the advanced capabilities of static compilers as reflected in benchmarking results and the actual performance that users experience in real-life scenarios makes client-side dynamic optimization technologies imperative to the domain of static languages. Dynamic optimization of software distributed in the form of a platform-agnostic Intermediate-Representation (IR) has been very successful in the domain of managed languages, greatly improving upon interpreted code, especially when online profiling is used. However, can such feedback-directed IR-based dynamic code generation be viable in the domain of statically compiled, rather than interpreted, languages? We show that fat binaries, which combine the IR together with the statically compiled executable, can provide a practical solution for software vendors, allowing their software to be dynamically optimized without the limitation of binary-level approaches, which lack the highlevel IR of the program, and without the warm-up costs associated with the IR-only software distribution approach. We describe and evaluate the fat-binary-based runtime compilation approach using SPECint2006, demonstrating that the overheads it incurs are low enough to be successfully surmounted by dynamic optimization. Building on Java JIT technologies, our results already improve upon common real-world usage scenarios, including very small workloads.

show abstract

Predictable Binary Code Cache: A First Step towards Reconciling Predictability and Just-in-Time Compilation

Cited by 2 publications

References 21 publications

Replacement Policies for a Function-Based Instruction Memory: A Quantification of the Impact on Hardware Complexity and WCET Estimates

Replacement Policies for a Function-Based Instruction Memory: A Quantification of the Impact on Hardware Complexity and WCET Estimates

JIT technology with C/C++

Contact Info

Product

Resources

About