b016c8929f
* Source code restructuring * Critical trace updates following restructuring * thread_sampler, timestamps - thread_sampler - CPU frequency managed via thread_sampler - rocm-smi managed via thread_sampler - Use consistent timestamps for perfetto - removed hsa_timer_t in favor of wall_clock::record() - disable KokkosP by default - re-enable critical-trace testing * cmake-format * Fix for defines.hpp.in * Remove OMNITRACE_ROCM_SMI_FREQ - thread_sampler freq is set via OMNITRACE_SAMPLING_FREQ w/ max of 1000 * Increase CI Install Dyninst timeout * Debug macros + omnitrace_init_tooling + config - new debug macros - extern "C" omnitrace_init_tooling - guard get_rocm_smi_devices * Miscellaneous tweaks - tweak to transpose - critical_trace::Device::ANY - perfetto "critical-trace" category - OMNITRACE_VERBOSE usage * Disable key and tid data for HIP API calls - non-kernels are ignored in activity callback * critical-trace exe updates - fix perfetto generation - improved logging - improved readability * timemory submodule update - lulesh example cmake tweaks
235 lines
7.5 KiB
C++
235 lines
7.5 KiB
C++
/*
|
|
Copyright (c) 2015-2020 Advanced Micro Devices, Inc. All rights reserved.
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included in
|
|
all copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
THE SOFTWARE.
|
|
*/
|
|
|
|
#include "hip/hip_runtime.h"
|
|
|
|
#include <cfloat>
|
|
#include <chrono>
|
|
#include <cmath>
|
|
#include <cstdio>
|
|
#include <cstdlib>
|
|
#include <fstream>
|
|
#include <iomanip>
|
|
#include <iostream>
|
|
#include <mutex>
|
|
#include <thread>
|
|
#include <vector>
|
|
|
|
static std::mutex print_lock{};
|
|
using auto_lock_t = std::unique_lock<std::mutex>;
|
|
|
|
#define HIP_API_CALL(CALL) \
|
|
{ \
|
|
hipError_t error_ = (CALL); \
|
|
if(error_ != hipSuccess) \
|
|
{ \
|
|
auto_lock_t _lk{ print_lock }; \
|
|
fprintf(stderr, "%s:%d :: HIP error : %s\n", __FILE__, __LINE__, \
|
|
hipGetErrorString(error_)); \
|
|
exit(EXIT_FAILURE); \
|
|
} \
|
|
}
|
|
|
|
void
|
|
check_hip_error(void)
|
|
{
|
|
hipError_t err = hipGetLastError();
|
|
if(err != hipSuccess)
|
|
{
|
|
auto_lock_t _lk{ print_lock };
|
|
std::cerr << "Error: " << hipGetErrorString(err) << std::endl;
|
|
exit(err);
|
|
}
|
|
}
|
|
|
|
void
|
|
verify(int* in, int* out, int M, int N)
|
|
{
|
|
for(int i = 0; i < 10; i++)
|
|
{
|
|
int row = rand() % M;
|
|
int col = rand() % N;
|
|
if(in[row * N + col] != out[col * M + row])
|
|
{
|
|
auto_lock_t _lk{ print_lock };
|
|
std::cout << "mismatch: " << row << ", " << col << " : " << in[row * N + col]
|
|
<< " | " << out[col * M + row] << "\n";
|
|
}
|
|
}
|
|
}
|
|
|
|
const unsigned TILE_DIM = 32;
|
|
__global__ void
|
|
transpose_a(int* in, int* out, int M, int N)
|
|
{
|
|
__shared__ int tile[TILE_DIM][TILE_DIM];
|
|
|
|
int idx = (blockIdx.y * blockDim.y + threadIdx.y) * M + blockIdx.x * blockDim.x +
|
|
threadIdx.x;
|
|
tile[threadIdx.y][threadIdx.x] = in[idx];
|
|
__syncthreads();
|
|
idx = (blockIdx.x * blockDim.x + threadIdx.y) * N + blockIdx.y * blockDim.y +
|
|
threadIdx.x;
|
|
out[idx] = tile[threadIdx.x][threadIdx.y];
|
|
}
|
|
|
|
void
|
|
run(int rank, int tid, hipStream_t stream, int argc, char** argv)
|
|
{
|
|
size_t nitr = 5000;
|
|
unsigned int M = 4960 * 2;
|
|
unsigned int N = 4960 * 2;
|
|
if(argc > 2) nitr = atoll(argv[2]);
|
|
|
|
auto_lock_t _lk{ print_lock };
|
|
std::cout << "[" << rank << "][" << tid << "] M: " << M << " N: " << N << std::endl;
|
|
_lk.unlock();
|
|
|
|
size_t size = sizeof(int) * M * N;
|
|
int* matrix = new int[size];
|
|
for(size_t i = 0; i < M * N; i++)
|
|
matrix[i] = rand() % 1002;
|
|
int* in = nullptr;
|
|
int* out = nullptr;
|
|
|
|
std::chrono::high_resolution_clock::time_point t1, t2;
|
|
|
|
HIP_API_CALL(hipMalloc(&in, size));
|
|
HIP_API_CALL(hipMalloc(&out, size));
|
|
HIP_API_CALL(hipMemset(in, 0, size));
|
|
HIP_API_CALL(hipMemset(out, 0, size));
|
|
HIP_API_CALL(hipMemcpy(in, matrix, size, hipMemcpyHostToDevice));
|
|
HIP_API_CALL(hipDeviceSynchronize());
|
|
|
|
dim3 grid(M / 32, N / 32, 1);
|
|
dim3 block(32, 32, 1); // transpose_a
|
|
|
|
t1 = std::chrono::high_resolution_clock::now();
|
|
for(size_t i = 0; i < nitr; i++)
|
|
{
|
|
transpose_a<<<grid, block, 0, stream>>>(in, out, M, N);
|
|
check_hip_error();
|
|
}
|
|
HIP_API_CALL(hipStreamSynchronize(stream));
|
|
t2 = std::chrono::high_resolution_clock::now();
|
|
double time =
|
|
std::chrono::duration_cast<std::chrono::duration<double>>(t2 - t1).count();
|
|
float GB = (float) size * nitr * 2 / (1 << 30);
|
|
|
|
print_lock.lock();
|
|
std::cout << "[" << rank << "][" << tid << "] Runtime of transpose is " << time
|
|
<< " sec\n"
|
|
<< "The average performance of transpose is " << GB / time << " GBytes/sec"
|
|
<< std::endl;
|
|
print_lock.unlock();
|
|
|
|
HIP_API_CALL(hipDeviceSynchronize());
|
|
|
|
int* out_matrix = new int[size];
|
|
HIP_API_CALL(hipMemcpy(out_matrix, out, size, hipMemcpyDeviceToHost));
|
|
|
|
// cpu_transpose(matrix, out_matrix, M, N);
|
|
verify(matrix, out_matrix, M, N);
|
|
|
|
HIP_API_CALL(hipFree(in));
|
|
HIP_API_CALL(hipFree(out));
|
|
|
|
delete[] matrix;
|
|
delete[] out_matrix;
|
|
}
|
|
|
|
#if defined(USE_MPI)
|
|
# include <mpi.h>
|
|
|
|
void
|
|
do_a2a(int rank)
|
|
{
|
|
// Define my value
|
|
int values[3];
|
|
for(int i = 0; i < 3; ++i)
|
|
values[i] = rank * 300 + i * 100;
|
|
printf("Process %d, values = %d, %d, %d.\n", rank, values[0], values[1], values[2]);
|
|
|
|
int buffer_recv[3];
|
|
MPI_Alltoall(&values, 1, MPI_INT, buffer_recv, 1, MPI_INT, MPI_COMM_WORLD);
|
|
printf("Values collected on process %d: %d, %d, %d.\n", rank, buffer_recv[0],
|
|
buffer_recv[1], buffer_recv[2]);
|
|
}
|
|
#endif
|
|
|
|
int
|
|
main(int argc, char** argv)
|
|
{
|
|
int rank = 0;
|
|
int size = 1;
|
|
int nthreads = 2;
|
|
int nitr = 5000;
|
|
if(argc > 1) nthreads = atoi(argv[1]);
|
|
if(argc > 2) nitr = atoi(argv[2]);
|
|
|
|
printf("[transpose] Number of threads: %i\n", nthreads);
|
|
printf("[transpose] Number of iterations: %i\n", nitr);
|
|
|
|
#if defined(USE_MPI)
|
|
MPI_Init(&argc, &argv);
|
|
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
|
|
MPI_Comm_size(MPI_COMM_WORLD, &size);
|
|
#else
|
|
(void) size;
|
|
#endif
|
|
// this is a temporary workaround in omnitrace when HIP + MPI is enabled
|
|
int ndevice = 0;
|
|
int devid = rank;
|
|
HIP_API_CALL(hipGetDeviceCount(&ndevice));
|
|
printf("[transpose] Number of devices found: %i\n", ndevice);
|
|
if(ndevice > 0)
|
|
{
|
|
devid = rank % ndevice;
|
|
HIP_API_CALL(hipSetDevice(devid));
|
|
printf("[transpose] Rank %i assigned to device %i\n", rank, devid);
|
|
}
|
|
if(rank == devid && rank < ndevice)
|
|
{
|
|
std::vector<std::thread> _threads{};
|
|
std::vector<hipStream_t> _streams(nthreads);
|
|
for(int i = 0; i < nthreads; ++i)
|
|
HIP_API_CALL(hipStreamCreate(&_streams.at(i)));
|
|
for(int i = 1; i < nthreads; ++i)
|
|
_threads.emplace_back(run, rank, i, _streams.at(i), argc, argv);
|
|
run(rank, 0, _streams.at(0), argc, argv);
|
|
for(auto& itr : _threads)
|
|
itr.join();
|
|
for(int i = 0; i < nthreads; ++i)
|
|
HIP_API_CALL(hipStreamDestroy(_streams.at(i)));
|
|
}
|
|
HIP_API_CALL(hipDeviceSynchronize());
|
|
HIP_API_CALL(hipDeviceReset());
|
|
|
|
#if defined(USE_MPI)
|
|
MPI_Barrier(MPI_COMM_WORLD);
|
|
do_a2a(rank);
|
|
MPI_Finalize();
|
|
#endif
|
|
|
|
return 0;
|
|
}
|