Performance Analysis of Parallel Algorithm over Sequential using OpenMP
Pranav P. Kulkarni, Sumit Pathare · IOSR Journal of Computer Engineering · 2014
Parallel programming represents the next turning point in how software engineers write software.Today, low-cost multi-core processors are widely available for both desktop computers and laptops.As a result, applications will increasingly need to be paralleled to fully exploit the multi-core-processor throughput gains that are becoming available.Unfortunately, writing parallel code is more complex than writing serial code.This is where the OpenMP programming model enters the parallel computing picture.OpenMP helps developers create multi-threaded applications more easily while retaining the look and feel of serial programming.The term algorithm performance is a systematic and quantitative approach for constructing software systems to meet the performance objectives such as response time, throughput, scalability and resource utilization.The performances (speedup) of parallel algorithms on multi-core system have been presented in this paper.The experimental results on a multi-core processor show that the proposed parallel algorithms achieves good performance compared to the sequential.