Alternate document:   Details   Reducing Branch Costs via Branch Alignment (94) Brad Calder, Dirk Grunwald

See this document in CiteSeerX!

Reducing Indirect Function Call Overhead In C++ Programs (1994)  (Make Corrections)  (85 citations)
Brad Calder, Dirk Grumwald
Conference Record of POPL '94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
colorado.edu/~calder/paper...POPL94.ps
ucsd.edu/~calder/papers/POPL94.ps.Z
ucsd.edu/users/calder/pa...POPL94.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  colorado.edu/~calder...paper_pubs (more)
From:  ucsd.edu/~calder/papers
Homepages:  B.Calder  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and prefetching are becoming standard architectural mechanisms that rely oncontrol flow prediction to prefetch and speculatively execute future instructions. At the same time, computer programmers are increasingly turning to object-oriented languages to increase their productivity. These languages commonly use run time... (Update)

Context of citations to this paper:   More

...11. Sequence diagram for jjAjj1 implemented at MA level with A dense and stored in dense format. 14 Method inlining [13, 21, 15, 18, 2, 6, 16, 25, 37] can be applied to eliminate the invocations by inserting the code of the invoked methods into the invoking methods. After...

...not prevent the integration of various dynamic optimizations in SmallEi el. For example, the addition of pro le guided analysis [HCU91, CG94, AH96] would provide more information on the most commonly used types at execution time, and thus allow further optimization of dynamic...

Cited by:   More
OoLaLa: Transformations for Implementations of Matrix.. - Luján, Freeman, Gurd (2002)   (Correct)
Specialization Patterns - Schultz, Lawall, Consel (2000)   (Correct)
Effectively Exploiting Indirect Jumps - Uh (1997)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Quantifying Behavioral Differences Between C and C++ Programs - Calder (1994)   (Correct)
0.6:   Branch Prediction Architectures for 64-bit Address Space - Brad Calder (1993)   (Correct)
0.3:   The Precomputed Branch Architecture - Calder, Grunwald (1999)   (Correct)

Similar documents based on text:   More   All
0.1:   Reducing Branch Costs via Branch Alignment - Calder, Grunwald (1994)   (Correct)
0.1:   Annotating Dispatching - Barbey   (Correct)
0.1:   Efficient Multiple and Predicate Dispatching - Chambers, Chen (1999)   (Correct)

Related documents from co-citation:   More   All
31:   Precise concrete type inference for objectoriented languages - Plevyak, Chien - 1994
30:   Optimizing dynamicallydispatched calls with run-time type feedback (context) - Holzle, Ungar - 1994
30:   Eliminating virtual function calls in C++ programs - Aigner, Holzle - 1995

BibTeX entry:   (Update)

Brad Calder and Dirk Grunwald. Reducing Indirect Function Call Overhead in C++ Programs. In 21st Annual ACM Symposium on Principles of Programming Languages, p. 397-408, January 1994. http://citeseer.ist.psu.edu/calder94reducing.html   More

@inproceedings{ calder94reducing,
    author = "Brad Calder and Dirk Grunwald",
    title = "Reducing Indirect Function Call Overhead in {C++} Programs",
    booktitle = "Conference Record of {POPL} '94: 21st {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages",
    address = "Portland, Oregon",
    pages = "397--408",
    year = "1994",
    url = "citeseer.ist.psu.edu/calder94reducing.html" }
Citations (may not include all citations):
358   The tera computer system - Alverson, Callahan et al. - 1990  ACM   DBLP
241   A study of branch prediction strategies (context) - Smith - 1981  ACM   DBLP
230   Limits of instruction-level parallelism - Wall - 1991  ACM   DBLP
185   Branch prediction strategies and branch target buffer design (context) - Lee, Smith - 1984  ACM   DBLP
157   Limits of control flow on parallelism - Lam, Wilson - 1992  ACM   DBLP
145   Customization: optimizing compiler technology for SELF (context) - DavidUngar - 1989
130   Optimally profiling and tracing programs - Ball, Larus - 1992  ACM   DBLP
110   Improving the accuracy of dynamic branch prediction using br.. (context) - Pan, So et al. - 1992  ACM   DBLP
103   Predicting conditional branch directions from previous runs .. (context) - Fisher, Freudenberger - 1992  ACM   DBLP
96   Branch prediction for free - Ball, Larus - 1993  ACM   DBLP
84   Reducing the cost of branches (context) - McFarling, Hennessy - 1986  ACM   DBLP
67   Iterative type analysis and extended message splitting: opti.. - Chambers, Ungar - 1990  DBLP
52   Efficient superscalar performance through boosting - Lam, Smith et al. - 1992  ACM   DBLP
36   IEEE Transactions on Software Engineering (context) - Ryder, call et al. - 1979
34   Branch target buffer design and optimization (context) - Perleberg, Smith - 1993  ACM   DBLP
31   Static type determination for C - Pande, Ryder - 1993
28   A comparison of dynamic branch predictors that use two level.. (context) - Yeh, Patt - 1993  ACM   DBLP
26   Subprogram inlining: A study of its effects on program execu.. (context) - Davidson, Holler - 1992  ACM   DBLP
24   Alternative implementations of two-level adaptive branch pre.. (context) - Yeh, Patt - 1992
22   accurate instruction fetch and branch prediction (context) - Calder, Grunwald - 1993
17   Reducing the branch penalty in pipelined processors (context) - Lilja - 1988  ACM   DBLP
8   A comprehensive instruction fetch mechanism for a processor .. (context) - Yeh, Patt - 1992  ACM   DBLP
5   Letters on Programming Languages and Systems (context) - Hall, Kennedy et al. - 1992
3   Branch history table prdiction of moving target branches due.. (context) - Kaeli, Emma - 1991
3   Optimizating dynamically-typed object-orientred languages wi.. (context) - Holzle, Chambers et al. - 1991
1   Technical Report (context) - Calder, Grunwald - 1993
1   Exploiting behavioral differences between C and C++ programs (context) - Calder, Grunwald et al. - 1993
1   An interval-based approach to exhcaustive and incremental in.. (context) - Burke - 1990
1   Reducing the cost of branchesby using registers (context) - Davidson, Whalley - 1990



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.colorado.edu/~calder/paper_pubs.html):   More
Leapfrogging: A Portable Technique for Implementing Efficient.. - Wagner, Calder (1993)   (Correct)
Reducing Branch Costs via Branch Alignment - Calder, Grunwald (1994)   (Correct)
Instruction Cache Fetch Policies for Speculative Execution - Lee, Baer, Calder, Grunwald (1995)   (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