Compacting the Uncompactable
Offered By: Strange Loop Conference via YouTube
Course Description
Overview
Explore a groundbreaking solution to memory fragmentation in C/C++ programs in this 40-minute conference talk from Strange Loop. Dive into the world of Mesh, a revolutionary plug-in replacement for malloc that eliminates fragmentation in unmodified C/C++ applications through compaction. Learn how this innovative approach combines randomized algorithms with virtual memory operations to reduce memory consumption and improve performance in languages like C, C++, Ruby, and Python. Discover the challenges of working in an environment where allocated object addresses are directly exposed to programmers and how Mesh overcomes these obstacles. Examine real-world examples of Mesh's impact, including significant memory reductions in Firefox and Redis. Gain insights into ongoing efforts to incorporate Mesh's approach into existing allocators like jemalloc. Follow along as Bobby Powers, a PhD candidate from the University of Massachusetts Amherst, guides you through the intricacies of memory management, garbage collection, and the future of efficient software development.
Syllabus
Introduction
The Impossible Dreams
Memory fragmentation
Real enemies
Garbage collection
Whats a pointer
Mesh
Challenges
Mechanism
Randomization
Meshing
Split Measure
Split Master
Links
Questions
Limitations
Cache Coherency
Summary
Taught by
Strange Loop Conference
Tags
Related Courses
Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsStanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera Biology Meets Programming: Bioinformatics for Beginners
University of California, San Diego via Coursera Finding Hidden Messages in DNA (Bioinformatics I)
University of California, San Diego via Coursera Algorithms for Big Data
Indian Institute of Technology Madras via Swayam