No repeated IPC open (#2642)
This commit is contained in:
parent
b72af8f1ed
commit
1b20639a43
@ -7,6 +7,7 @@
|
|||||||
|
|
||||||
#include <iostream>
|
#include <iostream>
|
||||||
#include <limits>
|
#include <limits>
|
||||||
|
#include <map>
|
||||||
#include <unordered_map>
|
#include <unordered_map>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
|
||||||
@ -327,6 +328,10 @@ __global__ void __launch_bounds__(512, 1)
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
using IPC_KEY = std::array<uint8_t, sizeof(cudaIpcMemHandle_t)>;
|
||||||
|
static_assert(sizeof(IPC_KEY) == sizeof(cudaIpcMemHandle_t));
|
||||||
|
static_assert(alignof(IPC_KEY) == alignof(cudaIpcMemHandle_t));
|
||||||
|
|
||||||
class CustomAllreduce {
|
class CustomAllreduce {
|
||||||
public:
|
public:
|
||||||
int rank_;
|
int rank_;
|
||||||
@ -341,7 +346,8 @@ class CustomAllreduce {
|
|||||||
// stores the registered device pointers from all ranks
|
// stores the registered device pointers from all ranks
|
||||||
RankData *d_rank_data_base_, *d_rank_data_end_;
|
RankData *d_rank_data_base_, *d_rank_data_end_;
|
||||||
std::vector<void *> graph_unreg_buffers_;
|
std::vector<void *> graph_unreg_buffers_;
|
||||||
std::vector<void *> ipc_handles_;
|
// a map from IPC handles to opened IPC pointers
|
||||||
|
std::map<IPC_KEY, char *> ipc_handles_;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* meta is a pointer to device metadata and temporary buffer for allreduce.
|
* meta is a pointer to device metadata and temporary buffer for allreduce.
|
||||||
@ -365,10 +371,7 @@ class CustomAllreduce {
|
|||||||
for (int i = 0; i < world_size_; i++) {
|
for (int i = 0; i < world_size_; i++) {
|
||||||
Metadata *rank_meta;
|
Metadata *rank_meta;
|
||||||
if (i != rank_) {
|
if (i != rank_) {
|
||||||
char *handle;
|
char *handle = open_ipc_handle(&handles[i]);
|
||||||
CUDACHECK(cudaIpcOpenMemHandle((void **)&handle, handles[i],
|
|
||||||
cudaIpcMemLazyEnablePeerAccess));
|
|
||||||
ipc_handles_.push_back(handle);
|
|
||||||
handle += offsets[i];
|
handle += offsets[i];
|
||||||
rank_meta = (Metadata *)handle;
|
rank_meta = (Metadata *)handle;
|
||||||
} else {
|
} else {
|
||||||
@ -378,6 +381,19 @@ class CustomAllreduce {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
char *open_ipc_handle(const void *ipc_handle) {
|
||||||
|
auto [it, new_handle] =
|
||||||
|
ipc_handles_.insert({*((IPC_KEY *)ipc_handle), nullptr});
|
||||||
|
if (new_handle) {
|
||||||
|
char *ipc_ptr;
|
||||||
|
CUDACHECK(cudaIpcOpenMemHandle((void **)&ipc_ptr,
|
||||||
|
*((const cudaIpcMemHandle_t *)ipc_handle),
|
||||||
|
cudaIpcMemLazyEnablePeerAccess));
|
||||||
|
it->second = ipc_ptr;
|
||||||
|
}
|
||||||
|
return it->second;
|
||||||
|
}
|
||||||
|
|
||||||
std::pair<std::vector<uint8_t>, std::vector<int64_t>>
|
std::pair<std::vector<uint8_t>, std::vector<int64_t>>
|
||||||
get_graph_buffer_ipc_meta() {
|
get_graph_buffer_ipc_meta() {
|
||||||
auto num_buffers = graph_unreg_buffers_.size();
|
auto num_buffers = graph_unreg_buffers_.size();
|
||||||
@ -413,11 +429,7 @@ class CustomAllreduce {
|
|||||||
RankData data;
|
RankData data;
|
||||||
for (int i = 0; i < world_size_; i++) {
|
for (int i = 0; i < world_size_; i++) {
|
||||||
if (i != rank_) {
|
if (i != rank_) {
|
||||||
char *handle;
|
char *handle = open_ipc_handle(handles[i].data());
|
||||||
CUDACHECK(cudaIpcOpenMemHandle(
|
|
||||||
(void **)&handle, *((const cudaIpcMemHandle_t *)handles[i].data()),
|
|
||||||
cudaIpcMemLazyEnablePeerAccess));
|
|
||||||
ipc_handles_.push_back(handle);
|
|
||||||
handle += offsets[i];
|
handle += offsets[i];
|
||||||
data.ptrs[i] = handle;
|
data.ptrs[i] = handle;
|
||||||
} else {
|
} else {
|
||||||
@ -448,13 +460,8 @@ class CustomAllreduce {
|
|||||||
auto &rd = rank_data[i];
|
auto &rd = rank_data[i];
|
||||||
for (int j = 0; j < world_size_; j++) {
|
for (int j = 0; j < world_size_; j++) {
|
||||||
if (j != rank_) {
|
if (j != rank_) {
|
||||||
char *handle;
|
char *handle =
|
||||||
CUDACHECK(cudaIpcOpenMemHandle(
|
open_ipc_handle(&handles[j][i * sizeof(cudaIpcMemHandle_t)]);
|
||||||
(void **)&handle,
|
|
||||||
*((cudaIpcMemHandle_t *)&handles[j]
|
|
||||||
[i * sizeof(cudaIpcMemHandle_t)]),
|
|
||||||
cudaIpcMemLazyEnablePeerAccess));
|
|
||||||
ipc_handles_.push_back(handle);
|
|
||||||
handle += offsets[j][i];
|
handle += offsets[j][i];
|
||||||
rd.ptrs[j] = handle;
|
rd.ptrs[j] = handle;
|
||||||
} else {
|
} else {
|
||||||
@ -541,7 +548,7 @@ class CustomAllreduce {
|
|||||||
}
|
}
|
||||||
|
|
||||||
~CustomAllreduce() {
|
~CustomAllreduce() {
|
||||||
for (auto ptr : ipc_handles_) {
|
for (auto [_, ptr] : ipc_handles_) {
|
||||||
CUDACHECK(cudaIpcCloseMemHandle(ptr));
|
CUDACHECK(cudaIpcCloseMemHandle(ptr));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
Loading…
x
Reference in New Issue
Block a user