Blazing Fast Merge with Loser Trees - GopherCon 2023
Offered By: Gopher Academy via YouTube
Course Description
Overview
Explore the intricacies of efficient k-way merging in this GopherCon 2023 talk by Bryan Boreham. Dive into the fundamentals and challenges of merging ordered sequences, and discover why the Tournament Tree or Loser Tree algorithm provides an optimal solution. Learn how Go's generics enable an efficient implementation of this algorithm, and gain insights into the process of tuning the implementation through profiling and benchmarking. Understand the practical applications of this technique in projects like Prometheus, Pyroscope, and Grafana Loki. By the end of this presentation, you'll be equipped with knowledge about a new open-source package and valuable insights into designing interfaces using generics in Go.
Syllabus
GopherCon 2023: Bryan Boreham - Blazing Fast Merge with Loser Trees
Taught by
Gopher Academy
Related Courses
Разработка веб-сервисов на Go - основы языкаMoscow Institute of Physics and Technology via Coursera Getting Started with Go
University of California, Irvine via Coursera Concurrency in Go
University of California, Irvine via Coursera Functions, Methods, and Interfaces in Go
University of California, Irvine via Coursera Game Thinking: Juego y toma de decisiones
The Pontificia Universidad Javeriana via edX