Cybernetics and Information Technologies (Mar 2017)

Fast Matrix Multiplication with Big Sparse Data

  • Somasekhar G.,
  • Karthikeyan K.

DOI
https://doi.org/10.1515/cait-2017-0002
Journal volume & issue
Vol. 17, no. 1
pp. 16 – 30

Abstract

Read online

Big Data becameabuzz word nowadays due to the evolution of huge volumes of data beyond peta bytes. This article focuses on matrix multiplication with big sparse data. The proposed FASTsparse MULalgorithm outperforms the state-of-the-art big matrix multiplication approaches in sparse data scenario.

Keywords