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:20211207T055347Z
LOCATION:Online
DTSTART;TZID=America/Chicago:20211115T170000
DTEND;TZID=America/Chicago:20211115T173000
UID:submissions.supercomputing.org_SC21_sess422_ws_pmbsf110@linklings.com
SUMMARY:Narrowing the Search Space of Applications Mapping on Hierarchical
  Topologies
DESCRIPTION:Workshop\n\nNarrowing the Search Space of Applications Mapping
  on Hierarchical Topologies\n\nDenoyelle, Jeannot, Perarnau, Videau, Beckm
 an\n\nProcessor architectures at exascale and beyond are expected to conti
 nue to suffer from issues of nonuniform access to in-die and node-wide sha
 red resources. Mapping applications onto these resource hierarchies is an 
 on-going performance concern, requiring specific care for increasing local
 ity and resource sharing but also for ensuing contention. Application-agno
 stic approaches to search efficient mappings are based on heuristics. Inde
 ed, the size of the search space makes it impractical to find optimal solu
 tions nowadays and will only worsen as the complexity of computing systems
  increases over time. In this paper we leverage the hierarchical structure
  of modern compute nodes to reduce the size of this search space. As a res
 ult, we facilitate the search for optimal mappings and improve the ability
  to evaluate existing heuristics. Using widely known benchmarks, we show t
 hat permuting thread and process placement per node of a hierarchical topo
 logy leads to similar performances. As a result, the mapping search space 
 can be narrowed down by several orders of magnitude when performing exhaus
 tive search. This reduced search space will enable the design of new appro
 aches, including exhaustive search or automatic exploration. Moreover, it 
 provides new insights into heuristic-based approaches, including better up
 per bounds and smaller solution space.\n\nTag: Online Only, Accelerator-ba
 sed Architectures, Applications, Computational Science, Emerging Technolog
 ies, Extreme Scale Computing, File Systems and I/O, Heterogeneous Systems,
  Parallel Programming Languages and Models, Performance, Scientific Comput
 ing, Software Engineering\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR