REDUCING THE VULNERABILITY LEVEL OF GARBAGE COLLECTION USING ARENA ALLOCATOR

Read full text Summarise with VIRAT
Authors: Myroslav Shpak, Oleg, Yurii Shcheblanin
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Memory allocation is substantially overcomplicated with commonly used self-managing background systems like: garbage-collection, smart pointers and RAII. Oftentimes these systems and memory allocation paradigms cause performance and safety issues. In most scenarios (projects) a decent alternative to said allocation paradigms can be used to avoid the performance hit that garbage-collection and smart pointers can impose on the made software, and greater control can be achieved that can help avoid possible safety risks in between prune-and-sweep clean intervals of garbage collection. Arena allocator is a pretty appealing allocation strategy that has relatively few mentions despite all the said benefits. With very concise implementation, Arenas can be very handy and make memory management trivial while keeping full control in hands of the developer. Arenas can be widely used in almost any project that revolves around real-time systems, user oriented software or inside highly optimized systems such as compilers.

Fields of Study & Subjects

Logic programming and type systems Parallel Computing and Optimization Techniques Real-Time Systems Scheduling

Publication details

Journal / source
Cybersecurity Education Science Technique
Volume
4
Issue
32
Pages
550–550
Publication date
26 March 2026
Language
EN