-
Notifications
You must be signed in to change notification settings - Fork 2
Report
n0he edited this page Dec 13, 2021
·
13 revisions
- We try to solve a distributed outer product
- First attempt:
- Naive allgather
- Naive allreduce
- -> Works decently well
- Second attempt
- Look at various implementations of the decision tree
- Optimize them, specifically targeted at our initial problem
- -> Successful mainly for both ring (attempt to beat native-ring) and g-rabenseifner
- Future work
- Push to upstream MPI implementation (if possible)
- Take network topology into consideration
- What do we want to solve
- Why is it a problem
- How do we solve it
- Start from birds-eye view (gradient descent in Neural Networks)
- Zoom into the detailed problem (send around chunks of data)
- Concept of {gather, reduce} (not the MPI function but instead the concept)
-
MPI Library
- allgather
- allreduce
- decision tree (explanation for the functions?)
- Rabenseifner?
- Basic implementation
- Allgather
- Allreduce
- Ring
- g-rabenseifner-allgather
- Listing results
- reasoning and interpretation of results (in detail)
- some general conclusions of results in context of the whole problem statement and project.
- what are some possible problems with current implementation? how could they be rectified?