3288 Generalized approach to SOCD sorting on centralized diamond architecture

Quality of applications that includes robustness, real time response, and accurate performance has become a vital property for current applications. Among other existing solutions for such problems, parallel computing is a trending solution. Sorting is one of the main parts in almost every algorithm and various parallel sorting techniques have employed parallel architectures to do a qualified sorting. Gaining the best based on various different factors where speedup is the premier, is a topic of discussion. In this paper, we have issued the generalization of SOCD sort on the novel Centralized Diamond architecture which benefits from Single Instruction Multiple Data (SIMD) architecture with a time complexity of O (logn) on PRAM EREW(Parallel Random Access Machine Exclusive Read Exclusive Write). The results of conducted simulations of the algorithm prove the results of theoretical analysis of the algorithm. The findings of this research can be exploited in developing faster embedded systems. Using an appropriate interconnection network for achieving reasonable speedup in the execution of applications is important especially in embedded systems