scan_perf-inl.h 4.89 KB
Newer Older
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 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119
/*
 * Copyright (c) 2014, Siemens AG. All rights reserved.
 *
 * 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.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 THE COPYRIGHT HOLDER OR 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.
 */

#ifndef EMB_ALGORITHMS_PERF_SCAN_PERF_INL_H_
#define EMB_ALGORITHMS_PERF_SCAN_PERF_INL_H_

#include <scan_perf.h>
#include <embb/algorithms/scan.h>
#include <embb/base/perf/call_args.h>
#include <embb/base/memory_allocation.h>
#include <index_iterator.h>
#include <embb/tasks/tasks.h>

namespace embb {
namespace algorithms {
namespace perf {

using namespace embb::base;

template<typename T>
SerialScan<T>::SerialScan(const embb::base::perf::CallArgs & args) :
  cargs(args),
  vector_size(args.VectorSize()),
  load_factor(args.LoadFactor()) {
  if (cargs.StressMode() == CallArgs::RAM_STRESS) {
    out = (T *) Allocation::AllocateCacheAligned(
      vector_size * sizeof(T));
    in  = (T *) Allocation::AllocateCacheAligned(
      vector_size * sizeof(T));
    for (size_t i = 0; i < vector_size; i++) {
      in[i] = static_cast<T>(1);
    }
  }
  else {
    out = 0;
    in  = 0;
  }
}

template<typename T>
SerialScan<T>::~SerialScan() {
  if (in != 0) {
    Allocation::FreeAligned(in);
  }
  if (out != 0) {
    Allocation::FreeAligned(out);
  }
}

template<typename T>
void SerialScan<T>::Run() {
  T total = 0;
  if (cargs.StressMode() == CallArgs::RAM_STRESS) {
    for (unsigned int i = 0; i < vector_size; i++) {
      // artificial complexity
      for (unsigned int k = 0; k < load_factor; k++) {
        total += static_cast<T>(in[i]);
      }
      out[i] = total;
    }
    result = out[vector_size - 1];
  }
  else {
    for (unsigned int i = 0; i < vector_size; i++) {
      // artificial complexity
      for (unsigned int k = 0; k < load_factor; k++) {
        total += 1;
      }
      out[i] = total;
    }
    result = out[vector_size - 1];
  }
}

template<typename T>
ParallelScan<T>::ParallelScan(const embb::base::perf::CallArgs & args) :
  cargs(args), vector_size(args.VectorSize()) {
  if (cargs.StressMode() == CallArgs::RAM_STRESS) {
    in = (T *) Allocation::AllocateCacheAligned(
      vector_size * sizeof(T));
  }
  else {
    in  = 0;
  }
  out = (T *) Allocation::AllocateCacheAligned(
    vector_size * sizeof(T));
}

template<typename T>
ParallelScan<T>::~ParallelScan() {
  if (in != 0) {
    Allocation::FreeAligned(in);
  }
}

template<typename T>
120 121 122 123 124 125 126 127 128 129
void ParallelScan<T>::Pre() {
  if (cargs.StressMode() == CallArgs::RAM_STRESS) {
    // Initialize input vector with 1's:
    for (size_t i = 0; i < vector_size; i++) {
      in[i] = static_cast<T>(1);
    }
  }
}

template<typename T>
130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166
void ParallelScan<T>::Run(unsigned int numThreads) {
  if (cargs.StressMode() == CallArgs::CPU_STRESS) {
    CpuStressScanOp<T> op(cargs);
    embb::algorithms::Scan(
      // Using iterator returning index value to avoid 
      // memory access
      IndexIterator<T>(0),
      IndexIterator<T>(static_cast<int>(vector_size)),
      out,
      static_cast<T>(0),            // neutral element
      op,                           // scan aggregation functor
      embb::algorithms::Identity(), // no transformation
      embb::tasks::ExecutionPolicy(),
      vector_size / numThreads
      );
    result = out[vector_size - 1];
  }
  else if (cargs.StressMode() == CallArgs::RAM_STRESS) {
    RamStressScanOp<T> op(cargs, in);
    embb::algorithms::Scan(
      in, in + vector_size, 
      out,
      static_cast<T>(0),            // neutral element
      op,                           // scan aggregation functor
      embb::algorithms::Identity(), // no transformation
      embb::tasks::ExecutionPolicy(),
      vector_size / numThreads
      );
    result = out[vector_size - 1];
  }
}

} // namespace perf
} // namespace algorithms
} // namespace embb

#endif /* EMB_ALGORITHMS_PERF_SCAN_PERF_INL_H_ */