| Name | Modified | Size | Downloads / Week |
|---|---|---|---|
| Parent folder | |||
| arrayfire-full-3.8.1.tar.bz2 | 2022-01-21 | 66.9 MB | |
| README.md | 2021-12-28 | 4.2 kB | |
| v3.8.1 Release.tar.gz | 2021-12-28 | 1.7 MB | |
| v3.8.1 Release.zip | 2021-12-28 | 2.7 MB | |
| Totals: 4 Items | 71.4 MB | 1 | |
v3.8.1
Improvements
- moddims now uses JIT approach for certain special cases - [#3177]
- Embed Version Info in Windows DLLs - [#3025]
- OpenCL device max parameter is now queries from device properties - [#3032]
- JIT Performance Optimization: Unique funcName generation sped up - [#3040]
- Improved readability of log traces - [#3050]
- Use short function name in non-debug build error messages - [#3060]
- SIFT/GLOH are now available as part of website binaries - [#3071]
- Short-circuit zero elements case in detail::copyArray backend function - [#3059]
- Speedup of kernel caching mechanism - [#3043]
- Add short-circuit check for empty Arrays in JIT evalNodes - [#3072]
- Performance optimization of indexing using dynamic thread block sizes - [#3111]
- ArrayFire starting with this release will use Intel MKL single dynamic library which resolves lot of linking issues unified library had when user applications used MKL themselves - [#3120]
- Add shortcut check for zero elements in af_write_array - [#3130]
- Speedup join by eliminating temp buffers for cascading joins - [#3145]
- Added batch support for solve - [#1705]
- Use pinned memory to copy device pointers in CUDA solve - [#1705]
- Added package manager instructions to docs - [#3076]
- CMake Build Improvements - [#3027] , [#3089] , [#3037] , [#3072] , [#3095] , [#3096] , [#3097] , [#3102] , [#3106] , [#3105] , [#3120] , [#3136] , [#3135] , [#3137] , [#3119] , [#3150] , [#3138] , [#3156] , [#3139] , [#1705] , [#3162]
- CPU backend improvements - [#3010] , [#3138] , [#3161]
- CUDA backend improvements - [#3066] , [#3091] , [#3093] , [#3125] , [#3143] , [#3161]
- OpenCL backend improvements - [#3091] , [#3068] , [#3127] , [#3010] , [#3039] , [#3138] , [#3161]
- General(including JIT) performance improvements across backends - [#3167]
- Testing improvements - [#3072] , [#3131] , [#3151] , [#3141] , [#3153] , [#3152] , [#3157] , [#1705] , [#3170] , [#3167]
- Update CLBlast to latest version - [#3135] , [#3179]
- Improved Otsu threshold computation helper in canny algorithm - [#3169]
- Modified default parameters for fftR2C and fftC2R C++ API from 0 to 1.0 - [#3178]
- Use appropriate MKL getrs_batch_strided API based on MKL Versions - [#3181]
Fixes
- Fixed a bug JIT kernel disk caching - [#3182]
- Fixed stream used by thrust(CUDA backend) functions - [#3029]
- Added workaround for new cuSparse API that was added by CUDA amid fix releases - [#3057]
- Fixed
constarray indexing insidegfor- [#3078] - Handle zero elements in copyData to host - [#3059]
- Fixed double free regression in OpenCL backend - [#3091]
- Fixed an infinite recursion bug in NaryNode JIT Node - [#3072]
- Added missing input validation check in sparse-dense arithmetic operations - [#3129]
- Fixed bug in
getMappedPtrin OpenCL due to invalid lambda capture - [#3163] - Fixed bug in
getMappedPtron Arrays that are not ready - [#3163] - Fixed edgeTraceKernel for CPU devices on OpenCL backend - [#3164]
- Fixed windows build issue(s) with VS2019 - [#3048]
- API documentation fixes - [#3075] , [#3076] , [#3143] , [#3161]
- CMake Build Fixes - [#3088]
- Fixed the tutorial link in README - [#3033]
- Fixed function name typo in timing tutorial - [#3028]
- Fixed couple of bugs in CPU backend canny implementation - [#3169]
- Fixed reference count of array(s) used in JIT operations. It is related to arrayfire's internal memory book keeping. The behavior/accuracy of arrayfire code wasn't broken earlier. It corrected the reference count to be of optimal value in the said scenarios. This may potentially reduce memory usage in some narrow cases - [#3167]
- Added assert that checks if topk is called with a negative value for k - [#3176]
- Fixed an Issue where countByKey would give incorrect results for any n > 128 - [#3175]
Contributions
Special thanks to our contributors: HO-COOH, Willy Born, Gilad Avidov, Pavan Yalamanchili