在n*n个网格上排序n/sup 2/ number

[1993] Proceedings Seventh International Parallel Processing Symposium Pub Date : 1993-04-13 DOI:10.1109/IPPS.1993.262858

M. Nigam, S. Sahni

{"title":"在n*n个网格上排序n/sup 2/ number","authors":"M. Nigam, S. Sahni","doi":"10.1109/IPPS.1993.262858","DOIUrl":null,"url":null,"abstract":"The authors show that by folding data from an n*n mesh onto an n*(n/k) submesh, sorting on the submesh, and finally unfolding back onto the entire n*n mesh it is possible to sort on bidirectional and strict unidirectional meshes using a number of routing steps that is very close to the distance lower bound for these architectures. The technique may also be applied to reconfigurable bus architectures to obtain faster sorting algorithms.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Sorting n/sup 2/ numbers on n*n meshes\",\"authors\":\"M. Nigam, S. Sahni\",\"doi\":\"10.1109/IPPS.1993.262858\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors show that by folding data from an n*n mesh onto an n*(n/k) submesh, sorting on the submesh, and finally unfolding back onto the entire n*n mesh it is possible to sort on bidirectional and strict unidirectional meshes using a number of routing steps that is very close to the distance lower bound for these architectures. The technique may also be applied to reconfigurable bus architectures to obtain faster sorting algorithms.<<ETX>>\",\"PeriodicalId\":248927,\"journal\":{\"name\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1993.262858\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Seventh International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1993.262858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

作者表明，通过将数据从n*n网格折叠到n*(n/k)个子网格上，在子网格上排序，最后展开到整个n*n网格上，可以使用一些非常接近这些架构的距离下界的路由步骤对双向和严格的单向网格进行排序。该技术还可以应用于可重构总线体系结构，以获得更快的排序算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Sorting n/sup 2/ numbers on n*n meshes

The authors show that by folding data from an n*n mesh onto an n*(n/k) submesh, sorting on the submesh, and finally unfolding back onto the entire n*n mesh it is possible to sort on bidirectional and strict unidirectional meshes using a number of routing steps that is very close to the distance lower bound for these architectures. The technique may also be applied to reconfigurable bus architectures to obtain faster sorting algorithms.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1993] Proceedings Seventh International Parallel Processing Symposium

自引率

0.00%

发文量

期刊最新文献

Mapping realistic data sets on parallel computers A cluster-M based mapping methodology Supporting insertions and deletions in striped parallel filesystems An efficient atomic multicast protocol for client-server models Implementation of distributed asynchronous algorithms with stochastic delays for solving time drifting optimization problems