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:20240116T191700Z
LOCATION:702
DTSTART;TZID=America/Denver:20231113T103000
DTEND;TZID=America/Denver:20231113T105400
UID:submissions.supercomputing.org_SC23_sess449_ws_pawatm102@linklings.com
SUMMARY:Implementing Scalable Matrix-Vector Products for the Exact Diagona
 lization Methods in Quantum Many-Body Physics
DESCRIPTION:Workshop\n\nTom Westerhout (Radboud University) and Bradford L
 . Chamberlain (Hewlett Packard Enterprise (HPE))\n\nExact diagonalization 
 is a well-established method for simulating small quantum systems. Its app
 licability is limited by the exponential growth of the Hamiltonian matrix 
 that needs to be diagonalized. Physical symmetries are usually utilized to
  reduce the matrix dimension, and distributed-memory parallelism is employ
 ed to explore larger systems. This paper focuses on an implementation of t
 he core distributed algorithms, with a special emphasis on the matrix-vect
 or product. Instead of the conventional MPI+X paradigm, Chapel is chosen a
 s the language in this work.\n\nWe provide a comprehensive description of 
 the algorithms and present performance and scalability tests. Our implemen
 tation outperforms the state-of-the-art MPI-based solution by a factor of 
 7--8 on 32 compute nodes or 4096 cores and scales well through 256 nodes o
 r 32768 cores. The implementation has 3 times fewer software lines of code
  than the current state of the art, but is still able to handle generic Ha
 miltonians.\n\nTag: Algorithms, Applications, Distributed Computing, Compi
 lers, Heterogeneous Computing, Message Passing, Programming Frameworks and
  System Software, Quantum Computing, Task Parallelism, Tensors\n\nRegistra
 tion Category: Workshop Reg Pass\n\nSession Chairs: Engin Kayraklioglu (He
 wlett Packard Enterprise (HPE)); Daniele Lezzi (Barcelona Supercomputing C
 enter (BSC)); Bill Long (Hewlett Packard Enterprise (HPE)); Karla Vanessa 
 Morris Wright (Sandia National Laboratories); Irene Moulitsas (Cranfield U
 niversity, England); and Elliott Slaughter (SLAC National Accelerator Labo
 ratory)
END:VEVENT
END:VCALENDAR