Optimizing Layout of Recursive Datatypes with Marmoset
Published in ECOOP 2024, 2024
Marmoset chooses data layouts for recursive algebraic datatypes based on how programs traverse them, improving access patterns and spatial locality. Benchmarks show speedups of 1.14x to 54x over the best prior work.
Recommended citation: Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni. (2024). "Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms + Data Layouts = Efficient Programs." ECOOP 2024, LIPIcs vol. 313, 38:1–38:28.
Download Paper
