AN EFFICIENT PARALLEL SORTING COMPATIBLE WITH THE STANDARD QSORT (Q3173935): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GPUTeraSort / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel merge sort with load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized parallel sorting algorithm with an experimental study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioned parallel radix sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: A benchmark parallel sort for shared memory multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel GPU-sorting using a hybrid algorithm / rank
 
Normal rank

Latest revision as of 12:56, 4 July 2024

scientific article
Language Label Description Also known as
English
AN EFFICIENT PARALLEL SORTING COMPATIBLE WITH THE STANDARD QSORT
scientific article

    Statements

    AN EFFICIENT PARALLEL SORTING COMPATIBLE WITH THE STANDARD QSORT (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    sorting
    0 references
    multicore processor
    0 references
    C standard library
    0 references
    loading balance
    0 references
    \texttt{qsort}
    0 references
    \texttt{psort}
    0 references

    Identifiers