Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
The task is to speed up a summation by using parMap or parListChunk or better. It actually runs slower with parallelism code.
Edit: Facepalm.. I overlooked how to execute the application correctly.
Don’t forget to add cores by
./myHaskellApp paramaters +RTS -N4 -sstderr
Where N4 is number of cores.
Always make sure that you’re actually running
-threaded, optimzied with-O2, and you are using a reasonable number of cores (e.g.-N4). Furthermore, check your garbage collector statistics.