Arbitrary rotation of raster images with SIMD machine architectures
Computer Graphics Forum
Optimal parallel merging and sorting without memory conflicts
IEEE Transactions on Computers
Parallel Sorting in Two-Dimensional VLSI Models of Computation
IEEE Transactions on Computers
The Hough transform on a reconfigurable multi-ring network
Journal of Parallel and Distributed Computing
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
A New Network Topology with Multiple Meshes
IEEE Transactions on Computers
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
Parallel Edge-Region-Based Segmentation Algorithm Targeted at Reconfigurable MultiRing Network
The Journal of Supercomputing
Multi-Mesh-an efficient topology for parallel processing
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Multi-mesh of trees with its parallel algorithms
Journal of Systems Architecture: the EUROMICRO Journal
IEEE Transactions on Computers
Dual-execution mode processor architecture
The Journal of Supercomputing
An Improved Parallel Sorting Algorithm for Odd Sequence
ICACTE '08 Proceedings of the 2008 International Conference on Advanced Computer Theory and Engineering
Designing efficient sorting algorithms for manycore GPUs
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
The Journal of Supercomputing
Bitonic sort on a chained-cubic tree interconnection network
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Various sorting algorithms using parallel architectures have been proposed in the search for more efficient results. This paper introduces the Multi-Sort Algorithm for Multi-Mesh of Trees (MMT) Architecture for N=n 4 elements with more efficient time complexity compared to previous architectures. The shear sort algorithm on Single Instruction Multiple Data (SIMD) mesh model requires $4\sqrt{N}+O\sqrt{N}$ time for sorting N elements, arranged on a $\sqrt{N}\times \sqrt{N}$ mesh, whereas Multi-Sort algorithm on the SIMD Multi-Mesh (MM) Architecture takes O(N 1/4) time for sorting the same N elements, which proves that Multi-Sort is a better sorting approach. We have improved the time complexity of intrablock Sort. The Communication time complexity for 2D Sort in MM is O(n), whereas this time in MMT is O(log驴n). The time complexity of compare---exchange step in MMT is same as that in MM, i.e., O(n). It has been found that the time complexity of the Multi-Sort on MMT has been improved as on Multi-Mesh architecture.