Parallel Breadth First Search on GPU Clusters using MPI and GPUDirect Speaker: Harish Kumar Dasari, Scientific Computing and Imaging Institute, University of Utah Advisor: Dr. Martin Berzins, SCI, University of Utah

First Page		Document Content
Date: 2015-11-20 13:17:45 Mathematics Graph theory Discrete mathematics Search algorithms Graph traversal Breadth-first search Vertex Connectivity Shortest path problem Graph coloring Planar separator theorem		Parallel Breadth First Search on GPU Clusters using MPI and GPUDirect Speaker: Harish Kumar Dasari, Scientific Computing and Imaging Institute, University of Utah Advisor: Dr. Martin Berzins, SCI, University of Utah Add to Reading List Source URL: mug.mvapich.cse.ohio-state.edu Download Document from Source Website File Size: 650,69 KB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document