loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)
Parallel Sorting by Exact Splitting
Hong Kong, SAR, China
May 10-May 12
ISBN: 0-7695-2135-5
Fan Dian, Tsinghua University, China
Tang Zhizhong, Tsinghua University, China
A new algorithm of parallel sorting by exact splitting suitable for MIMD multiprocessors is presented in the paper. The algorithm locates the splitter accurately using flexible locating splitter algorithm. The time complexity and communication cost is pretty good as compared with other con-generic algorithms, and they could even be better in particular situation benefitting from the flexibility of its locating splitter algorithm. In addition, the experimental results of the algorithm under MPI environment on LANs are given and compared with that of PSRS algorithm. According to the theoretical analysis and experimental results, the algorithm is a preferable algorithm for its virtues of high efficiency, scalability, low communication cost and well load balancing.
Citation:
Fan Dian, Tang Zhizhong, "Parallel Sorting by Exact Splitting," ispan, pp.92, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.