k-k sorting on the Multi Mesh of Trees

Multi Mesh of Trees network is the recent interest of researchers as it combines the efficiency of both Multi-Mesh and Mesh of Trees network architecture. Our aim in this paper is to propose the k-k sorting algorithm on MMT. Our algorithm takes 41n + o (n) steps. The sorting algorithm is based on the technique using interchange of data between the n × n submeshes and mesh of trees. Furthermore, with this approach we can handle k-k problem (where each processor contains k elements initially and finally) on the MMT.