3 ms·
Yeah those algorithms are numerically tested, haven't changed in years, and really fast. You can certainly get to convenient matrix manipulation in C++, but th
by karma_fountain 6y ago
Yeah those algorithms are numerically tested, haven't changed in years, and really fast. You can certainly get to convenient matrix manipulation in C++, but then your compile times will increase significantly.
- Zardoz84 6y agoYou can have a fast implementation and fast compilation time with DLang
- andi999 6y agoPerformance might be worse in c++
- DesiLurker 6y agoCan the fortran implementations do auto-vectorization on simd hardware? or map to gpu using cuda-like library? not rhetorical, genuine question.
- cygx 6y agoYes. See e.g. https://gcc.gnu.org/projects/tree-ssa/vectorization.html#example6 https://gcc.gnu.org/projects/tree-ssa/vectorization.html#exa... https://developer.nvidia.com/cuda-fortran https://developer.nvidia.com/cuda-fortran
- jhayward 6y agoYes, in fact all the original research for those things was done in Fortran compilers.
- TheRealKing 6y agoFortran is a fully-vectorized and parallelized language at all levels, from instructions to shared and distributed parallelism (corresponding to one-sided MPI communications). This has been the case for at least 3 decades if not more. There are mature GPU support for Fortran. NVIDIA and PGI are currently implementing the standard parallel features of Fortran via GPUs.