Дослідження часу виконання паралельної програми із застосуванням різних засобів синхронізації

Abstract

The paper examines the effectiveness of various synchronization methods for solving the mutual exclusion problem in parallel computing systems using C#. The theoretical aspects of the "race condition" problem are analyzed and methods for its elimination are investigated. A software implementation based on the "Strategy" pattern is created to compare the performance of Monitor, Mutex, SpinLock, and Interlocked. Experimental results revealed the dependence of execution time on the selected synchronization tool and the number of threads.