Towards optimal parallel radix sorting

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

R. Vaidyanathan, C. Hartmann, P. Varshney

引用次数: 8

Abstract

The authors propose a radix sorting algorithm for n m-bit numbers (where m= Omega (log n) and polynomially upper bounded in n) that runs in O(t(n)log m) time, on any PRAM with mp(n)/logn logm O(logn)-bit processors; p(n) and t(n) are the number of processors and time needed for any deterministic algorithm to sort n logn-bit numbers stably (integer sorting) on the same type of PRAM as used by the radix sorting algorithm. The proposed algorithm has the same factor of inefficiency (if any) as that of the integer sorting algorithm used by it.<>

查看原文

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

本刊更多论文

走向最优并行基数排序

在任意具有mp(n)/logn logm O(logn)位处理器的PRAM上，作者提出了一种n m-bit数的基数排序算法(其中m= Omega (logn)和n的多项式上界)，该算法运行时间为O(t(n)log m);p(n)和t(n)是任何确定性算法在与基数排序算法使用的相同类型的PRAM上对n个对数位数进行稳定排序(整数排序)所需的处理器数量和时间。所提出的算法具有与它所使用的整数排序算法相同的低效率因素(如果有的话)。

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

求助全文

约1分钟内获得全文去求助

来源期刊

[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