Skip to main content
Erschienen in: The Journal of Supercomputing 4/2021

18.08.2020

SMOaaS: a Scalable Matrix Operation as a Service model in Cloud

verfasst von: KC Ujjwal, Sudheer Kumar Battula, Saurabh Garg, Ranesh Kumar Naha, Md Anwarul Kaium Patwary, Alexander Brown

Erschienen in: The Journal of Supercomputing | Ausgabe 4/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Matrix operations are fundamental to a wide range of scientific applications such as Graph Theory, Linear Equation System, Image Processing, Geometric Optics, and Probability Analysis. As the workload in these applications has increased, the sizes of matrices involved have also significantly increased. Parallel execution of matrix operations in existing cluster-based systems performs effectively for relatively small matrices but significantly suffers as matrices become larger due to limited resources. Cloud Computing offers scalable resources to handle this limitation; however, the benefits of having access to almost-infinite scalable resources in the Cloud also come with challenges of ensuring time and resource-efficient matrix operations. To the best of our knowledge, there is no specific Cloud service that optimizes the efficiency of matrix operations on Cloud infrastructure. To address this gap and offer convenient service of matrix operations, the paper proposes a novel scalable service framework called Scalable Matrix Operation as a Service. Our framework uses Dynamic Matrix Partition techniques, based on matrix operation and sizes, to achieve efficient work distribution, and scales based on demand to achieve time and resource-efficient operations. The framework also embraces the basic features of security, fault tolerance, and reliability. Experimental results show that the adopted dynamic partitioning technique ensures faster and better performance when compared to the existing static partitioning technique.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Fiedler M (1975) A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech Math J 25(4):619–633MathSciNetCrossRef Fiedler M (1975) A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech Math J 25(4):619–633MathSciNetCrossRef
2.
Zurück zum Zitat Campbell SL, Meyer CD (2009) Generalized inverses of linear transformations. SIAM, PhiladelphiaCrossRef Campbell SL, Meyer CD (2009) Generalized inverses of linear transformations. SIAM, PhiladelphiaCrossRef
3.
Zurück zum Zitat Mitzenmacher M, Upfal E (2017) Probability and computing: randomization and probabilistic techniques in algorithms and data analysis. Cambridge University Press, CambridgeMATH Mitzenmacher M, Upfal E (2017) Probability and computing: randomization and probabilistic techniques in algorithms and data analysis. Cambridge University Press, CambridgeMATH
4.
Zurück zum Zitat Krishnan M, Nieplocha J (2004) SRUMMA: a matrix multiplication algorithm suitable for clusters and scalable shared memory systems. In: 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings, p 70. IEEE Krishnan M, Nieplocha J (2004) SRUMMA: a matrix multiplication algorithm suitable for clusters and scalable shared memory systems. In: 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings, p 70. IEEE
5.
Zurück zum Zitat Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107–113CrossRef Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107–113CrossRef
6.
Zurück zum Zitat Gittens A, Devarakonda A, Racah E, Ringenburg M, Gerhardt L, Kottalam J, Liu J, Maschhoff K, Canon S, Chhugani J et al (2016) Matrix factorizations at scale: a comparison of scientific data analytics in spark and C+ MPI using three case studies. In: 2016 IEEE International Conference on Big Data (Big Data). IEEE, pp 204–213 Gittens A, Devarakonda A, Racah E, Ringenburg M, Gerhardt L, Kottalam J, Liu J, Maschhoff K, Canon S, Chhugani J et al (2016) Matrix factorizations at scale: a comparison of scientific data analytics in spark and C+ MPI using three case studies. In: 2016 IEEE International Conference on Big Data (Big Data). IEEE, pp 204–213
7.
Zurück zum Zitat Gupta V, Wang S, Courtade T, Ramchandran K (2018) Oversketch: approximate matrix multiplication for the cloud. In: 2018 IEEE International Conference on Big Data (Big Data). IEEE, pp 298–304 Gupta V, Wang S, Courtade T, Ramchandran K (2018) Oversketch: approximate matrix multiplication for the cloud. In: 2018 IEEE International Conference on Big Data (Big Data). IEEE, pp 298–304
8.
Zurück zum Zitat Beaumont O, Boudet V, Rastello F, Robert Y et al (2002) Partitioning a square into rectangles: NP-completeness and approximation algorithms. Algorithmica 34(3):217–239MathSciNetCrossRef Beaumont O, Boudet V, Rastello F, Robert Y et al (2002) Partitioning a square into rectangles: NP-completeness and approximation algorithms. Algorithmica 34(3):217–239MathSciNetCrossRef
9.
Zurück zum Zitat Pichel JC, Rivera FF (2013) Sparse matrix vector multiplication on the single-chip cloud computer many-core processor. J Parallel Distrib Comput 73(12):1539–1550 (Heterogeneity in Parallel and Distributed Computing)CrossRef Pichel JC, Rivera FF (2013) Sparse matrix vector multiplication on the single-chip cloud computer many-core processor. J Parallel Distrib Comput 73(12):1539–1550 (Heterogeneity in Parallel and Distributed Computing)CrossRef
10.
Zurück zum Zitat Yang X, Parthasarathy S, Sadayappan P (2011) Fast sparse matrix-vector multiplication on GPUs: implications for graph mining. Proc VLDB Endow 4(4):231–242CrossRef Yang X, Parthasarathy S, Sadayappan P (2011) Fast sparse matrix-vector multiplication on GPUs: implications for graph mining. Proc VLDB Endow 4(4):231–242CrossRef
11.
Zurück zum Zitat Ashari A, Sedaghati N, Eisenlohr J, Parthasarath S, Sadayappan P (2014) Fast sparse matrix-vector multiplication on GPUs for graph applications. In: SC ’14:Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp 781–792 Ashari A, Sedaghati N, Eisenlohr J, Parthasarath S, Sadayappan P (2014) Fast sparse matrix-vector multiplication on GPUs for graph applications. In: SC ’14:Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp 781–792
12.
Zurück zum Zitat Boukaram W, Turkiyyah G, Keyes D (2019) Hierarchical matrix operations on GPUs: matrix-vector multiplication and compression. ACM Trans Math Softw 45(1):1–28MathSciNetCrossRef Boukaram W, Turkiyyah G, Keyes D (2019) Hierarchical matrix operations on GPUs: matrix-vector multiplication and compression. ACM Trans Math Softw 45(1):1–28MathSciNetCrossRef
13.
Zurück zum Zitat Seo S, Yoon EJ, Kim J, Jin S, Kim J, Maeng S (2010) Hama: an efficient matrix computation with the mapreduce framework. In: 2010 IEEE Second International Conference on Cloud Computing Technology and Science, pp 721–726 Seo S, Yoon EJ, Kim J, Jin S, Kim J, Maeng S (2010) Hama: an efficient matrix computation with the mapreduce framework. In: 2010 IEEE Second International Conference on Cloud Computing Technology and Science, pp 721–726
14.
Zurück zum Zitat Gu R, Tang Y, Wang Z, Wang S, Yin X, Yuan C, Huang Y (2015) Efficient large scale distributed matrix computation with spark. In: 2015 IEEE International Conference on Big Data (Big Data), pp 2327–2336 Gu R, Tang Y, Wang Z, Wang S, Yin X, Yuan C, Huang Y (2015) Efficient large scale distributed matrix computation with spark. In: 2015 IEEE International Conference on Big Data (Big Data), pp 2327–2336
15.
Zurück zum Zitat Liu J, Liang Y, Ansari N (2016) Spark-based large-scale matrix inversion for big data processing. IEEE Access 4:2166–2176CrossRef Liu J, Liang Y, Ansari N (2016) Spark-based large-scale matrix inversion for big data processing. IEEE Access 4:2166–2176CrossRef
16.
Zurück zum Zitat DeFlumere A, Lastovetsky A (2014) Searching for the optimal data partitioning shape for parallel matrix matrix multiplication on 3 heterogeneous processors. In: 2014 IEEE International Parallel and Distributed Processing Symposium Workshops. IEEE, pp 17–28 DeFlumere A, Lastovetsky A (2014) Searching for the optimal data partitioning shape for parallel matrix matrix multiplication on 3 heterogeneous processors. In: 2014 IEEE International Parallel and Distributed Processing Symposium Workshops. IEEE, pp 17–28
17.
Zurück zum Zitat Dovolnov E, Kalinov A, Klimov S (2003) Natural block data decomposition for heterogeneous clusters. In: Proceedings International Parallel and Distributed Processing Symposium. IEEE, p 10 Dovolnov E, Kalinov A, Klimov S (2003) Natural block data decomposition for heterogeneous clusters. In: Proceedings International Parallel and Distributed Processing Symposium. IEEE, p 10
18.
Zurück zum Zitat Lastovetsky Alexey (2007) On grid-based matrix partitioning for heterogeneous processors. In: Sixth International Symposium on Parallel and Distributed Computing (ISPDC’07). IEEE, p 51 Lastovetsky Alexey (2007) On grid-based matrix partitioning for heterogeneous processors. In: Sixth International Symposium on Parallel and Distributed Computing (ISPDC’07). IEEE, p 51
19.
Zurück zum Zitat Clarke D, Lastovetsky A, Rychkov V (2012) Column-based matrix partitioning for parallel matrix multiplication on heterogeneous processors based on functional performance models. In: Euro-Par 2011: Parallel Processing Workshops. Springer, Berlin, pp 450–459 Clarke D, Lastovetsky A, Rychkov V (2012) Column-based matrix partitioning for parallel matrix multiplication on heterogeneous processors based on functional performance models. In: Euro-Par 2011: Parallel Processing Workshops. Springer, Berlin, pp 450–459
20.
Zurück zum Zitat Malik T, Rychkov V, Lastovetsky A (2016) Network-aware optimization of communications for parallel matrix multiplication on hierarchical hpc platforms. Concurr Comput Pract Exp 28(3):802–821CrossRef Malik T, Rychkov V, Lastovetsky A (2016) Network-aware optimization of communications for parallel matrix multiplication on hierarchical hpc platforms. Concurr Comput Pract Exp 28(3):802–821CrossRef
21.
Zurück zum Zitat Wang S, Huang J, Lee W, Lee K (2018) Scaling up matrix factorization with cloud computing for collaborative recommendation. In: 2018 International Conference on System Science and Engineering (ICSSE), pp 1–6 Wang S, Huang J, Lee W, Lee K (2018) Scaling up matrix factorization with cloud computing for collaborative recommendation. In: 2018 International Conference on System Science and Engineering (ICSSE), pp 1–6
22.
Zurück zum Zitat Gupta V, Wang S, Courtade T, Ramchandran K (2018) Oversketch: approximate matrix multiplication for the cloud. pp 298–304 Gupta V, Wang S, Courtade T, Ramchandran K (2018) Oversketch: approximate matrix multiplication for the cloud. pp 298–304
23.
Zurück zum Zitat Qian Z, Chen X, Kang N, Chen M, Yu Y, Moscibroda T, Zhang Z (2012) Madlinq: large-scale distributed matrix computation for the cloud. In: Proceedings of the 7th ACM European Conference on Computer Systems, EuroSys 12, New York, NY, USA. Association for Computing Machinery, p 197210 Qian Z, Chen X, Kang N, Chen M, Yu Y, Moscibroda T, Zhang Z (2012) Madlinq: large-scale distributed matrix computation for the cloud. In: Proceedings of the 7th ACM European Conference on Computer Systems, EuroSys 12, New York, NY, USA. Association for Computing Machinery, p 197210
24.
Zurück zum Zitat Beaumont O, Becker BA, DeFlumere A, Eyraud-Dubois L, Lambert T, Lastovetsky A (2019) Recent advances in matrix partitioning for parallel computing on heterogeneous platforms. IEEE Trans Parallel Distrib Syst 30(1):218–229CrossRef Beaumont O, Becker BA, DeFlumere A, Eyraud-Dubois L, Lambert T, Lastovetsky A (2019) Recent advances in matrix partitioning for parallel computing on heterogeneous platforms. IEEE Trans Parallel Distrib Syst 30(1):218–229CrossRef
25.
Zurück zum Zitat Chen Y, Xiao G, Fan W, Tang Z, Li K (2020) tpSpMV: a two-phase large-scale sparse matrix-vector multiplication kernel for manycore architectures. Inf Sci 523:279–295CrossRef Chen Y, Xiao G, Fan W, Tang Z, Li K (2020) tpSpMV: a two-phase large-scale sparse matrix-vector multiplication kernel for manycore architectures. Inf Sci 523:279–295CrossRef
26.
Zurück zum Zitat Garg S, Forbes-Smith N, Hilton J, Prakash M (2018) SparkCloud: a cloud-based elastic bushfire simulation service. Remote Sens 10(1):74CrossRef Garg S, Forbes-Smith N, Hilton J, Prakash M (2018) SparkCloud: a cloud-based elastic bushfire simulation service. Remote Sens 10(1):74CrossRef
Metadaten
Titel
SMOaaS: a Scalable Matrix Operation as a Service model in Cloud
verfasst von
KC Ujjwal
Sudheer Kumar Battula
Saurabh Garg
Ranesh Kumar Naha
Md Anwarul Kaium Patwary
Alexander Brown
Publikationsdatum
18.08.2020
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 4/2021
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-020-03400-0

Weitere Artikel der Ausgabe 4/2021

The Journal of Supercomputing 4/2021 Zur Ausgabe