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:20241120T082410Z
LOCATION:HG E 3
DTSTART;TZID=Europe/Stockholm:20240604T150000
DTEND;TZID=Europe/Stockholm:20240604T153000
UID:submissions.pasc-conference.org_PASC24_sess182_pap124@linklings.com
SUMMARY:Parallel Algorithms for Intersection Computation
DESCRIPTION:Paper\n\nAparna Sasidharan (Illinois Institute of Technology)\
 n\nThis paper discusses parallel algorithms for computing intersections<br
  />between pairs of meshes. We used parallel intersection algorithms<br />
 to compute interpolation weights in coupled solvers which are part<br />of
  multi-physics simulations. We present a parallel algorithm for<br />compu
 ting intersections that has linear computational complexity.<br />We analy
 ze the computation and communication complexities of<br />this algorithm, 
 along with lower bounds for parallel intersection<br />computation. The al
 gorithm has low contention and can be executed<br />on many-core CPUs or o
 ffloaded to GPUs. We present strong scaling<br />results for this algorith
 m on a heterogeneous machine with multiple<br />GPUs per node.\n\nDomain: 
 Engineering\n\nSession Chair: Cristina Silvano (Politecnico di Milano)
END:VEVENT
END:VCALENDAR