Conc-Tree Combiners: Parallel Programming in Scala

Related lectures (30)

Page 2 of 3

Introduces parallel scan left in Scala, covering its properties, sequential solutions, and efficient parallel computation techniques.

Covers multiprocessor architecture, sustainable computing, AI model training impact, and parallel programming fundamentals.

Explains two-phase construction for arrays, hash tables, and search trees in parallel.

Covers the implementation of a parallel merge sort algorithm in Scala, comparing its performance with quicksort.

Covers the evolution and challenges of multiprocessors, emphasizing energy efficiency, parallel programming, cache coherence, and the role of GPUs.

Explores task parallelism, explicit communication, and synchronization primitives for efficient parallel programming.

Covers data-parallel programming basics and rendering the Mandelbrot set efficiently.

Covers Splitters and Combiners in parallel programming using Scala, explaining how to implement key methods efficiently.

Delves into the performance analysis of parallel programs in Scala, covering asymptotic analysis, recursive functions, and Amdahl's Law.

Covers the evolution of Actors, challenges of modern CPUs, parallel programming risks, and synchronization tools in Scala.