Parallel sorting pattern

Authors:
Vivek Kale;Edgar Solomonik
Affiliations:
University of Illinois, Urbana, IL;University of California, Berkeley, CA
Venue:
Proceedings of the 2010 Workshop on Parallel Programming Patterns
Year:
2010

Citing 8
Cited 1

Parallel sorting with limited bandwidth

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Fast Parallel Sorting Under LogP: Experience with the CM-5

IEEE Transactions on Parallel and Distributed Systems
Load balanced parallel radix sort

ICS '98 Proceedings of the 12th international conference on Supercomputing
A randomized parallel sorting algorithm with an experimental study

Journal of Parallel and Distributed Computing
Introduction to algorithms

Introduction to algorithms
Efficient Massively Parallel Quicksort

IRREGULAR '97 Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel
The record-breaking terabyte sort on a compaq cluster

WINSYM'99 Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds

IEEE Transactions on Visualization and Computer Graphics

Sort-based parallel loading of R-trees

Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data

Quantified Score

Hi-index	0.00

Visualization

Abstract

A large number of parallel applications contain a computationally intensive phase in which a large list of elements must be ordered based on some common attribute of the elements. How do we sort a sequence of elements on multiple processing units so as to minimize redistribution of keys while allowing processing units to do independent sorting work?