2010 the 2nd International Conference on Computer and Automation Engineering (ICCAE) 2010
DOI: 10.1109/iccae.2010.5451723
|View full text |Cite
|
Sign up to set email alerts
|

k-k sorting on the Multi Mesh of Trees

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…However, generally, the target thickening time is often based on the objectives of the operator. Commonly reported consistencies are 40, 50, 60, and 70 Bc. …”
Section: Results and Discussionmentioning
confidence: 99%
“…However, generally, the target thickening time is often based on the objectives of the operator. Commonly reported consistencies are 40, 50, 60, and 70 Bc. …”
Section: Results and Discussionmentioning
confidence: 99%
“…The default values are used for the under-relaxation factors. In the iteration process, the residuals of continuity, x -velocity, y -velocity, z -velocity, k , and epsilon are controlled at a level, while the energy equation is controlled at a level. The iteration calculation is considered converged when the residuals reach the corresponding residual accuracy …”
Section: Grid Partitioning and Computational Methodsmentioning
confidence: 99%
“…The iteration calculation is considered converged when the residuals reach the corresponding residual accuracy. 33 …”
Section: Grid Partitioning and Computational Methodsmentioning
confidence: 99%