STINGER: High Performance Data Structure for Streaming Graphs. In The IEEE High Performance Extreme Computing Conference (HPEC), Waltham, MA, September, 2012. Best paper award
doi  abstract   bibtex   
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.
@inproceedings{stinger-hpec12,
  author = {David Ediger and Robert McColl and Jason Riedy and
                  David A. Bader},
  ejr-withauthor = {David Ediger and Robert McColl and David A. Bader},
  title = {{STINGER}: High Performance Data Structure for
                  Streaming Graphs},
  tags = {parallel; graph; streaming},
  booktitle = {The IEEE High Performance Extreme Computing
                  Conference (HPEC)},
  year = 2012,
  month = sep,
  address = {Waltham, MA},
  note = {Best paper award},
  dom = 12,
  role = {proceedings},
  doi = {10.1109/HPEC.2012.6408680},
  file = {material/hpec12-stinger.pdf},
  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.},
  projtag = {cassmt, intel-sting}
}
Downloads: 0