Implementing Wait-Free Space Bounded Shared Memory Primitives on Concurrent Systems

Learn how to implement wait-free space bounded shared memory primitives on concurrent systems in this 36-minute conference talk by Phillipp Woefel from the University of Calgary, presented at the Simons Institute. Explore the theoretical foundations and practical approaches for designing memory management systems that guarantee progress without blocking in concurrent computing environments. Discover techniques for creating shared memory primitives that operate within bounded space constraints while maintaining wait-free properties, ensuring that all processes can complete their operations regardless of the scheduling or timing of other concurrent processes. Gain insights into the challenges of memory management in parallel systems and understand how wait-free algorithms can provide strong guarantees for system reliability and performance in multi-threaded applications.