可重构网格的基本数据移动算法

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200593

S. Olariu, J. L. Schwing, J. Zhang

{"title":"可重构网格的基本数据移动算法","authors":"S. Olariu, J. L. Schwing, J. Zhang","doi":"10.1109/PCCC.1992.200593","DOIUrl":null,"url":null,"abstract":"A number of data movement algorithms for the two-dimensional reconfigurable mesh are presented. These include computing the prefix sum of a binary sequence and computing the prefix maxima of a sequence of real numbers. These algorithms lead to a fast algorithm to sort a sequence of n reals in O(log n/log m) time on a reconfigurable mesh of size mn*n with 3<or=m<or=n. The result implies that sorting n real numbers takes O(1) time on a reconfigurable mesh of size n/sup 1.5/*n. The sorting algorithm uses significantly fewer processors than the best-known algorithm to date. Next, it is shown that computing the convex hull of a planar set of n points takes O(log n/log m) time on a reconfigurable mesh of size mn*n with 3<or=m<or=n. The result implies that the convex hull of n points in the plane can be coupled in O(1) time on a reconfigurable mesh of size n/sup 1.5/*n.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Fundamental data movement algorithms for reconfigurable meshes\",\"authors\":\"S. Olariu, J. L. Schwing, J. Zhang\",\"doi\":\"10.1109/PCCC.1992.200593\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A number of data movement algorithms for the two-dimensional reconfigurable mesh are presented. These include computing the prefix sum of a binary sequence and computing the prefix maxima of a sequence of real numbers. These algorithms lead to a fast algorithm to sort a sequence of n reals in O(log n/log m) time on a reconfigurable mesh of size mn*n with 3<or=m<or=n. The result implies that sorting n real numbers takes O(1) time on a reconfigurable mesh of size n/sup 1.5/*n. The sorting algorithm uses significantly fewer processors than the best-known algorithm to date. Next, it is shown that computing the convex hull of a planar set of n points takes O(log n/log m) time on a reconfigurable mesh of size mn*n with 3<or=m<or=n. The result implies that the convex hull of n points in the plane can be coupled in O(1) time on a reconfigurable mesh of size n/sup 1.5/*n.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200593\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200593","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

摘要

针对二维可重构网格，提出了多种数据移动算法。这包括计算二进制序列的前缀和和计算实数序列的前缀最大值。这些算法产生了一种快速算法，可以在0 (log n/log m)时间内对n个实数序列在大小为mn*n的可重构网格上进行排序。

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

查看原文

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

本刊更多论文

Fundamental data movement algorithms for reconfigurable meshes

A number of data movement algorithms for the two-dimensional reconfigurable mesh are presented. These include computing the prefix sum of a binary sequence and computing the prefix maxima of a sequence of real numbers. These algorithms lead to a fast algorithm to sort a sequence of n reals in O(log n/log m) time on a reconfigurable mesh of size mn*n with 3>

求助全文

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

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量