Abstract
dc:description.abstractThe 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.
Degree
thesis:*- Level thesis:degree_level
- Masters
- Department dc:contributor.department
- Computer Science
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2023
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Pinto, Elton Leander
- Advisor dc:contributor.advisor
-
- Sarkar, Vivek
- Committee members dc:contributor.committeemember
-
- Leijen, Daan
- Zhang, Qirun
- Orso, Alessandro
Subjects
dc:subject × 5Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/1853/72050