Search Results for "allocator"

VulkanSceneGraph (VSG), is a modern, cross-platform, high-performance scene graph library built upon Vulkan graphics/compute API. The software is written in C++17 and follows the CppCoreGuidelines and FOSS Best Practices. The source code is published under the MIT License, with the exception of vulkan.h, used for Vulkan extensions, which is under Apache License 2.0. This repository contains C++ headers and source and CMake build scripts to build the libvsg library. Additional support...

With this library we provide useful data structures and algorithms for common programming tasks in the C language.

Libtdata is a small and portable C library implements a set of various search data structures, bit operations and index allocation.

a shared memory allocator that provides a simple interface for named shared memory segments; shared memory between any processes; provides shared memory queues; does not use the same address between processes; fast structured arena file scales well

Hoard is a multiprocessor memory allocator that is fast, memory-efficient, and scalable. If you are running multithreaded code on a multiprocessor system, Hoard can dramatically improve your application's performance without any changes to your source.

...More scalable and memory efficient than mtmalloc, ptmalloc, Hoard, etc. Allocations are very fast, with no lock contention and the least memory waste of any other allocator. Concur is optimized especially for applications that make heavy use of memory allocation in a threaded environment, or that just want to make the best use of every ounce of available memory. Just plugs right into your existing application without modification! The new 2.0 update includes a variety of new optimizations to make Concur even more memory efficient.

An O(1) memory allocator, which may be used to replace malloc. It's very small and very fast.

A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.

This was my first attempt at a persistent (disk-based) allocator, but I aimed too high, used too many obscure C++ features and it got away from me. You will need the version of v3c mentioned in configure.ac.in to build it. Like I said, it contains lots of really obscure C++, if you're curious. This project isn't being actively maintained anymore - see it's way-cooler C/C++ replacement here at SourceForge - treedb.

SHAllocator is C++ STL allocator in SYSTEM V shared memory based on libmm.

One approach to constructing fast queues is to construct a mechanism for using shared memory appropriate containers in C++ as templates. There are three main components: the shared segment of memory, an allocator of memory chunks and the queue itself.

OS portable common dynamic / static memory allocator for embedded system. Auto-converge, keep track of free chunks list, first-fit allocating principle. All of these are done by only 4-Byte boundary tag in each chunk - Fast & Minimal Memory Fragmentation

STL allocator, implements shared memory allocation (for unix/linux systems). Enables sharing memory between processes, while still using the STL API.

A Pooled, Shared Memory allocator for the C++ Standard Template Library (STL). Allows processes to share an STL container class to facilitate control and communications between the connected processes.