Parallel permutation and sorting algorithms and a new generalized connection network
Journal Article
·
· J. Assoc. Comput. Mach.; (United States)
O(k log n) algorithms are obtained to permute and sort n data items on cube and perfect shuffle computers with n/sup 1+1/k/ processing elements, 1>k>log n. These algorithms lead directly to a generalized-connection-network construction having o(k log n) delay and o(kn/sup 1+1/k/log n) contact pairs. This network has the advantage that the switches can be set in o(k log n) time by either a cube or perfect shuffle computer with n/sup 1+1/k/ processing elements. 23 references.
- Research Organization:
- Northwestern Univ., Evanston, IL
- OSTI ID:
- 5001068
- Journal Information:
- J. Assoc. Comput. Mach.; (United States), Journal Name: J. Assoc. Comput. Mach.; (United States) Vol. 3; ISSN JACOA
- Country of Publication:
- United States
- Language:
- English
Similar Records
A logarithmic time sort for linear size networks
Permutations on Illiac IV-type networks
Parallel-sorting algorithms for hypercube multiprocessors
Journal Article
·
Wed Dec 31 23:00:00 EST 1986
· J. Assoc. Comput. Mach.; (United States)
·
OSTI ID:6560601
Permutations on Illiac IV-type networks
Journal Article
·
Tue Jul 01 00:00:00 EDT 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5516693
Parallel-sorting algorithms for hypercube multiprocessors
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6155985