American Journal of Computer Science and Engineering Survey Open Access
ISSN: 2349-7238
Journal h-index: 9
Journal CiteScore: 1.72
Journal Impact Factor: 1.11
Average acceptance to publication time (5-7 days)
Average article processing time (30-45 days)
Less than 5 volumes 30 days
8 - 9 volumes 40 days
10 and more volumes 45 days
Reach us
+32 25889658
Abstract
A Survey on Serial and Parallel Optimization
Techniques Applicable for Matrix
Multiplication Algorithm
Yajnaseni Dash, Sanjay Kumar and V.K. Patle
A Survey on Serial and Parallel Optimization Techniques Applicable for Matrix Multiplication Algorithm
Parallel algorithms play an imperative role in the high performance computing environment. Dividing a task into the smaller tasks and assigning them to different processors for parallel execution are the two key concepts to evaluate the performance of parallel algorithms. Performance enhancement is essential in large scientific applications, where dense matrix multiplication algorithm is extensively used. Thus, optimization of this algorithm, both for serial and parallel execution would provide upsurge performance. In this paper, a brief systematic survey on serial and parallel optimization techniques applied on matrix multiplication algorithm is carried out.
