Efficient betweenness Centrality Computations on Hybrid CPU-GPU Systems

Efficient betweenness Centrality Computations on Hybrid CPU-GPU Systems

Analysis of networks is quite interesting, because they can be interpreted for several purposes. Various features require different metrics to measure and interpret them. Measuring the relative importance of each vertex in a network is one of the most fundamental building blocks in network analysis....

Full description

Bibliographic Details
Main Author: Mishra, Ashirbad
Other Authors: Vadhiyar, Sathish
Language:en_US
Published: 2017
Subjects:
Network Analysis
Betweenness Centrality
CPU-GPU Hybrid Systems
Space Complexity
Border Matrix Reduction
Distributed Computing
Graphics Processing Unit (GPU)
Graph Partitioning
Bulk Synchronous Paradigm (BSP)
Central Processing Unit (CPU)
Parallel Processing
High Performance Computing
Network Theory
System Analysis
Graph Theory
Hybrid Betweenness Centrality Algorithm
Computer Science
Online Access:http://hdl.handle.net/2005/2718
http://etd.ncsi.iisc.ernet.in/abstracts/3542/G27794-Abs.pdf

Internet

http://hdl.handle.net/2005/2718
http://etd.ncsi.iisc.ernet.in/abstracts/3542/G27794-Abs.pdf

Similar Items