From 67e2c04bee619676992194204a5dc3008cd75586 Mon Sep 17 00:00:00 2001 From: easybuild <easybuild@srv1.smc.salomon.it4i.cz> Date: Tue, 14 Nov 2017 16:00:03 +0100 Subject: [PATCH] Tue, 14 Nov 2017 16:00:03 +0100 --- salomon.csv | 1 + salomon.md | 1 + 2 files changed, 2 insertions(+) diff --git a/salomon.csv b/salomon.csv index 757afdff..9afec964 100644 --- a/salomon.csv +++ b/salomon.csv @@ -958,6 +958,7 @@ ScientificPython/2.9.4-intel-2016.01-Python-2.7.9,2 Theano/0.9.0-Python-3.6.1,2 h5py/2.7.0-intel-2017a-Python-2.7.13-base,2 libcerf/1.5,2 +libsmm/2015-11-10,2 libxsmm/1.6.4-intel-2017a,2 libxsmm/1.7.1,2 numpy/1.8.2-intel-2015b-Python-2.7.9,2 diff --git a/salomon.md b/salomon.md index 656ed3f8..c1b1f04a 100644 --- a/salomon.md +++ b/salomon.md @@ -257,6 +257,7 @@ | [ISL](http://isl.gforge.inria.fr/) | isl is a library for manipulating sets and relations of integer points bounded by linear constraints. | | Keras | | | libcerf | | +| libsmm | | | libxsmm | | | MATLAB | | | [METIS](http://glaros.dtc.umn.edu/gkhome/metis/metis/overview) | METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. | -- GitLab