util/partitioning_strategies.C File Reference

Go to the source code of this file.

Functions
void	getHilbertList (int *procList)
	Author: Harshitha Menon, Nikhil Jain Contact: gplkrsh2@illinois.edu, nikhil@illinois.edu.
void	getPlanarList (int *procList)
	A function to traverse the given processors, and get a planar list.
void	recursive_bisect (int part_begin, int part_end, int *node_begin, int *node_end, TopoManagerWrapper &tmgr)
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

)

Author: Harshitha Menon, Nikhil Jain Contact: gplkrsh2@illinois.edu, nikhil@illinois.edu.

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 @1444::recursive_bisect	(	int	part_begin,
		int	part_end,
		int *	node_begin,
		int *	node_end,
		TopoManagerWrapper &	tmgr
	)			[static]

Definition at line 403 of file partitioning_strategies.C.

References abs(), CmiAbort(), and p.

Referenced by getRecursiveBisectionList().

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:

---

Variable Documentation

TopoManagerWrapper& tmgr

Definition at line 148 of file partitioning_strategies.C.

Referenced by getRecursiveBisectionList(), LrtsInitCpuTopo(), ReadFileMap::registerArray(), and ScotchTopoLB::work().

int a_dim

Definition at line 149 of file partitioning_strategies.C.

int b_dim

Definition at line 149 of file partitioning_strategies.C.

int c_dim

Definition at line 149 of file partitioning_strategies.C.

int d_dim

Definition at line 149 of file partitioning_strategies.C.

int e_dim

Definition at line 149 of file partitioning_strategies.C.

int a_rot

Definition at line 150 of file partitioning_strategies.C.

int b_rot

Definition at line 150 of file partitioning_strategies.C.

int c_rot

Definition at line 150 of file partitioning_strategies.C.

int d_rot

Definition at line 150 of file partitioning_strategies.C.

int e_rot

Definition at line 150 of file partitioning_strategies.C.

int a_mod

Definition at line 151 of file partitioning_strategies.C.

int b_mod

Definition at line 151 of file partitioning_strategies.C.

int c_mod

Definition at line 151 of file partitioning_strategies.C.

int d_mod

Definition at line 151 of file partitioning_strategies.C.

int e_mod

Definition at line 151 of file partitioning_strategies.C.

const int* sortdims

Definition at line 359 of file partitioning_strategies.C.