Incremental copying garbage collection for WAM-based Prolog systems
| dc.creator | Vandeginste, Ruben | |
| dc.creator | Demoen, Bart | |
| dc.date | 2006-01-02 | |
| dc.date.accessioned | 2026-07-07T06:57:52Z | |
| dc.date.available | 2026-07-07T06:57:52Z | |
| dc.description | The design and implementation of an incremental copying heap garbage collector for WAM-based Prolog systems is presented. Its heap layout consists of a number of equal-sized blocks. Other changes to the standard WAM allow these blocks to be garbage collected independently. The independent collection of heap blocks forms the basis of an incremental collecting algorithm which employs copying without marking (contrary to the more frequently used mark© or mark&slide algorithms in the context of Prolog). Compared to standard semi-space copying collectors, this approach to heap garbage collection lowers in many cases the memory usage and reduces pause times. The algorithm also allows for a wide variety of garbage collection policies including generational ones. The algorithm is implemented and evaluated in the context of hProlog. | |
| dc.description | 33 pages, 22 figures, 5 tables. To appear in Theory and Practice of Logic Programming (TPLP) | |
| dc.identifier | https://arxiv.org/abs/cs/0601003 | |
| dc.identifier | http://arxiv.org/abs/cs/0601003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/107133 | |
| dc.subject | Programming Languages | |
| dc.title | Incremental copying garbage collection for WAM-based Prolog systems | |
| dc.type | text |