Change search
ReferencesLink to record
Permanent link

Direct link
Garbage Collection for Prolog Based on WAM (Revised version)
Number of Authors: 4
1986 (English)Report (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1986, 1. , 32 p.
SICS Research Report, ISSN 0283-3638 ; R86:09B
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14014OAI: diva2:1035297
Original report number 86009B. Revised report. (Also published in Communications of the ACM, June 1989, pp. 719-740.)Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(3304 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 3304 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link