论文信息 - A Simple and Efficient Copying Garbage Collector for Prolog

A Simple and Efficient Copying Garbage Collector for Prolog

We show how to implement efficient copying garbage collection for Prolog. We measure the efficiency of the collector compared to a standard mark-sweep algorithm on several programs. We then show how to accomodate generational garbage collection and Prolog primitives that make the implementation more difficult.

Thomas Lindgren | Johan Bevemyr | Thomas Lindgren | Johan Bevemyr

[1] William J. Older,et al. An Incremental Garbage Collector for WAM-Based Prolog , 1992, JICSLP.

[2] Andrew W. Appel. A runtime system , 1990 .

[3] Chris J. Cheney. A nonrecursive list compacting algorithm , 1970, Commun. ACM.

[4] Olivier Ridoux,et al. Dynamic Memory Management for Sequential Logic Programming Languages , 1992, IWMM.

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

[6] Jacques Cohen,et al. Garbage Collection of Linked Data Structures , 1981, CSUR.

[7] F. Lockwood Morris,et al. A time- and space-efficient garbage compaction algorithm , 1978, CACM.

[8] Mats Carlsson,et al. Garbage Collection for Prolog Based on WAM (Revised version) , 1986 .

[9] Toshiyuki Hama,et al. A Light-Weight Prolog Garbage Collector , 1988, FGCS.

[10] Dan Sahlin. Making garbage collection independent of the amount of garbage , 1987 .

[11] Jonas Barklund,et al. Garbage Cut for Garbage Collection of Iterative Prolog Programs , 1986, SLP.

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

[13] Andrew W. Appel,et al. Simple generational garbage collection and fast allocation , 1989, Softw. Pract. Exp..