BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T000616Z
LOCATION:301-302-303
DTSTART;TZID=America/Denver:20231114T103000
DTEND;TZID=America/Denver:20231114T120000
UID:submissions.supercomputing.org_SC23_sess172@linklings.com
SUMMARY:Global Task Parallelism
DESCRIPTION:Automated Mapping of Task-Based Programs onto Distributed and 
 Heterogeneous Machines\n\nIn a parallel and distributed application, a map
 ping is a selection of a processor for each computation or task and memori
 es for the data collections that each task accesses.  Finding high-perform
 ance mappings is challenging, particularly on heterogeneous hardware with 
 multiple choices for processor...\n\n\nThiago S. F. X. Teixeira (Stanford 
 University), Alexandra Henzinger (Massachusetts Institute of Technology (M
 IT)), and Rohan Yadav and Alex Aiken (Stanford University)\n--------------
 -------\nLegate Sparse: Distributed Sparse Computing in Python\n\nThe spar
 se module of the popular SciPy Python library is widely used across applic
 ations in scientific computing, data analysis, and machine learning. The s
 tandard implementation of SciPy is restricted to a single CPU and cannot t
 ake advantage of modern distributed and accelerated computing resource...\
 n\n\nRohan Yadav (Stanford University); Wonchan Lee, Melih Elibol, Manolis
  Papadakis, Taylor Lee-Patti, and Michael Garland (NVIDIA Corporation); Al
 ex Aiken and Fredrik Kjolstad (Stanford University); and Michael Bauer (NV
 IDIA Corporation)\n---------------------\nItoyori: Reconciling Global Addr
 ess Space and Global Fork-Join Task Parallelism\n\nThis paper introduces I
 toyori, a task-parallel runtime system designed to tackle the challenge of
  scaling task parallelism (more specifically, nested fork-join parallelism
 ) beyond a single node. The partitioned global address space (PGAS) model 
 is often employed in task-parallel systems, but naively...\n\n\nShumpei Sh
 iina and Kenjiro Taura (University of Tokyo)\n\nTag: Heterogeneous Computi
 ng, Programming Frameworks and System Software, Task Parallelism\n\nRegist
 ration Category: Tech Program Reg Pass\n\nReproducibility Badges: Artifact
  Available, Artifact Functional, Results Reproduced\n\nSession Chair: Clau
 dia Fohry (University of Kassel, Germany)
END:VEVENT
END:VCALENDAR