Graphs for HPC and LLMs episode artwork

EPISODE · Oct 29, 2024 · 52 MIN

Graphs for HPC and LLMs

from Data Skeptic

We are joined by Maciej Besta, a senior researcher of sparse graph computations and large language models at the Scalable Parallel Computing Lab (SPCL). In this episode, we explore the intersection of graph theory and high-performance computing (HPC), Graph Neural Networks (GNNs) and LLMs.

Episode metadata supplied by the publisher feed · Published Oct 29, 2024

Embed this episode

Ready to play

Graphs for HPC and LLMs

0:00 52:08

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Data Skeptic?

This episode is 52 minutes long.

When was this Data Skeptic episode published?

This episode was published on October 29, 2024.

Can I download this Data Skeptic episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!