KRINTZ, C., AND CALDER, B. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of the ACM SIGPLAN 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Online Profiling And Feedback-Directed Optimization Of Java - Arnold (2002) (1 citation) (Correct)
....samplebased profiler did not negatively impact performance. Radhakrishnan et al. 68] used the Ka#e Virtual Machine to measure the performance improvement possible by interpreting, rather than compiling, cold methods for a subset of the SPECjvm98 benchmarks with input size 1. Krintz and Calder [57] use o#ine profiles to generate annotations for Java Bytecode. These annotations are later used to guide selective optimization in a JVM. Plezbert and Cytron [66] propose continuous compilation, as well as several other selective optimization strategies, and simulate their e#ectiveness on C ....
Chandra Krintz and Brad Calder. Using annotations to reduce dynamic optimization time. In SIGPLAN 2001.
Code Annotation for Safe and Efficient Dynamic Object Resolution - Hartmann, Amme (2003) (Correct)
.... technique[4] Code annotation for program representations have not been as thoroughly researched as escape analysis, but recently, various annotations have been proposed for enhancing the performance of JIT compilers using Java bytecode and other intermediate representations[3] Krintz et al.[13] annotates bytecode for increasing the performance of programs executed by JVMs. Franz et al. 8] annotate programs syntax trees with escape information and encode them for safe transportation. Both [13] and [8] guarantee the safety of their annotations. Hannan uses a functional approach for the ....
....of JIT compilers using Java bytecode and other intermediate representations[3] Krintz et al. 13] annotates bytecode for increasing the performance of programs executed by JVMs. Franz et al. 8] annotate programs syntax trees with escape information and encode them for safe transportation. Both [13] and [8] guarantee the safety of their annotations. Hannan uses a functional approach for the annotation of escape information types in [10] In contrast to our work, he excludes dynamic class loading and gives no algorithm for the computation of types. 6 Conclusion Static object resolution is ....
C. Krintz and B. Calder. Using annotation to reduce dynamic optimization time. In SIGPLAN Conference on Programming Language Design and Implementation, pages 156--167, 2001.
Efficient Online Optimization by Utilizing Offline.. - von Ronne.. (2002) (Correct)
....analyses to try to determine accurate estimates. The only thing that is required of the JIT compiler, however, is to utilize its knowledge of the number of available registers and its knowledge of how many variables are live at each point, and spill as many variables as necessary. As suggested in [KC01], this may be useful for a more efficient prioritized graph coloring. Spill ranking may be combined with a copy function, to allow the offline safeTSA producer to split live ranges and assign different spill ranking to each live range segment. 3 Escape Analysis Escape analysis is supported by ....
....depicts the resulting SafeTSA representation of class A, where # marks SObject O to be safe and eob to be object bound. 4 Related Work Recently, various annotations have been proposed for enhancing the performance of JIT compilers using Java bytecode and other intermediate representations [ANH00, KC01, BFHS02, Rei01]. The annotations of [KC01] and [BFHS02] will not compromise type safety. Both [ANH00] and [KC01] suggest utilizing annotations for register allocations. Their proposed mechanisms are not dissimilar to our spill rankings. They do not, however, convey information about live ranges as our kill ....
[Article contains additional citation context not shown here]
Chandra Krintz and Brad Calder. Using annotation to reduce dynamic optimization time. In SIGPLAN Conference on Programming Language Design and Implementation, pages 156--167, 2001.
The Open Runtime Platform: A Flexible High-Performance Managed .. - Cierniak, al. (2003) (3 citations) (Correct)
....Runtime Platform (ORP) ORP was designed to support experimentation with different technologies in just in time compilers (JITs) garbage collection (GC) multithreading, and synchronization. Over the past five years, researchers have used ORP to conduct a number of MRTE implementation experiments [15 17, 19 21, 23, 25]. At least three different garbage collectors and eight different JITs have been developed and integrated with ORP. The version of ORP described in this paper is an internal research tool and is not publicly available. Three characteristics of MRTEs provide the key challenges to their ....
Krintz, C. and Calder, B., "Using Annotations to Reduce Dynamic Optimization Time," ACM Conference on Programming Language Design and Implementation, 2001.
Dynamic Selection of Application-Specific Garbage Collectors - Soman, Krintz, Bacon (2004) (1 citation) Self-citation (Krintz) (Correct)
No context found.
KRINTZ, C., AND CALDER, B. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of the ACM SIGPLAN 2001.
Dynamic Selection of Application-Specific Garbage Collectors - Soman, Krintz, Bacon (2004) (1 citation) Self-citation (Krintz) (Correct)
No context found.
KRINTZ, C., AND CALDER, B. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of the ACM SIGPLAN 2001.
Adaptive Code Unloading for Efficient Dynamic Compilation in.. - Zhang, Krintz (2003) Self-citation (Krintz) (Correct)
No context found.
C. Krintz and B. Calder. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 156-167, June 2001.
Improving Mobile Program Performance through the Use of a Hybrid.. - Krintz (2002) (3 citations) Self-citation (Krintz) (Correct)
No context found.
Krintz, C., Calder, B.: Using Annotation to Reduce Dynamic Optimization Time. In: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation. (1998)
Using Adaptive Optimization Techniques to Teach Mobile Java.. - Krintz Self-citation (Krintz) (Correct)
No context found.
Krintz, C., Calder, B.: Using Annotation to Reduce Dynamic Optimization Time. In: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation. (1998)
NWSLite: A Light-Weight Prediction Utility for Mobile Devices - Gurun, Krintz, Wolski (2004) (4 citations) Self-citation (Krintz) (Correct)
No context found.
C. Krintz and B. Calder. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 156--167, June 2001.
Tamper-Proof Annotations, by Construction - Franz, Haldar, Krintz, Stork Self-citation (Krintz) (Correct)
No context found.
C. Krintz and B. Calder. Using annotations to reduce dynamic optimization time. In Proceedings of the ACM SIGPLAN '01 ConferenceonProgramming Language Design and Implementation [1], pages 156-167. SIGPLAN Notices, 36(5), May 2001.
NWSLite: A Non-Parametric Prediction Utility for.. - Gurun, Krintz, Wolski Self-citation (Krintz) (Correct)
No context found.
C. Krintz and B. Calder. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 156--167, June 2001.
NWSLite: A Non-Parametric Prediction Utility for.. - Gurun, Krintz, Wolski (2003) Self-citation (Krintz) (Correct)
No context found.
C. Krintz and B. Calder. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 156--167, June 2001.
Reducing Load Delay to Improve Performance of Internet-Computing.. - Krintz (2001) Self-citation (Krintz Calder) (Correct)
No context found.
C. Krintz and B. Calder. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of the ACM SIGPLAN 2001.
Dynamic Selection of Application-Specific - Garbage Collectors Sunil Self-citation (Krintz) (Correct)
No context found.
KRINTZ, C., AND CALDER, B. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of the ACM SIGPLAN 2001.
Adaptive, Application-Specific Garbage Collection - Soman, Krintz (2003) (1 citation) Self-citation (Krintz) (Correct)
....identifier is not available, the default JikesRVM collection system is used. We specify (possibly multiple) collection systems for a number of heap size ranges. We insert annotations into bytecode programs using an annotation language and a highly compact encoding that we developed in prior work [21]. We discover the best performing collection systems by repeatedly executing the program off line for a number of heap sizes and program inputs and recording the systems that enable minimum program execution times. Since the best performing collection system may depend on the underlying ....
KRINTZ, C., AND CALDER, B. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of the ACM SIGPLAN 2001.
Online Verification of Offline Escape Analysis - Franz, Haldar, Krintz, Stork Self-citation (Krintz) (Correct)
....algorithms. This becomes a problem when code is generated on the fly while a user is waiting for execution to commence. Because the available time is limited, just in time compilation systems often don t make use of the best possible optimization algorithms. Annotation guided optimization [17, 1, 16, 20, 12, 22] o#ers a solution to this problem: analysis is performed o# line and communicated to the compilation system as program annotations. Annotations reduce just in time compilation overhead and enable optimizations that are too time consuming to perform on line. An example of such an analysis is escape ....
.... The first column shows the size of the actual Java class file, the second shows the amount of annotation information one would need to add in order to transport the results of escape analysis using the annotation format of the 16 annotation aware Open Runtime Platform (ORP) 7] described in [17]. The third column gives the size of our CAST format without annotation information encoded, and the last column gives the delta between our ACAST format (including annotations) and CAST. The size overhead for incorporating annotations into ASTs is smaller than that for doing the same for Java ....
[Article contains additional citation context not shown here]
C. Krintz and B. Calder. Using annotations to reduce dynamic optimization time. In Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implementation, pages 156--167, Snowbird, Utah, June 20--22, 2001.
Making Mobile Code Both Safe and Efficient - Franz, Amme, Beers, Dalton.. (2003) (Correct)
No context found.
C. Krintz and B. Calder. Using annotations to reduce dynamic optimization time. In Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implementation, pages 156--167, Snowbird, Utah, June 20--22, 2001.
Application Tailoring for Mobile Applications - Joel Jones Department (Correct)
No context found.
C. Krintz and B. Calder. Using annotations to reduce dynamic optimization time. In Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implmenetation (PLDI), pages 156--167. ACM Press, May 2001.
Using Hardware Counters to Improve Dynamic Compilation - Tam, Wu (2003) (Correct)
No context found.
Chandra Krintz and Brad Calder. Using annotations to reduce dynamic optimization time. In Programming Language Design and Implementation, June 2001.
Making Mobile Code Both Safe and Efficient - Franz, Amme, Beers, Dalton.. (Correct)
No context found.
C. Krintz and B. Calder. Using annotations to reduce dynamic optimization time. In Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implementation, pages 156--167, Snowbird, Utah, June 20--22, 2001.
Dynamic Metrics for Compiler Developers - Dufour, Driesen, Hendren.. (2002) (Correct)
No context found.
Chandra Krintz and Brad Calder. Using annotations to reduce dynamic optimization time. In Proceedings of the ACM SIGPLAN'01 conference on Programming language design and implementation, pages 156--167. ACM Press, 2001.
Techniques for Transparent Program Specialization in Dynamic.. - Sastry (Correct)
No context found.
C. Krintz and B. Calder. Using Annotation to Reduce Dynamic Optimization Time. In SIGPLAN Conference on Programming Language Design and Implementation, pages 156--167, 2001.
Verifying Data Flow Optimization for Just-in-Time Compilation - Haldar (2002) (Correct)
No context found.
C. Krintz and B. Calder. Using annotation to reduce dynamic optimization time. In SIGPLAN Conference on Programming Language Design and Implementation, 2001.
Making Mobile Code Both Safe and Efficient - Franz, Amme, Beers, Dalton.. (2003) (Correct)
No context found.
C. Krintz and B. Calder. Using annotations to reduce dynamic optimization time. In Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implementation, pages 156--167, Snowbird, Utah, June 20--22, 2001.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC