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:20250626T234542Z
LOCATION:B306
DTSTART;TZID=America/New_York:20241117T144500
DTEND;TZID=America/New_York:20241117T150000
UID:submissions.supercomputing.org_SC24_sess734_ws_pawatm113@linklings.com
SUMMARY:Exploring Suffix Array Algorithms in Chapel
DESCRIPTION:Kate Rasmussen (ESnet; Lawrence Berkeley National Laboratory (
 LBNL)), Michael Ferguson (Hewlett Packard Enterprise (HPE)), Bonnie Hurwit
 z (University of Arizona), and Shreyas Khandekar (Hewlett Packard Enterpri
 se (HPE))\n\nIn this project, we implemented algorithms to construct suffi
 x arrays in Chapel, and used them to compute minimal unique substrings and
  similarity rankings. We developed these algorithms as building blocks for
  strain detection in metagenomic analysis. With Chapel, we were able to cr
 eate parallel programs for each of these tasks in short order, and we are 
 seeing good performance with minimal optimization.\n\nTag: Heterogeneous C
 omputing, Parallel Programming Methods, Models, Languages and Environments
 , PAW-Abstract, Task Parallelism\n\nRegistration Category: Workshop Reg Pa
 ss\n\nSession Chairs: Engin Kayraklioglu (Hewlett Packard Enterprise (HPE)
 ); Daniele Lezzi (Barcelona Supercomputing Center (BSC)); Karla Vanessa Mo
 rris Wright (Sandia National Laboratories); Irene Moulitsas (Cranfield Uni
 versity); Elliott Slaughter (SLAC National Accelerator Laboratory); and Ke
 njiro Taura (The University of Tokyo, Japan)\n\n
END:VEVENT
END:VCALENDAR