Abstract

With the developing multi-core technology, it becomes quite practical to speed up sequential algorithms via parallel running threads. Java language which has built in libraries for the management of threads provides a good environment for developing parallel applications. In the presented study, performance of the parallel implementation of matrix multiplication algorithm that provides a basis for most of the matrix operations is investigated on a multi-core computer. In the experiments where six-core processor computer used, the impact of static and dynamic load management approaches which are common in practice for managing threads on effect of use of computational power are shown. Experiments are realized according to the number of threads and the matrix size to be multiplied. Through the experiments, it has been shown by graphical results that parallel algorithm bring significant speed up and parallel efficiency by comparing it to sequential equivalent.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.