Pages that link to "Item:Q912631"
From MaRDI portal
The following pages link to A parallel sorting-merging algorithm for tightly coupled multiprocessors (Q912631):
Displaying 15 items.
- A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← 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)
- The parallel neighbour sort and 2-way merge algorithm (Q1068553) (← links)
- Analysis of the performance of the parallel quicksort method (Q1070824) (← links)
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge (Q1123621) (← links)
- A balanced submatrix merging algorithm for multiprocessor architectures (Q1185909) (← links)
- An efficient parallel sorting algorithm for shared memory multiprocessors (Q1185926) (← links)
- Parallel sorting by regular sampling (Q1200122) (← links)
- Simple randomized mergesort on parallel disks (Q1391519) (← links)
- Parallel merge sort with load balancing (Q1394776) (← links)
- Sorting algorithms on transputer arrays (Q1802662) (← links)
- Parallel merging sorting using comparison matrices. I (Q1905191) (← links)
- Parallel merge sort using comparison matrices. II (Q1918756) (← links)
- A Pictorial Description of Cole’s Parallel Merge Sort (Q3644720) (← links)