Title :
k-k sorting on the Multi Mesh of Trees
Author :
Rakesh, Nitin ; Chanderwal, Nitin
Author_Institution :
Dept. of Comput. Sci. & Eng. & Inf. Technol., Jaypee Univ. of Inf. Technol., Waknaghat, India
Abstract :
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.
Keywords :
indexing; sorting; indexing; k-k sorting; mesh of trees network architecture; multimesh of trees network; Algorithm design and analysis; Computer architecture; Computer science; Indexing; Information technology; Network topology; Routing; Sorting; Tree graphs; Very large scale integration; 1–1 Sorting; Brick-to-plane transport; Indexing; Multi Mesh of trees; Snake Like indexing; all-to-all transport; k-k Sorting;
Conference_Titel :
Computer and Automation Engineering (ICCAE), 2010 The 2nd International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-5585-0
Electronic_ISBN :
978-1-4244-5586-7
DOI :
10.1109/ICCAE.2010.5451723
