Skip to content

Releases: cp2k/dbcsr

v2.0.0-rc5

13 Sep 11:40
Compare
Choose a tag to compare
v2.0.0-rc5 Pre-release
Pre-release
Version 2.0.0-rc5

v2.0.0-rc4

13 Sep 11:39
Compare
Choose a tag to compare
v2.0.0-rc4 Pre-release
Pre-release
Version 2.0.0-rc4

v2.0.0-rc3

16 Aug 10:50
Compare
Choose a tag to compare
v2.0.0-rc3 Pre-release
Pre-release

Version v2.0.0-rc3

v2.0.0-rc2

12 Jul 07:09
Compare
Choose a tag to compare
v2.0.0-rc2 Pre-release
Pre-release
Version v2.0.0-rc2

v2.0.0-rc1

11 Jul 20:55
Compare
Choose a tag to compare
v2.0.0-rc1 Pre-release
Pre-release
Version v2.0.0-rc1

v2.0.0-rc.0

08 Jul 08:38
Compare
Choose a tag to compare
v2.0.0-rc.0 Pre-release
Pre-release

This release has an improved API, therefore it requires some changes with respect to the DBCSR v1.
Summary of changes in API:

  • Remove arrays for clusters in dbcsr_distribution_new and dbcsr_distribution_get #34
  • Rename dbcsr_trace_ab in dbcsr_dot #68
  • dbcsr_init_lib takes an MPI communicator #102
  • dbcsr_finalize_lib remove input MPI communicator #102
  • Print DBCSR statistics with dbcsr_print_statistics #102
  • All functions in API have a dbcsr_ namespace #109
  • acc_get_ndevices and acc_set_active_device have now dbcsr_ prefix, available in the API #111
  • dbcsr_get_block_* has a traspose parameter (old API is will available) #109
  • dbcsr_iterator_next_* has a traspose parameter (old API is will available) #109
  • Add GPU V100 parameters #172
  • Add support for F2008 #136
  • Better CMAKE support
  • Fix minor bugs

v2.0.0-alpha2

29 Jun 05:16
Compare
Choose a tag to compare
v2.0.0-alpha2 Pre-release
Pre-release
Version 2.0.0-alpha2

v2.0.0-alpha1

17 Apr 12:14
Compare
Choose a tag to compare
v2.0.0-alpha1 Pre-release
Pre-release
Version 2.0.0-alpha1

v2.0.0-alpha

15 Apr 19:54
Compare
Choose a tag to compare
v2.0.0-alpha Pre-release
Pre-release
Version 2.0.0-alpha

Version 1.1.0

09 Apr 03:44
Compare
Choose a tag to compare

This DBCSR version introduces predictive modeling for the CUDA generation of the kernels. A decision tree model is built from the data obtained by autotuning certain (m, n, k)-triplets and is used to predict optimal parameters for unseen (m, n, k)-triplets.

Developed as a part of the PASC proposal "Sparse Tensor Linear Algebra Library"

Thanks to @shoshijak for the hard work to implement it!