A new sort algorithm for multi core parallel computers

Abstract EN

Sorting is one of the basic problems of tremendous data for computers.

In the past computer processes were executed on a single processor and this took a long time.

To solve this problems computers used multi cores, to decrease the amount of time taken for solving these operations.

The advent of the internet allowed people to pool their processing power; parallel processing.

This paper offers such sort algorithms for parallel processing.

The proposed algorithm in this paper sorts random numbers and save them in a text file.

It uses three parameters: number cutting, multi core, and times.

The file is divided in a number of matrix.

And uses two main operations: the first operation merges a column with the adjacent column, and the second operation sorts ascending and shared memory in cores P1, P2, P3, and P4, and computes time/millisecond for each process.

This algorithm is executed in a computer having multiply cores; CPU 0, CPU 1, CPU 2, and CPU 3.

The outcome of this algorithm is fast, efficient, and produces optimal results; when the number of processors increase, execution time is decrease.