Process Topologies
Christopher Cameron, Brandon Barker, Steve Lantz (original)
Cornell Center for Advanced Computing
Revisions: 5/2022, 10/2014, 5/2011 (original)
This topic discusses how and why you might organize your processes into virtual topologies.
Objectives
After you complete this topic, you should be able to:
- Demonstrate using virtual topologies
- Distinguish between Cartesian and graph topologies
- Describe the function of neighborhood collectives
Prerequisites
- A basic knowledge of parallel programming and MPI.
- Ability to program in a high-level language such as Fortran or C.
©
|
Cornell University
|
Center for Advanced Computing
|
Copyright Statement
|
Access Statement
CVW material development is supported by NSF OAC awards 1854828, 2321040, 2323116 (UT Austin) and 2005506 (Indiana University)
CVW material development is supported by NSF OAC awards 1854828, 2321040, 2323116 (UT Austin) and 2005506 (Indiana University)