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:20260522T150112Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181115T083000
DTEND;TZID=America/Chicago:20181115T170000
UID:submissions.supercomputing.org_SC18_sess341_drs110@linklings.com
SUMMARY:Productive Data Locality Optimizations in Distributed Memory
DESCRIPTION:Engin Kayraklioglu and Tarek El-Ghazawi (George Washington Uni
 versity)\n\nWith deepening memory hierarchies in HPC systems, the challeng
 e of managing data locality gains more importance. Coincidentally, increas
 ing ubiquity of HPC systems and wider range of disciplines utilizing HPC i
 ntroduce more programmers to the HPC community. Given these two trends, it
  is imperative to have scalable and productive ways to manage data localit
 y.<br /><br />In this research, we address the problem in multiple ways. W
 e propose a novel language feature that programmers can use to transform s
 hared memory applications to distributed memory applications easily. We in
 troduce a high-level profiling tool to help understand how distributed arr
 ays are used in an application. As next steps, we are designing a model to
  describe the implementation of data locality optimizations as an engineer
 ing process, which can lend itself to combinatorial optimization. We are a
 lso implementing a profile-based automatic optimization framework that uti
 lizes AI to replace the programmer completely in implementing optimization
 s for distributed memory.\n\nRegistration Category: Workshop Reg Pass, Tut
 orial Reg Pass, Tech Program Reg Pass, Exhibits Reg Pass, Exhibits - Exhib
 it Hall Only Reg Pass\n\n
END:VEVENT
END:VCALENDAR