BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211207T054807Z
LOCATION:230-231-232
DTSTART;TZID=America/Chicago:20211117T153000
DTEND;TZID=America/Chicago:20211117T160000
UID:submissions.supercomputing.org_SC21_sess160_pap432@linklings.com
SUMMARY:TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal 
 Graphs with Metadata
DESCRIPTION:Paper\n\nTriPoll: Computing Surveys of Triangles in Massive-Sc
 ale Temporal Graphs with Metadata\n\nSteil, Reza, Iwabuchi, Priest, Sander
 s...\n\nUnderstanding the higher-order interactions within network data is
  a key objective of network science. Surveys of metadata triangles (or pat
 terned 3-cycles in metadata-enriched graphs) are often of interest in this
  pursuit. In this work, we develop TriPoll, a prototype distributed HPC sy
 stem capable of surveying triangles in massive graphs containing metadata 
 on their edges and vertices.  We contrast our approach with much of the pr
 ior effort on triangle analysis, which often focuses on simple triangle co
 unting, usually in simple graphs with no metadata. We assess the scalabili
 ty of TriPoll when surveying triangles involving metadata on real and synt
 hetic graphs with up to hundreds of billions of edges.We utilize communica
 tion-reducing optimizations to demonstrate a triangle counting task on a 2
 24 billion edge web graph in approximately half of the time of competing a
 pproaches, while additionally supporting metadata-aware capabilities.\n\nT
 ag: Algorithms\n\nRegistration Category: Tech Program Reg Pass
END:VEVENT
END:VCALENDAR