-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathworkshop2017.html
More file actions
371 lines (338 loc) · 27.1 KB
/
workshop2017.html
File metadata and controls
371 lines (338 loc) · 27.1 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
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
<!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’2017)</title>
<!-- InstanceEndEditable -->
<!-- InstanceBeginEditable name="head" -->
<style type="text/css">
<!--
#container #content dl dd em {
color: #00F;
}
-->
</style>
<style type="text/css">
<!--
table.MsoNormalTable {
line-height:107%;
font-size:11.0pt;
font-family:"Calibri",sans-serif;
}
p.MsoNormal {
margin:0in;
margin-bottom:.0001pt;
font-size:12.0pt;
font-family:"Times New Roman",serif;
}
-->
</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’2017)<br />
</h3>
<h4 align="center">Buena Vista Palace Hotel<br />
Orlando, Florida, USA<br />
<br />
29 May 2017<br />
</h4>
<h3>Scope and Goals:</h3>
<p>This workshop series started with the narrow goal of exploring the definition of a set of basic building blocks for graph algorithms (<a href="http://graphblas.org">http://graphblas.org</a>), analogous to the Basic Linear Algebra Subprograms (BLAS) in numerical linear algebra. Over the years, our scope has expanded. We’ve welcomed a wide range of papers into GABB covering graph computations with an emphasis on high-performance and parallel computing. We expect this trend to continue in 2017. </p>
<p>In particular, while we retain our focus on "building blocks" for graph computations (including those not based on linear algebra), we also welcome work that focuses on libraries and frameworks to support applications that use graph algorithms. </p>
<p>Our target audience is developers of graph algorithms, researchers in high-performance computing working on irregular applications, applied mathematicians working on fundamental algorithmic building blocks for graph computations, and application scientists using graphs in their computational work and data analysis.</p>
<h3>Location:</h3>
<p><a href="http://www.ipdps.org/"><img src="http://www.ipdps.org/ipdps2017/images/logo-lg-2017.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 2017</a>, held 29 May - 2 June 2017, at the Buena Vista Hotel, in
Orlando, Florida, USA. Registration information for IPDPS2017 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="https://easychair.org/conferences/?conf=gabb17">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 IPDPS Call for Papers for more details). All papers will be reviewed. Proceedings of the workshops are distributed at the conference and are submitted for inclusion in the IEEE Xplore Digital Library after the conference.</p>
<ul>
<li>Submissions due: January 31, 2017 EST 23:59pm</li>
<li>Notification: February 21, 2017</li>
<li>Final Camera-Ready Manuscript due: March 15, 2017</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 2017 Keynote Speaker</h3>
<p><a href="http://www.cc.gatech.edu/~umit/">Ümit V. Çatalyürek</a>, <em>Georgia Institute of Technology</em></p>
<h3>GABB 2017 Agenda</h3>
<p><a href="GABB17_program_final.pdf">GABB 2017 Final Program (PDF)</a></p>
<!--
<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></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></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></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</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</td></tr>
<tr>
<td>11:30am - 12pm</td>
<td>Brendan Gavin; Vijay Gadepally; Jeremy Kepner</td>
<td>Enforced Sparse Non-Negative Matrix Factorization</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></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></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></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>
-->
<table border="0" cellpadding="0" cellspacing="0" class="MsoNormalTable" style="width:6.65in;margin-left:-5.15pt;border-collapse:collapse;">
<tr style="height:25.5pt;">
<td style="width:1.2in;border:solid windowtext 1.0pt;padding:0in 0in 0in 0in;height:25.5pt;"><p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">Session</span></strong></p></td>
<td style="width:211.55pt;border:solid windowtext 1.0pt;border-left:none;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; "><strong>Title</strong></span></p></td>
<td style="width:180.85pt;border:solid windowtext 1.0pt;border-left:none;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; "><strong>Authors</strong></span></p></td>
</tr>
<tr style="height:25.5pt;">
<td rowspan="3" style="width:1.2in;border:solid windowtext 1.0pt;border-top:none;padding:0in 0in 0in 0in;height:25.5pt;"><p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">1</span></strong></p>
<p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">(8:30am-10am)</span></strong></p>
<p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">Chair: Aydin Buluc</span></strong></p></td>
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Breadth-first search with a multi-core computer</span><br />
<a href="https://doi.org/10.1109/IPDPSW.2017.48">https://doi.org/10.1109/IPDPSW.2017.48</a></p>
<p class="MsoNormal"> </p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Maryia Belova and Ming Ouyang</span></p></td>
</tr>
<tr style="height:25.5pt;">
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Order or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations</span><br />
<a href="https://doi.org/10.1109/IPDPSW.2017.164">https://doi.org/10.1109/IPDPSW.2017.164</a></p>
<p class="MsoNormal"> </p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">George M Slota, Siva Rajamanickam and Kamesh Madduri</span></p></td>
</tr>
<tr style="height:25.5pt;">
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">A Study of Graph Decomposition Algorithms for Parallel Symmetry Breaking</span><br />
<a href="https://doi.org/10.1109/IPDPSW.2017.120">https://doi.org/10.1109/IPDPSW.2017.120</a></p>
<p class="MsoNormal"> </p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Sayyad Nayyaroddeen, Mahak Gambhir and Kishore Kothapalli</span></p></td>
</tr>
<tr style="height:51.0pt;">
<td valign="top" style="width:1.2in;border:solid windowtext 1.0pt;border-top:none;padding:0in 0in 0in 0in;height:51.0pt;"><p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; "> </span></strong></p></td>
<td colspan="2" style="width:5.45in;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:51.0pt;"><p class="MsoNormal" align="center" style="text-align:center;"><span style="font-size:10.0pt; color:black; "><strong>Morning Break (10-10:30am)</strong></span></p></td>
</tr>
<tr style="height:51.0pt;">
<td rowspan="3" style="width:1.2in;border:solid windowtext 1.0pt;border-top:none;padding:0in 0in 0in 0in;height:51.0pt;"><p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">2</span></strong></p>
<p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">(10:30am-12)</span></strong></p>
<p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">Chair: Chris Long</span></strong></p></td>
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:51.0pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Constructing Adjacency Arrays from Incidence Arrays</span><br />
<a href="https://doi.org/10.1109/IPDPSW.2017.71">https://doi.org/10.1109/IPDPSW.2017.71</a></p>
<p class="MsoNormal"> </p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:51.0pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Hayden Jananthan, Karia Dibert and Jeremy Kepner</span></p></td>
</tr>
<tr style="height:38.25pt;">
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:38.25pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Mini-Gunrock: A Lightweight Graph Analytics Framework on the GPU</span><br />
<a href="https://doi.org/10.1109/IPDPSW.2017.116">https://doi.org/10.1109/IPDPSW.2017.116</a> </p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:38.25pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Yangzihao Wang, Sean Baxter and John Owens </span></p></td>
</tr>
<tr style="height:25.5pt;">
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Algebraic Multigrid for Least Squares Problems on Graphs with Applications to HodgeRank</span><br />
<a href="https://doi.org/10.1109/IPDPSW.2017.163">https://doi.org/10.1109/IPDPSW.2017.163</a></p>
<p class="MsoNormal"> </p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Charles Colley, Junyuan Lin, Xiaozhe Hu and Shuchin Aeron</span></p></td>
</tr>
<tr style="height:38.25pt;">
<td valign="top" style="width:1.2in;border:solid windowtext 1.0pt;border-top:none;padding:0in 0in 0in 0in;height:38.25pt;"><p class="MsoNormal" align="center" style="text-align:center;"><span style="font-size:10.0pt; color:black; "> </span></p></td>
<td colspan="2" style="width:5.45in;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:38.25pt;"><p class="MsoNormal" align="center" style="text-align:center;"><span style="font-size:10.0pt; color:black; "><strong>Lunch (12-1:30pm)</strong></span></p></td>
</tr>
<tr style="height:38.25pt;">
<td rowspan="2" style="width:1.2in;border:solid windowtext 1.0pt;border-top:none;padding:0in 0in 0in 0in;height:38.25pt;"><p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">3</span></strong></p>
<p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">(1:30pm-3pm)</span></strong></p>
<p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">Chair: Tim Mattson</span></strong></p></td>
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:38.25pt;"><p class="MsoNormal"><strong><span style="font-size:10.0pt; color:black; ">Keynote talk:</span></strong></p>
<p class="MsoNormal"><strong><span style="font-size:10.0pt; color:black; ">HPC Graph Analytics: Trends and Fallacies</span></strong></p>
<p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">In the era of data and ubiquitous computing, solutions to many of the social, scientific, and engineering problems necessitate the analysis and integration of very large data captured in multiple scales. Often, the data we capture are irregular and modeled as graphs. In this talk, I will first present some examples of algorithm reengineering and system support for efficient graph analytics. Then, I will discuss fallacies and shortcomings of the current HPC Graph Analytics trends</span></p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:38.25pt;"><p class="MsoNormal"><strong><span style="font-size:10.0pt; color:black; ">Ümit V. Çatalyürek</span></strong><span style="font-size:10.0pt; color:black; "> is Professor and Associate Chair of the School of Computational Science and Engineering in the College of Computing at the Georgia Institute of Technology. Dr. Çatalyürek is a recipient of an NSF CAREER award and is the primary investigator of several awards from DOE, NIH, and NSF. Dr. Çatalyürek currently serves as an Associate Editor for Parallel Computing, and as an editorial board member for IEEE TPDS, and the JPDC. He is a Fellow of IEEE, member of ACM and SIAM, and the Chair for IEEE TCPP for 2016-2017. His main research areas are in parallel computing, combinatorial scientific computing and biomedical informatics. </span></p></td>
</tr>
<tr style="height:38.25pt;">
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:38.25pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Deriving Streaming Graph Algorithms from Static Definitions</span><br />
<a href="https://doi.org/10.1109/IPDPSW.2017.146">https://doi.org/10.1109/IPDPSW.2017.146</a></p>
<p class="MsoNormal"> </p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:38.25pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">David Ediger and James Fairbanks</span></p></td>
</tr>
<tr style="height:25.5pt;">
<td valign="top" style="width:1.2in;border:solid windowtext 1.0pt;border-top:none;padding:0in 0in 0in 0in;height:25.5pt;"><p class="MsoNormal" align="center" style="text-align:center;"><span style="font-size:10.0pt; color:black; "> </span></p></td>
<td colspan="2" style="width:5.45in;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal" align="center" style="text-align:center;"><span style="font-size:10.0pt; color:black; "><strong>Afternoon Break (3-3:30pm)</strong></span></p></td>
</tr>
<tr style="height:25.5pt;">
<td rowspan="3" style="width:1.2in;border:solid windowtext 1.0pt;border-top:none;padding:0in 0in 0in 0in;height:25.5pt;"><p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">4</span></strong></p>
<p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">(3:30pm-5:15pm)</span></strong></p>
<p class="MsoNormal" align="center" style="text-align:center;"><strong><span style="font-size:10.0pt; color:black; ">Chair: Henning Meyerhenke</span></strong></p></td>
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Design of the GraphBLAS API for C</span><br />
<a href="https://doi.org/10.1109/IPDPSW.2017.117">https://doi.org/10.1109/IPDPSW.2017.117</a></p>
<p class="MsoNormal"> </p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:25.5pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">Aydin Buluc, Tim Mattson, Scott McMillan, Jose Moreira and Carl Yang</span></p></td>
</tr>
<tr style="height:51.0pt;">
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:51.0pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">A Linear Algebra-based Programming Interface for Graph Computations in Scala and Spark</span><br />
<a href="https://doi.org/10.1109/IPDPSW.2017.142">https://doi.org/10.1109/IPDPSW.2017.142</a></p>
<p class="MsoNormal"> </p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:51.0pt;"><p class="MsoNormal"><span style="font-size:10.0pt; color:black; ">William Horn, Gabriel Tanase, Hao Yu and Pratap Pattnaik</span></p></td>
</tr>
<tr style="height:47.2pt;">
<td style="width:211.55pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:47.2pt;"><p class="MsoNormal"><strong><em><span style="font-size:10.0pt; color:black; ">Panel:</span></em></strong><span style="font-size:10.0pt; color:black; "> </span><em><span style="font-size:10.0pt; color:#222222; background:white; ">Computational primitives across application domains: converging or diverging?</span></em><span style="font-size:10.0pt; color:#222222; background:white; "> </span></p>
<p class="MsoNormal"><span style="font-size:10.0pt; color:#222222; background:white; "> </span></p>
<p class="MsoNormal"><span style="font-size:10.0pt; ">We will prime our discussion by asking whether building blocks used in graph computations have any commonalities with those used in other domains such as machine learning, sparse linear algebra, computational biology and computational chemistry.</span></p>
<p class="MsoNormal"><span style="font-size:10.0pt; color:black; "> </span></p></td>
<td style="width:180.85pt;border-top:none;border-left:none;border-bottom:solid windowtext 1.0pt;border-right:solid windowtext 1.0pt;padding:0in 5.4pt 0in 5.4pt;height:47.2pt;"><p class="MsoNormal"><strong><span style="font-size:10.0pt; color:black; ">Panelists:</span></strong><span style="font-size:10.0pt; color:black; "> </span><span style="font-size:10.0pt; color:black; background:white; ">Srinivas Aluru (Georgia Tech), John Feo (PNNL)</span><span style="font-size:10.0pt; color:black; ">, </span><span style="font-size:10.0pt; color:black; background:white; ">Esmond Ng (LBNL)</span><span style="font-size:10.0pt; ">, Tim Mattson (Intel)</span></p>
<p class="MsoNormal"><span style="font-size:10.0pt; "> </span></p>
<p class="MsoNormal"><span style="font-size:10.0pt; ">Moderator: Aydin Buluc</span><span style="font-size:10.0pt; color:black; "> </span></p></td>
</tr>
</table>
<p><br />
<br />
</p>
<h3>Workshop Organizers: </h3>
<h4>Co-chairs:</h4>
<ul>
<li>Aydın Buluç, <em>Lawrence Berkeley National Lab</em></li>
<li>Tim Mattson, <em>Intel Corp.</em></li>
</ul>
<h4>Program committee members (in addition to the co-chairs): </h4>
<ul>
<li>David A. Bader, <em>Georgia Institute of Technology</em></li>
<li>Jonathan Berry, <em>Sandia National Labs</em></li>
<li>John Gilbert, <em>UC Santa Barbara</em></li>
<li>Vasia Kalavri, <em>KTH Royal Institute of Technology</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>Pacific Northwest National Lab and University of Washington</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>Intel</em></li>
<li>Semih Salihoglu, <em>University of Waterloo</em></li>
<li>Edgar Solomonik, <em>University of Illinois, Urbana-Champaign</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 -->