Search Results for "shared memory allocator"
Sort By:
Showing 61 open source projects for "shared memory allocator"
View related business solutions-
Paessler: Easy to Use With Enterprise Power. Free TrialYou shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
1
codebase-memory-mcp
High-performance code intelligence MCP server
...It is built for speed, with average repositories indexed in milliseconds and structural queries answered in under one millisecond. It ships as a single static binary for macOS, Linux, and Windows with no shared library dependencies. It also includes semantic search, BM25 search, graph visualization, auto-indexing, and cross-repository intelligence. -
2
yyjson
The fastest JSON library in C
A high-performance JSON library written in ANSI C. -
3
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... -
4
OpenGL Mathematics
Highly Optimized Graphics Math (glm) for C
...Euler angles was implemented in reverse order (extrinsic) it was fixed, now they are intrinsic. Make sure that you have the latest version. vec4 and mat4 variables must be aligned. (There will be unaligned versions later). cglm doesn't alloc any memory on heap. So it doesn't provide any allocator. You should alloc memory for out parameters too if you pass pointer of memory location. -
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
5
crun
A fast and lightweight fully featured OCI runtime and C library
A fast and low-memory footprint OCI Container Runtime fully written in C. While most of the tools used in the Linux containers ecosystem are written in Go, I believe C is a better fit for a lower-level tool like container runtime. runc, the most used implementation of the OCI runtime specs written in Go, re-execs itself and uses a module written in C for setting up the environment before the container process starts. crun aims to be also usable as a library that can be easily included in... -
6
Unified Communication X
Communication framework for data-centric high-performance applications
...UCX exposes a set of abstract communication primitives which utilize the best of available hardware resources and offloads. These include RDMA (InfiniBand and RoCE), TCP, GPUs, shared Memory, and network atomic operations. UCX facilitates rapid development by providing a high-level API, masking the low-level details, while maintaining high-performance and scalability. UCX implements best practices for transfer of messages of all sizes, based on accumulated experience gained from applications running on the world’s largest datacenters and supercomputers. -
7
DSVPN
A dead simple VPN
DSVPN is a Dead Simple VPN, designed to address the most common use case for using a VPN. Runs on TCP. Works pretty much everywhere, including on public WiFi where only TCP/443 is open or reliable. Uses only modern cryptography, with formally verified implementations. Small and constant memory footprint. Doesn't perform any heap memory allocations. Small (~25 KB), with an equally small and readable code base. No external dependencies. Works out of the box. No lousy documentation to read. No... -
8
WASTE
Run the full 2.78-trillion-parameter Kimi K3 model
WASTE is an embeddable C inference engine for running extremely large mixture-of-experts models when the weights exceed available RAM. It keeps the shared model trunk in memory and streams only the experts selected for each token from fast NVMe storage. A bounded cache reuses recently needed experts, while lookahead routing begins disk reads before the next layer requires them. Its main target is the full 2.78-trillion-parameter Kimi K3 model, including multimodal image input. The engine has no third-party runtime dependency on its CPU inference path and exposes both a CLI and C library. ... -
9
shmcat
A tool to dump shared memory segments, files and text
This is a simple tool that dumps shared memory segments (System V and POSIX), files and text. It might be useful when you have to debug programs that use shared memory. -
Veeam Data Platform v13.1Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
10
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. -
11
librsb
A shared memory parallel sparse matrix library including Sparse BLAS.
librsb is a library for sparse matrix computations featuring the Recursive Sparse Blocks (RSB) matrix format. This format allows cache efficient and multi-threaded (that is, shared memory parallel) operations on large sparse matrices. The most common operations necessary to iterative solvers are available, e.g.: matrix-vector multiplication, triangular solution, rows/columns scaling, diagonal extraction / setting, blocks extraction, norm computation, formats conversion. The RSB format is especially well suited for symmetric and transposed multiplication variants. ... -
12
BMDFM
Binary Modular DataFlow Machine (BMDFM)
Binary Modular DataFlow Machine (BMDFM) is a software package that enables running an application in parallel on shared memory symmetric multiprocessing (SMP) computers using the multiple processors to speed up the execution of single applications. BMDFM automatically identifies and exploits parallelism due to the static and mainly dynamic scheduling of the dataflow instruction sequences derived from the formerly sequential program. The BMDFM dynamic scheduling subsystem performs a symmetric multiprocessing (SMP) emulation of a tagged-token dataflow machine to provide the transparent dataflow semantics for the applications. ... -
13
minicoro
Single header stackful cross-platform coroutine library in pure C
Minicoro is a single-file library for using asymmetric coroutines in C. The API is inspired by Lua coroutines but with C's use in mind. The project is being developed mainly to be a coroutine backend for the Nelua programming language. The library assembly implementation is inspired by Lua Coco by Mike Pall. -
14
Emerald
An operating system written in C
emerald is a minimalistic Unix-like operating system kernel developed for x86_64 systems, focused on being lightweight, modular, and understandable. Written in C and assembly, emerald serves as a learning tool for OS enthusiasts who want to explore kernel design from scratch. It includes basic components such as multitasking, paging, interrupts, and system calls, while maintaining a clear and concise codebase. Emerald is a strong starting point for building more complex systems or... -
15
libaco
A blazing fast and lightweight C asymmetric coroutine library
...The benchmark part shows that a context switch between coroutines only takes about 10 ns (in the case of the standalone stack) on the AWS c5d.large machine. User could choose to create a new coroutine with a standalone stack or with a shared stack (could be shared with others). It is extremely memory-efficient, 10,000,000 coroutines simultaneously to run cost only 2.8 GB physical memory (run with tcmalloc, each coroutine has a 120B copy-stack size configuration). The phrase "fastest" in above means the fastest context switching implementation which complies to the Sys V ABI of Intel386 or AMD64. -
16
Lists all the processes, executables, and shared libraries that are using up virtual memory. It's helpful to see how the shared memory is used and which 'old' libs are loaded.
-
17
This is a collection of libraries contained : Shared memory allocation, configuration script processor, containers (trees, lists, queues, stacks), file system abstraction, network library, timers/threads, Image library, Display libraries, and more.
-
18
libshmal
Primitive shared memory allocator that allows several independent proc
Primitive shared memory allocator that allows several independent processes to share same shared memory segments. It provides shared memory analogs to regular memry library calls like malloc(), free(), etc. Currently may work with mmap() or shmget(). -
19
Coroutine
A asymmetric coroutine library for C
Coroutine is a small asymmetric coroutine library written in C. It is inspired by Lua-style coroutine behavior and uses a schedule-based model. Developers first open a schedule, create coroutines inside it, and then resume them from the same thread that opened the schedule. Coroutines in the same schedule share the stack, which makes it possible to create many coroutines without heavy memory overhead. The project is useful for C developers who want cooperative multitasking without depending... -
20
ipc-quartztime
inter process communication library based on POSIX
ipc-quartztime is an inter process communication library based on shared memory, mutexes and signals. ipc-quartztime is intended for high-speed and high-throughput communication between processes. -
21
SWIFT
SPH With Inter-dependent Fine-grained Tasking
Shared-Memory Parallel Smoothed Particle Hydrodynamics (SPH) code for large-scale cosmological simulations. -
22
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 -
23
MDcore is an Open-Source library implementing the core functionality of a Molecular Dynamics engine. The engine is inherently multi-threaded and runs efficiently on multi-processor/multi-core shared-memory architectures.
-
24
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.
-
25
The Safe C Library provides bound checking memory and string functions per ISO/IEC TR24731. These functions are alternative functions to the existing standard C library that promote safer, more secure programming. The ISO/IEC Programming languages — C spec, C11, now includes the bounded APIs in Appendix K, "Bounds-checking interfaces". This latest upload supports building static library, a shared library and a linux kernel module.
