Andrew W. Appel, Zhong Shao  Home/Search
Context
Related
| princeton.edu/techreports/19...450.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: princeton.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It has been proposed that allocating procedure activation records on a garbage collected heap is more efficient than stack allocation. However, previous comparisons of heap vs. stack allocation have been over-simplistic, neglecting (for example) frame pointers, or the better locality of reference of stacks. We present a comprehensive analysis of all the components of creation, access, and disposal of heap-allocated and stack-allocated activation records. Among our results are: ffl Although... (Update)
Similar documents (at the sentence level):
51.6%: An Empirical and Analytic Study of Stack vs. Heap Cost for.. - Appel, Shao (1993) (Correct)
50.7%: Compiling Standard ML For Efficient Execution On Modern Machines - Shao (1994) (Correct)
Active bibliography (related documents): More All
0.9: Space-Efficient Closure Representations - Shao, Appel (1994) (Correct)
0.3: Cache Performance of Fast-Allocating Programs - Gonçalves, Appel (1995) (Correct)
0.2: the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
Similar documents based on text: More All
0.3: Callee-save Registers in Continuation-passing Style - Appel, Shao (1992) (Correct)
0.2: A Type-Based Compiler for Standard ML - Zhong Shao (1994) (Correct)
0.2: Smartest Recompilation - Zhong Shao (1993) (Correct)
BibTeX entry: (Update)
@techreport{ appel94empirical,
author = "Andrew W. Appel and Zhong Shao",
title = "An Empirical and Analytic Study of Stack vs. Heap Cost for Languages with Closures",
number = "CS--TR--450--94",
year = "1994",
url = "citeseer.ist.psu.edu/appel94empirical.html" }
Citations (may not include all citations):521 Compiling with Continuations (context) - Appel - 1992
220 ORBIT: An optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986
197 Revised report on the algorithmic language Scheme - Rees, Clinger - 1986
178 Standard ML of New Jersey - Appel, MacQueen - 1991
162 Unboxed objects and polymorphic typing - Leroy - 1992
159 CML: A higher-order concurrent language (context) - Reppy - 1991
123 Simple generational garbage collection and fast allocation - Appel - 1989
116 Rabbit: a compiler for Scheme (context) - Steele - 1978
95 Virtual memory primitives for user programs - Appel, Li - 1991
89 closure-passing style (context) - Appel, Jim - 1989
85 Cache write policies and performance - Jouppi - 1993
85 Garbage collection can be faster than stack allocation - Appel - 1987
84 The Design and Evaluation of a High Performance Smalltalk Sy.. (context) - Ungar - 1986
69 Typing first-class continuations in ML - Duba, Harper et al. - 1991
67 Representing control in the presence of firstclass continuat.. - Hieb, Dybvig et al. - 1990
57 Continuation-based multiprocessing - Wand - 1980
55 Space-efficient closure representations - Shao, Appel - 1994
49 Heap profiling of lazy functional programs - Runciman, Wakeling - 1993
46 Caching considerations for generational garbage collection - Wilson, Lam et al. - 1992
30 Tail recursion without space leaks - Jones - 1992
29 Memory subsystem performance of programs using copying garba.. - Diwan, Tarditi et al. - 1994
27 Implementation strategies for continuations (context) - Clinger, Hartheimer et al. - 1988
25 Calleesave registers in continuation-passing style - Appel, Shao - 1992
25 The effect of garbage collection on cache performance - Zorn - 1991
25 Performance features of the PA7100 microprocessor (context) - Asprey, Averill et al. - 1993
23 Safety considerations for storage allocation optimizations (context) - Chase - 1988
14 Memory allocation and higherorder functions (context) - Danvy - 1987
12 Data Cache and Storage Control Units (context) - Hardell, Hicks et al. - 1990
11 Efficient stack allocation for tailrecursive languages (context) - Hanson - 1990
10 Some issues and strategies in heap management and memory hie.. (context) - Wilson - 1991
8 Characterization of object behaviour in Standard ML of New J.. (context) - Stefanovic, Eliot et al. - 1994
4 The buried binding and stale binding problems of LISP (context) - Baker - 1976
4 Technical Report PMG memo (context) - Augustsson, in et al. - 1989
4 Multiprocessing aspects of the PowerPC (context) - Allen, Becker - 1993
3 Re: stack scanning for generational g (context) - Doligez, Gonthier - 1994
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.princeton.edu.html): More
Communication Fault Tolerance in Parallel Computers - Sitaraman (1993) (Correct)
Extensible Security Architectures for Java - Wallach (1997) (Correct)
Finite Growth Models - Ristad, Yianilos (1997) (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