{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T13:12:41Z","timestamp":1651842761432},"reference-count":38,"publisher":"IGI Global","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"abstract":"<jats:p>The huge computations performed sequentially requires a lot of time for execution as on contrary to the concurrent implementation. Many problems are involved in the dense linear algebra operations the main focus for this work is for solving linear equations. The problem of solving linear equations when approached using parallel implementation will yield better results. The Vedic mathematical method of Paravartya Yojayet is having less complexity as compared to the conventional methods. This work mainly focuses on the parallel implementation of the Paravartya Yojayet and its comparison to the benchmarking of the existing LU decomposition. The results of this implementation of Paravartya Yojayet are better when analysed theoretically but its actual parallel implementation will vary so it needs to be analysed and this work presents the same. The comparative analysis of the two ways for parallelization of the Paravartya Yojayet methods viz. \u2018For loop' parallelization and the \u2018direct parallelization' is also analysed in this work.<\/jats:p>","DOI":"10.4018\/ijrsda.2017100103","type":"journal-article","created":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T18:13:06Z","timestamp":1500055986000},"page":"31-47","source":"Crossref","is-referenced-by-count":1,"title":["Complexity Analysis of Vedic Mathematics Algorithms for Multicore Environment"],"prefix":"10.4018","volume":"4","author":[{"given":"Urmila","family":"Shrawankar","sequence":"first","affiliation":[{"name":"G. H. Raisoni College of Engineering, Nagpur, India"}]},{"given":"Krutika Jayant","family":"Sapkal","sequence":"additional","affiliation":[{"name":"G. H. Raisoni College of Engineering, Nagpur, India"}]}],"member":"2432","reference":[{"key":"IJRSDA.2017100103-0","doi-asserted-by":"crossref","unstructured":"Agullo, E., Bouwmeester, H., Dongarra, J., Kurzak, J., Langou, J., & Rosenberg, L. (2011). Towards an efficient tile matrix inversion of symmetric positive definite matrices on multicore architectures. In High Performance Computing for Computational Science VECPAR \u201810, LNCS (Vol. 6449, pp. 129\u2013138).","DOI":"10.1007\/978-3-642-19328-6_14"},{"key":"IJRSDA.2017100103-1","doi-asserted-by":"crossref","unstructured":"Alonso, P., Dolz, M.F., Mayo, R., & Quintana-Orti, E.S. (2011). Improving power efficiency of dense linear algebra algorithms on multi-core processors via slack control. Proceedings of the 2011 International Conference on High Performance Computing and Simulation HPCS \u201811 (pp. 463\u2013470).","DOI":"10.1109\/HPCSim.2011.5999861"},{"key":"IJRSDA.2017100103-2","doi-asserted-by":"crossref","unstructured":"Armistead, R., & Li, F. (2011). Parallel computing of sparse linear systems using matrix condensation algorithm. Proceedings of the PowerTech, 2011 IEEE Trondheim (pp. 1\u20136).","DOI":"10.1109\/PTC.2011.6238219"},{"key":"IJRSDA.2017100103-3","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.12"},{"key":"IJRSDA.2017100103-4","doi-asserted-by":"crossref","unstructured":"Baker, A. H., Schulz, M., & Yang, U. M. (2011). On the performance of an algebraic multigrid solver on multicore clusters. In High Performance Computing for Computational Science VECPAR \u201910, LNCS (Vol. 6449, pp. 102\u2013115).","DOI":"10.1007\/978-3-642-19328-6_12"},{"key":"IJRSDA.2017100103-5","doi-asserted-by":"crossref","unstructured":"Balsa, C., Guivarch, R., Ruiz, D., & Zenadi, M. (2011). A hybrid approach for the parallelization of a block iterative algorithm. In High Performance Computing for Computational Science VECPAR \u201910, LNCS (Vol. 6449, pp. 116\u2013128).","DOI":"10.1007\/978-3-642-19328-6_13"},{"key":"IJRSDA.2017100103-6","doi-asserted-by":"crossref","unstructured":"Barreda, M., Dolz, M.F., Mayo, R., Quintana-Orti, E.S., & Reyes, R. (2012). Binding Performance and Power of Dense Linear Algebra Operations. Proceedings of the 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications (pp. 63\u201370).","DOI":"10.1109\/ISPA.2012.17"},{"key":"IJRSDA.2017100103-7","doi-asserted-by":"crossref","unstructured":"Benner, P., . . .. (2013). On the impact of optimization on the time-power-energy balance of dense linear algebra factorizations. In Algorithms and Architectures for Parallel Processing, LNCS (Vol. 8286, pp. 3\u201310).","DOI":"10.1007\/978-3-319-03889-6_1"},{"key":"IJRSDA.2017100103-8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.299"},{"key":"IJRSDA.2017100103-9","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1301"},{"key":"IJRSDA.2017100103-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.10.002"},{"key":"IJRSDA.2017100103-11","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2012.12"},{"key":"IJRSDA.2017100103-12","doi-asserted-by":"publisher","DOI":"10.1109\/SCIS-ISIS.2012.6505077"},{"key":"IJRSDA.2017100103-13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.308"},{"key":"IJRSDA.2017100103-14","doi-asserted-by":"publisher","DOI":"10.1109\/CGC.2012.113"},{"key":"IJRSDA.2017100103-15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173241"},{"key":"IJRSDA.2017100103-16","doi-asserted-by":"crossref","unstructured":"Glenis, A., & Pham, V. 2012. A Linear Algebra Approach to C-Means Clustering Using GPUs and MPI. Proceedings of the 2012 16th Panhellenic Conference on Informatics (Vol. 7, pp. 198\u2013203).","DOI":"10.1109\/PCi.2012.24"},{"key":"IJRSDA.2017100103-17","author":"A.Grama","year":"2003","journal-title":"Introduction to Parallel Computing"},{"key":"IJRSDA.2017100103-18","doi-asserted-by":"publisher","DOI":"10.1145\/1055531.1055534"},{"key":"IJRSDA.2017100103-19","doi-asserted-by":"crossref","unstructured":"Gunter, B.C. & van de Geijn, R.A., 2005. Parallel Out-of-Core Computation and Updating the QR Factorization. ACM Transactions on Mathematical Software, 31(1), 60\u201378.","DOI":"10.1145\/1055531.1055534"},{"key":"IJRSDA.2017100103-20","unstructured":"Guthrie, G., (n. d.). Vedic Computation\u202f: Redefining Computer Science in the Light of Maharishi Vedic Science."},{"key":"IJRSDA.2017100103-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.06.007"},{"key":"IJRSDA.2017100103-22","unstructured":"Kale, A., Vaidya, S. & Joglekar, A. (2009). A generalized recursive algorithm for binary multiplication based on Vedic mathematics."},{"key":"IJRSDA.2017100103-23","doi-asserted-by":"crossref","unstructured":"Katagiri, T., & Itoh, S. (2011). A massively parallel dense symmetric eigensolver with communication splitting multicasting algorithm. In High Performance Computing for Computational Science VECPAR \u201910, LNCS (Vol. 6449, pp. 139\u2013150).","DOI":"10.1007\/978-3-642-19328-6_15"},{"key":"IJRSDA.2017100103-24","doi-asserted-by":"publisher","DOI":"10.1109\/SPICES.2015.7091534"},{"key":"IJRSDA.2017100103-25","unstructured":"Kreetee, D., Babajee, R. & Allied, A. (2015). Solving Systems of linear equations using the Paravartya rule in Vedic Mathematics."},{"key":"IJRSDA.2017100103-26","doi-asserted-by":"crossref","unstructured":"Krishnan, M., Lewis, R. R., & Vishnu, A. (2010). Scaling Linear Algebra Kernels Using Remote Memory Access. Proceedings of the 2010 39th International Conference on Parallel Processing Workshops (pp. 369\u2013376).","DOI":"10.1109\/ICPPW.2010.57"},{"key":"IJRSDA.2017100103-27","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882363"},{"key":"IJRSDA.2017100103-28","doi-asserted-by":"crossref","unstructured":"Kumar, A., Kumar, A., & Sarin, R.K. (2010). Small area reconfigurable FFT design by vedic mathematics. Proceedings of the 2010 2nd International Conference on Computer and Automation Engineering, ICCAE 2010, 5(1), 836\u2013838.","DOI":"10.1109\/ICCAE.2010.5451884"},{"key":"IJRSDA.2017100103-29","doi-asserted-by":"publisher","DOI":"10.1002\/cpe"},{"key":"IJRSDA.2017100103-30","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.230"},{"key":"IJRSDA.2017100103-31","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0319-0"},{"key":"IJRSDA.2017100103-32","doi-asserted-by":"publisher","DOI":"10.1109\/HPCSA.2002.1019151"},{"key":"IJRSDA.2017100103-33","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2010.39"},{"key":"IJRSDA.2017100103-34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2011.07.023"},{"key":"IJRSDA.2017100103-35","doi-asserted-by":"publisher","DOI":"10.1109\/PCi.2012.23"},{"key":"IJRSDA.2017100103-36","unstructured":"Tirthji, S. B. K. (Bankagarya of Oovardhana Matha, P. (1981). Vedic Mathematics. (V. S. Agrawal, Ed.) (1st ed.). Varanasi: Motilal Banarsidass."},{"key":"IJRSDA.2017100103-37","doi-asserted-by":"publisher","DOI":"10.3233\/SPR-2009-0265"}],"container-title":["International Journal of Rough Sets and Data Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=186857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T12:44:45Z","timestamp":1651841085000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJRSDA.2017100103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":38,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.4018\/ijrsda.2017100103","relation":{},"ISSN":["2334-4598","2334-4601"],"issn-type":[{"value":"2334-4598","type":"print"},{"value":"2334-4601","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}