BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.sciwork.dev//sw26//9WDRZP
BEGIN:VEVENT
UID:pretalx-sw26-S97GU7@pretalx.sciwork.dev
DTSTART:20261205T110000Z
DTEND:20261205T113000Z
DESCRIPTION:Matrix multiplication may look like three nested loops or a sin
 gle BLAS call\, but implementing it efficiently in an array library requir
 es more than a fast computational kernel. Shapes\, strides\, broadcasting\
 , and operand reuse can change which execution strategy works best—even 
 when the arithmetic workload remains the same.\n\nThis talk explores the i
 mplementation and optimization of matrix multiplication in Solvcon’s Sim
 pleArray. We follow the path from direct computation to layout-aware execu
 tion\, covering BLAS-compatible layouts\, signed-stride operands\, and bat
 ched matrix multiplication. Particular attention is given to small-matrix 
 execution\, reuse of broadcast operands\, and the trade-offs between compl
 ete packing and streamed packing with reusable scratch storage. We also di
 scuss how separating operation semantics\, execution selection\, and compu
 tation makes these optimizations easier to integrate and maintain.\n\nTo e
 valuate the implementation\, we briefly demonstrate a Qt Benchmark Inspect
 or and explain how identical operands\, numerical comparisons\, and balanc
 ed timing help assess performance improvements. The central lesson is that
  efficient matrix multiplication depends not only on kernel speed\, but al
 so on how data layout\, reuse\, and execution strategy fit together.
DTSTAMP:20261122T202528Z
LOCATION:403
SUMMARY:Beyond Calling BLAS: Implementing and Optimizing Matrix Multiplicat
 ion - Chun-Shih Chang
URL:https://pretalx.sciwork.dev/sw26/talk/S97GU7/
END:VEVENT
END:VCALENDAR
