Pages that link to "Item:Q1185926"
From MaRDI portal
The following pages link to An efficient parallel sorting algorithm for shared memory multiprocessors (Q1185926):
Displaying 22 items.
- A note on adaptive parallel sorting (Q582114) (← links)
- A parallel sorting-merging algorithm for tightly coupled multiprocessors (Q912631) (← links)
- Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention (Q912634) (← links)
- Parallel sorting with cooperating heaps in a linear array of processors (Q922696) (← links)
- Analysis of the performance of the parallel quicksort method (Q1070824) (← links)
- Noisy sort, a memory-intensive sorting algorithm (Q1116704) (← links)
- Efficient algorithms for parallel sorting on mesh multicomputers (Q1193763) (← links)
- A parallel partition for enhanced parallel QuickSort (Q1195162) (← links)
- An efficient parallel sorting algorithm (Q1199552) (← links)
- Parallel sorting by regular sampling (Q1200122) (← links)
- A randomized parallel sorting algorithm with an experimental study (Q1268779) (← links)
- On the versatility of parallel sorting by regular sampling (Q1315927) (← links)
- Parallel merge sort with load balancing (Q1394776) (← links)
- Sorting algorithms on transputer arrays (Q1802662) (← links)
- Overlapping computations, communications and I/O in parallel sorting (Q1898182) (← links)
- (Q3112007) (← links)
- PARALLEL SORT-HASH OBJECT-ORIENTED COLLECTION JOIN ALGORITHMS FOR SHARED-MEMORY MACHINES (Q3150026) (← links)
- Parallel Sorting with Serial Memories (Q3219773) (← links)
- (Q4228477) (← links)
- A time-space optimal parallel sorting on a hypercube (Q4229564) (← links)
- GPU-Quicksort (Q5406196) (← links)
- Parallel data distribution management on shared-memory multiprocessors (Q6600077) (← links)
