Abstract—Parallel sorting is a technique which researchers have studied from the time parallelism was proposed as a way of making fast algorithms. Different parallel sorting techniques on different architectures have been studied for many years. Sorting is one of the most important operations in different algorithms. This paper presents another sort on Centralized Diamond architecture which sorts unsorted lists of length L. The theoretical analysis of the algorithm specifies that the algorithm needs o(log n) time complexity on PRAM EREW.

Index Terms—Sorting, centralized diamond, SIMD, EREW PRAM.

The authors are with the Department of Computer Science, Firoozkooh Branch, Islamic Azad University, Firoozkooh, Iran.

Cite:Kamal Jadidy Aval, Masumeh Damrudi, "SOCD Sort on Centralized Diamond Architecture," International Journal of Computer and Communication Engineering vol. 5, no. 4, pp. 246-252, 2016.