Алгоритми без очікування

Abstract

This work explores the concept of wait-free algorithms as a subset of non-blocking synchronization and their advantages and disadvantages in parallel programming. The Kogan-Petrank queue is used as a specific example to illustrate the features of wait-free algorithms. Also this work describes their general development in different periods of time. This work discusses the scalability and reliability of non-blocking algorithms and the potential for further optimization. Overall, this work suggests that wait-free algorithms have the potential to outperform synchronization-based algorithms in productivity without waiting.