DocumentCode
589964
Title
STINGER: High performance data structure for streaming graphs
Author
Ediger, David ; McColl, R. ; Riedy, Jason ; Bader, David A.
Author_Institution
Georgia Inst. of Technol., Atlanta, GA, USA
fYear
2012
fDate
10-12 Sept. 2012
Firstpage
1
Lastpage
5
Abstract
The current research focus on “big data” problems highlights the scale and complexity of analytics required and the high rate at which data may be changing. In this paper, we present our high performance, scalable and portable software, Spatio-Temporal Interaction Networks and Graphs Extensible Representation (STINGER), that includes a graph data structure that enables these applications. Key attributes of STINGER are fast insertions, deletions, and updates on semantic graphs with skewed degree distributions. We demonstrate a process of algorithmic and architectural optimizations that enable high performance on the Cray XMT family and Intel multicore servers. Our implementation of STINGER on the Cray XMT processes over 3 million updates per second on a scale-free graph with 537 million edges.
Keywords
data structures; graph theory; multiprocessing systems; Cray XMT family; Intel multicore servers; STINGER; algorithmic optimizations; architectural optimizations; big data problems; deletion; graph data structure; high performance data structure; insertion; semantic graphs; skewed degree distributions; spatio-temporal interaction network and graph extensible representation; streaming graphs; update; Data structures; Instruction sets; Multicore processing; Optimization; Parallel processing; Semantics; Synchronization;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Extreme Computing (HPEC), 2012 IEEE Conference on
Conference_Location
Waltham, MA
Print_ISBN
978-1-4673-1577-7
Type
conf
DOI
10.1109/HPEC.2012.6408680
Filename
6408680
Link To Document