A Lock-Free Work-Stealing Algorithm for Bulk Operations
This paper presents a specialized lock-free work-stealing queue designed for a master-worker framework in mixed-integer programming solvers that leverages restricted concurrency assumptions to support native bulk operations and achieve constant-latency push performance, significantly outperforming general-purpose implementations like C++ Taskflow in batch processing scenarios.