Awesome GitHub RepositoriesAlocatoare de memorie

This project is a comprehensive technical interview preparation resource and computer science interview guide. It serves as an educational reference for developers to study core software engineering fundamentals and common coding patterns required for employment screenings. The repository provides detailed guides and references covering data structures and algorithms, networking and security, operating systems, and web development. It specifically focuses on the implementation and complexity analysis of sorting, searching, and graph algorithms. The material encompasses a wide breadth of comp

Mimalloc is a general purpose dynamic memory allocator for C and C++ designed to increase execution speed and reduce fragmentation. It functions as a scalable heap manager that replaces standard library allocation functions to improve performance and memory efficiency across applications. The project distinguishes itself as both a heap security hardener and a memory corruption detector. It employs randomized allocation, encrypted free lists, and sampled guard pages to mitigate heap exploits and identify buffer overflows or use-after-free errors during runtime. The allocator provides capabili

This project is a technical reference and documentation suite focused on the internal architecture and operational principles of the Java Virtual Machine. It provides comprehensive guides and analysis on how the virtual machine manages class loading, memory organization, and bytecode execution. The documentation distinguishes itself by providing deep dives into specific runtime mechanisms, such as the binary decoding of class files, the hierarchical delegation model for class loaders, and the precise sequence of the loading, linking, and initialization lifecycle. It also details memory reclam

jemalloc is a general purpose C memory allocator designed as a replacement for the standard library malloc and free functions. It is a multi-threaded allocation library that emphasizes fragmentation avoidance and scalable concurrency for high-performance applications. The project reduces lock contention by using multiple independent memory arenas and thread-local cache layers. It minimizes latency by offloading the reclamation of unused memory pages to asynchronous background threads and utilizes huge page metadata storage to reduce translation lookaside buffer misses. The system includes a

LMCache is a distributed key-value cache manager and tiering system designed to accelerate large language model inference. It functions as a tiered storage layer that offloads tensors from GPU memory to CPU RAM, local disks, or remote object stores, enabling the reuse of cached prefixes across different inference sessions and serving engines. The system differentiates itself through a disaggregated prefill-decode model, which separates prompt processing from token generation by transferring caches between distributed compute nodes. It utilizes peer-to-peer orchestration to share and retrieve

996.Leave is an open-source, community-maintained guide that helps tech workers compare work conditions, salaries, cost of living, and legal protections across different countries to inform international relocation decisions. The project stores each country's information as a Markdown file, which is rendered into a pre-built HTML page through static site generation, making the content fast to load and simple to host. The guide provides structured comparisons across a wide range of factors that matter to tech professionals considering a move abroad. These include annual leave entitlements, tax

RediSearch is a Redis module that adds secondary indexing, full-text search, aggregation, and vector similarity search directly into the in-memory data store. It operates as an in-process search engine, extending the core key-value store with capabilities for indexing hash and JSON documents, enabling fast field-level lookups beyond primary key access. The module provides a full-text search engine built on inverted indexes, supporting stemming, fuzzy matching, and relevance scoring via tf-idf. It also includes a vector similarity search engine using a Hierarchical Navigable Small World graph

Torchtune is a PyTorch-native library for fine-tuning, aligning, and quantizing large language models. It provides a configurable training pipeline orchestrated through YAML recipes, with CLI overrides and component swapping, distributed training via FSDP2, memory optimizations, and parameter-efficient fine-tuning methods like LoRA, DoRA, and QLoRA. The library distinguishes itself through its YAML-driven configuration system that defines all training parameters and instantiates components from config files, with full CLI override capability for any field or component at launch time. It suppo

Torchtune is a PyTorch-native library for fine-tuning, aligning, and quantizing large language models. It provides a config-driven system for instantiating components, orchestrating distributed training, and managing parameter-efficient fine-tuning with quantization support, all through YAML-based configurations and command-line overrides. The library distinguishes itself through its comprehensive post-training workflow orchestration, combining supervised fine-tuning, preference optimization (DPO, PPO, GRPO), knowledge distillation, and quantization-aware training in a single configurable pip

InterviewGuide is a comprehensive technical interview preparation platform that covers the full spectrum of software engineering recruitment, from foundational computer science concepts through to offer negotiation. It provides structured learning paths across algorithms, operating systems, databases, networking, and programming languages, with a particular emphasis on C++ and Go. The platform aggregates real interview experiences and company-specific questions from major tech employers, offering candidates a searchable database of past written exam problems and detailed accounts of actual int

Carp is a statically typed Lisp compiler that compiles Lisp-like syntax directly to C source code, enabling seamless integration with existing C libraries and low-level system programming. It manages memory deterministically at compile time using ownership tracking and linear types, eliminating garbage collection pauses and runtime overhead while ensuring type safety through an inferred static type system. The language distinguishes itself through compile-time macro expansion and metaprogramming capabilities, allowing code generation and transformation before final binary output. It enforces

This is an open-source, crowd-sourced wiki textbook that teaches Linux system programming in C. It covers the core operating system concepts of process management through the fork-exec-wait model, dynamic memory allocation using implicit free list heap allocators, inode-based file systems, inter-process communication via pipes and shared memory, POSIX threads with synchronization primitives, signal-based asynchronous notification, virtual memory with page table translation, and runtime diagnostics using Valgrind and GDB. The textbook distinguishes itself by providing practical, implementation

Highway este o bibliotecă C++ portabilă și un strat de abstractizare hardware conceput pentru scrierea codului de tip SIMD (Single Instruction Multiple Data). Oferă o interfață unificată care mapează logica de procesare paralelă a datelor către diverse seturi de instrucțiuni CPU, permițând dezvoltarea de software de înaltă performanță care rulează pe diferite arhitecturi de procesoare fără a necesita assembly specific arhitecturii. Proiectul dispune de un dispecer dinamic de instrucțiuni care selectează cel mai eficient set de instrucțiuni CPU la runtime, pe baza hardware-ului detectat. De asemenea, suportă specializarea statică a țintei și mecanisme extensibile pentru adăugarea de noi ținte hardware sau operații SIMD personalizate. Biblioteca acoperă o gamă largă de operații vectoriale, inclusiv aritmetică pe elemente, reducerea benzilor, shuffling și execuție condiționată mascată. Include o bibliotecă matematică vectorizată, un manager de memorie pentru alocare aliniată și operații de load-store mascate, precum și primitive pentru criptografie accelerată hardware. Sunt oferite instrumente pentru compilarea și validarea automată a instrucțiunilor accelerate hardware pe mai multe arhitecturi de procesoare.

Luau is a high-performance programming language evolved from Lua 5.1. It consists of a bytecode virtual machine, an embeddable scripting engine, and a static code analyzer designed to provide a secure, sandboxed execution environment for host applications. The project is distinguished by its gradual typing system, which combines automatic type inference with optional manual annotations to detect bugs without requiring full static typing. It also features native vector mathematics for high-performance operations and a specialized debugging system that uses bytecode patching to minimize executi

Perfetto is a platform for system-level performance tracing and analysis on Linux and Android. It combines a high-throughput trace recorder, a SQL-based query engine, and a browser-based visualizer into a single toolchain. The platform covers CPU scheduling and call-stack profiling, native and Java heap memory allocation tracking, GPU and graphics events, and system-wide counters such as CPU frequency and power consumption. The architecture decouples trace recording from offline analysis, using a compact protobuf format for event encoding and columnar storage for efficient SQL queries. The we

Tcmalloc este un alocator de memorie C++ de înaltă performanță și o bibliotecă de runtime concepută pentru a gestiona memoria heap pentru servicii la scară largă. Acesta funcționează ca un alocator de memorie cu thread-caching care reduce lock contention-ul în aplicațiile multi-threaded pentru a menține stabilitatea și performanța în timpul sarcinilor de lucru concurente. Proiectul se concentrează pe alocarea memoriei cu concurență ridicată și scalarea aplicațiilor multi-threaded. Utilizează o strategie de furnizare a cache-urilor per-thread pentru a asigura accesul rapid la memorie și a îmbunătăți throughput-ul programelor paralele în medii de programare de sistem low-level. Biblioteca gestionează memoria prin alocare la nivel de pagină, binning pe clase de dimensiune și metadate bazate pe span pentru a minimiza fragmentarea. Utilizează o listă centrală de elemente libere și căi rapide lock-free pentru a gestiona cererile de memorie pe mai multe thread-uri de execuție.

Magnum este o suită de middleware C++ pentru dezvoltarea grafică cross-platform și vizualizarea datelor în timp real. Oferă un strat de randare hardware-agnostic care traduce comenzile grafice în apeluri specifice platformei, asigurând un comportament consistent între diferite drivere GPU și API-uri precum Vulkan. Proiectul se concentrează pe decuplarea logicii aplicației de hardware-ul subiacent prin utilitare grafice și de sistem abstracte. Dispune de un importator de resurse bazat pe plugin-uri pentru active 3D și audio, un graf de scenă ierarhic pentru transformări spațiale și un sistem de evenimente bazat pe semnale de înaltă performanță pentru comunicare. Capabilitățile largi includ algebra liniară și matematica vectorială, procesarea geometriei mesh și gestionarea contextelor GPU. Toolkit-ul acoperă, de asemenea, redarea audio spațială, integrarea hardware-ului VR și optimizări de memorie de nivel scăzut, cum ar fi layout-urile strided și alocările aliniate. Biblioteca poate fi integrată în proiectele părinte ca un subproiect CMake.

c3c is the compiler for the C3 programming language, transforming source code into executable binaries, static libraries, or dynamic libraries using an LLVM backend. It implements a system based on result-based error handling, scoped memory pooling, and a semantic macro system. The compiler provides first-class support for hardware-backed SIMD vectors that map directly to processor instructions and enables runtime polymorphism through interface-based dynamic dispatch. The project covers a broad set of low-level capabilities, including manual and pooled memory management, inline assembly inte

This repository is a comprehensive collection of fully worked solutions to exercises and problems from the standard algorithms textbook by Cormen, Leiserson, Rivest, and Stein (CLRS). It serves as an educational reference for algorithm design and analysis, providing step-by-step reasoning, pseudocode, and mathematical proofs for a wide range of topics. The content spans core computer science areas: algorithm analysis with asymptotic notation, recurrence solving, and amortized cost analysis; data structure implementation and operations for binary search trees, red-black trees, B-trees, Fibonac