Algorithms for sorting arbitrary input using a fixed-size parallel sorting device

Si Zheng · 2002

A simple computing model for sorting an arbitrary number of elements using a fixed-size sorting device is proposed, and a framework for designing a class of parallel sorting algorithms under this model is presented.

Read the paper · More papers on PaperTik