On Wednesday, 3 June 2020 at 15:55:53 UTC, data pulverizer wrote:
On Wednesday, 3 June 2020 at 14:34:02 UTC, Mike Parker wrote:
Some of you may have seen a draft of this post from user "data
pulverizer" elsewhere on the forums. The final draft is now
on the D Blog under his real name and ready for your perusal.
The blog:
https://dlang.org/blog/2020/06/03/a-look-at-chapel-d-and-julia-using-kernel-matrix-calculations/
Reddit:
https://www.reddit.com/r/programming/comments/gvuy59/a_look_at_chapel_d_and_julia_using_kernel_matrix/
I'll be posting on HN, too, but please don't share a direct
link. I did some digging around and it really does affect the
ranking -- your upvotes won't count.
Very excited and proud to have my first D article. I'm on
reddit now but people can ask me anything here also.
Cheers
Very nice. Overall, I think the article is very fair to the other
languages.
Also, I'm curious if you know how the Julia functions (like
pow/log) are implemented, i.e. are they also calling C/Fortran
functions or are they natively implemented in Julia?
Typo (other than Mike's headline):
"In our exercsie"
"Chapel’s arrays are more difficult to get started with than
Julia’s but are designed to be run on single-core, multicore, and
computer clusters using the same or very similar code, which is a
good unique selling point." (should have comma between Julia's
and but)
This is unclear:
The chart below shows matrix implementation times minus ndslice
times; negative means that ndslice is slower, indicating that the
implementation used here does not negatively represent D’s
performance.
