Abstract
The issue of shared data usage by threads is especially relevant in modern multi-core and multiprocessor systems. The main problems of implementing multithreaded programs are race conditions, deadlocks, and thread starvation. The aim of the work is to solve the problem of thread racing in multithreaded calculations of resource-intensive tasks with parallel access to shared data using appropriate synchronization mechanisms, such as mutexes. A multithreaded algorithm for implementing a typical task of processing large data arrays with protection of the critical area in concurrent programs running on multiprocessor and multi-core systems has been developed and researched.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
