BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210916T132451Z
LOCATION:Mère Royaume
DTSTART;TZID=Europe/Stockholm:20210707T140000
DTEND;TZID=Europe/Stockholm:20210707T143000
UID:submissions.pasc-conference.org_PASC21_sess155_msa303@linklings.com
SUMMARY:Addressing the Memory Wall: Designing a Multiprecision Ecosystem
DESCRIPTION:Minisymposium\n\nAddressing the Memory Wall: Designing a Multi
 precision Ecosystem\n\nAnzt\n\nThe performance of sparse linear algebra is
  to a large extent constrained by the communication bandwidth, motivating 
 the recent investigation of sophisticated techniques to avoid, reduce, and
 /or hide data transfers in-between processors and between processors and m
 ain memory. One promising strategy is to decouple the memory precision fro
 m the arithmetic precision, and compress the data before invoking communic
 ation operations. While this generally comes with a loss of information, t
 he strategy can be reasonable when operating with approximate objects, e.g
 . preconditioners used in iterative methods or self-healing iterative solv
 ers. We will present a memory accessor separating the arithmetic precision
  from the memory precision and mixed precision algorithms based on the str
 ategy of employing lower precision formats for communication and memory ac
 cess without impacting the final accuracy.\n\nDomain: CS and Math
END:VEVENT
END:VCALENDAR