Uniform Memory Hierarchies

We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and nearly-optimal algorithms for a wide range of bandwidth degradations, including a parsimonious algorithm for constant bandwidth. We also develop optimal sorting algorithms for all bandwidths for other versions of UMH and P-UMH, including natural restrictions we introduce called RUMH and P-RUMH, which more closely correspond to current programming languages.

• Type: Conference
• Year: 1990
• Where: FOCS
• Authors: Bowen Alpern, Larry Carter, Ephraim Feig
• Keywords: Algorithms, FOCS 1990, Optimal Sorting Algorithms, Theoretical Computer Science, Uniform Memory Hierarchy