Live Webcast 15th Annual Charm++ Workshop

-->

PPL/Charm++ at SC17

Parallel Sorting
Encyclopedia of Parallel Computing 2011
Publication Type: Paper
Repository URL: papers/EncyParComp
Abstract
Parallel sorting is a process which given n keys distributed over p processors, migrates the keys so that all keys on processor k are sorted locally and are smaller than or equal to all keys on processor k+1.
TextRef
Laxmikant Kale and Edgar Solomonik, Parallel Sorting, Encyclopedia of Parallel Computing, David Padua, Ed., 2011 (to appear)
People
Research Areas