Reduced Circular Slice Buffer
Paavola, Antoni (2022)
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:amk-202205057475
https://urn.fi/URN:NBN:fi:amk-202205057475
Tiivistelmä
This paper is a study describing the combining of a circular buffer and a slice to minimize the use of instance variables and to further increase reliance on compile time information to reduce memory accesses. The paper undertakes an analysis on a theoretical as well as on a practical basis.
The study highlights the researcher’s former experiment as a reference implementation which describes a performant method for designing circular buffer solutions for both construction and usage. It involves a modified technique for using the virtual memory system to guarantee buffer position optimizations in usage.
A concurrent circular buffer based on the guidance of the reference implementation was created, benchmarked, and compared with other concurrent buffers within an open source community.
The results show that a circular buffer identical to a slice, which uses optimized custom techniques for circular buffering, can be achieved all while retaining the performance benefits of memory access based on the virtual memory system.
The study highlights the researcher’s former experiment as a reference implementation which describes a performant method for designing circular buffer solutions for both construction and usage. It involves a modified technique for using the virtual memory system to guarantee buffer position optimizations in usage.
A concurrent circular buffer based on the guidance of the reference implementation was created, benchmarked, and compared with other concurrent buffers within an open source community.
The results show that a circular buffer identical to a slice, which uses optimized custom techniques for circular buffering, can be achieved all while retaining the performance benefits of memory access based on the virtual memory system.