358 karma · joined January 17, 2009
When I originally set out to compare ND4J and Neanderthal, I've ran into the issue that I bottomed out at: they basically both call MKL (or Openblas) for BLAS operations.
For completeness sake, could you also provide some information about your machine specs and operating system (and if on linux your glibc and kernel version)?
https://github.com/treo/benchmarking_nd4j/blob/master/src/ma...
The difference is rather huge with the newer versions of nd4j.
While the numbers in the following gists do not contain the measurements I took for neanderthal, they do contain the numbers that I got for ND4J.
Without f ordering: https://gist.github.com/treo/1fab39f213da26255cf4f75e383ff90...
With f ordering: https://gist.github.com/treo/94fe92c9417b5c8b24baa12924a35b0...
As you can see something happened in the time between the 0.4 release (I took that as the comparison point since that was when I ran my own benchmarks the last time) and the 0.9.1 release that introduced additional overhead.
Originally I planned to create my own write-up on this, but I wanted to first to find out what happened there.
Given that ND4J is mainly used inside of DL4J and the matrix sizes it is used with usually are rather large, the performance overhead difference that I've observed there for tiny multiplications isn't necessarily that bad, as the newer version performs much better on larger matrices.
This are their current goals. They want to allow private copying. So selling the copy would still be illegal.
Concerning patents: "We reject patents unanimously onto organisms and genes on business ideas and also to software"
But if you take /dev/urandom you can get quite a bit more. On this system it is about 7Mbyte/s.
I could however replace the disk drive for another battery and have about 9 hours of run time with it.
It looks like they have killed everything but USA access.
Tried it today with a tpc-c trace which has about 500 million accesses. The result: CPython would have run for about 90 minutes (I stopped it after 30 minutes, and began to look for a speedier possibility), PyPy only took 22 minutes.
They describe how bayesian filtering works and how to use it to detect spam automatically.
What is HackerBuddy? HackerBuddy is a weekend project built using Ruby on Rails. It was built as a way to learn Rails, there is a very large chance that this site will collapse under the weight of it's own awkward code. If it does - sorry - I plan to improve it as I get better at coding in Ruby, please bear with me.