-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathworkshop2016.html
More file actions
252 lines (232 loc) · 11.2 KB
/
workshop2016.html
File metadata and controls
252 lines (232 loc) · 11.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"><!-- InstanceBegin template="/Templates/base.dwt" codeOutsideHTMLIsLocked="false" -->
<head>
<meta name="author" content="David A. Bader" />
<meta http-equiv="content-type" content="text/html; charset=utf-8" />
<meta name="description" content="GraphAnalysis.org: High performance computing for solving large-scale graph problems" />
<meta name="keywords" content="Graph Analysis, GraphAnalysis, HPC Graphs, parallel graph problems" />
<link rel="stylesheet" type="text/css" href="style.css" />
<!-- InstanceBeginEditable name="doctitle" -->
<title>GraphAnalysis.org: Graph Algorithms Building Blocks (GABB’2016)</title>
<!-- InstanceEndEditable -->
<!-- InstanceBeginEditable name="head" -->
<style type="text/css">
<!--
.style3 {color: #0000FF}
.style5 {color: #FF0000; font-family: Verdana, Arial, Helvetica, sans-serif; font-weight: bold; font-size: large; }
.style6 {font-size: medium}
.style7 {color: #FF0000; font-family: Verdana, Arial, Helvetica, sans-serif; font-weight: bold; font-size: medium; }
#container #content dl dd em {
color: #00F;
}
-->
</style>
<!-- InstanceEndEditable -->
</head>
<body>
<div id="container">
<div id="top">
<h1><center>HPC Graph Analysis</center></h1>
</div>
<div id="leftnav">
<ul>
<li><a href="index.html">Home</a></li>
<li><a href="news.html">News</a></li>
<li><a href="benchmark/index.html">Benchmark</a></li>
<li><a href="benchmark/results.html">Results</a></li>
<li><a href="workshop2022.html">Workshop 2022</a></li>
<li><a href="workshop2021.html">Workshop 2021</a></li>
<li><a href="workshop2020.html">Workshop 2020</a></li>
<li><a href="workshop2019.html">Workshop 2019</a></li>
<li><a href="workshop2018.html">Workshop 2018</a></li>
<li><a href="workshop-CSE17.html">Workshop @CSE17</a></li>
<li><a href="workshop2017.html">Workshop 2017</a></li>
<li><a href="workshop2016.html">Workshop 2016</a></li>
<li><a href="workshop2015.html">Workshop 2015</a></li>
<li><a href="workshop2014.html">Workshop 2014</a></li>
<li><a href="workshop2013.html">Workshop 2013</a></li>
<li><a href="workshop2012-SC12.html">Workshop @SC12</a></li>
<li><a href="workshop2012.html">Workshop 2012</a></li>
<li><a href="workshop2010.html">Workshop 2010</a></li>
<li><a href="workshop2009.html">Workshop 2009</a></li>
<li><a href="workshop2008.html">Workshop 2008</a></li>
<li><a href="publications.html">Publications</a></li>
<li><a href="people.html">People</a></li>
<li><a href="links.html">Links</a></li>
<li><a href="contact.html">Contact</a></li>
</ul>
</div>
<!-- InstanceBeginEditable name="EditRegion3" -->
<div id="content">
<h3>Graph Algorithms Building Blocks (GABB’2016)<br />
</h3>
<h4 align="center">Chicago Hyatt Regency<br />
Chicago, Illinois, USA<br />
<br />
23 May 2016<br />
</h4>
<h3>Scope and Goals:</h3>
<p>The Basic Linear Algebra Subprograms, introduced over 30 years ago, had a transformative effect on software for linear algebra. With the BLAS, researchers spend less time mapping algorithms onto specific features of hardware platforms and more time on interesting new algorithms.<br />
<br />
Would it be practical to define an analogous set of basic building blocks for graph algorithms? Can we define a core set of mathematical primitives from which we can build most (if not all) important graph algorithms? If we can agree on the mathematical foundations, how would these interact with the data structures used in graph algorithms and result in an API the graph algorithms research community could support?<br />
<br />
These questions will be the topic for the third “Graph Algorithms Building Blocks” workshop. Our goal is an interactive workshop where the full range of issues behind “Graph Algorithms Building Blocks” will be explored. We want an interactive “workshop” so papers that report preliminary results and unproven but interesting ideas will be considered. </p>
<h3>Location:</h3>
<p><a href="http://www.ipdps.org/"><img src="http://ipdps.org/ipdps2016/images/IPDPS-2016-Logo-lg.jpg" alt="IPDPS 2016 logo" width="129" height="55" longdesc="http://www.ipdps.org/" hspace="10" vspace="0" border="0" align="left" /></a>This workshop is co-located with <a href="http://www.ipdps.org/">IPDPS 2016</a>, held 23 - 27 May 2016, at the Chicago Hyatt Regency, in
Chicago, Illinois, USA. Registration information for IPDPS2016 can be found at <a href="http://www.ipdps.org/">here</a>.</p>
<p> </p>
<h3>Details and Dates</h3>
<p> To submit a paper, upload a PDF copy <a href="http://edas.info/newPaper.php?c=21807">here</a>. Submitted manuscripts may not exceed ten (10) single-spaced double-column pages using 10-point size font on 8.5x11 inch pages (IEEE conference style), including figures, tables, and references (see <a href="http://www.ipdps.org/ipdps2016/2016_call_for_papers.html">IPDPS Call for Papers</a> for more details). Papers shorter than 10 pages are welcome and even encouraged. All papers will be reviewed. Proceedings of the workshops are distributed at the conference and<br />
are submitted for inclusion in the IEEE Xplore Digital Library after<br />
the conference.</p>
<ul>
<li>Submissions due: January 29, 2016 EST (updated)</li>
<li>Notification: February 12, 2016</li>
<li>Final Manuscript due: February 26, 2016</li>
</ul>
<p>
<br />
<!--
<h3 align="left"><br />
Call for Speakers: </h3>
<p>GABB’14 will be an “invited speaker” workshop. We want to have a diverse range of speakers exploring a wide range of topics about standards for software implementing graph algorithms. If you are interested in speaking at this workshop, send an abstract of no more than one page that discusses what you’d like to present. The steering committee will select s subset of submitted abstracts for presentation at the workshop. Please send abstracts to the GABB’14 workshop chair at:<br />
<a href="mailto:timothy.g.mattson@intel.com">timothy.g.mattson@intel.com<br />
</a></p>
-->
</p>
<h3>GABB Preliminary Agenda</h3>
<table border="1">
<tr><td> <b>Time</b> </td><td><strong>Speaker</strong></td><td><strong>Topic</strong></td></tr>
<tr>
<td>8:20am - 8:30am</td>
<td>Tim Mattson, Intel </td>
<td>Welcome</td></tr>
<tr>
<td>8:30am - 9am</td>
<td>Mark Tullsen; Matthew Sottile</td>
<td><a href="IPDPS2016-GABB/Tullsen.pdf">Array Types for a Graph Processing Language</a><br />
<a href="https://doi.org/10.1109/IPDPSW.2016.37">https://doi.org/10.1109/IPDPSW.2016.37</a>
</td></tr>
<tr>
<td>9am - 9:30am</td>
<td>Jiahao Chen; Weijian Zhang</td>
<td><a href="IPDPS2016-GABB/Chen.pdf">The Right Way to Search Evolving Graphs</a><br />
<a href="https://doi.org/10.1109/IPDPSW.2016.76">https://doi.org/10.1109/IPDPSW.2016.76</a>
</td></tr>
<tr>
<td>9:30am - 10am</td>
<td>Jason Riedy</td>
<td><a href="IPDPS2016-GABB/Riedy.pdf">Updating PageRank for Streaming Graphs</a><br />
<a href="https://doi.org/10.1109/IPDPSW.2016.22">https://doi.org/10.1109/IPDPSW.2016.22</a>
</td></tr>
<tr>
<td>10am - 10:30am</td><td> </td>
<td><strong>Morning Break</strong></td></tr>
<tr>
<td>10:30am - 11am</td>
<td>Sriram Srinivasan; Sanjukta Bhowmick; Sajal K. Das</td>
<td>Application of Graph Sparsification in Developing Parallel Algorithms for Updating Dynamic Networks<br />
<a href="https://doi.org/10.1109/IPDPSW.2016.180">https://doi.org/10.1109/IPDPSW.2016.180</a></td>
</tr>
<tr>
<td>11am - 11:30am</td>
<td>Keita Iwabuchi; Scott Sallinen; Roger Pearce; Brian Van Essen; Maya Gokhale; Satoshi Matsuoka</td>
<td>Towards a Distributed Large-Scale Dynamic Graph Data Store<br />
<a href="https://doi.org/10.1109/IPDPSW.2016.189">https://doi.org/10.1109/IPDPSW.2016.189</a></td></tr>
<tr>
<td>11:30am - 12pm</td>
<td>Brendan Gavin; Vijay Gadepally; Jeremy Kepner</td>
<td>Enforced Sparse Non-Negative Matrix Factorization<br />
<a href="https://doi.org/10.1109/IPDPSW.2016.58">https://doi.org/10.1109/IPDPSW.2016.58</a></td></tr>
<tr>
<td>12pm - 1:30pm</td>
<td> </td>
<td><strong>Lunch</strong></td>
</tr>
<tr>
<td>1:30pm - 2:30pm</td>
<td>David A. Bader</td>
<td><strong>Keynote talk: </strong>Massive-scale streaming analytics</td>
</tr>
<tr>
<td>2:30pm-3pm</td>
<td>Peter Zhang; Samantha Misurda; Marcin Zalewski; Scott McMillan; A. Lumsdaine</td>
<td><a href="IPDPS2016-GABB/Zhang.pdf">GBTL-CUDA: Graph Algorithms and Primitives for GPUs</a><br />
<a href="https://doi.org/10.1109/IPDPSW.2016.185">https://doi.org/10.1109/IPDPSW.2016.185</a>
</td></tr>
<tr>
<td>3pm - 3:30pm</td>
<td> </td>
<td>Afternoon Break</td>
</tr>
<tr>
<td>3:30pm - 4pm</td>
<td>Peter Kogge</td>
<td><a href="IPDPS2016-GABB/Kogge.pdf">Jaccard Coefficients as a Potential Graph Benchmark</a><br />
<a href="https://doi.org/10.1109/IPDPSW.2016.208">https://doi.org/10.1109/IPDPSW.2016.208</a>
</td></tr>
<tr>
<td>4pm - 4:30pm</td>
<td>Patrick Dreher; Chansup Byun; Chris Hill; Vijay Gadepally; Bradley Kuszmaul; Jeremy Kepner</td>
<td><a href="IPDPS2016-GABB/Dreher.pdf">PageRank Pipeline Benchmark: Proposal for a Holistic System Benchmark for Big-Data Platforms</a><br />
<a href="https://doi.org/10.1109/IPDPSW.2016.89">https://doi.org/10.1109/IPDPSW.2016.89</a>
</td></tr>
<tr>
<td>4:30pm - 5pm</td>
<td>Fabrizio Petrini; Kamesh Madduri; John Gilbert; Scott McMillan</td>
<td><strong>Panel</strong></td>
</tr>
</table>
<br />
<br />
<br />
<h3>Workshop Organizers: </h3>
<h4>Program committee: </h4>
<ul>
<li>Tim Mattson, <em>Intel Corp.</em> (Chair)</li>
<li>David A. Bader, <em>Georgia Institute of Technology</em></li>
<li>Jonathan Berry, <em>Sandia National Labs</em></li>
<li>Aydın Buluç, <em>Lawrence Berkeley National Lab</em></li>
<li>John Gilbert, <em>UC Santa Barbara</em></li>
<li>Jeremy Kepner, <em>MIT Lincoln Labs</em></li>
<li>Chris Long, <em>US Department of Defense </em></li>
<li>Andrew Lumsdaine, <em>Indiana University </em></li>
<li>Kamesh Madduri, <em>Penn State University</em></li>
<li>Henning Meyerhenke, <em>Karlsruhe Institute of Technology</em></li>
<li>John Owens, <em>University of California, Davis </em></li>
<li>Fabrizio Petrini, <em>IBM</em></li>
<li>Sivan Toledo, <em>Tel Aviv University</em></li>
<br />
<br />
</li>
</ul>
<h4>Steering committee: </h4>
<ul>
<li>David A. Bader (<em>Georgia Institute of Technology</em>)</li>
<li>Aydın Buluç (<em>LBNL</em>)</li>
<li>John Gilbert (<em>UC Santa Barbara</em>)</li>
<li>Jeremy Kepner (<em>MIT Lincoln Labs</em>)</li>
<br />
<br />
</li>
</ul>
</div>
<!-- InstanceEndEditable -->
<div id="footer">
<i>
<script language="JavaScript">
<!---//hide script from old browsers
document.write( "Last updated: "+ document.lastModified );
//end hiding contents --->
</script>
</i>
</div>
</div>
<script src="http://www.google-analytics.com/urchin.js" type="text/javascript">
</script>
<script type="text/javascript">
_uacct = "UA-1564202-1";
urchinTracker();
</script>
</body>
<!-- InstanceEnd -->