Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Sample sort"”.

  1. Parallel sorting and Star-P data movement and tree flattening

    … first result provides a deterministic parallel sorting algorithm that empirically shows an improvement over two sample sort algorithms. When using a comparison sort, this algorithm is 1-optimal in both computation and communication. The second study develops some extensions to the Star-P system …

    mit Repository record for Parallel sorting and Star-P data movement and tree flattening (opens in a new tab)

  2. Histogram sort with sampling

    The student, - Vipul Harsh, submitted this Thesis for approval on 2017-07-04 at 08:53.

    uiuc Repository record for Histogram sort with sampling (opens in a new tab)

  3. Portable and productive high-performance computing

    … systems, executing "watershed" cuts on graphs, sample sort, fast multipole computations, and all-prefix-sums and its various applications. We present a programming model, which is also called Star, to generate and execute parallel code for the Star class of programs. The Star model abstracts the …

    mit Repository record for Portable and productive high-performance computing (opens in a new tab)