From 804a9102f4f22f92242131864a65ef2671aaeeda Mon Sep 17 00:00:00 2001 From: Changho Hwang Date: Thu, 5 Dec 2024 04:01:50 +0000 Subject: [PATCH] lint --- python/mscclpp/comm.py | 8 ++++++-- python/test/proxy_channel_test.cu | 4 ++-- 2 files changed, 8 insertions(+), 4 deletions(-) diff --git a/python/mscclpp/comm.py b/python/mscclpp/comm.py index 96fcae884..c2726826f 100644 --- a/python/mscclpp/comm.py +++ b/python/mscclpp/comm.py @@ -180,7 +180,9 @@ def make_proxy_channels( semaphore_ids[rank] = proxy_service.add_semaphore(semaphores[rank]) channels = {} for rank in semaphores: - channels[rank] = proxy_service.proxy_channel(semaphore_ids[rank], memory_ids[rank], memory_ids[self.my_rank]) + channels[rank] = proxy_service.proxy_channel( + semaphore_ids[rank], memory_ids[rank], memory_ids[self.my_rank] + ) return channels def make_proxy_channels_with_scratch( @@ -216,7 +218,9 @@ def make_proxy_channels_with_scratch( semaphore_ids[rank] = proxy_service.add_semaphore(semaphores[rank]) channels = {} for rank in semaphores: - channels[rank] = proxy_service.proxy_channel(semaphore_ids[rank], memory_ids[rank], memory_ids[self.my_rank]) + channels[rank] = proxy_service.proxy_channel( + semaphore_ids[rank], memory_ids[rank], memory_ids[self.my_rank] + ) return channels def register_semaphore_with_proxy( diff --git a/python/test/proxy_channel_test.cu b/python/test/proxy_channel_test.cu index 31d3802e4..d79a97bf6 100644 --- a/python/test/proxy_channel_test.cu +++ b/python/test/proxy_channel_test.cu @@ -6,8 +6,8 @@ // be careful about using channels[my_rank] as it is inavlie and it is there just for simplicity of indexing extern "C" __global__ void __launch_bounds__(1024, 1) - proxy_channel(mscclpp::ProxyChannelDeviceHandle* channels, int my_rank, int nranks, int* data, - int* scratch, int num_elements, int use_packet) { + proxy_channel(mscclpp::ProxyChannelDeviceHandle* channels, int my_rank, int nranks, int* data, int* scratch, + int num_elements, int use_packet) { int tid = threadIdx.x; int nthreads = blockDim.x; uint64_t size_per_rank = (num_elements * sizeof(int)) / nranks;