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:20210916T132528Z
LOCATION:Ernesto Bertarelli
DTSTART;TZID=Europe/Stockholm:20210709T110000
DTEND;TZID=Europe/Stockholm:20210709T130000
UID:submissions.pasc-conference.org_PASC21_sess189@linklings.com
SUMMARY:AP08 - ACM Papers
DESCRIPTION:Paper\n\nPredictive, Reactive and Replication-based Load Balan
 cing of Tasks in Chameleon and Sam(oa)²\n\nSamfass, Klinkenberg, Chung, Ba
 der\n\nIncreasingly complex hardware architectures as well as numerical al
 gorithms make balancing load in parallel numerical software for adaptive m
 esh refinement an inherently difficult task, especially if variability of 
 system components and unpredictability of execution time comes into play. 
 Yet, tradit...\n\n---------------------\nAutomatic Generation of Efficient
  Linear Algebra Programs\n\nBarthels, Psarras, Bientinesi\n\nThe level of 
 abstraction at which application experts reason about linear algebra compu
 tations and the level of abstraction used by developers of high-performanc
 e numerical linear algebra libraries do not match. The former is convenien
 tly captured by high-level languages and libraries such as Matlab...\n\n--
 -------------------\nAlgorithm-Hardware Co-design of a Discontinuous Galer
 kin Shallow-Water Model for a Dataflow Architecture on FPGA\n\nKenter, Sha
 mbhu, Faghih-Naini, Aizinger\n\nWe present the first FPGA implementation o
 f the full simulation pipeline of a shallow water code based on the discon
 tinuous Galerkin method. Using OpenCL and following an algorithm-hardware 
 co-design approach, the software reference is transformed into a dataflow 
 architecture that can process a full...\n\n---------------------\nA Task-B
 ased Distributed Parallel Sparsified Nested Dissection Algorithm\n\nCambie
 r, Darve\n\nSparsified nested dissection (spaND) is a fast scalable linear
  solver for sparse linear systems. It combines nested dissection and separ
 ator sparsification, leading to an algorithm with an O(N log N) complexity
  on many problems. In this work, we study the parallelization of spaND usi
 ng TaskTorrent, ...\n\n\nDomain: CS and Math
END:VEVENT
END:VCALENDAR