论文信息 - One Pass Real-Time Generational Mark-Sweep Garbage Collection - 字舞流文

One Pass Real-Time Generational Mark-Sweep Garbage Collection

Traditional mark-sweep garbage collection algorithms do not allow reclamation of data until the mark phase of the algorithm has terminated.

Joe L. Armstrong | Robert Virding | J. Armstrong | Robert Virding

[1] Thomas Johnsson,et al. Efficient compilation of lazy evaluation , 1984, SIGPLAN '84.

[2] Thomas Johnsson. Efficient compilation of lazy evaluation , 1984, SIGP.

[3] Paul R. Wilson,et al. Uniprocessor Garbage Collection Techniques , 1992, IWMM.

[4] Robert Virding. A Garbage Collector for the Concurrent Real-Time Language Erlang , 1995, IWMM.

[5] Frank Jackson,et al. Tenuring policies for generation-based storage reclamation , 1988, OOPSLA '88.

[6] Henry Lieberman,et al. A real-time garbage collector based on the lifetimes of objects , 1983, CACM.

[7] William M. Waite,et al. An efficient machine-independent procedure for garbage collection in various list structures , 1967, CACM.

[8] Lennart Augustsson,et al. A compiler for lazy ML , 1984, LFP '84.

[9] David A. Fisher,et al. Bounded Workspace Garbage Collection in an Address-Order Preserving List Processing Environment , 1974, Information Processing Letters.

[10] Guy L. Steele. Data Representations in PDP-10 MACLISP , 1977 .

[11] Joe Armstrong,et al. Concurrent programming in ERLANG , 1993 .

[12] S. L. Graham,et al. List Processing in Real Time on a Serial Computer , 1978 .

[13] Eiichi Goto,et al. Genetic Order and Compactifying Garbage Collectors , 1978, Inf. Process. Lett..