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:20181221T160726Z
LOCATION:D171
DTSTART;TZID=America/Chicago:20181111T153000
DTEND;TZID=America/Chicago:20181111T155500
UID:submissions.supercomputing.org_SC18_sess152_ws_vpa101@linklings.com
SUMMARY:Visual Analytics Challenges in Analyzing Calling Context Trees
DESCRIPTION:Workshop\nData Analytics, Performance, Visualization, Workshop
  Reg Pass\n\nVisual Analytics Challenges in Analyzing Calling Context Tree
 s\n\nBergel, Bhatele, Boehme, Gralka, Griffin...\n\nPerformance analysis i
 s an integral part of developing and optimizing parallel applications for 
 high-performance computing (HPC) platforms. Hierarchical data from differe
 nt sources is typically available to identify performance issues or anomal
 ies. Some hierarchical data such as the calling context can be very large 
 in terms of breadth and depth of the hierarchy. Classic tree visualization
 s quickly reach their limits in analyzing such hierarchies with the abunda
 nce of information to display. In this position paper, we identify the cha
 llenges commonly faced by the HPC community in visualizing hierarchical pe
 rformance data, with a focus on calling context trees. Furthermore, we mot
 ivate and lay out the bases of a visualization that addresses some of thes
 e challenges.
URL:https://sc18.supercomputing.org/presentation/?id=ws_vpa101&sess=sess15
 2
END:VEVENT
END:VCALENDAR