Search Results for "allocator" - Page 2

BTFF Features O(log n) time with First-Fit behavior, as n is the number of allocated & free blocks. No boundary tag. Separation between payload and bookkeeping meta data. It does not use any free payload area. As of v1.0, payloads are located in data segment area which is acquired by brk(), and bookkeeping meta data are located in separated area which is acquired by mmap(). Small bookkeeping meta data overhead. Applicable to any kind...

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.

The brownie Libraries is a collection of complementary concepts. The focus lies on the development of new concepts independently from concrete operating systems and programming languages plus providing a wide range of ports for different targets.

...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.

It is a share memory allocator. It can be used for parent and children progress allocate the share memory. In a allocated and fixed-length shared memory, ccmalloc manage the application anddestroy of different size of memory blocks

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.

Micro Heap is memory allocator for embedded systems without virtual memory / paging support.

LIfetime Bound Region Allocator for C++

Open source high-level synthesis system developed within the FP7 OSMOSIS project. Includes gcc-based SystemC front-end, database with browsing GUI, scheduler/allocator/binder, and Verilog back-end. (We are under migration to SVN server now)

Application level crossed-platform slab allocator implementation: fixed-allocating-time, automanual give memory back to os, address coloring to reduce bus-unbalance.

Fuzzy Traffic Shaper as bandwidth allocator based on connection reservation

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.

In all , I want to implement a slab cached memory management in application layer instead of linux kernel layer. That memory mechanism is to serve for one type of object which needs frequently allocating and deallocating.

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

Multimac is a linux virtual ethernet tap allocator to emulate and use multiple virtual interfaces (with different MAC addresses) on a LAN using a single network adapter

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.

STLshm provides an C++ STL Allocator implementation for creating and using STL containers (and any other allocator aware types) in shared memory regions. It supports multiple shared region implementations.

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

The Steel Allocator is a memory allocator. It is principally designed to have a low theoretical bound on memory waste--memory held from the system but not actually in use by the program. Performance and security are also taken into account.

Moved to http://labs.omniti.com/trac/portableumem/ A port of the Solaris libumem memory allocator to other platforms. It provides runtime creation of slabs with per-cpu caching to reduce cpu contention during memory allocation.

FifoEmbed: a thread-safe basic queue, packet queue, and FIFO allocator library

A Contiguous Memory Allocator Kernel Module for Linux that can be used for Large Contiguous Memory Allocations exceeding 128k. Uses a custom vmalloc to avoid using the normal vmalloc address space that might be used by others.

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