util/partitioning_strategies.h File Reference

Go to the source code of this file.

Functions
void	getHilbertList (int *procList)
	A function to traverse the given processors, and get a hilbert list.
void	getPlanarList (int *procList)
	A function to traverse the given processors, and get a planar list.
void	getRecursiveBisectionList (int numparts, int *procList)
	A function to traverse the given processors, and get a recursive bisection list.

---

Function Documentation

void getHilbertList

(

int *

procList

)

A function to traverse the given processors, and get a hilbert list.

A function to traverse the given processors, and get a hilbert list.

More details about this implementation of the Hilbert curve can be found from https://github.com/straup/gae-spacetimeid/blob/master/hilbert.py and this is a C++ implementation of what is given there. A function to traverse the given processors, and get a hilbert list

Definition at line 39 of file partitioning_strategies.C.

References dims, int_to_Hilbert(), ranks, TopoManager_getDimCount(), TopoManager_getDims(), and TopoManager_getRanks().

Referenced by HilbertArrayMap::HilbertArrayMap(), and TopoManager_init().

Here is the call graph for this function:

Here is the caller graph for this function:

void getPlanarList

(

int *

procList

)

A function to traverse the given processors, and get a planar list.

Definition at line 101 of file partitioning_strategies.C.

References dims, ranks, TopoManager_getDimCount(), TopoManager_getDims(), and TopoManager_getRanks().

Referenced by TopoManager_init().

Here is the call graph for this function:

Here is the caller graph for this function:

void getRecursiveBisectionList	(	int	numparts,
		int *	procList
	)

A function to traverse the given processors, and get a recursive bisection list.

Definition at line 457 of file partitioning_strategies.C.

References n, p, recursive_bisect(), and tmgr.

Referenced by TopoManager_init().

Here is the call graph for this function:

Here is the caller graph for this function: