@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},
  opttags = {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},
  keywords = {hpda, graph analysis, streaming data, parallel algorithm},
  ejr-proj = {high-performance-data-analysis, graph-analysis},
  ejr-grant = {intel-sting, cassmt}
}

{"_id":"sbRFu6Qf5imaJvfP9","bibbaseid":"ediger-mccoll-riedy-bader-stingerhighperformancedatastructureforstreaminggraphs-2012","downloads":0,"creationDate":"2018-08-21T18:11:53.661Z","title":"STINGER: High Performance Data Structure for Streaming Graphs","author_short":["Ediger, D.","McColl, R.","Riedy, J.","Bader, D. A."],"year":2012,"bibtype":"inproceedings","biburl":"http://lovesgoodfood.com/jason/CV/ejr.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["David"],"propositions":[],"lastnames":["Ediger"],"suffixes":[]},{"firstnames":["Robert"],"propositions":[],"lastnames":["McColl"],"suffixes":[]},{"firstnames":["Jason"],"propositions":[],"lastnames":["Riedy"],"suffixes":[]},{"firstnames":["David","A."],"propositions":[],"lastnames":["Bader"],"suffixes":[]}],"ejr-withauthor":"David Ediger and Robert McColl and David A. Bader","title":"STINGER: High Performance Data Structure for Streaming Graphs","opttags":"parallel; graph; streaming","booktitle":"The IEEE High Performance Extreme Computing Conference (HPEC)","year":"2012","month":"September","address":"Waltham, MA","note":"Best paper award","dom":"12","role":"author","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","keywords":"hpda, graph analysis, streaming data, parallel algorithm","ejr-proj":"high-performance-data-analysis, graph-analysis","ejr-grant":"intel-sting, cassmt","bibtex":"@inproceedings{stinger-hpec12,\n author = {David Ediger and Robert McColl and Jason Riedy and David A. Bader},\n ejr-withauthor = {David Ediger and Robert McColl and David A. Bader},\n title = {{STINGER}: High Performance Data Structure for Streaming Graphs},\n opttags = {parallel; graph; streaming},\n booktitle = {The IEEE High Performance Extreme Computing Conference (HPEC)},\n year = 2012,\n month = sep,\n address = {Waltham, MA},\n note = {Best paper award},\n dom = 12,\n role = {proceedings},\n doi = {10.1109/HPEC.2012.6408680},\n file = {material/hpec12-stinger.pdf},\n 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.},\n projtag = {cassmt, intel-sting},\n keywords = {hpda, graph analysis, streaming data, parallel algorithm},\n ejr-proj = {high-performance-data-analysis, graph-analysis},\n ejr-grant = {intel-sting, cassmt}\n}\n\n","author_short":["Ediger, D.","McColl, R.","Riedy, J.","Bader, D. A."],"key":"stinger-hpec12","id":"stinger-hpec12","bibbaseid":"ediger-mccoll-riedy-bader-stingerhighperformancedatastructureforstreaminggraphs-2012","urls":{},"keyword":["hpda","graph analysis","streaming data","parallel algorithm"],"metadata":{"authorlinks":{}}},"search_terms":["stinger","high","performance","data","structure","streaming","graphs","ediger","mccoll","riedy","bader"],"keywords":["hpda","graph analysis","streaming data","parallel algorithm"],"authorIDs":[],"dataSources":["yxjEg4KYBKLdX7BAz","iovMFeXD2oi65krsd"]}