| commit | 4587971e3817f207b9733c3c008ebda4d92de159 | |
| author | Juan Galvez <jjgalvez@illinois.edu> | |
| Mon, 13 Mar 2017 22:08:17 +0000 (13 17:08 -0500) | ||
| committer | Sam White <white67@illinois.edu> | |
| Thu, 16 Mar 2017 15:01:45 +0000 (16 10:01 -0500) | ||
| tree | 21cc1c0f4fd24c6ea1f0330a704c13bc882bb768 | treesnapshot (tar.gz zip) |
| parent | bc1436716c7223ed71dc0fdefd5146da0cfcd41d | commitdiff |
Added spanning tree API and algorithm to form tree of logical nodes
New algorithm to form spanning tree of Charm nodes (Recursive
Partitioning). Is physical-node aware, works with/without topology
info, and supports N-d mesh/torus networks, including
non-contiguous allocations and allocations with holes.
Change-Id: I42a6c7fe5fb35faf95a57f2c981b31a932a97623
New algorithm to form spanning tree of Charm nodes (Recursive
Partitioning). Is physical-node aware, works with/without topology
info, and supports N-d mesh/torus networks, including
non-contiguous allocations and allocations with holes.
Change-Id: I42a6c7fe5fb35faf95a57f2c981b31a932a97623
| src/scripts/Make.depends | diffblobblamehistory | |
| src/scripts/Makefile | diffblobblamehistory | |
| src/util/spanningTree.C | [new file with mode: 0644] | blob |
| src/util/spanningTree.h | [new file with mode: 0644] | blob |