{"_id":"AYJHjxr8WJddwsJCp","bibbaseid":"riedy-highperformanceanalysisofstreaminggraphs-2017","downloads":0,"creationDate":"2018-08-21T18:11:53.695Z","title":"High-Performance Analysis of Streaming Graphs","author_short":["Riedy, J."],"year":2017,"bibtype":"misc","biburl":"http://lovesgoodfood.com/jason/CV/ejr.bib","bibdata":{"bibtype":"misc","type":"misc","author":[{"firstnames":["Jason"],"propositions":[],"lastnames":["Riedy"],"suffixes":[]}],"title":"High-Performance Analysis of Streaming Graphs","howpublished":"HPC Analytic Workshop","month":"June","year":"2017","dom":"28","address":"Hanover, MD","url":"https://www.slideshare.net/jasonriedy/highperformance-analysis-of-streaming-graphs-77348572","projtag":"hpda, grateful, memory-centric, crnch-rg","abstract":"Graph-structured data in social networks, finance, network security, and others not only are massive but also under continual change. These changes often are scattered across the graph. Stopping the world to run a single, static query is infeasible. Repeating complex global analyses on massive snapshots to capture only what has changed is inefficient. We discuss requirements for single-shot queries on changing graphs as well as recent high-performance algorithms that update rather than recompute results. These algorithms are incorporated into our software framework for streaming graph analysis, STINGER.","keywords":"hpda, graph analysis, streaming data, memory-centric, novel architectures","ejr-proj":"high-performance-data-analysis, graph-analysis, novel-arch","ejr-grant":"hpda, iarpa-emu, grateful","bibtex":"@misc{acs-2017,\n author = {Jason Riedy},\n title = {High-Performance Analysis of Streaming Graphs},\n howpublished = {HPC Analytic Workshop},\n month = jun,\n year = 2017,\n dom = 28,\n address = {Hanover, MD},\n url = {https://www.slideshare.net/jasonriedy/highperformance-analysis-of-streaming-graphs-77348572},\n projtag = {hpda, grateful, memory-centric, crnch-rg},\n abstract = {Graph-structured data in social networks, finance, network security, and others not only are massive but also under continual change. These changes often are scattered across the graph. Stopping the world to run a single, static query is infeasible. Repeating complex global analyses on massive snapshots to capture only what has changed is inefficient. We discuss requirements for single-shot queries on changing graphs as well as recent high-performance algorithms that update rather than recompute results. These algorithms are incorporated into our software framework for streaming graph analysis, STINGER.},\n keywords = {hpda, graph analysis, streaming data, memory-centric, novel architectures},\n ejr-proj = {high-performance-data-analysis, graph-analysis, novel-arch},\n ejr-grant = {hpda, iarpa-emu, grateful}\n}\n\n","author_short":["Riedy, J."],"key":"acs-2017","id":"acs-2017","bibbaseid":"riedy-highperformanceanalysisofstreaminggraphs-2017","role":"author","urls":{"Paper":"https://www.slideshare.net/jasonriedy/highperformance-analysis-of-streaming-graphs-77348572"},"keyword":["hpda","graph analysis","streaming data","memory-centric","novel architectures"],"metadata":{"authorlinks":{}}},"search_terms":["high","performance","analysis","streaming","graphs","riedy"],"keywords":["hpda","graph analysis","streaming data","memory-centric","novel architectures"],"authorIDs":[],"dataSources":["yxjEg4KYBKLdX7BAz","iovMFeXD2oi65krsd"]}