论文信息 - Radix sort for vector multiprocessors - 字舞流文

Radix sort for vector multiprocessors

No abstract available

Guy E. Blelloch | Marco Zagha

[1] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[2] David A. Padua,et al. Advanced compiler optimizations for supercomputers , 1986, CACM.

[3] Richard Cole,et al. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

[4] Lasse Natvig,et al. Logarithmic time cost optimal parallel sorting is not yet fast in practice , 1990, Proceedings SUPERCOMPUTING '90.

[5] Guy E. Blelloch,et al. A comparison of sorting algorithms for the connection machine CM-2 , 1991, SPAA '91.

[6] Guy E. Blelloch,et al. Scan primitives for vector computers , 1990, Proceedings SUPERCOMPUTING '90.

[7] Donald E. Knuth,et al. Sorting and Searching , 1973 .

[8] S. A. Levin,et al. A fully vectorized quicksort , 1990, Parallel Comput..

[9] Guy E. Blelloch,et al. Scans as Primitive Parallel Operations , 1989, ICPP.

[10] Henry D. Shapiro,et al. Algorithms from P to NP , 1991 .

[11] Wolfgang Rönsch,et al. Timing results of some internal sorting algorithms on vector computers , 1987, Parallel Comput..