Parallel sorting on cayley graphs |
| |
| Authors: | Daniel M Gordon |
| |
| Affiliation: | (1) Department of Computer Science, University of Georgia, 30602 Athens, GA, USA |
| |
| Abstract: | This paper presents a parallel algorithm for sorting on any graph with a Hamiltonian path and 1-factorization. For ann-cube the algorithm is equivalent to the sequential balanced sorting network of Dowd, Perl, Rudolph, and Saks. The application of this algorithm to other networks is discussed. |
| |
| Keywords: | Sorting Hypercube Sorting network Parallel algorithm Complexity |
| 本文献已被 SpringerLink 等数据库收录！ |
|
