sifsort算法

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI:10.1109/PARBSE.1990.77196

J. Bentin, J. Modi

{"title":"sifsort算法","authors":"J. Bentin, J. Modi","doi":"10.1109/PARBSE.1990.77196","DOIUrl":null,"url":null,"abstract":"A description is given of Siftsort, a highly parallel algorithm, which takes O(log/sup 2//sub 2/ n) steps to sort n items of data on fewer than n log/sub 2/ n processors. Although a comparison-exchange algorithm, it separates out the comparisons from the exchanges, with an intermediate logical step of selectively annihilating-that is, sifting-an array representing the results of comparisons. The algorithm proceeds by successive sweeps, with each sweep consisting of three stages: comparison, sifting, and exchange. Unlike Batcher's sort, the method is robust against random errors occurring in the sorting process.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Siftsort algorithm\",\"authors\":\"J. Bentin, J. Modi\",\"doi\":\"10.1109/PARBSE.1990.77196\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A description is given of Siftsort, a highly parallel algorithm, which takes O(log/sup 2//sub 2/ n) steps to sort n items of data on fewer than n log/sub 2/ n processors. Although a comparison-exchange algorithm, it separates out the comparisons from the exchanges, with an intermediate logical step of selectively annihilating-that is, sifting-an array representing the results of comparisons. The algorithm proceeds by successive sweeps, with each sweep consisting of three stages: comparison, sifting, and exchange. Unlike Batcher's sort, the method is robust against random errors occurring in the sorting process.<<ETX>>\",\"PeriodicalId\":389644,\"journal\":{\"name\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PARBSE.1990.77196\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

描述了Siftsort算法，它是一种高度并行的算法，它需要O(log/sup 2//sub 2/ n)个步骤在少于n个log/sub 2/ n个处理器上对n项数据进行排序。虽然是比较交换算法，但它将比较从交换中分离出来，中间逻辑步骤是选择性地消除(即筛选)表示比较结果的数组。算法通过连续扫描进行，每次扫描包括三个阶段:比较、筛选和交换。与批处理排序不同，该方法对排序过程中出现的随机错误具有鲁棒性。

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

查看原文本刊更多论文

The Siftsort algorithm

A description is given of Siftsort, a highly parallel algorithm, which takes O(log/sup 2//sub 2/ n) steps to sort n items of data on fewer than n log/sub 2/ n processors. Although a comparison-exchange algorithm, it separates out the comparisons from the exchanges, with an intermediate logical step of selectively annihilating-that is, sifting-an array representing the results of comparisons. The algorithm proceeds by successive sweeps, with each sweep consisting of three stages: comparison, sifting, and exchange. Unlike Batcher's sort, the method is robust against random errors occurring in the sorting process.<>

求助全文

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

来源期刊

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications

自引率

0.00%

发文量