|
| 1 | +#include <CL/sycl.hpp> |
| 2 | +#include "use_sycl_buffer.h" |
| 3 | +#include <oneapi/mkl.hpp> |
| 4 | +#include "dppl_sycl_types.h" |
| 5 | + |
| 6 | +int |
| 7 | +c_columnwise_total(DPPLSyclQueueRef q_ref, size_t n, size_t m, double *mat, double *ct) { |
| 8 | + |
| 9 | + sycl::queue q = *(reinterpret_cast<sycl::queue *>(q_ref)); |
| 10 | + |
| 11 | + sycl::buffer<double, 1> mat_buffer = sycl::buffer(mat, sycl::range<1>(n * m)); |
| 12 | + sycl::buffer<double, 1> ct_buffer = sycl::buffer(ct, sycl::range<1>(m)); |
| 13 | + |
| 14 | + double *ones = reinterpret_cast<double *>(malloc(n * sizeof(double))); |
| 15 | + { |
| 16 | + sycl::buffer<double, 1> ones_buffer = sycl::buffer(ones, sycl::range<1>(n)); |
| 17 | + |
| 18 | + try { |
| 19 | + auto ev = q.submit([&](sycl::handler &cgh) { |
| 20 | + auto ones_acc = ones_buffer.get_access<sycl::access::mode::read_write>(cgh); |
| 21 | + cgh.fill(ones_acc, double(1.0)); |
| 22 | + }); |
| 23 | + |
| 24 | + ev.wait_and_throw(); |
| 25 | + } |
| 26 | + catch (sycl::exception const& e) { |
| 27 | + std::cout << "\t\tCaught synchronous SYCL exception during fill:\n" |
| 28 | + << e.what() << std::endl << "OpenCL status: " << e.get_cl_code() << std::endl; |
| 29 | + goto cleanup; |
| 30 | + } |
| 31 | + |
| 32 | + try { |
| 33 | + oneapi::mkl::blas::row_major::gemv( |
| 34 | + q, |
| 35 | + oneapi::mkl::transpose::trans, |
| 36 | + n, m, double(1.0), mat_buffer, m, |
| 37 | + ones_buffer, 1, |
| 38 | + double(0.0), ct_buffer, 1); |
| 39 | + q.wait(); |
| 40 | + } |
| 41 | + catch (sycl::exception const &e) { |
| 42 | + std::cout << "\t\tCaught synchronous SYCL exception during GEMV:\n" |
| 43 | + << e.what() << std::endl << "OpenCL status: " << e.get_cl_code() << std::endl; |
| 44 | + goto cleanup; |
| 45 | + } |
| 46 | + } |
| 47 | + |
| 48 | + free(ones); |
| 49 | + return 0; |
| 50 | + |
| 51 | + cleanup: |
| 52 | + free(ones); |
| 53 | + return -1; |
| 54 | +} |
| 55 | + |
| 56 | +inline size_t upper_multiple(size_t n, size_t wg) { return wg * ((n + wg - 1)/wg); } |
| 57 | + |
| 58 | +int |
| 59 | +c_columnwise_total_no_mkl(DPPLSyclQueueRef q_ref, size_t n, size_t m, double *mat, double *ct) { |
| 60 | + |
| 61 | + sycl::queue q = *(reinterpret_cast<sycl::queue *>(q_ref)); |
| 62 | + |
| 63 | + sycl::buffer<double, 2> mat_buffer = sycl::buffer(mat, sycl::range<2>(n, m)); |
| 64 | + sycl::buffer<double, 1> ct_buffer = sycl::buffer(ct, sycl::range<1>(m)); |
| 65 | + |
| 66 | + auto e = q.submit( |
| 67 | + [&](sycl::handler &h) { |
| 68 | + sycl::accessor ct_acc {ct_buffer, h, sycl::write_only}; |
| 69 | + h.parallel_for( |
| 70 | + sycl::range<1>(m), |
| 71 | + [=](sycl::id<1> i){ |
| 72 | + ct_acc[i] = 0.0; |
| 73 | + }); |
| 74 | + }); |
| 75 | + |
| 76 | + constexpr size_t wg = 256; |
| 77 | + auto e2 = q.submit( |
| 78 | + [&](sycl::handler &h) { |
| 79 | + |
| 80 | + sycl::accessor mat_acc {mat_buffer, h, sycl::read_only}; |
| 81 | + sycl::accessor ct_acc {ct_buffer, h}; |
| 82 | + h.depends_on(e); |
| 83 | + |
| 84 | + sycl::range<2> global {upper_multiple(n, wg), m}; |
| 85 | + sycl::range<2> local {wg, 1}; |
| 86 | + |
| 87 | + h.parallel_for( |
| 88 | + sycl::nd_range<2>(global, local), |
| 89 | + [=](sycl::nd_item<2> it) { |
| 90 | + size_t i = it.get_global_id(0); |
| 91 | + size_t j = it.get_global_id(1); |
| 92 | + double group_sum = sycl::ONEAPI::reduce( |
| 93 | + it.get_group(), |
| 94 | + (i < n) ? mat_acc[it.get_global_id()] : 0.0, |
| 95 | + std::plus<double>() |
| 96 | + ); |
| 97 | + if (it.get_local_id(0) == 0) { |
| 98 | + sycl::ONEAPI::atomic_ref< |
| 99 | + double, |
| 100 | + sycl::ONEAPI::memory_order::relaxed, |
| 101 | + sycl::ONEAPI::memory_scope::system, |
| 102 | + sycl::access::address_space::global_space>(ct_acc[j]) += group_sum; |
| 103 | + } |
| 104 | + }); |
| 105 | + }); |
| 106 | + |
| 107 | + e2.wait_and_throw(); |
| 108 | + return 0; |
| 109 | +} |
0 commit comments