File: perf_sort_by_key.cpp

package info (click to toggle)
boost1.83 1.83.0-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 545,632 kB
  • sloc: cpp: 3,857,086; xml: 125,552; ansic: 34,414; python: 25,887; asm: 5,276; sh: 4,799; ada: 1,681; makefile: 1,629; perl: 1,212; pascal: 1,139; sql: 810; yacc: 478; ruby: 102; lisp: 24; csh: 6
file content (79 lines) | stat: -rw-r--r-- 2,764 bytes parent folder | download | duplicates (14)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
//---------------------------------------------------------------------------//
// Copyright (c) 2013-2014 Kyle Lutz <kyle.r.lutz@gmail.com>
//
// Distributed under the Boost Software License, Version 1.0
// See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt
//
// See http://boostorg.github.com/compute for more information.
//---------------------------------------------------------------------------//

#include <algorithm>
#include <iostream>
#include <vector>

#include <boost/compute/system.hpp>
#include <boost/compute/algorithm/sort_by_key.hpp>
#include <boost/compute/algorithm/is_sorted.hpp>
#include <boost/compute/container/vector.hpp>
#include <boost/compute/types/fundamental.hpp>

#include "perf.hpp"

int main(int argc, char *argv[])
{
    using boost::compute::int_;
    using boost::compute::long_;

    perf_parse_args(argc, argv);

    std::cout << "size: " << PERF_N << std::endl;

    // setup context and queue for the default device
    boost::compute::device device = boost::compute::system::default_device();
    boost::compute::context context(device);
    boost::compute::command_queue queue(context, device);
    std::cout << "device: " << device.name() << std::endl;

    // create vector of random numbers on the host
    std::vector<int_> host_keys(PERF_N);
    std::generate(host_keys.begin(), host_keys.end(), rand);
    std::vector<long_> host_values(PERF_N);
    std::copy(host_keys.begin(), host_keys.end(), host_values.begin());

    // create vector on the device and copy the data
    boost::compute::vector<int_> device_keys(PERF_N, context);
    boost::compute::vector<long_> device_values(PERF_N, context);

    perf_timer t;
    for(size_t trial = 0; trial < PERF_TRIALS; trial++){
        boost::compute::copy(
            host_keys.begin(), host_keys.end(), device_keys.begin(), queue
        );
        boost::compute::copy(
            host_values.begin(), host_values.end(), device_values.begin(), queue
        );

        t.start();
        // sort vector
        boost::compute::sort_by_key(
            device_keys.begin(), device_keys.end(), device_values.begin(), queue
        );
        queue.finish();
        t.stop();
    }
    std::cout << "time: " << t.min_time() / 1e6 << " ms" << std::endl;

    // verify keys are sorted
    if(!boost::compute::is_sorted(device_keys.begin(), device_keys.end(), queue)){
        std::cout << "ERROR: is_sorted() returned false for the keys" << std::endl;
        return -1;
    }
    // verify values are sorted
    if(!boost::compute::is_sorted(device_values.begin(), device_values.end(), queue)){
        std::cout << "ERROR: is_sorted() returned false for the values" << std::endl;
        return -1;
    }

    return 0;
}