YoVDO

Blazing Fast Merge with Loser Trees - GopherCon 2023

Offered By: Gopher Academy via YouTube

Tags

Go Courses Algorithms Courses Data Structures Courses Generics Courses Benchmarking Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera