CS3210 Parallel computing
Search
Search
Dark mode
Light mode
Reader mode
Explorer
Home
❯
Notes
❯
Data distribution
Data distribution
The work inside a tile and the values around it
Have feedback?
Share it anonymously
↗
Graph View
Table of Contents
Who owns the next value?
A halo is a copy, not a second owner
Equal work can have different boundaries
What exactly are we counting?
Adding ranks makes the pieces smaller
The neighbouring rank may not be next door
Backlinks
Assignment 3: Distributed K-nearest neighbors with MPI (AY2025/26 S2)