首页   按字顺浏览 期刊浏览 卷期浏览 SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS
SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS

 

作者: S. RAJASEKARAN,   S. SAHNI,  

 

期刊: Parallel Algorithms and Applications  (Taylor Available online 1996)
卷期: Volume 8, issue 3-4  

页码: 179-193

 

ISSN:1063-7192

 

年代: 1996

 

DOI:10.1080/10637199608915552

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient algorithm for computing the sum ofnbits; 2) An optimalO(1) time sorting algorithm; 3) An optimal randomized logarithmic lime integer sorting algorithm; and 4) An optimal randomized constant time selection algorithm. Our algorithms will run without change in performance on many related models as well. For example, these algorithms apply to the RMBM model of Vaidyanathan et al.

 

点击下载:  PDF (308KB)



返 回