Concurrency Hylomorphism
summary
Prototype implements a structured-concurrency model for Hylo (and a C++ library) that uses spawn/await primitives and stackful coroutines (boost::context) to allow stack-accessible tasks and thread-hopping rather than blocking. Claims: no deadlocks and no data races when following exclusivity rules. Benchmarks: Skynet (10M bottom tasks) runs ~2.4s in Go, 1.3–1.9s in the C++ prototype and sender/receiver is ~20% faster than the structured variant; Mandelbrot scaling hits ~95% up to 12 cores. Missing: copyable futures, richer cancellation and IO affinities.
AI-written summary · about
chapters (9)
- 0:00Concurrency hylomorphism intro
- 3:26Hilo language origins
- 10:33Concurrency theory and practice
- 13:24Code examples for concurrency
- 21:23Structured concurrency
- 29:31Thread hopping and coroutines
- 40:00Early performance
- 49:32Concurrency model analysis
- 1:08:23Takeaways and future
related talks
01h 02m“Parallelism in Modern C++"
01h 02mAsynchronous Programming in Modern C++
01h 16mConcurrency Approaches: Past, Present, and Future
54mStructured Concurrency: Hierarchical Cancellation & Error Handling
01h 21mStructured Concurrency
25mResponsive Parallelism with Synchronization
01h 02mStructured Concurrency: Managing the Hierarchical Cancelation and Error Handling
01h 32mCoroutines and C++ DSLs for Human Scale Concurrency