Diamond architecture with NOD sorting

In this paper we introduce a new architecture which is called Diamond. This architecture has new techniques for interconnection among processors. We also present a new sorting algorithm on it. This algorithm which we name it NOD (Neighborhood sort On Diamond), sorts n data with 7/4n processors. The aim of issued architecture and algorithm is to reduce the cost of sorting by using a simple architecture and a simple way of sorting. There are architectures and sorting algorithms that are used but we always endeavor to find new and optimal ones. The algorithm on the issued architecture sorts data elements using 7/4n processors with a running time of O(n). Our architecture is heterogeneous and uses cheaper processors more than expensive ones. Though, this architecture makes a tradeoff between number of processors and their cost.