Pages that link to "Item:Q1386651"
From MaRDI portal
The following pages link to An experimental analysis of parallel sorting algorithms (Q1386651):
Displaying 17 items.
- Parallel-vector algorithms for particle simulations on shared-memory multiprocessors (Q630432) (← links)
- Efficient sample sort and the average case analysis of PEsort (Q861251) (← links)
- Analysis of the performance of the parallel quicksort method (Q1070824) (← links)
- Analyzing a class of distributive partitioning sort algorithms (Q1075762) (← links)
- Timing results of some internal sorting algorithms on vector computers (Q1100881) (← links)
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge (Q1123621) (← links)
- A randomized parallel sorting algorithm with an experimental study (Q1268779) (← links)
- On the versatility of parallel sorting by regular sampling (Q1315927) (← links)
- Efficient massively parallel implementation of some combinatorial algorithms (Q1365935) (← links)
- Application of fuzzy optimization to the orienteering problem (Q1750202) (← links)
- Sorting algorithms on transputer arrays (Q1802662) (← links)
- Timing results of some internal sorting algorithms on the ETA 10-P (Q1823702) (← links)
- Overlapping computations, communications and I/O in parallel sorting (Q1898182) (← links)
- An efficient general in-place parallel sorting scheme (Q1964342) (← links)
- A strategy for parallel sorting algorithms evaluation based on MPI technology (Q2804723) (← links)
- Cache-Oblivious Iterated Predecessor Queries via Range Coalescing (Q3449823) (← links)
- The performance of a selection of sorting algorithms on a general purpose parallel computer (Q4208621) (← links)
