Home/ Questions/Q 8695931
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-13T01:09:33+00:00

problem : if i use mutex lock in thread, allocation slows down significantly, but

  • 0

problem : if i use mutex lock in thread, allocation slows down significantly, but im getting proper allocation, therefore – proper data structure.

if i dont use mutex lock, i get the allocation job done much faster in threads, but get corrupted data structure.

this is closely related to my previous post that had fully working code too (with improper usage of mutex lock).

c++ linked list missing nodes after allocation in multiple threads, on x64 linux; why?

ive tried three different allocators and they all seem to slow down if i use mutex lock and if i dont, data structure gets corrupted. any suggestions ?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    If multiple threads use a common data structure, e.g., some sort of memory pool, and there is at least one thread modifying the data structure, you need synchronization of some form. Whether the synchronization is based on atomics, mutexes, or other primitives is separate question.

    The memory allocation mechanisms provided by the standard library (operator new() and malloc() and the other members of their respective family) are thread-safe and you don’t need to do any additional synchronization. If you need to use memory allocation from a resource shared between multiple threads you create yourself you will have to synchronize even it becomes slower as a result.

    • 0