Search: onr:"swepub:oai:DiVA.org:ri-21325" >
Garbage Collection ...
Garbage Collection for Prolog Based on WAM (Revised version)
-
Appleby, Karen (author)
-
- Carlsson, Mats (author)
- RISE,Computer Systems Laboratory
-
- Haridi, Seif (author)
- RISE,Computer Systems Laboratory
-
show more...
-
- Sahlin, Dan (author)
- RISE,SICS
-
show less...
-
(creator_code:org_t)
- 1
- Kista, Sweden : Swedish Institute of Computer Science, 1986
- English 32 s.
-
Series: SICS Research Report, 0283-3638 ; R86:09B
- Related links:
-
https://ri.diva-port... (primary) (Raw object)
-
show more...
-
https://urn.kb.se/re...
-
show less...
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Publication and Content Type
- vet (subject category)
- rap (subject category)
To the university's database