Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.


Cubesort is a parallel sorting algorithm that builds a self-balancing multi-dimensional array from the keys to be sorted. As the axes are of similar… Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Abstract This paper presents a parallel sorting algorithm called Cubesort. Cubesort sorts N data items by performing a number of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
This paper studies the problem of sorting N items on a P processor parallel machine, where N≥P. The central result of the paper… Expand
Is this relevant?