Garbage Collection for Prolog Based on WAM (Revised version)

Original report number 86009B. Revised report. (Also published in Communications of the ACM, June 1989, pp. 719-740.)
Warren Abstract Machine (WAM) has become a generally accepted standard Prolog implementation technique. Garbage collection is an important aspect in the implementation of any Prolog system. We first present a synopsis of the WAM and then show marking and compaction algorithms that take advantage of WAM's unique use of the data areas. Marking and compaction are performed on both the heap and the trail. The marking and compaction algorithms use pointer reversal techniques, which obviate the need for extra stack space. However, two bits for every pointer on the heap are reserved for the garbage collection algorithm. The algorithm can work on segments of the heap, which may lead to a significant reduction of the total garbage collection time. The time of the algorithms are linear in the size of the areas.

Carlsson, MatsRISE,Computer Systems Laboratory(Swepub:ri)MatsCa@ri.se (författare)
Haridi, SeifRISE,Computer Systems Laboratory(Swepub:ri)SeifHa@ri.se (författare)
Sahlin, DanRISE,SICS (författare)
RISEComputer Systems Laboratory (creator_code:org_t)

Av författaren/redakt...: Appleby, Karen; Carlsson, Mats; Haridi, Seif; Sahlin, Dan

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.