3 ms·
I compared the time it takes to run both scripts, with 10000000 iteration. 1m32s for the Python version and only 29s for the J's. If an algorithm is paralleli
by libx 9y ago
I compared the time it takes to run both scripts, with 10000000 iteration. 1m32s for the Python version and only 29s for the J's.
If an algorithm is parallelizable, does J use all cores of a CPU?
- ghosthamlet 9y agoThanks, i didn't know the performance of j is so good. But Sorry, i am not very skilled in J, just a beginner, so have no idea if it use all cores of CPU.
- ghosthamlet 9y agoit run fast may be as the optimized j interpreter: http://code.jsoftware.com/wiki/Guides/AVX http://code.jsoftware.com/wiki/Guides/AVX, and indeed J may use all cores of CPU in some situations, you can see: http://code.jsoftware.com/wiki/User:Devon_McCormick http://code.jsoftware.com/wiki/User:Devon_McCormick, http://code.jsoftware.com/wiki/NYCJUG/2010-03-09#Parallel-Programming_Projects_on_the_J_Wiki http://code.jsoftware.com/wiki/NYCJUG/2010-03-09#Parallel-Pr... http://code.jsoftware.com/wiki/NYCJUG/2010-04-14/ExampleConvertingJCodetoUseMultipleCores http://code.jsoftware.com/wiki/NYCJUG/2010-04-14/ExampleConv...