BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210402T160558Z
LOCATION:Track 5
DTSTART;TZID=America/New_York:20201111T150000
DTEND;TZID=America/New_York:20201111T153000
UID:submissions.supercomputing.org_SC20_sess195_ws_mchpc106@linklings.com
SUMMARY:Cache Oblivious Strategies to Exploit Multi-Level Memory on Manyco
 re Systems
DESCRIPTION:Workshop\n\nCache Oblivious Strategies to Exploit Multi-Level 
 Memory on Manycore Systems\n\nButcher, Olivier, Kogge\n\nMany-core systems
  are beginning to feature novel large, high-bandwidth intermediate memory 
 as a visible part of the memory hierarchy. This paper discusses how to mak
 e use of intermediate memory when composing multiple matrix operations. \n
 \nWe re-purpose the cache-oblivious approach developed by Frigo and apply 
 it to the composition of a notionally bandwidth-bound kernel (transpose) w
 ith a compute-bound kernel (matrix multiply). Particular focus is on regio
 ns of matrix shapes far from square that are not usually considered. The r
 esulting example is far simpler than optimized codes, but reasonably close
  in performance. Also, perhaps of more importance is developing a paradigm
  for how to construct other codes using intermediate memories.\n\nRegistra
 tion Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR