Closed 4 days ago.

Closed 4 days ago.

I have read many questions about this topic here, but still feel like the point is being missed by many answers I read.

This question already exists: Reliably checking if the OS can spawn a thread [closed] Closed 4 days ago. EDIT: Having figured it out (see my own answer), I get that the question text below is misleading, which caused a lot of misunderstanding. I still believe it might help somebody who has the same issue. Justification […]

I realize there are a lot of questions asking why multithreading can slowdown a program but it always seems to come down to threads aggressively locking shared state. In my case I’m not using any locks.

I realize there are a lot of questions asking why multithreading can slowdown a program but it always seems to come down to threads aggressively locking shared state. In my case I’m not using any locks.

I was under the impression that I could, in principle, do multi-threading with hundreds of threads simultaneously (regardless if it makes sense). But this code throws a std::system_error at memory location… when commenting in 16 “folders” (works still fine with 10) which corresponds to (only!) 16 threads:

I’m trying to learn threading in C++ and not able to understand why both threads are not running one after the other? After push, the mutex is unlocked and notified through condition variable.
Why is pop thread not executing at the point? It can access the queue as the mutex is unlocked and pop the inserted value. But instead what I’m seeing is that push thread runs till the queue is full and after that pop thread runs till the queue is empty.

I am learning multithreading.
I took the example for ‘Producer-Consumer Problem ‘ in Operating Systems Concepts by Silberschartz, Galvin and Gagne, and wrote it in C++.

this is the quit code: