Dynamo: a transparent dynamic optimization system
By Vasanth Bala, Evelyn Duesterwald, S. Banerjia. ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2000
845 citations recorded by the source corpus.
Subfields: Hardware and Architecture, Information Systems, Management Science and Operations Research
View Paper: https://www.semanticscholar.org/paper/393a1e472d631f1c3e0ac5374c0f7fa7877277a7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Hardware and Architecture
- Margaret Martonosi
- Julian Seward
- Nicholas Nethercote
- David M. Brooks
- Thomas W. Reps
- Gogul Balakrishnan
- Anh Nguyen-Tuong
- Michele Co
In Information Systems
- James E. Smith
- David E. Evans
- Thomas W. Reps
- Margaret Martonosi
- Chris Lattner
- Ashutosh S. Dhodapkar
- Vijay Janappa Reddi
- David M. Brooks
In Management Science and Operations Research
- James E. Smith
- David E. Evans
- Thomas W. Reps
- Margaret Martonosi
- Chris Lattner
- Ashutosh S. Dhodapkar
- Vijay Janappa Reddi
- Gogul Balakrishnan
Citations in the corpus
- Adaptive optimization in the Jalapeño JVM (2000, neutral): “A number of research projects have explored more aggressive forms of dynamic compilation [35, 9, 12, 13, 8, 27, 28, 38, 37, 19, 39], using runtime information to tailor the executable to its current environment.”
- The Transmeta Code Morphing/spl trade/ Software: using speculation, recovery, and adaptive retranslation to address real-life challenges (2003, methodology): “A well-known recent dynamic optimization system is Dynamo from HP Labs (Bala et al. [3,4]) and its successor DELI [10].”
- ILR: Where'd My Gadgets Go? (2012, methodology): “For example, programs are arranged sequentially in memory starting at a base address, as shown in the left of Figure 1.1 In this example, the address used to return from function foo (7003) might be leaked if there is a vulnerability in the function.”
- LLVM: AN INFRASTRUCTURE FOR MULTI-STAGE OPTIMIZATION (2000, background): “A large amount of research has gone into performing interprocedural optimizations on machine code [5, 16, 24, 34, 40, 11, 35] at either link-time or run-time.”
- Tracing the meta-level: PyPy's tracing JIT compiler (2009, methodology): “Tracing optimizations were initially explored by the Dynamo project [2] to dynamically optimize machine code at runtime.”
- Managing multi-configuration hardware via dynamic working set analysis (2002, methodology): “Dynamo optimizes traces of the program to generate fragments, which are stored in a fragment cache.”
- Trace-based just-in-time type specialization for dynamic languages (2009, background): “Dynamo (7) by Bala et al, introduced native code tracing as a replacement for profile-guided optimization (PGO).”
- N-Variant Systems: A Secretless Framework for Security through Diversity (2006, background): “Strata and other software dynamic translators [4, 11] have demonstrated that it is possible to implement software dynamic translation without unreasonable performance penalty.”
- WYSINWYX: What you see is not what you eXecute (2010, methodology): “These days many applications are run in nonstandard ways, for example, in a guest virtual machine, using runtime optimization [Bala et al. 2000], or under program shepherding [Kiriansky et al. 2002].”
- Dynamic-Compiler-Driven Control for Microprocessor Energy and Performance (2006, background): “Since most dynamic optimization systems are already equipped with some light-weight profiling mechanism to identify hot code regions (for example DynamoRio profiles every possible loop Figure 2: The overall”
- A dynamic compilation framework for controlling microprocessor energy and performance (2005, background): “Since most dynamic optimization systems are already equipped with some light-weight pro.ling mechanism to identify hot code regions (for example DynamoRio pro.les every possible loop target [5]), we will extend the existing pro.ling infrastructure to monitor and identify hot functions or loops.”