Investigation of sparse matrix multiplication task for the PDCS “Buran”
N. N. Levchenko, A.S. Okunev, D.N. Zmejev · 2017
In order to improve the efficiency of the sparse matrices multiplication task on a traditional cluster supercomputer, it is necessary to take into account different levels of parallelism when programming. To work around these problems the dataflow computing model with the dynamically formed context and the architecture of the parallel dataflow computing system can be used. The article describes the implementation of a parallel algorithm of the sparse matrices multiplication task on the parallel dataflow computing system. The experiments performed on the emulator of the system demonstrate the application perspectiveness of the dataflow computing model for this class of tasks.