一种快速概率并行排序算法

22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI:10.1109/SFCS.1981.6

R. Reischuk

{"title":"一种快速概率并行排序算法","authors":"R. Reischuk","doi":"10.1109/SFCS.1981.6","DOIUrl":null,"url":null,"abstract":"We describe a probabilistic parallel algorithm to sort n keys drawn from some arbitrary total ordered set. This algorithm can be implemented on a parallel computer consisting of n RAMs, each with small private memory, and a common memory of size O(n) such that the average runtime is bounded by O(log n). Hence for this algorithm the product of time and number of processors meets the information theoretic lower bound for sorting.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":"{\"title\":\"A fast probabilistic parallel sorting algorithm\",\"authors\":\"R. Reischuk\",\"doi\":\"10.1109/SFCS.1981.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe a probabilistic parallel algorithm to sort n keys drawn from some arbitrary total ordered set. This algorithm can be implemented on a parallel computer consisting of n RAMs, each with small private memory, and a common memory of size O(n) such that the average runtime is bounded by O(log n). Hence for this algorithm the product of time and number of processors meets the information theoretic lower bound for sorting.\",\"PeriodicalId\":224735,\"journal\":{\"name\":\"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"55\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1981.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1981.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 55

摘要

本文描述了一种概率并行算法，用于对任意全有序集中的n个键进行排序。该算法可以在由n个ram组成的并行计算机上实现，每个ram具有较小的私有内存和一个大小为O(n)的公共内存，使得平均运行时间以O(log n)为界。因此，对于该算法，时间与处理器数量的乘积满足排序的信息论下界。

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

查看原文本刊更多论文

A fast probabilistic parallel sorting algorithm

We describe a probabilistic parallel algorithm to sort n keys drawn from some arbitrary total ordered set. This algorithm can be implemented on a parallel computer consisting of n RAMs, each with small private memory, and a common memory of size O(n) such that the average runtime is bounded by O(log n). Hence for this algorithm the product of time and number of processors meets the information theoretic lower bound for sorting.

求助全文

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

来源期刊

22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)

自引率

0.00%

发文量