Search Results for "allocator"
Sort By:
23 projects for "allocator" with 1 filter applied:
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
jemalloc
A general purpose malloc(3) implementation
jemalloc is a general purpose malloc(3) implementation that emphasizes fragmentation avoidance and scalable concurrency support. jemalloc first came into use as the FreeBSD libc allocator in 2005, and since then it has found its way into numerous applications that rely on its predictable behavior. In 2010 jemalloc development efforts broadened to include developer support features such as heap profiling and extensive monitoring/tuning hooks. Modern jemalloc releases continue to be integrated back into FreeBSD, and therefore versatility remains critical. ... -
2
VibeTensor
Our first fully AI generated deep learning system
VibeTensor is a groundbreaking open-source research system software stack for deep learning that was uniquely generated almost entirely by AI coding agents under guided human supervision, demonstrating a new frontier in AI-assisted software engineering. It implements a PyTorch-style eager tensor library with a modern C++20 core that supports both CPU and CUDA backends, giving it the ability to manage tensors, automatic differentiation (autograd), and complex computation flows similar to... -
3
VulkanSceneGraph
Vulkan & C++17 based Scene Graph Project
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... -
4
UAP Common Extensions (UCX)
Utilities Library for C
With this library we provide useful data structures and algorithms for common programming tasks in the C language. -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
libtdata
Libtdata is a C library implements trees, index allocation and bit ops
Libtdata is a small and portable C library implements a set of various search data structures, bit operations and index allocation. -
6
gatelib
A multiplatform library to program in C++ like in an hi-level language
-
7
...The memory model chosen is NUMA without pagination. During the initialization, the memory is divided proportionally for each processor installed on the system. When a thread needs memory, the memory allocator returns a free block of memory depending on which CPU the thread is running. In the same way, TORO can dedicate resources to specific processor, i.e. a FileSystem. This only CPU then can access to this instance of FileSystem. The scheduler is based on the cooperative threading model, therefore due to this design, TORO can migrate threads between CPUs and send messages between threads without using any lock instruction. ...
-
8
Shared Memory Arena
shared memory allocator
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 -
9
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.
-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
10
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.
-
11
Concur memory allocator
An extremely scalable multithreaded drop-in malloc() replacement
...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. -
12
-
13
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.
-
14
-
15
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.
-
16
-
17
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.
-
18
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
-
19
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.
-
20
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.
-
21
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.
-
22
STL allocator, implements shared memory allocation (for unix/linux systems). Enables sharing memory between processes, while still using the STL API.
-
23
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.
- Previous
- You're on page 1
- Next
