Lennart Augustsson. Garbage collection in the ! ; g ?- machine. Technical Report PMG memo 73, Dept. of Computer Sciences, Chalmers University of Technology, Goteborg, Sweden, December 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Space-Efficient Closure Representations - Shao, Appel (1994) (40 citations) (Correct)
....and Jim [3] violate the rule. Most stack frame implementations also violate SSC, since dead variables remain in the frame until a function returns. This can be avoided by associating a descriptor with each return address, showing which variables are live; but this complicates the garbage collector [7, 8]. Obeying SSC can require extra copying of pointer values from an old closure that contains them (but also contains values not needed in a new context) into a new closure. One cannot simply zap the unneeded values in the old closure, since it is not known whether there are other references to ....
....registers in continuation passing style [6, 2] but our new algorithm does a much better job of it. Safe space complexity: The notion that certain compiler optimizations can cause space leaks by remembering too much is old, but only recently appreciated [9, 11, 2] The Chalmers Lazy ML compiler [8] and the SML NJ compiler [5] are the only ones we know of that guarantee space safety. Globalization: Local variables of different functions with nonoverlapping live ranges can be allocated to the same register or global without any save restore [18, 12] A stack of regions: Tofte and Talpin ....
Lennart Augustsson. Garbage collection in the ! ; g ?- machine. Technical Report PMG memo 73, Dept. of Computer Sciences, Chalmers University of Technology, Goteborg, Sweden, December 1989.
Compiling Standard ML For Efficient Execution On Modern Machines - Shao (1994) (14 citations) (Correct)
....frames. It is possible to allow dead variables in frames and closures, if the garbage collector knows they are dead. This can be accomplished using special descriptors, which would reduce the copying and sharing penalty for stack frames. For example, in the Chalmers Lazy ML compiler [Aug89] or the Gallium compiler [Ler92] associated with each return address is a descriptor telling which variables in the caller s frame are live after the return. 4 But this is not sufficient; heap closures still cannot point to stack frames. A fully flexible system must be able to let the stack ....
Lennart Augustsson. Garbage collection in the ! ; G ?-machine. Technical Report PMG memo 73, Dept. of Computer Sciences, Chalmers University of Technology, Goteborg, Sweden, December 1989.
An Empirical and Analytic Study of Stack vs. Heap Cost for.. - Appel, Shao (1994) (Correct)
....descriptors It is possible to allow dead variables in frames and closures, if the garbage collector knows they are dead. This can be accomplished using special descriptors, which would reduce the copying, sharing penalty for stack frames. For example, in the Chalmers Lazy ML compiler [10] or the Gallium compiler [24] for CAML, associated with each return address is a descriptor telling which variables in the caller s frame are live after the return. 3 But this is not sufficient; heap closures still cannot point to stack frames. A fully flexible system must be able to let the ....
Lennart Augustsson. Garbage collection in the ! ; g ?-machine. Technical Report PMG memo 73, Dept. of Computer Sciences, Chalmers University of Technology, Goteborg, Sweden, December 1989.
An Empirical and Analytic Study of Stack vs. Heap Cost for.. - Appel, Shao (1993) (Correct)
....descriptors It is possible to allow dead variables in frames and closures, if the garbage collector knows they are dead. This can be accomplished using special descriptors, which would reduce the copying and sharing penalty for stack frames. For example, in the Chalmers Lazy ML compiler (Augustsson, 1989) or the Gallium compiler (Leroy, 1992) associated with each return address is a descriptor telling which variables in the caller s frame are live after the return 5 . But this is not su#cient; heap closures still cannot point to stack frames. A fully flexible system must be able to let the ....
Augustsson, Lennart. 1989 (December). Garbage collection in the < #, g >-machine. Technical Report PMG memo 73, Dept. of Computer Sciences, Chalmers University of Technology, Goteborg, Sweden.
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