Authors:

Qingyuan Li

Date Created:

Not specified

Course Title:

Professor:

Not specified

About Paper:

A pointer-based data structure usually means every single node would be allocated randomly in memory. Although this approach is ubiquitous, it might be inefficient in some cases. Especially when we need to traverse most of the tree in bulk. In that situation, using a packed representation could provide improvements on both time and space usage. However, it would be difficult and error prone for a programmer to write code that uses packed representation. Therefore, the Gibbon Compiler was introduced to automatically transform programs written in high-level programming language (a subset of Haskell) into C code that uses packed representation. Although there is evidence showing the advantage of Gibbon's packed representation over the regular compilers, providing more benchmarks would be necessary to strengthen it. Therefore, we propose a movie review microservice benchmark to evaluate the efficiency of Gibbon's packed mode. We will compare the performance of Gibbon's packed mode with Gibbon's pointer mode, as well as the Glasgow Haskell Compiler(GHC) over a variety of traversals performed by the microservice benchmark.

Source:

Purdue University / 2023

Topics:

No topics listed

Co-authors:

Qingyuan Li