mirror of
https://github.com/ml-explore/mlx.git
synced 2025-06-25 01:41:17 +08:00
116 lines
3.4 KiB
Python
116 lines
3.4 KiB
Python
# Copyright © 2024 Apple Inc.
|
|
|
|
import unittest
|
|
|
|
import mlx.core as mx
|
|
import mlx_tests
|
|
|
|
|
|
class TestDistributed(mlx_tests.MLXTestCase):
|
|
def test_groups(self):
|
|
world = mx.distributed.init()
|
|
self.assertEqual(world.size(), 8)
|
|
self.assertTrue(0 <= world.rank() < 8)
|
|
|
|
world2 = mx.distributed.init()
|
|
self.assertEqual(world.size(), world2.size())
|
|
self.assertEqual(world.rank(), world2.rank())
|
|
|
|
sub = world.split(world.rank() % 2)
|
|
self.assertEqual(sub.size(), 4)
|
|
self.assertEqual(sub.rank(), world.rank() // 2)
|
|
|
|
sub = world.split(world.rank() // 2)
|
|
self.assertEqual(sub.size(), 2)
|
|
|
|
def test_all_reduce(self):
|
|
world = mx.distributed.init()
|
|
dtypes = [
|
|
mx.int8,
|
|
mx.uint8,
|
|
mx.int16,
|
|
mx.uint16,
|
|
mx.int32,
|
|
mx.uint32,
|
|
mx.float32,
|
|
mx.complex64,
|
|
]
|
|
for dt in dtypes:
|
|
x = mx.ones((2, 2, 4), dtype=dt)
|
|
y = mx.distributed.all_sum(x)
|
|
self.assertTrue(mx.all(y == world.size()))
|
|
|
|
sub = world.split(world.rank() % 2)
|
|
for dt in dtypes:
|
|
x = mx.ones((2, 2, 4), dtype=dt)
|
|
y = mx.distributed.all_sum(x, group=sub)
|
|
self.assertTrue(mx.all(y == sub.size()))
|
|
|
|
def test_all_gather(self):
|
|
world = mx.distributed.init()
|
|
dtypes = [
|
|
mx.int8,
|
|
mx.uint8,
|
|
mx.int16,
|
|
mx.uint16,
|
|
mx.int32,
|
|
mx.uint32,
|
|
mx.float32,
|
|
mx.complex64,
|
|
]
|
|
for dt in dtypes:
|
|
x = mx.ones((2, 2, 4), dtype=dt)
|
|
y = mx.distributed.all_gather(x)
|
|
self.assertEqual(y.shape, (world.size() * 2, 2, 4))
|
|
self.assertTrue(mx.all(y == 1))
|
|
|
|
sub = world.split(world.rank() % 2)
|
|
for dt in dtypes:
|
|
x = mx.ones((2, 2, 4), dtype=dt)
|
|
y = mx.distributed.all_gather(x, group=sub)
|
|
self.assertEqual(y.shape, (sub.size() * 2, 2, 4))
|
|
self.assertTrue(mx.all(y == 1))
|
|
|
|
def test_mixed(self):
|
|
# Make the following groups:
|
|
# - world: 0 1 2 3 4 5 6 7
|
|
# - sub_1: 0 1 0 1 0 1 0 1
|
|
# - sub_2: 0 0 1 1 2 2 3 3
|
|
#
|
|
# The corresponding colors to make them are
|
|
# - world: N/A
|
|
# - sub_1: 0 0 1 1 2 2 3 3
|
|
# - sub_2: 0 1 0 1 0 1 0 1
|
|
|
|
world = mx.distributed.init()
|
|
sub_1 = world.split(world.rank() // 2)
|
|
sub_2 = world.split(world.rank() % 2)
|
|
|
|
x = mx.ones((1, 8)) * world.rank()
|
|
y = mx.distributed.all_sum(x, group=sub_1)
|
|
z = mx.distributed.all_gather(y, group=sub_2)
|
|
z_target = mx.arange(8).reshape(4, 2).sum(-1, keepdims=True)
|
|
|
|
self.assertTrue(mx.all(z == z_target))
|
|
|
|
def test_send_recv(self):
|
|
world = mx.distributed.init()
|
|
pairs = world.split(world.rank() // 2)
|
|
neighbor = (pairs.rank() + 1) % 2
|
|
send = pairs.rank() == 0
|
|
|
|
x = mx.ones(10)
|
|
for i in range(10):
|
|
if send:
|
|
mx.eval(mx.distributed.send(2 * x, neighbor, group=pairs))
|
|
else:
|
|
x = mx.distributed.recv_like(x, neighbor, group=pairs)
|
|
mx.eval(x)
|
|
send = not send
|
|
|
|
self.assertTrue(mx.all(x == (1024 if pairs.rank() == 0 else 512)))
|
|
|
|
|
|
if __name__ == "__main__":
|
|
unittest.main()
|