0

I wonder if there exist efficient MPI algorithms for finding intersection of rank-local arrays. Specifically, each rank holds a variable length array:

rank 0: a = [1,4,7,9] rank 1: a = [2,3,7,8,10,12] ...

I need to check if there are duplicate values in these arrays (like the number 7 in the example above). The arrays are too large to be all moved to a single rank.

I googled around but found nothing.

Nick Gnedin
  • 11
  • 1
  • 1
    Do a "circular bucket brigade": everyone passes their data down a ring of processes, and -- except for your own data -- note duplicates. – Victor Eijkhout Apr 20 '23 at 14:36

0 Answers0