PARALLEL SELECTION USING MULTITHREADING SOFTWARE

One of the main targets of designing programs is to reduce the complexity time. The purpose of this paper is to present a parallel algorithm for solving the selection problem using multithreading technique. We use openmp techniques to divide one processor into number of threads. This means that, the task of calculations of our algorithm is distributed over number of threads instead of one universal thread. Of course the complexity time will be affected using this technique. Our algorithm is written in c/c++ language. Although, the designed algorithm works in parallel, yet, it can be executed sequentially. We compare our results to the sequentially designed one for evaluating improvement done