Analyzing hybrid architectures for massively parallel graph analysis
The quantity of rich, semi-structured data generated by sensor networks, scientific simulation, business activity, and the Internet grows daily. The objective of this research is to investigate architectural requirements for emerging applications in massive graph analysis. Using emerging hybrid sys...
Main Author: | |
---|---|
Published: |
Georgia Institute of Technology
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/1853/47659 |
id |
ndltd-GATECH-oai-smartech.gatech.edu-1853-47659 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-GATECH-oai-smartech.gatech.edu-1853-476592013-09-01T03:09:03ZAnalyzing hybrid architectures for massively parallel graph analysisEdiger, DavidData intensive computingComputer architecturesCray XMTStreaming graph algorithmsMultithreaded graph algorithmsParallel processing (Electronic computers)Computer algorithmsGraph algorithmsParallel algorithmsThe quantity of rich, semi-structured data generated by sensor networks, scientific simulation, business activity, and the Internet grows daily. The objective of this research is to investigate architectural requirements for emerging applications in massive graph analysis. Using emerging hybrid systems, we will map applications to architectures and close the loop between software and hardware design in this application space. Parallel algorithms and specialized machine architectures are necessary to handle the immense size and rate of change of today's graph data. To highlight the impact of this work, we describe a number of relevant application areas ranging from biology to business and cybersecurity. With several proposed architectures for massively parallel graph analysis, we investigate the interplay of hardware, algorithm, data, and programming model through real-world experiments and simulations. We demonstrate techniques for obtaining parallel scaling on multithreaded systems using graph algorithms that are orders of magnitude faster and larger than the state of the art. The outcome of this work is a proposed hybrid architecture for massive-scale analytics that leverages key aspects of data-parallel and highly multithreaded systems. In simulations, the hybrid systems incorporating a mix of multithreaded, shared memory systems and solid state disks performed up to twice as fast as either homogeneous system alone on graphs with as many as 18 trillion edges.Georgia Institute of Technology2013-06-15T02:52:14Z2013-06-15T02:52:14Z2013-04-08Dissertationhttp://hdl.handle.net/1853/47659 |
collection |
NDLTD |
sources |
NDLTD |
topic |
Data intensive computing Computer architectures Cray XMT Streaming graph algorithms Multithreaded graph algorithms Parallel processing (Electronic computers) Computer algorithms Graph algorithms Parallel algorithms |
spellingShingle |
Data intensive computing Computer architectures Cray XMT Streaming graph algorithms Multithreaded graph algorithms Parallel processing (Electronic computers) Computer algorithms Graph algorithms Parallel algorithms Ediger, David Analyzing hybrid architectures for massively parallel graph analysis |
description |
The quantity of rich, semi-structured data generated by sensor networks, scientific simulation, business activity, and the Internet grows daily. The objective of this research is to investigate architectural requirements for emerging applications in massive graph analysis. Using emerging hybrid systems, we will map applications to architectures and close the loop between software and hardware design in this application space. Parallel algorithms and specialized machine architectures are necessary to handle the immense size and rate of change of today's graph data. To highlight the impact of this work, we describe a number of relevant application areas ranging from biology to business and cybersecurity. With several proposed architectures for massively parallel graph analysis, we investigate the interplay of hardware, algorithm, data, and programming model through real-world experiments and simulations. We demonstrate techniques for obtaining parallel scaling on multithreaded systems using graph algorithms that are orders of magnitude faster and larger than the state of the art. The outcome of this work is a proposed hybrid architecture for massive-scale analytics that leverages key aspects of data-parallel and highly multithreaded systems. In simulations, the hybrid systems incorporating a mix of multithreaded, shared memory systems and solid state disks performed up to twice as fast as either homogeneous system alone on graphs with as many as 18 trillion edges. |
author |
Ediger, David |
author_facet |
Ediger, David |
author_sort |
Ediger, David |
title |
Analyzing hybrid architectures for massively parallel graph analysis |
title_short |
Analyzing hybrid architectures for massively parallel graph analysis |
title_full |
Analyzing hybrid architectures for massively parallel graph analysis |
title_fullStr |
Analyzing hybrid architectures for massively parallel graph analysis |
title_full_unstemmed |
Analyzing hybrid architectures for massively parallel graph analysis |
title_sort |
analyzing hybrid architectures for massively parallel graph analysis |
publisher |
Georgia Institute of Technology |
publishDate |
2013 |
url |
http://hdl.handle.net/1853/47659 |
work_keys_str_mv |
AT edigerdavid analyzinghybridarchitecturesformassivelyparallelgraphanalysis |
_version_ |
1716596682171351040 |