(Enter summary)
Abstract: How much do two profiles of the same program differ? When has a profile changed enough to
warrant reexamination of the profiled program? And how should two or more profiles be combined
to make a better hybrid profile? To answer these questions, we borrow concepts from information
theory that measure the differences between the distributions of random variables. Treating the distribution
of execution frequencies in a profile like the distribution of a random variable lets us use
metrics of... (Update)
Cited by: More
The Chaos of Software Development - Ahmed Hassan And (2003)
(Correct)
Studying the Chaos of Code Development - Hassan, Holt (2003)
(Correct)
Evaluating the Relationship Between the Usefulness and.. - Langdale, Gross (2003)
(Correct)
Similar documents (at the sentence level):
58.6%: Comparing and Combining Profiles - Savari, Young (1999)
(Correct)
Active bibliography (related documents): More All
0.5: Arithmetic Coding for Noisy Channels - Sayir (1999)
(Correct)
0.3: Continuous Program Optimization: A Case Study - Kistler, Franz (2003)
(Correct)
0.3: Proceedings of the First Australian Undergraduate.. - Portable..
(Correct)
Similar documents based on text: More All
0.1: On the Entropy of DNA: Algorithms and Measurements .. - Farach.. (1994)
(Correct)
0.1: Inductive Synthesis of Recursive Logic Programs - Yilmaz (1997)
(Correct)
0.1: A Simple Technique for Bounding the Pointwise Redundancy of.. - Kieffer, Yang
(Correct)
Related documents from co-citation: More All
4: Metrics and Laws of Software Evolution-The Nineties View
- MM, DE and et al. - 1997
4: the Uniformity of Software Evolution Patterns (context) - Barry, Kemere et al. - 2003
4: Entropies As Measures of Software Information (context) - Abd-El-Hafiz - 2001
BibTeX entry: (Update)
S. Savari and C. Young. "Comparing and combining profiles. " In Workshop on Profile and Feedback-Directed Optimization, Nov. 1999. http://citeseer.ist.psu.edu/savari00comparing.html More
@inproceedings{ savari99comparing,
author = "S. Savari and C. Young",
title = "Comparing and Combining Profiles",
booktitle = "Proc. Second Workshop on Feedback-Directed Optimization ({FDO})",
year = "1999",
url = "citeseer.ist.psu.edu/savari00comparing.html" }
Citations (may not include all citations):
121
Continuous Profiling: Where Have All the Cycles Gone
- Anderson, Berc et al. - 1997
34
Transparent Dynamic Optimization: The Design and Implementat.. (context) - Bala, Duesterwald et al. - 1999
25
The Predictability of Branches in Libraries
- Calder, Grunwald et al. - 1995
8
Branch Prediction Based on Universal Data Compression Algori.. (context) - Federovsky, Feder et al. - 1998
4
Evaluating the Importance of User-Specific Profiling (context) - Wang, Rubin - 1998
4
Path-based compilation
- Young - 1997
3
Digital FX (context) - Hookway, Herdeg - 1997
2
Elements of Information Theory (context) - York, ACM et al. - 1991
1
Analysis of Branch Prediction Via Data Compression (context) - rep, Research et al. - 1996
1
Predicting Conditional Branch Directions From Previous Runs .. (context) - York, ACM et al. - 1992
1
Computing the Similarity of Profiling Data (context) - Journal, Kistler et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.jilp.org/vol2/): More
A Comparative Survey of Load Speculation Architectures - Calder, Reinman (2000)
(Correct)
Wavefront Scheduling: Path Based Data Representation and.. - Bharadwaj, Menezes, al. (2000)
(Correct)
Code Transformations to Improve Memory Parallelism - Pai, Adve (1999)
(Correct)
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