SCHEDULING: A FAST C++ THREAD POOL IMPLEMENTATION CAPABLE OF EXECUTING TASK GRAPHS

Authors

  • Dmytro PUYDA Lviv Polytechnic National University

DOI:

https://doi.org/10.31891/csit-2025-1-9

Keywords:

multithreading, Chase-Lev deque, task graph, thread pool, work-stealing

Abstract

In this paper, the author presents a simple and efficient C++ thread pool implementation capable of executing task graphs. The conducted experiments demonstrate that the proposed solution achieves CPU performance comparable to Taskflow, a highly optimized library for parallel and heterogeneous programming. The implementation is small and straightforward, consisting of less than one thousand lines of C++ code at the time of writing this paper.

Downloads

Published

2025-03-27

How to Cite

PUYDA, D. (2025). SCHEDULING: A FAST C++ THREAD POOL IMPLEMENTATION CAPABLE OF EXECUTING TASK GRAPHS. Computer Systems and Information Technologies, (1), 73–78. https://doi.org/10.31891/csit-2025-1-9