Implementation Specifics of Lock-Free Containers for High Loaded Multithreaded Applications

The paper is devoted to lock-free programming, especially implementation of containers with multiple consumers for parallelized socially oriented systems. General and technical actuality of specified containers are discoursed. Some solutions based on stated approach were investigated and implemented, particularly stack and queue. Provided comparative analysis for lock-based and lock-free elucidations via solving multi-criteria decision problem using "performance", "stability", and "load balancing" for each consumer as target indicators. Obtained results determined potential usage of described method for high loaded systems, where performance indicator assumed as dominant.