Tree [r3] /
History



File Date Author Commit
source 2010-05-04 leofm [r3]
source_perf_tests 2010-01-04 leofm [r1] initial commit for caqsort-sel
test-parparstr 2010-01-04 leofm [r1] initial commit for caqsort-sel
LICENSE_1_0.txt 2010-01-04 leofm [r1] initial commit for caqsort-sel
compile 2010-01-04 leofm [r1] initial commit for caqsort-sel
readme.txt 2010-01-04 leofm [r1] initial commit for caqsort-sel

Read Me

-------------------------------------------------------
Selection and sorting algorithms 
-------------------------------------------------------

This folder provides code for several selection and sorting algorithms. 
Specifically, it implements:

    * (C)aQSort and (C)aQSel: sequential and parallel versions according to:
        [1] L.~Frias. On the number of string lookups in BSTs (and related 
        algorithms) with digital access. Technical report LSI-09-14-R, 
        Universitat Politčcnica de Catalunya, Departament de Llenguatges i
         Sistemes Informŕtics, 2009.

        [2] L. Frias and J. Petit. Combining digital access and parallel 
        partition for quicksort and quickselect.
        ICSE Workshop on Multicore Software Engineering, 0:33--40, 2009.
    * Multikey quicksort and quickselect according to:
        [2] L. Frias and S. Roura. Multikey Quickselect. Technical report 
        LSI-09-27-R, Universitat Politčcnica de Catalunya, Departament de 
        Llenguatges i Sistemes Informŕtics, 2009.

This is the main directory. The contents of the subdirectories are 
the following:

    ~source:  contains the source code 

    ~source_perf_tests:  contains the source code of test programs 

    ~test-mkey: contains the scripts used to run experiments for multikey 
    quickselect 

    ~test-parparstr: contains the scripts used to run experiments for parallel
     (C)aQSort and (C)aQSel

Also contains the following files (apart from this file):

    compile: describes how to compile the test program