@inproceedings{ppopp12-graph,
  author = {David Ediger and Jason Riedy and Rob McColl and David A. Bader},
  ejr-withauthor = {David Ediger and Rob McColl and David A. Bader},
  title = {Parallel Programming for Graph Analysis},
  booktitle = {17th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP)},
  role = {tutorial},
  opttags = {parallel; graph},
  year = 2012,
  month = feb,
  dom = 26,
  address = {New Orleans, LA},
  url = {http://www.cc.gatech.edu/~bader/papers/GraphAnalysisTutorial-PPoPP2012.html},
  abstract = {An increasingly fast-paced, digital world has produced an ever-growing volume of petabyte-sized datasets. At the same time, terabytes of new, unstructured data arrive daily. As the desire to ask more detailed questions about these massive streams has grown, parallel software and hardware have only recently begun to enable complex analytics in this non-scientific space.  In this tutorial, we will discuss the open problems facing us with analyzing this "data deluge". We will present algorithms and data structures capable of analyzing spatio-temporal data at massive scale on parallel systems. We will try to understand the difficulties and bottlenecks in parallel graph algorithm design on current systems and will show how multithreaded and hybrid systems can overcome these challenges. We will demonstrate how parallel graph algorithms can be implemented on a variety of architectures using different programming models.  The goal of this tutorial is to provide a comprehensive introduction to the field of parallel graph analysis to an audience with computing background, interested in participating in research and/or commercial applications of this field. Moreover, we will cover leading-edge technical and algorithmic developments in the field and discuss open problems and potential solutions.},
  officialproject = {nsf-s2i2-conc},
  projtag = {cassmt},
  keywords = {graph analysis, high performance data analysis, streaming data},
  ejr-proj = {hpda, graph-analysis},
  ejr-grant = {cassmt}
}

{"_id":"3zSDjXcpn25uASTkj","bibbaseid":"ediger-riedy-mccoll-bader-parallelprogrammingforgraphanalysis-2012","downloads":0,"creationDate":"2018-08-21T18:11:53.651Z","title":"Parallel Programming for Graph Analysis","author_short":["Ediger, D.","Riedy, J.","McColl, R.","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":["Jason"],"propositions":[],"lastnames":["Riedy"],"suffixes":[]},{"firstnames":["Rob"],"propositions":[],"lastnames":["McColl"],"suffixes":[]},{"firstnames":["David","A."],"propositions":[],"lastnames":["Bader"],"suffixes":[]}],"ejr-withauthor":"David Ediger and Rob McColl and David A. Bader","title":"Parallel Programming for Graph Analysis","booktitle":"17th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP)","role":"author","opttags":"parallel; graph","year":"2012","month":"February","dom":"26","address":"New Orleans, LA","url":"http://www.cc.gatech.edu/~bader/papers/GraphAnalysisTutorial-PPoPP2012.html","abstract":"An increasingly fast-paced, digital world has produced an ever-growing volume of petabyte-sized datasets. At the same time, terabytes of new, unstructured data arrive daily. As the desire to ask more detailed questions about these massive streams has grown, parallel software and hardware have only recently begun to enable complex analytics in this non-scientific space. In this tutorial, we will discuss the open problems facing us with analyzing this \"data deluge\". We will present algorithms and data structures capable of analyzing spatio-temporal data at massive scale on parallel systems. We will try to understand the difficulties and bottlenecks in parallel graph algorithm design on current systems and will show how multithreaded and hybrid systems can overcome these challenges. We will demonstrate how parallel graph algorithms can be implemented on a variety of architectures using different programming models. The goal of this tutorial is to provide a comprehensive introduction to the field of parallel graph analysis to an audience with computing background, interested in participating in research and/or commercial applications of this field. Moreover, we will cover leading-edge technical and algorithmic developments in the field and discuss open problems and potential solutions.","officialproject":"nsf-s2i2-conc","projtag":"cassmt","keywords":"graph analysis, high performance data analysis, streaming data","ejr-proj":"hpda, graph-analysis","ejr-grant":"cassmt","bibtex":"@inproceedings{ppopp12-graph,\n author = {David Ediger and Jason Riedy and Rob McColl and David A. Bader},\n ejr-withauthor = {David Ediger and Rob McColl and David A. Bader},\n title = {Parallel Programming for Graph Analysis},\n booktitle = {17th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP)},\n role = {tutorial},\n opttags = {parallel; graph},\n year = 2012,\n month = feb,\n dom = 26,\n address = {New Orleans, LA},\n url = {http://www.cc.gatech.edu/~bader/papers/GraphAnalysisTutorial-PPoPP2012.html},\n abstract = {An increasingly fast-paced, digital world has produced an ever-growing volume of petabyte-sized datasets. At the same time, terabytes of new, unstructured data arrive daily. As the desire to ask more detailed questions about these massive streams has grown, parallel software and hardware have only recently begun to enable complex analytics in this non-scientific space. In this tutorial, we will discuss the open problems facing us with analyzing this \"data deluge\". We will present algorithms and data structures capable of analyzing spatio-temporal data at massive scale on parallel systems. We will try to understand the difficulties and bottlenecks in parallel graph algorithm design on current systems and will show how multithreaded and hybrid systems can overcome these challenges. We will demonstrate how parallel graph algorithms can be implemented on a variety of architectures using different programming models. The goal of this tutorial is to provide a comprehensive introduction to the field of parallel graph analysis to an audience with computing background, interested in participating in research and/or commercial applications of this field. Moreover, we will cover leading-edge technical and algorithmic developments in the field and discuss open problems and potential solutions.},\n officialproject = {nsf-s2i2-conc},\n projtag = {cassmt},\n keywords = {graph analysis, high performance data analysis, streaming data},\n ejr-proj = {hpda, graph-analysis},\n ejr-grant = {cassmt}\n}\n\n","author_short":["Ediger, D.","Riedy, J.","McColl, R.","Bader, D. A."],"key":"ppopp12-graph","id":"ppopp12-graph","bibbaseid":"ediger-riedy-mccoll-bader-parallelprogrammingforgraphanalysis-2012","urls":{"Paper":"http://www.cc.gatech.edu/~bader/papers/GraphAnalysisTutorial-PPoPP2012.html"},"keyword":["graph analysis","high performance data analysis","streaming data"],"metadata":{"authorlinks":{}}},"search_terms":["parallel","programming","graph","analysis","ediger","riedy","mccoll","bader"],"keywords":["graph analysis","high performance data analysis","streaming data"],"authorIDs":[],"dataSources":["yxjEg4KYBKLdX7BAz","iovMFeXD2oi65krsd"]}