Malebolgia - Structured Concurrency for Nim

on YouTube ↗46m

" summary

Library Malebolgia adds a compile time spawn construct that enforces every parallel task eventually joins the main flow and it catches simple read write conflicts by macro inspection. Implementation uses a bounded thread pool and a bounded task queue with cancellation and timeouts to keep memory fixed for embedded targets. The codebase is compact (under 300 lines), combines with locks and lock free techniques, reports surprising wins on DFS and crawler benchmarks and therefore won benchmarks in some cases.

AI-written summary · about

" chapters (10)

1. 0:00Nim and Malebolgia intro
2. 6:50Thread pools with Malebolgia
3. 11:00Structured concurrency
4. 18:05Futures and data flow
5. 21:24Benefits of structured concurrency
6. 25:01Memory management concurrency
7. 31:50Compile-time conflict detection
8. 37:26Parallel map/reduce
9. 42:03Malebolgia design philosophy
10. 45:59Q&A

" related talks

• 52mBest Practices for ConcurrencyRainer Grimm · Meeting C++ 2018
• 01h 04mThe C++20 Synchronization LibraryBryce Adelstein Lelbach · Meeting C++ 2019
• 30mFearless concurrency in your microcontrollerJorge Aparicio · RustFest Zürich 2017
• 01h 04m[old version]The C++20 Synchrononization LibraryBryce Adelstein Lelbach · Meeting C++ 2019
• 42mNim Nuggets: Systems Programming & Metaprogramming MagicAditya Siram · Strange Loop 2021
• 01h 05mDecomposing a Problem for Parallel ExecutionPablo G Halpern · CppCon 2014
• 01h 08mWork Contracts - Rethinking Task Based Concurrency & Parallelism for Low Latency C++Michael A Maniscalco · CppCon 2024
• 48mConsiderations for choosing the parallel computing strategyDori Exterman · Meeting C++ 2015