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:20260522T150130Z
LOCATION:C146
DTSTART;TZID=America/Chicago:20181113T153000
DTEND;TZID=America/Chicago:20181113T170000
UID:submissions.supercomputing.org_SC18_sess218@linklings.com
SUMMARY:Performance Optimization Studies
DESCRIPTION:Topology-Aware Space-Shared Co-Analysis of Large-Scale Molecul
 ar Dynamics Simulations\n\nAnalysis of scientific simulation data can be c
 oncurrently executed with simulation either in time- or space-shared mode.
  This mitigates the I/O bottleneck.  However it results in either stalling
  the simulation for performing the analysis or transferring data for analy
 sis. In this paper, we improve ...\n\n\nPreeti Malakar (Indian Institute o
 f Technology Kanpur); Todd Munson, Christopher Knight, and Venkatram Vishw
 anath (Argonne National Laboratory); and Michael E. Papka (Argonne Nationa
 l Laboratory, Northern Illinois University)\n---------------------\nMany-C
 ore Graph Workload Analysis\n\nGraph applications have specific characteri
 stics that are not common in other application domains. In this paper, we 
 analyze multiple graph applications on current multi- and many-core proces
 sors and provide conclusions and recommendations for future designs. We pr
 ovide new insights on executing gra...\n\n\nStijn Eyerman, Wim Heirman, Kr
 istof Du Bois, Joshua B. Fryman, and Ibrahim Hur (Intel Corporation)\n----
 -----------------\nLessons Learned from Analyzing Dynamic Promotion for Us
 er-Level Threading\n\nA performance vs. practicality trade-off exists betw
 een user-level threading techniques. The community has settled mostly on a
  black-and-white perspective; fully fledged threads assume that suspension
  is imminent and incur overheads when suspension does not take place, and 
 run-to-completion threads ...\n\n\nShintaro Iwasaki (University of Tokyo),
  Abdelhalim Amer (Argonne National Laboratory), Kenjiro Taura (University 
 of Tokyo), and Pavan Balaji (Argonne National Laboratory)\n\nTag: Data Ana
 lytics, Performance, Programming Systems, Storage, Tools, Visualization\n\
 nRegistration Category: Tech Program Reg Pass\n\nSession Chair: John Linfo
 rd (NVIDIA Corporation)
END:VEVENT
END:VCALENDAR