102 lines
3.6 KiB
C++
102 lines
3.6 KiB
C++
/*
|
|
//@HEADER
|
|
// ************************************************************************
|
|
//
|
|
// Kokkos v. 3.0
|
|
// Copyright (2020) National Technology & Engineering
|
|
// Solutions of Sandia, LLC (NTESS).
|
|
//
|
|
// Under the terms of Contract DE-NA0003525 with NTESS,
|
|
// the U.S. Government retains certain rights in this software.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// 1. Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
//
|
|
// 2. Redistributions in binary form must reproduce the above copyright
|
|
// notice, this list of conditions and the following disclaimer in the
|
|
// documentation and/or other materials provided with the distribution.
|
|
//
|
|
// 3. Neither the name of the Corporation nor the names of the
|
|
// contributors may be used to endorse or promote products derived from
|
|
// this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY NTESS "AS IS" AND ANY
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NTESS OR THE
|
|
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
//
|
|
// Questions? Contact Christian R. Trott (crtrott@sandia.gov)
|
|
//
|
|
// ************************************************************************
|
|
//@HEADER
|
|
*/
|
|
|
|
#include <Kokkos_Core.hpp>
|
|
#include <impl/Kokkos_Timer.hpp>
|
|
#include <gather.hpp>
|
|
#include <cstdlib>
|
|
|
|
int main(int argc, char* argv[]) {
|
|
Kokkos::initialize(argc, argv);
|
|
|
|
if (argc < 8) {
|
|
printf("Arguments: S N K D\n");
|
|
printf(
|
|
" S: Scalar Type Size (1==float, 2==double, 4=complex<double>)\n");
|
|
printf(" N: Number of entities\n");
|
|
printf(" K: Number of things to gather per entity\n");
|
|
printf(" D: Max distance of gathered things of an entity\n");
|
|
printf(" R: how often to loop through the K dimension with each team\n");
|
|
printf(" U: how many independent flops to do per load\n");
|
|
printf(
|
|
" F: how many times to repeat the U unrolled operations before "
|
|
"reading next element\n");
|
|
printf("Example Input GPU:\n");
|
|
printf(" Bandwidth Bound : 2 10000000 1 1 10 1 1\n");
|
|
printf(" Cache Bound : 2 10000000 64 1 10 1 1\n");
|
|
printf(" Cache Gather : 2 10000000 64 256 10 1 1\n");
|
|
printf(" Global Gather : 2 100000000 16 100000000 1 1 1\n");
|
|
printf(" Typical MD : 2 100000 32 512 1000 8 2\n");
|
|
Kokkos::finalize();
|
|
return 0;
|
|
}
|
|
|
|
int S = atoi(argv[1]);
|
|
int N = atoi(argv[2]);
|
|
int K = atoi(argv[3]);
|
|
int D = atoi(argv[4]);
|
|
int R = atoi(argv[5]);
|
|
int U = atoi(argv[6]);
|
|
int F = atoi(argv[7]);
|
|
|
|
if ((S != 1) && (S != 2) && (S != 4)) {
|
|
printf("S must be one of 1,2,4\n");
|
|
return 0;
|
|
}
|
|
if (N < D) {
|
|
printf("N must be larger or equal to D\n");
|
|
return 0;
|
|
}
|
|
if (S == 1) {
|
|
run_gather_test<float>(N, K, D, R, U, F);
|
|
}
|
|
if (S == 2) {
|
|
run_gather_test<double>(N, K, D, R, U, F);
|
|
}
|
|
if (S == 4) {
|
|
run_gather_test<Kokkos::complex<double> >(N, K, D, R, U, F);
|
|
}
|
|
Kokkos::finalize();
|
|
}
|