A GPU-based method for computing eigenvector centrality of gene-expression networks

Authors:
Ahmed Shamsul Arefin;Regina Berretta;Pablo Moscato
Affiliations:
The University of Newcastle, Callaghan, NSW, Australia;The University of Newcastle, Callaghan, NSW, Australia;The University of Newcastle, Callaghan, NSW, Australia
Venue:
AusPDC '13 Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140
Year:
2013

Citing 15
Cited 0

Fast approximation of centrality

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks

ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Analysis of Biological Networks (Wiley Series in Bioinformatics)

Analysis of Biological Networks (Wiley Series in Bioinformatics)
A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms

Parallel Computing
On the Visualization of Social and other Scale-Free Networks

IEEE Transactions on Visualization and Computer Graphics
A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Early experiences with large-scale Cray XMT systems

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
The web as a graph: measurements, models, and methods

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Networks: An Introduction

Networks: An Introduction
Analyzing Social Media Networks with NodeXL: Insights from a Connected World

Analyzing Social Media Networks with NodeXL: Insights from a Connected World
Efficient PageRank and SpMV Computation on AMD GPUs

ICPP '10 Proceedings of the 2010 39th International Conference on Parallel Processing
Speeding up network layout and centrality measures for social computing goals

SBP'11 Proceedings of the 4th international conference on Social computing, behavioral-cultural modeling and prediction
Betweenness Centrality Approximations for an Internet Deployed P2P Reputation System

IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
A Variant betweenness Centrality Approach towards Distributed Network Monitoring

PAAP '11 Proceedings of the 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming
kNN-Borůvka-GPU: a fast and scalable MST construction from kNN graphs on GPU

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a fast and scalable method for computing eigenvector centrality using graphics processing units (GPUs). The method is designed to compute the centrality on gene-expression networks, where the network is pre-constructed in the form of kNN graphs from DNA microarray data sets.