I have a program which accepts 2 N
-digit numbers, multiplies them using threads & prints the output.
The number of threads created here are 2 * N - 1
.
whenever I run the program for N > 151
, the program gives me a segmentation fault.
Is there a cap on maximum number of threads a process can get from the thread pool?
If so, could this be a valid reason for the fault?
Edit:
Valgrind finds no memory leaks for N <= 150
.
I'm running the program in Linux 2.6.x kernel.