Search Results for "heap memory"

Agrona provides a library of data structures and utility methods that are a common need when building high-performance applications in Java. Many of these utilities are used in the Aeron efficient reliable UDP unicast, multicast, and IPC message transport and provides high-performance buffer implementations to support the Simple Binary Encoding Message Codec.

Perfetto is a production-grade tracing platform for Android, Linux, and Chrome that captures extremely detailed information about what a system is doing over time. It’s designed around a low-overhead producer/consumer model: instrumented components (“producers”) write binary events into shared memory buffers and a collector (“service”) reliably streams them to storage. The data model spans kernel and userspace, so you can stitch together CPU scheduling, app lifecycles, binder/IPC hops, GPU work, power and thermal signals, file I/O, heap samples, and more into a single coherent timeline. Perfetto’s ecosystem includes a web-based UI that can load multi-GB traces directly in the browser and an offline “trace processor” that exposes the trace as a queryable SQL-like table schema for deep analysis and automation. ...

Portable, stand-alone C libraries and data structures. Each folder is stand-alone with a single header/source pair in it. There is no build for libraries, just copy files you want. e.g If you want the logger, copy sc_log.h and sc_log.c to your project. High performance & minimal memory usage. Portability between many operating systems and architectures. Tests with 100% branch coverage and multiple sanitizers. Drag & drop source code distribution. There is 100% branch coverage on Linux....

...The design emphasises simplicity, compatibility, performance and minimal overhead: you still get a C-style char * string pointer, but you also get length tracking, safe memory management, and higher-level string operations. As a mature library, it is used in performance-sensitive contexts.

A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of...

This library implements a simple, lite and easy to use heap management library for embedded systems. Library includes APIs to reserve memory (malloc) and to free memory with a builtin garbage collector to defragment close area of memory freed