combblas::DistEdgeList< IT > Class Template Reference

#include <DistEdgeList.h>

Public Member Functions
	DistEdgeList ()
	DistEdgeList (MPI_Comm &myWorld)
	DistEdgeList (const char *filename, IT globaln, IT globalm)
	~DistEdgeList ()
void	Dump64bit (std::string filename)
void	Dump32bit (std::string filename)
void	GenGraph500Data (double initiator[4], int log_numverts, int edgefactor, bool scramble=false, bool packed=false)
void	CleanupEmpties ()
int64_t	getGlobalV () const
IT	getNumLocalEdges () const
IT *	getEdges () const
packed_edge *	getPackedEdges () const
	DistEdgeList ()
	DistEdgeList (MPI_Comm &myWorld)
	DistEdgeList (const char *filename, IT globaln, IT globalm)
	~DistEdgeList ()
void	Dump64bit (std::string filename)
void	Dump32bit (std::string filename)
void	GenGraph500Data (double initiator[4], int log_numverts, int edgefactor, bool scramble=false, bool packed=false)
void	CleanupEmpties ()
int64_t	getGlobalV () const
IT	getNumLocalEdges () const
IT *	getEdges () const
packed_edge *	getPackedEdges () const
	DistEdgeList ()
	DistEdgeList (MPI_Comm &myWorld)
	DistEdgeList (const char *filename, IT globaln, IT globalm)
	~DistEdgeList ()
void	Dump64bit (std::string filename)
void	Dump32bit (std::string filename)
void	GenGraph500Data (double initiator[4], int log_numverts, int edgefactor, bool scramble=false, bool packed=false)
void	CleanupEmpties ()
int64_t	getGlobalV () const
IT	getNumLocalEdges () const
IT *	getEdges () const
packed_edge *	getPackedEdges () const

Public Attributes
std::shared_ptr< CommGrid >	commGrid

Friends
template<class IU , class NU , class UDER >
class	SpParMat
template<typename IU >
void	PermEdges (DistEdgeList< IU > &DEL)
template<typename IU >
void	RenameVertices (DistEdgeList< IU > &DEL)
template<typename IU >
void	PermEdges (DistEdgeList< IU > &DEL)
template<typename IU >
void	RenameVertices (DistEdgeList< IU > &DEL)
template<typename IU >
void	PermEdges (DistEdgeList< IU > &DEL)
template<typename IU >
void	RenameVertices (DistEdgeList< IU > &DEL)
template<class IU , class NU , class UDER >
class	SpParMat
template<class IU , class NU , class UDER >
class	SpParMat

Detailed Description

template<typename IT>
class combblas::DistEdgeList< IT >

Definition at line 81 of file DistEdgeList.h.

Constructor & Destructor Documentation

DistEdgeList() [1/9]

template<typename IT >

combblas::DistEdgeList< IT >::DistEdgeList

(

)

Definition at line 49 of file DistEdgeList.cpp.

DistEdgeList() [2/9]

template<typename IT >

combblas::DistEdgeList< IT >::DistEdgeList

(

MPI_Comm &

myWorld

)

Definition at line 55 of file DistEdgeList.cpp.

DistEdgeList() [3/9]

template<typename IT >

combblas::DistEdgeList< IT >::DistEdgeList	(	const char *	filename,
		IT	globaln,
		IT	globalm
	)

Definition at line 61 of file DistEdgeList.cpp.

~DistEdgeList() [1/3]

template<typename IT >

combblas::DistEdgeList< IT >::~DistEdgeList

(

)

Definition at line 162 of file DistEdgeList.cpp.

DistEdgeList() [4/9]

template<typename IT >

combblas::DistEdgeList< IT >::DistEdgeList

(

)

DistEdgeList() [5/9]

template<typename IT >

combblas::DistEdgeList< IT >::DistEdgeList

(

MPI_Comm &

myWorld

)

DistEdgeList() [6/9]

template<typename IT >

combblas::DistEdgeList< IT >::DistEdgeList	(	const char *	filename,
		IT	globaln,
		IT	globalm
	)

~DistEdgeList() [2/3]

template<typename IT >

combblas::DistEdgeList< IT >::~DistEdgeList

(

)

DistEdgeList() [7/9]

template<typename IT >

combblas::DistEdgeList< IT >::DistEdgeList

(

)

DistEdgeList() [8/9]

template<typename IT >

combblas::DistEdgeList< IT >::DistEdgeList

(

MPI_Comm &

myWorld

)

DistEdgeList() [9/9]

template<typename IT >

combblas::DistEdgeList< IT >::DistEdgeList	(	const char *	filename,
		IT	globaln,
		IT	globalm
	)

~DistEdgeList() [3/3]

template<typename IT >

combblas::DistEdgeList< IT >::~DistEdgeList

(

)

Member Function Documentation

CleanupEmpties() [1/3]

template<typename IT >

void combblas::DistEdgeList< IT >::CleanupEmpties

(

)

Removes all edges that begin with a -1. Walks back from the end to tighten the nedges counter, then walks forward and replaces any edge with a -1 source with the last edge.

Definition at line 190 of file DistEdgeList.cpp.

CleanupEmpties() [2/3]

template<typename IT >

void combblas::DistEdgeList< IT >::CleanupEmpties

(

)

CleanupEmpties() [3/3]

template<typename IT >

void combblas::DistEdgeList< IT >::CleanupEmpties

(

)

Dump32bit() [1/3]

template<typename IT >

void combblas::DistEdgeList< IT >::Dump32bit

(

std::string

filename

)

Dump32bit() [2/3]

template<typename IT >

void combblas::DistEdgeList< IT >::Dump32bit

(

std::string

filename

)

Dump32bit() [3/3]

template<typename IT >

void combblas::DistEdgeList< IT >::Dump32bit

(

std::string

filename

)

Dump64bit() [1/3]

template<typename IT >

void combblas::DistEdgeList< IT >::Dump64bit

(

std::string

filename

)

Dump64bit() [2/3]

template<typename IT >

void combblas::DistEdgeList< IT >::Dump64bit

(

std::string

filename

)

Dump64bit() [3/3]

template<typename IT >

void combblas::DistEdgeList< IT >::Dump64bit

(

std::string

filename

)

GenGraph500Data() [1/3]

template<typename IT >

void combblas::DistEdgeList< IT >::GenGraph500Data	(	double	initiator[4],
		int	log_numverts,
		int	edgefactor,
		bool	scramble = false,
		bool	packed = false
	)

Note that GenGraph500Data will return global vertex numbers (from 1... N). The ith edge can be accessed with edges[2*i] and edges[2*i+1]. There will be duplicates and the data won't be sorted. Generates an edge list consisting of an RMAT matrix suitable for the Graph500 benchmark.

Definition at line 223 of file DistEdgeList.cpp.

GenGraph500Data() [2/3]

template<typename IT >

void combblas::DistEdgeList< IT >::GenGraph500Data	(	double	initiator[4],
		int	log_numverts,
		int	edgefactor,
		bool	scramble = false,
		bool	packed = false
	)

GenGraph500Data() [3/3]

template<typename IT >

void combblas::DistEdgeList< IT >::GenGraph500Data	(	double	initiator[4],
		int	log_numverts,
		int	edgefactor,
		bool	scramble = false,
		bool	packed = false
	)

getEdges() [1/3]

template<typename IT >

IT * combblas::DistEdgeList< IT >::getEdges ( ) const

inline

Definition at line 97 of file DistEdgeList.h.

getEdges() [2/3]

template<typename IT >

IT * combblas::DistEdgeList< IT >::getEdges ( ) const

inline

Definition at line 97 of file DistEdgeList.h.

getEdges() [3/3]

template<typename IT >

IT * combblas::DistEdgeList< IT >::getEdges ( ) const

inline

Definition at line 97 of file DistEdgeList.h.

getGlobalV() [1/3]

template<typename IT >

int64_t combblas::DistEdgeList< IT >::getGlobalV ( ) const

inline

Definition at line 95 of file DistEdgeList.h.

getGlobalV() [2/3]

template<typename IT >

int64_t combblas::DistEdgeList< IT >::getGlobalV ( ) const

inline

Definition at line 95 of file DistEdgeList.h.

getGlobalV() [3/3]

template<typename IT >

int64_t combblas::DistEdgeList< IT >::getGlobalV ( ) const

inline

Definition at line 95 of file DistEdgeList.h.

getNumLocalEdges() [1/3]

template<typename IT >

IT combblas::DistEdgeList< IT >::getNumLocalEdges ( ) const

inline

Definition at line 96 of file DistEdgeList.h.

getNumLocalEdges() [2/3]

template<typename IT >

IT combblas::DistEdgeList< IT >::getNumLocalEdges ( ) const

inline

Definition at line 96 of file DistEdgeList.h.

getNumLocalEdges() [3/3]

template<typename IT >

IT combblas::DistEdgeList< IT >::getNumLocalEdges ( ) const

inline

Definition at line 96 of file DistEdgeList.h.

getPackedEdges() [1/3]

template<typename IT >

packed_edge * combblas::DistEdgeList< IT >::getPackedEdges ( ) const

inline

Definition at line 98 of file DistEdgeList.h.

getPackedEdges() [2/3]

template<typename IT >

packed_edge * combblas::DistEdgeList< IT >::getPackedEdges ( ) const

inline

Definition at line 98 of file DistEdgeList.h.

getPackedEdges() [3/3]

template<typename IT >

packed_edge * combblas::DistEdgeList< IT >::getPackedEdges ( ) const

inline

Definition at line 98 of file DistEdgeList.h.

Friends And Related Symbol Documentation

PermEdges [1/3]

template<typename IT >

template<typename IU >

void PermEdges ( DistEdgeList< IU > &  DEL )

friend

PermEdges [2/3]

template<typename IT >

template<typename IU >

void PermEdges ( DistEdgeList< IU > &  DEL )

friend

PermEdges [3/3]

template<typename IT >

template<typename IU >

void PermEdges ( DistEdgeList< IU > &  DEL )

friend

RenameVertices [1/3]

template<typename IT >

template<typename IU >

void RenameVertices ( DistEdgeList< IU > &  DEL )

friend

Rename vertices globally. You first need to do create a random permutation distributed on all processors. Then the p round robin algorithm will do the renaming: For all processors P(i,i) Broadcast local_p to all p processors For j= i*N/p to min((i+1)*N/p, N) Rename the all j's with local_p(j) inside the edgelist (and mark them "renamed" so that yeach vertex id is renamed only once)

Definition at line 364 of file DistEdgeList.cpp.

RenameVertices [2/3]

template<typename IT >

template<typename IU >

void RenameVertices ( DistEdgeList< IU > &  DEL )

friend

Rename vertices globally. You first need to do create a random permutation distributed on all processors. Then the p round robin algorithm will do the renaming: For all processors P(i,i) Broadcast local_p to all p processors For j= i*N/p to min((i+1)*N/p, N) Rename the all j's with local_p(j) inside the edgelist (and mark them "renamed" so that yeach vertex id is renamed only once)

Definition at line 364 of file DistEdgeList.cpp.

RenameVertices [3/3]

template<typename IT >

template<typename IU >

void RenameVertices ( DistEdgeList< IU > &  DEL )

friend

Rename vertices globally. You first need to do create a random permutation distributed on all processors. Then the p round robin algorithm will do the renaming: For all processors P(i,i) Broadcast local_p to all p processors For j= i*N/p to min((i+1)*N/p, N) Rename the all j's with local_p(j) inside the edgelist (and mark them "renamed" so that yeach vertex id is renamed only once)

Definition at line 364 of file DistEdgeList.cpp.

SpParMat [1/3]

template<typename IT >

template<class IU , class NU , class UDER >

friend class SpParMat

friend

Definition at line 120 of file DistEdgeList.h.

SpParMat [2/3]

template<typename IT >

template<class IU , class NU , class UDER >

class SpParMat

friend

Definition at line 120 of file DistEdgeList.h.

SpParMat [3/3]

template<typename IT >

template<class IU , class NU , class UDER >

class SpParMat

friend

Definition at line 120 of file DistEdgeList.h.

Member Data Documentation

commGrid

template<typename IT >

std::shared_ptr< CommGrid > combblas::DistEdgeList< IT >::commGrid

Definition at line 99 of file DistEdgeList.h.

---

The documentation for this class was generated from the following files:

• debian/libcombblas-dev/usr/include/CombBLAS/DistEdgeList.h
• debian/tmp/usr/include/CombBLAS/DistEdgeList.h
• include/CombBLAS/DistEdgeList.h
• debian/libcombblas-dev/usr/include/CombBLAS/DistEdgeList.cpp
• debian/tmp/usr/include/CombBLAS/DistEdgeList.cpp
• include/CombBLAS/DistEdgeList.cpp