Perceus for OCaml
Author(s)
Pinto, Elton Leander
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
Abstract
The Perceus algorithm introduces a new approach for achieving automated reference counting with impressive performance capabilities. However, a direct comparison of this algorithm to a garbage collector within the same system has not been conducted, leading to an unresolved research question about whether Perceus can compete with state-of-the-art garbage collectors. In this thesis, I take a step towards answering this question by presenting an implementation of Perceus in OCaml, an industrial-strength programming language with a heavily fine-tuned and performant garbage collector. The implementation, as evaluated against the benchmark suite used in the Perceus paper, is competitive with the OCaml (version 4.14.0) garbage collector, motivating further exploration of this topic.
Sponsor
Date
2023-05-02
Extent
Resource Type
Text
Resource Subtype
Thesis