The Template Task Graph (TTG) - an emerging practical dataflow programming paradigm for scientific simulation at extreme scale

Author(s):  
G. Bosilca ◽  
R.J. Harrison ◽  
T. Herault ◽  
M.M. Javanmard ◽  
P. Nookala ◽  
...  
2019 ◽  
Vol 13 (4) ◽  
pp. 286-290
Author(s):  
Siraphob Theeracheep ◽  
Jaruloj Chongstitvatana

Matrix multiplication is an essential part of many applications, such as linear algebra, image processing and machine learning. One platform used in such applications is TensorFlow, which is a machine learning library whose structure is based on dataflow programming paradigm. In this work, a method for multiplication of medium-density matrices on multicore CPUs using TensorFlow platform is proposed. This method, called tbt_matmul, utilizes TensorFlow built-in methods tf.matmul and tf.sparse_matmul. By partitioning each input matrix into four smaller sub-matrices, called tiles, and applying an appropriate multiplication method to each pair depending on their density, the proposed method outperforms the built-in methods for matrices of medium density and matrices of significantly uneven distribution of non-zeros.


2009 ◽  
Vol 46 (1) ◽  
pp. 71-82 ◽  
Author(s):  
Min Zhou ◽  
Onkar Sahni ◽  
H. Jin Kim ◽  
C. Alberto Figueroa ◽  
Charles A. Taylor ◽  
...  

Author(s):  
Liang Wang ◽  
Zhiwen Yu ◽  
Qi Han ◽  
Dingqi Yang ◽  
Shirui Pan ◽  
...  

2021 ◽  
Vol 11 (2) ◽  
pp. 25
Author(s):  
Evelina Forno ◽  
Alessandro Salvato ◽  
Enrico Macii ◽  
Gianvito Urgese

SpiNNaker is a neuromorphic hardware platform, especially designed for the simulation of Spiking Neural Networks (SNNs). To this end, the platform features massively parallel computation and an efficient communication infrastructure based on the transmission of small packets. The effectiveness of SpiNNaker in the parallel execution of the PageRank (PR) algorithm has been tested by the realization of a custom SNN implementation. In this work, we propose a PageRank implementation fully realized with the MPI programming paradigm ported to the SpiNNaker platform. We compare the scalability of the proposed program with the equivalent SNN implementation, and we leverage the characteristics of the PageRank algorithm to benchmark our implementation of MPI on SpiNNaker when faced with massive communication requirements. Experimental results show that the algorithm exhibits favorable scaling for a mid-sized execution context, while highlighting that the performance of MPI-PageRank on SpiNNaker is bounded by memory size and speed limitations on the current version of the hardware.


2007 ◽  
Vol 18 (12) ◽  
pp. 1740-1753 ◽  
Author(s):  
C. Roig ◽  
A. Ripoll ◽  
F. Guirado

Sign in / Sign up

Export Citation Format

Share Document