Parallel Sorting with Serial Memories
From MaRDI portal
Recommendations
- Sorting in Parallel
- Parallel sorting revisited
- scientific article; zbMATH DE number 4074508
- Sorting roughly sorted sequences in parallel
- scientific article; zbMATH DE number 2087747
- An efficient parallel sorting algorithm for shared memory multiprocessors
- Parallel External Memory Suffix Sorting
- Parallel Sorting with Limited Bandwidth
- On parallel integer sorting
Cited in
(20)- Simulating the Bitonic Sort Using P Systems
- Scanning multiple sequences via cache memory
- Slowing down sorting networks to obtain faster sorting algorithms
- Noisy sort, a memory-intensive sorting algorithm
- scientific article; zbMATH DE number 3938577 (Why is no real title available?)
- Sorting numbers using limited systolic coprocessors
- Systolic Sorting on a Mesh-Connected Network
- Parallel newton interpolation on mesh-of-unshuffle network
- Space and time complexities of balanced sorting on processor arrays
- Routing, merging, and sorting on parallel models of computation
- Parallel sorting in two-dimensional VLSI models of computation
- scientific article; zbMATH DE number 4064477 (Why is no real title available?)
- Parallelism in tape-sorting
- Sorting on OTIS-Networks
- Parallel External Memory Suffix Sorting
- Systolic sorting in a sequential input/output environment
- RANDOMIZED SORTING ON THE POPS NETWORK
- scientific article; zbMATH DE number 4070343 (Why is no real title available?)
- Overlapping computations, communications and I/O in parallel sorting
- VLSI-sorting evaluated under the linear model
This page was built for publication: Parallel Sorting with Serial Memories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219773)
