• LOKENDRA GOUR
• Akhilesh A. Waoo

Various engineering and scientific computational problems involve both sparse and dense matrices. Problems related to dense matrix can be resolved easily by parallelizing matrix computations. For problems related to sparse matrix, Karmaker suggested a new parallel architecture which is based on finite projective geometry. For such kinds of computations, it is essential to utilize parallel architectures. All contemporary computer systems are equipped with multi-core model in addition to multithreading. These multiple cores which are physical processing units provide parallelism. These cores may be homogeneous or heterogeneous. These cores operate in parallel and each performs separate computations by using different instruction streams on different data streams.

"OPTIMIZATION OF COMPUTATION IN PARALLEL COMPUTING BASED ON FINITE PROJECTIVE GEOMETRY", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.405-412, June 2019, Available :http://www.jetir.org/papers/JETIR1906Z58.pdf

"OPTIMIZATION OF COMPUTATION IN PARALLEL COMPUTING BASED ON FINITE PROJECTIVE GEOMETRY", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp405-412, June 2019, Available at : http://www.jetir.org/papers/JETIR1906Z58.pdf