Stenobird

Episode

Graphs for HPC and LLMs

Podcast
Data Skeptic
Published
Oct 29, 2024
Duration seconds
3128
Processing state
failed
Canonical source
https://dataskeptic.com/blog/episodes/2024/graphs-for-hpc-and-llms
Audio
https://pscrb.fm/rss/p/mgln.ai/e/35/traffic.libsyn.com/secure/dataskeptic/graphs-for-hpc-and-llms.mp3?dest-id=201630
JSON
/v1/public/podcasts/data-skeptic/episodes/graphs-for-hpc-and-llms
Markdown
/podcast/data-skeptic/graphs-for-hpc-and-llms.md

Actions

  • POST https://stenobird.com/v1/public/podcasts/data-skeptic/episodes/graphs-for-hpc-and-llms/transcription-requests
    Idempotently request low-priority transcript generation for this episode.
  • GET https://stenobird.com/podcast/data-skeptic/graphs-for-hpc-and-llms.md
    Read the agent-friendly Markdown representation of this episode resource.

Summary

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.