Abstract
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.
Language: English
Page range: 16 - 30
Published on: Apr 6, 2017
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2017 G. Somasekhar, K. Karthikeyan, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
