Fundamentals of Computation Theory

1997

DOI: 10.1007/bfb0036174

|View full text |Cite

|

Sign up to set email alerts

|

k-k Sorting on the multi-mesh

Alfons Avermiddig

¹

,

²

,

³

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

0

Mentioning

1

Contrasting

0

Year Published

2004

2004

2010

2010

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

0

Mentioning

1

Contrasting

0

Order By: Relevance

“…In k-k sorting problem [5], as we have studied, each processor initially contains k elements and also receives k elements finally. The result on multimesh architecture is described in [k-k sorting].…”

Section: Introductionmentioning

confidence: 99%

k-k sorting on the Multi Mesh of Trees

¹

,

²

2010

2010 the 2nd International Conference on Computer and Automation Engineering (ICCAE)

View full text Add to dashboard Cite

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.Index Terms-k-k Sorting, 1-1 Sorting, Multi Mesh of trees, Indexing, Snake Like indexing, Brick-to-plane transport, allto-all transport.

“…In k-k sorting problem [5], as we have studied, each processor initially contains k elements and also receives k elements finally. The result on multimesh architecture is described in [k-k sorting].…”

Section: Introductionmentioning

confidence: 99%

k-k sorting on the Multi Mesh of Trees

¹

,

²

2010

2010 the 2nd International Conference on Computer and Automation Engineering (ICCAE)

View full text Add to dashboard Cite

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.Index Terms-k-k Sorting, 1-1 Sorting, Multi Mesh of trees, Indexing, Snake Like indexing, Brick-to-plane transport, allto-all transport.

Multi-mesh of trees with its parallel algorithms

2004

Journal of Systems Architecture

View full text Add to dashboard Cite

No abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Product

Browser Extension Assistant by scite Citation Statement Search Reference Check Visualizations Dashboards Explore Journals Explore Organizations Explore Funders Embedding Badge Embedding Citation Search Pricing

Resources

Blog Help & FAQ Accessibility Statement API Terms For Universities & Governments For Researchers For Publishers For Corporate, Pharma & Enterprise Author Marketing Become an Affiliate Get an organization trial or quote scite Data & Services

About

News & Press Careers Read our Paper Coverage

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Copyright © 2024 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.